mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-05-23 05:42:29 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Change support vector to Windows 8+

Browse source 
Doing this makes binaries tinier, since we don't need to have all the
extra code for supporting a 32-bit address space. It also benefits us
because we're able to use WIN32 futexes, which makes locking simpler.

b69f3d2488 is what officially ended our
Windows 7 support. This change is merely a formalization. You can use
old versions of Cosmo now and forevermore if you need Windows 7 since
our repository is hermetic and vendors all its dependencies.

Won't fix #617
This commit is contained in:
Justine Tunney 2022-09-15 03:49:34 -07:00
parent 6c90f830d9
commit 134ffee519
No known key found for this signature in database
GPG key ID: BE714B4575D6E328
25 changed files with 296 additions and 167 deletions
Download patch file Download diff file Expand all files Collapse all files

87
test/libc/intrin/lockscale_test.c Normal file
View file

@ -0,0 +1,87 @@
/*-*- 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/atomic.h"
#include "libc/calls/calls.h"
#include "libc/calls/struct/timespec.h"
#include "libc/intrin/intrin.h"
#include "libc/mem/gc.h"
#include "libc/mem/mem.h"
#include "libc/stdio/stdio.h"
#include "libc/testlib/testlib.h"
#include "libc/thread/thread.h"
#include "libc/time/time.h"
/**
* @fileoverview Lock Waiter Scalability Test
*
* This test can be run as follows:
*
* make o//test/libc/intrin/lockscale_test.com.runs V=5 TESTARGS=-b
*
* It's intended to demonstrate the importance of futexes. On systems
* that don't have them, this test consumes orders of a magnitude more
* cpu time, because there's a lot of waiters and they need to wait a
* very long time.
*/
#define WAITERS 100
#define ITERATIONS 10000
atomic_int x;
pthread_t t[WAITERS];
pthread_mutex_t lock;
pthread_barrier_t barrier;
void Worker(void) {
pthread_mutex_lock(&lock);
pthread_barrier_wait(&barrier);
for (x = 0; x < ITERATIONS; ++x) {
sched_yield();
}
pthread_mutex_unlock(&lock);
}
void *Waiter(void *arg) {
pthread_barrier_wait(&barrier);
pthread_mutex_lock(&lock);
ASSERT_EQ(ITERATIONS, x);
pthread_mutex_unlock(&lock);
return 0;
}
BENCH(lock, scalability) {
int i;
struct timespec t1, t2;
t1 = _timespec_real();
pthread_mutex_init(&lock, 0);
pthread_barrier_init(&barrier, 0, WAITERS + 1);
for (i = 0; i < WAITERS; ++i) {
ASSERT_EQ(0, pthread_create(t + i, 0, Waiter, 0));
}
Worker();
for (i = 0; i < WAITERS; ++i) {
ASSERT_EQ(0, pthread_join(t[i], 0));
}
pthread_barrier_destroy(&barrier);
pthread_mutex_destroy(&lock);
t2 = _timespec_real();
printf("consumed %10g seconds monotonic time and %10g seconds cpu time\n",
_timespec_tonanos(_timespec_sub(t2, t1)) / 1000000000.,
(double)clock() / CLOCKS_PER_SEC);
}