forked from emscripten-core/emscripten
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[test] Cleanup gcc pthread operations tests
- Convert to C - Tabs to spaces - And some print status
- Loading branch information
Showing
13 changed files
with
867 additions
and
863 deletions.
There are no files selected for viewing
181 changes: 181 additions & 0 deletions
181
test/pthread/test_pthread_gcc_64bit_atomic_fetch_and_op.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,181 @@ | ||
// Copyright 2015 The Emscripten Authors. All rights reserved. | ||
// Emscripten is available under two separate licenses, the MIT license and the | ||
// University of Illinois/NCSA Open Source License. Both these licenses can be | ||
// found in the LICENSE file. | ||
|
||
#include <assert.h> | ||
#include <stdio.h> | ||
#include <pthread.h> | ||
#include <emscripten.h> | ||
#include <emscripten/threading.h> | ||
|
||
// This file tests the old GCC built-in atomic operations of the form __sync_fetch_and_op(). | ||
// See https://gcc.gnu.org/onlinedocs/gcc-4.6.4/gcc/Atomic-Builtins.html | ||
|
||
#define NUM_THREADS 8 | ||
|
||
#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_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); | ||
} | ||
|
||
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); | ||
} | ||
|
||
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); | ||
} | ||
|
||
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); | ||
} | ||
|
||
#define HILO(hi, lo) ((((uint64_t)(hi)) << 32) | ((uint64_t)(lo))) | ||
#define DUP(x) HILO((x), (x)) | ||
|
||
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; | ||
} |
176 changes: 0 additions & 176 deletions
176
test/pthread/test_pthread_gcc_64bit_atomic_fetch_and_op.cpp
This file was deleted.
Oops, something went wrong.
Oops, something went wrong.