glibc

Commit Graph

Author	SHA1	Message	Date
Paul Eggert	2642002380	Update copyright dates with scripts/update-copyrights	2025-01-01 11:22:09 -08:00
Wilco Dijkstra	0997c3d0c8	benchtests: Add random() benchmark Add a simple benchmark to measure the overhead of internal libc locks in the random() implementation on both single- and multi-threaded cases. This relies on the implementation of random using internal locks to access shared global data, and that the runtime uses multi-threaded locking once a thread has been created (even after it finishes). Reviewed-by: Adhemerval Zanella <adhemerval.zanella@linaro.org>	2024-04-18 14:30:21 +01:00

Author

SHA1

Message

Date

Paul Eggert

2642002380

Update copyright dates with scripts/update-copyrights

2025-01-01 11:22:09 -08:00

Wilco Dijkstra

0997c3d0c8

benchtests: Add random() benchmark

Add a simple benchmark to measure the overhead of internal libc locks in
the random() implementation on both single- and multi-threaded cases.
This relies on the implementation of random using internal locks to
access shared global data, and that the runtime uses multi-threaded
locking once a thread has been created (even after it finishes).

Reviewed-by: Adhemerval Zanella  <adhemerval.zanella@linaro.org>

2024-04-18 14:30:21 +01:00

2 Commits