50 lines
2.4 KiB
C
50 lines
2.4 KiB
C
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
||
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
||
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
||
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
||
|
|
│ │
|
||
|
|
│ This program is free software; you can redistribute it and/or modify │
|
||
|
|
│ it under the terms of the GNU General Public License as published by │
|
||
|
|
│ the Free Software Foundation; version 2 of the License. │
|
||
|
|
│ │
|
||
|
|
│ This program is distributed in the hope that it will be useful, but │
|
||
|
|
│ WITHOUT ANY WARRANTY; without even the implied warranty of │
|
||
|
|
│ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU │
|
||
|
|
│ General Public License for more details. │
|
||
|
|
│ │
|
||
|
|
│ You should have received a copy of the GNU General Public License │
|
||
|
|
│ along with this program; if not, write to the Free Software │
|
||
|
|
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA │
|
||
|
|
│ 02110-1301 USA │
|
||
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
||
|
|
#include "libc/runtime/mappings.h"
|
||
|
|
|
||
|
|
size_t findmapping_(int32_t k, const struct MemoryCoord *coords, size_t count) {
|
||
|
|
size_t l, r, m;
|
||
|
|
l = 0;
|
||
|
|
r = count;
|
||
|
|
while (l < r) {
|
||
|
|
m = (l + r) >> 1;
|
||
|
|
if (coords[m].x > k) {
|
||
|
|
r = m;
|
||
|
|
} else {
|
||
|
|
l = m + 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return l;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Returns appropriate rightmost index.
|
||
|
|
*/
|
||
|
|
size_t findmapping(int32_t k) {
|
||
|
|
return findmapping_(k, _mm.p, _mm.i);
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Returns appropriate rightmost index.
|
||
|
|
*/
|
||
|
|
size_t pickmapping(int32_t k) {
|
||
|
|
return findmapping_(k, _mm.p, _mm.i);
|
||
|
|
}
|