- unsigned int i;
- pointer head;
- pointer tail;
- pointer next;
-
- node_nums = malloc(num_threads * sizeof(*node_nums));
- for (i = 0; i < num_threads; i++)
- node_nums[i] = 2 + i;
-
- /* initialize queue */
- head = MAKE_POINTER(1, 0);
- tail = MAKE_POINTER(1, 0);
- next = MAKE_POINTER(0, 0); // (NULL, 0)
-
- atomic_init(&q->head, head);
- atomic_init(&q->tail, tail);
- atomic_init(&q->nodes[1].next, next);
-
- /* initialize avail list */
- for (i = 2; i < MAX_NODES; i++) {
- next = MAKE_POINTER(i + 1, 0);
- atomic_init(&q->nodes[i].next, next);
+ int i, j;
+
+ /* Initialize each thread's free list with INITIAL_FREE NULL "pointers" */
+ free_lists = malloc(num_threads * sizeof(*free_lists));
+ for (i = 0; i < num_threads; i++) {
+ for (j = 0; j < INITIAL_FREE; j++) {
+ free_lists[i][j] = 2 + i * MAX_FREELIST + j;
+ atomic_init(&q->nodes[free_lists[i][j]].next, MAKE_POINTER(0, 0));
+ }