mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 19:43:32 +00:00
39bf41f4eb
- Python static hello world now 1.8mb
- Python static fully loaded now 10mb
- Python HTTPS client now uses MbedTLS
- Python REPL now completes import stmts
- Increase stack size for Python for now
- Begin synthesizing posixpath and ntpath
- Restore Python \N{UNICODE NAME} support
- Restore Python NFKD symbol normalization
- Add optimized code path for Intel SHA-NI
- Get more Python unit tests passing faster
- Get Python help() pagination working on NT
- Python hashlib now supports MbedTLS PBKDF2
- Make memcpy/memmove/memcmp/bcmp/etc. faster
- Add Mersenne Twister and Vigna to LIBC_RAND
- Provide privileged __printf() for error code
- Fix zipos opendir() so that it reports ENOTDIR
- Add basic chmod() implementation for Windows NT
- Add Cosmo's best functions to Python cosmo module
- Pin function trace indent depth to that of caller
- Show memory diagram on invalid access in MODE=dbg
- Differentiate stack overflow on crash in MODE=dbg
- Add stb_truetype and tools for analyzing font files
- Upgrade to UNICODE 13 and reduce its binary footprint
- COMPILE.COM now logs resource usage of build commands
- Start implementing basic poll() support on bare metal
- Set getauxval(AT_EXECFN) to GetModuleFileName() on NT
- Add descriptions to strerror() in non-TINY build modes
- Add COUNTBRANCH() macro to help with micro-optimizations
- Make error / backtrace / asan / memory code more unbreakable
- Add fast perfect C implementation of μ-Law and a-Law audio codecs
- Make strtol() functions consistent with other libc implementations
- Improve Linenoise implementation (see also github.com/jart/bestline)
- COMPILE.COM now suppresses stdout/stderr of successful build commands
90 lines
3.5 KiB
C
90 lines
3.5 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 2021 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/alg/alg.h"
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/log/countbranch.h"
|
|
#include "libc/macros.internal.h"
|
|
#include "libc/runtime/runtime.h"
|
|
#include "libc/stdio/stdio.h"
|
|
|
|
static double GetTotal(const struct countbranch *p) {
|
|
return p->total;
|
|
}
|
|
|
|
static double GetPercent(const struct countbranch *p) {
|
|
if (p->total) {
|
|
return (double)p->taken / p->total * 100;
|
|
} else {
|
|
return 50;
|
|
}
|
|
}
|
|
|
|
static double RankCounter(const struct countbranch *p) {
|
|
double x;
|
|
x = GetPercent(p);
|
|
x = MIN(x, 100 - x);
|
|
return x;
|
|
}
|
|
|
|
static int CompareCounters(const void *a, const void *b) {
|
|
double x, y;
|
|
x = RankCounter(a);
|
|
y = RankCounter(b);
|
|
if (x > y) return +1;
|
|
if (x < y) return -1;
|
|
if (GetTotal(a) < GetTotal(b)) return +1;
|
|
if (GetTotal(a) > GetTotal(b)) return -1;
|
|
return 0;
|
|
}
|
|
|
|
static size_t CountCounters(void) {
|
|
size_t n;
|
|
struct countbranch *p;
|
|
for (n = 0, p = countbranch_data; p->total >= 0; ++p) ++n;
|
|
return n;
|
|
}
|
|
|
|
static void SortCounters(size_t n) {
|
|
qsort(countbranch_data, n, sizeof(*countbranch_data), CompareCounters);
|
|
}
|
|
|
|
void countbranch_report(void) {
|
|
size_t i, n;
|
|
struct countbranch *p;
|
|
n = CountCounters();
|
|
SortCounters(n);
|
|
for (i = n; i--;) {
|
|
p = countbranch_data + i;
|
|
if (strcmp(p->code, p->xcode)) {
|
|
dprintf(2, "%s:%d: %g%% taken (%,ld/%,ld) %s [%s]\n", p->file, p->line,
|
|
GetPercent(p), p->taken, p->total, p->code, p->xcode);
|
|
} else {
|
|
dprintf(2, "%s:%d: %g%% taken (%,ld/%,ld) %s\n", p->file, p->line,
|
|
GetPercent(p), p->taken, p->total, p->code);
|
|
}
|
|
}
|
|
}
|
|
|
|
static textstartup void countbranch_init() {
|
|
atexit(countbranch_report);
|
|
}
|
|
|
|
const void *const countbranch_ctor[] initarray = {
|
|
countbranch_init,
|
|
};
|