Skip to content

[test] Cleanup gcc pthread operations tests #22546

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 10, 2024
+603 −632
Merged

[test] Cleanup gcc pthread operations tests #22546

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
269 changes: 131 additions & 138 deletions test/pthread/test_pthread_gcc_64bit_atomic_fetch_and_op.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -16,161 +16,154 @@

#define T uint64_t

void *thread_fetch_and_add(void *arg)
{
for(int i = 0; i < 10000; ++i)
__sync_fetch_and_add((T*)arg, 0x0000000100000001ULL);
pthread_exit(0);
void *thread_fetch_and_add(void *arg) {
for (int i = 0; i < 10000; ++i) {
__sync_fetch_and_add((T*)arg, 0x0000000100000001ULL);
}
pthread_exit(0);
}

void *thread_fetch_and_sub(void *arg)
{
for(int i = 0; i < 10000; ++i)
__sync_fetch_and_sub((T*)arg, 0x0000000100000001ULL);
pthread_exit(0);
void *thread_fetch_and_sub(void *arg) {
for (int i = 0; i < 10000; ++i) {
__sync_fetch_and_sub((T*)arg, 0x0000000100000001ULL);
}
pthread_exit(0);
}

volatile T fetch_and_or_data = 0;
void *thread_fetch_and_or(void *arg)
{
for(int i = 0; i < 10000; ++i)
__sync_fetch_and_or((T*)&fetch_and_or_data, *(T*)arg);
pthread_exit(0);
void *thread_fetch_and_or(void *arg) {
for (int i = 0; i < 10000; ++i) {
__sync_fetch_and_or((T*)&fetch_and_or_data, *(T*)arg);
}
pthread_exit(0);
}

volatile T fetch_and_and_data = 0;
void *thread_fetch_and_and(void *arg)
{
for(int i = 0; i < 10000; ++i)
__sync_fetch_and_and((T*)&fetch_and_and_data, *(T*)arg);
pthread_exit(0);
void *thread_fetch_and_and(void *arg) {
for (int i = 0; i < 10000; ++i) {
__sync_fetch_and_and((T*)&fetch_and_and_data, *(T*)arg);
}
pthread_exit(0);
}

volatile T fetch_and_xor_data = 0;
void *thread_fetch_and_xor(void *arg)
{
for(int i = 0; i < 9999; ++i) // Odd number of times so that the operation doesn't cancel itself out.
__sync_fetch_and_xor((T*)&fetch_and_xor_data, *(T*)arg);
pthread_exit(0);
void *thread_fetch_and_xor(void *arg) {
for (int i = 0; i < 9999; ++i) { // Odd number of times so that the operation doesn't cancel itself out.
__sync_fetch_and_xor((T*)&fetch_and_xor_data, *(T*)arg);
}
pthread_exit(0);
}

volatile long fetch_and_nand_data = 0;
void *thread_fetch_and_nand(void *arg)
{
for(int i = 0; i < 9999; ++i) // Odd number of times so that the operation doesn't cancel itself out.
__sync_fetch_and_nand((long*)&fetch_and_nand_data, (long)arg);
pthread_exit(0);
void *thread_fetch_and_nand(void *arg) {
for (int i = 0; i < 9999; ++i) { // Odd number of times so that the operation doesn't cancel itself out.
__sync_fetch_and_nand((long*)&fetch_and_nand_data, (long)arg);
}
pthread_exit(0);
}

T threadArg[NUM_THREADS];
pthread_t thread[NUM_THREADS];

#define HILO(hi, lo) ((((uint64_t)(hi)) << 32) | ((uint64_t)(lo)))
#define DUP(x) HILO((x), (x))

int main()
{
{
T x = HILO(5, 3);
T y = __sync_fetch_and_add(&x, DUP(1));
assert(y == HILO(5, 3));
assert(x == HILO(6, 4));
volatile T n = HILO(2, 1);
if (emscripten_has_threading_support())
{
for(int i = 0; i < NUM_THREADS; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_add, (void*)&n);
for(int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
printf("n: %llx\n", n);
assert(n == HILO(NUM_THREADS*10000ULL+2ULL, NUM_THREADS*10000ULL+1ULL));
}
}
{
T x = HILO(15, 13);
T y = __sync_fetch_and_sub(&x, HILO(10, 10));
assert(y == HILO(15, 13));
assert(x == HILO(5, 3));
volatile T n = HILO(NUM_THREADS*10000ULL+5ULL, NUM_THREADS*10000ULL+3ULL);
if (emscripten_has_threading_support())
{
for(int i = 0; i < NUM_THREADS; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_sub, (void*)&n);
for(int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
printf("n: %llx\n", n);
assert(n == HILO(5,3));
}
}
{
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_or(&x, HILO(65536 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 65536 + 13, 13));
if (emscripten_has_threading_support())
{
for(int x = 0; x < 100; ++x) // Test a few times for robustness, since this test is so short-lived.
{
fetch_and_or_data = HILO(65536 + (1<<NUM_THREADS), 1<<NUM_THREADS);
for(int i = 0; i < NUM_THREADS; ++i)
{
threadArg[i] = DUP(1 << i);
pthread_create(&thread[i], NULL, thread_fetch_and_or, &threadArg[i]);
}
for(int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_or_data == HILO(65536 + (1<<(NUM_THREADS+1))-1, (1<<(NUM_THREADS+1))-1));
}
}
}
{
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_and(&x, HILO(32768 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 1, 1));
if (emscripten_has_threading_support())
{
for(int x = 0; x < 100; ++x) // Test a few times for robustness, since this test is so short-lived.
{
fetch_and_and_data = HILO(65536 + (1<<(NUM_THREADS+1))-1, (1<<(NUM_THREADS+1))-1);
for(int i = 0; i < NUM_THREADS; ++i)
{
threadArg[i] = DUP(~(1u<<i));
pthread_create(&thread[i], NULL, thread_fetch_and_and, (void*)&threadArg[i]);
}
for(int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_and_data == HILO(65536 + (1<<NUM_THREADS), 1<<NUM_THREADS));
}
}
}
{
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_xor(&x, HILO(16384 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 16384 + 12, 12));
if (emscripten_has_threading_support())
{
for(int x = 0; x < 100; ++x) // Test a few times for robustness, since this test is so short-lived.
{
fetch_and_xor_data = HILO(32768 + (1<<NUM_THREADS), 1<<NUM_THREADS);
for(int i = 0; i < NUM_THREADS; ++i)
{
threadArg[i] = DUP(~(1u<<i));
pthread_create(&thread[i], NULL, thread_fetch_and_xor, (void*)&threadArg[i]);
}
for(int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_xor_data == HILO(32768 + ((1<<(NUM_THREADS+1))-1), (1<<(NUM_THREADS+1))-1));
}
}
}
{
T x = 5;
T y = __sync_fetch_and_nand(&x, 9);
assert(y == 5);
assert(x == -2);
const int oddNThreads = NUM_THREADS-1;
for(int x = 0; x < 100; ++x) // Test a few times for robustness, since this test is so short-lived.
{
fetch_and_nand_data = 0;
for(int i = 0; i < oddNThreads; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_nand, (void*)-1);
for(int i = 0; i < oddNThreads; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_nand_data == -1);
}
}
int main() {
T threadArg[NUM_THREADS];
pthread_t thread[NUM_THREADS];
{
printf("__sync_fetch_and_add ..\n");
T x = HILO(5, 3);
T y = __sync_fetch_and_add(&x, DUP(1));
assert(y == HILO(5, 3));
assert(x == HILO(6, 4));
volatile T n = HILO(2, 1);
if (emscripten_has_threading_support()) {
for (int i = 0; i < NUM_THREADS; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_add, (void*)&n);
for (int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
printf("n: %llx\n", n);
assert(n == HILO(NUM_THREADS*10000ULL+2ULL, NUM_THREADS*10000ULL+1ULL));
}
}
{
printf("__sync_fetch_and_sub ..\n");
T x = HILO(15, 13);
T y = __sync_fetch_and_sub(&x, HILO(10, 10));
assert(y == HILO(15, 13));
assert(x == HILO(5, 3));
volatile T n = HILO(NUM_THREADS*10000ULL+5ULL, NUM_THREADS*10000ULL+3ULL);
if (emscripten_has_threading_support()) {
for (int i = 0; i < NUM_THREADS; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_sub, (void*)&n);
for (int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
printf("n: %llx\n", n);
assert(n == HILO(5,3));
}
}
{
printf("__sync_fetch_and_or ..\n");
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_or(&x, HILO(65536 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 65536 + 13, 13));
if (emscripten_has_threading_support()) {
for (int x = 0; x < 100; ++x) { // Test a few times for robustness, since this test is so short-lived.
fetch_and_or_data = HILO(65536 + (1<<NUM_THREADS), 1<<NUM_THREADS);
for (int i = 0; i < NUM_THREADS; ++i) {
threadArg[i] = DUP(1 << i);
pthread_create(&thread[i], NULL, thread_fetch_and_or, &threadArg[i]);
}
for (int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_or_data == HILO(65536 + (1<<(NUM_THREADS+1))-1, (1<<(NUM_THREADS+1))-1));
}
}
}
{
printf("__sync_fetch_and_and ..\n");
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_and(&x, HILO(32768 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 1, 1));
if (emscripten_has_threading_support()) {
for (int x = 0; x < 100; ++x) { // Test a few times for robustness, since this test is so short-lived.
fetch_and_and_data = HILO(65536 + (1<<(NUM_THREADS+1))-1, (1<<(NUM_THREADS+1))-1);
for (int i = 0; i < NUM_THREADS; ++i) {
threadArg[i] = DUP(~(1u<<i));
pthread_create(&thread[i], NULL, thread_fetch_and_and, (void*)&threadArg[i]);
}
for (int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_and_data == HILO(65536 + (1<<NUM_THREADS), 1<<NUM_THREADS));
}
}
}
{
printf("__sync_fetch_and_xor ..\n");
T x = HILO(32768 + 5, 5);
T y = __sync_fetch_and_xor(&x, HILO(16384 + 9, 9));
assert(y == HILO(32768 + 5, 5));
assert(x == HILO(32768 + 16384 + 12, 12));
if (emscripten_has_threading_support()) {
for (int x = 0; x < 100; ++x) { // Test a few times for robustness, since this test is so short-lived.
fetch_and_xor_data = HILO(32768 + (1<<NUM_THREADS), 1<<NUM_THREADS);
for (int i = 0; i < NUM_THREADS; ++i) {
threadArg[i] = DUP(~(1u<<i));
pthread_create(&thread[i], NULL, thread_fetch_and_xor, (void*)&threadArg[i]);
}
for (int i = 0; i < NUM_THREADS; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_xor_data == HILO(32768 + ((1<<(NUM_THREADS+1))-1), (1<<(NUM_THREADS+1))-1));
}
}
}
{
printf("__sync_fetch_and_nand ..\n");
T x = 5;
T y = __sync_fetch_and_nand(&x, 9);
assert(y == 5);
assert(x == -2);
const int oddNThreads = NUM_THREADS-1;
for (int x = 0; x < 100; ++x) { // Test a few times for robustness, since this test is so short-lived.
fetch_and_nand_data = 0;
for (int i = 0; i < oddNThreads; ++i) pthread_create(&thread[i], NULL, thread_fetch_and_nand, (void*)-1);
for (int i = 0; i < oddNThreads; ++i) pthread_join(thread[i], NULL);
assert(fetch_and_nand_data == -1);
}
}

return 0;
return 0;
}
Loading
Loading