mirror of
http://git.haproxy.org/git/haproxy.git/
synced 2024-12-21 11:58:03 +00:00
2b71810cb3
The current "ADD" vs "ADDQ" is confusing because when thinking in terms
of appending at the end of a list, "ADD" naturally comes to mind, but
here it does the opposite, it inserts. Several times already it's been
incorrectly used where ADDQ was expected, the latest of which was a
fortunate accident explained in 6fa922562 ("CLEANUP: stream: explain
why we queue the stream at the head of the server list").
Let's use more explicit (but slightly longer) names now:
LIST_ADD -> LIST_INSERT
LIST_ADDQ -> LIST_APPEND
LIST_ADDED -> LIST_INLIST
LIST_DEL -> LIST_DELETE
The same is true for MT_LISTs, including their "TRY" variant.
LIST_DEL_INIT keeps its short name to encourage to use it instead of the
lazier LIST_DELETE which is often less safe.
The change is large (~674 non-comment entries) but is mechanical enough
to remain safe. No permutation was performed, so any out-of-tree code
can easily map older names to new ones.
The list doc was updated.
99 lines
1.9 KiB
C
99 lines
1.9 KiB
C
#include <pthread.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#define USE_THREAD
|
|
#include <haproxy/list.h>
|
|
|
|
/* Stress test the mt_lists.
|
|
* Compile from the haproxy directory with :
|
|
* cc -I../../include test-list.c -pthread -O2 -o test-list
|
|
* The only argument it takes is the number of threads to be used.
|
|
* ./test-list 4
|
|
*/
|
|
|
|
struct mt_list pouet_list = MT_LIST_HEAD_INIT(pouet_list);
|
|
#define MAX_ACTION 5000000
|
|
|
|
__thread unsigned int tid;
|
|
struct pouet_lol {
|
|
struct mt_list list_elt;
|
|
};
|
|
|
|
void *thread(void *pouet)
|
|
{
|
|
struct pouet_lol *lol;
|
|
struct mt_list *elt1, elt2;
|
|
tid = (uintptr_t)pouet;
|
|
int i = 0;
|
|
|
|
for (int i = 0; i < MAX_ACTION; i++) {
|
|
struct pouet_lol *lol;
|
|
struct mt_list *elt1, elt2;
|
|
switch (random() % 4) {
|
|
case 0:
|
|
lol = malloc(sizeof(*lol));
|
|
MT_LIST_INIT(&lol->list_elt);
|
|
MT_LIST_TRY_INSERT(&pouet_list, &lol->list_elt);
|
|
break;
|
|
case 1:
|
|
lol = malloc(sizeof(*lol));
|
|
MT_LIST_INIT(&lol->list_elt);
|
|
MT_LIST_TRY_APPEND(&pouet_list, &lol->list_elt);
|
|
break;
|
|
|
|
case 2:
|
|
lol = MT_LIST_POP(&pouet_list, struct pouet_lol *, list_elt);
|
|
if (lol)
|
|
free(lol);
|
|
break;
|
|
case 3:
|
|
|
|
mt_list_for_each_entry_safe(lol, &pouet_list, list_elt, elt1, elt2)
|
|
|
|
{
|
|
if (random() % 2) {
|
|
MT_LIST_DELETE_SAFE(elt1);
|
|
free(lol);
|
|
}
|
|
if (random() % 2) {
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
int nb;
|
|
pthread_t *pth;
|
|
|
|
srandom(time(NULL));
|
|
if (argc != 2) {
|
|
printf("Usage: %s <nb_threads>\n", argv[0]);
|
|
exit(1);
|
|
}
|
|
nb = atoi(argv[1]);
|
|
#if 0
|
|
if (nb < 2) {
|
|
printf("Need at least 2 threads.\n");
|
|
exit(1);
|
|
}
|
|
#endif
|
|
pth = malloc(nb * sizeof(*pth));
|
|
if (pth == NULL) {
|
|
printf("Shot failed to connect.\n");
|
|
exit(1);
|
|
}
|
|
for (int i = 0; i < nb; i++) {
|
|
pthread_create(&pth[i], NULL, thread, (void *)(uintptr_t)i);
|
|
|
|
}
|
|
for (int i = 0; i < nb; i++)
|
|
pthread_join(pth[i], NULL);
|
|
return 0;
|
|
}
|