mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 19:43:32 +00:00
f7ff77d865
- Invent iso8601us() for faster timestamps - Improve --strace descriptions of sigset_t - Rebuild the Landlock Make bootstrap binary - Introduce MODE=sysv for non-Windows builds - Permit OFD fcntl() locks under pledge(flock) - redbean can now protect your kernel from ddos - Have vfork() fallback to sys_fork() not fork() - Change kmalloc() to not die when out of memory - Improve documentation for some termios functions - Rewrite putenv() and friends to conform to POSIX - Fix linenoise + strace verbosity issue on Windows - Fix regressions in our ability to show backtraces - Change redbean SetHeader() to no-op if value is nil - Improve fcntl() so SQLite locks work in non-WAL mode - Remove some unnecessary work during fork() on Windows - Create redbean-based SSL reverse proxy for IPv4 TurfWar - Fix ape/apeinstall.sh warning when using non-bash shells - Add ProgramTrustedIp(), and IsTrustedIp() APIs to redbean - Support $PWD, $UID, $GID, and $EUID in command interpreter - Introduce experimental JTqFpD APE prefix for non-Windows builds - Invent blackhole daemon for firewalling IP addresses via UNIX named socket - Add ProgramTokenBucket(), AcquireToken(), and CountTokens() APIs to redbean
93 lines
3.2 KiB
C
93 lines
3.2 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 2022 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
|
│ │
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "libc/assert.h"
|
|
#include "libc/dce.h"
|
|
#include "libc/intrin/midpoint.h"
|
|
#include "libc/mem/mem.h"
|
|
#include "libc/mem/sortedints.internal.h"
|
|
#include "libc/str/str.h"
|
|
|
|
bool ContainsInt(const struct SortedInts *t, int k) {
|
|
int l, m, r;
|
|
l = 0;
|
|
r = t->n - 1;
|
|
while (l <= r) {
|
|
m = _midpoint(l, r);
|
|
if (t->p[m] < k) {
|
|
l = m + 1;
|
|
} else if (t->p[m] > k) {
|
|
r = m - 1;
|
|
} else {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
int LeftmostInt(const struct SortedInts *t, int k) {
|
|
int l, m, r;
|
|
l = 0;
|
|
r = t->n;
|
|
while (l < r) {
|
|
m = _midpoint(l, r);
|
|
if (t->p[m] < k) {
|
|
l = m + 1;
|
|
} else {
|
|
r = m;
|
|
}
|
|
}
|
|
_unassert(l == 0 || k >= t->p[l - 1]);
|
|
_unassert(l == t->n || k <= t->p[l]);
|
|
return l;
|
|
}
|
|
|
|
int CountInt(const struct SortedInts *t, int k) {
|
|
int i, c;
|
|
for (c = 0, i = LeftmostInt(t, k); i < t->n; ++i) {
|
|
if (t->p[i] == k) {
|
|
++c;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
return c;
|
|
}
|
|
|
|
bool InsertInt(struct SortedInts *t, int k, bool u) {
|
|
int l;
|
|
_unassert(t->n >= 0);
|
|
_unassert(t->n <= t->c);
|
|
if (t->n == t->c) {
|
|
++t->c;
|
|
if (!IsModeDbg()) {
|
|
t->c += t->c >> 1;
|
|
}
|
|
t->p = realloc(t->p, t->c * sizeof(*t->p));
|
|
}
|
|
l = LeftmostInt(t, k);
|
|
if (l < t->n) {
|
|
if (u && t->p[l] == k) {
|
|
return false;
|
|
}
|
|
memmove(t->p + l + 1, t->p + l, (t->n - l) * sizeof(*t->p));
|
|
}
|
|
t->p[l] = k;
|
|
t->n++;
|
|
return true;
|
|
}
|