Lines Matching refs:next
49 struct ck_hp_fifo_entry *next;
64 stub->next = NULL;
83 struct ck_hp_fifo_entry *tail, *next;
86 entry->next = NULL;
95 next = ck_pr_load_ptr(&tail->next);
96 if (next != NULL) {
97 ck_pr_cas_ptr(&fifo->tail, tail, next);
99 } else if (ck_pr_cas_ptr(&fifo->tail->next, next, entry) == true)
114 struct ck_hp_fifo_entry *tail, *next;
117 entry->next = NULL;
125 next = ck_pr_load_ptr(&tail->next);
126 if (next != NULL) {
127 ck_pr_cas_ptr(&fifo->tail, tail, next);
129 } else if (ck_pr_cas_ptr(&fifo->tail->next, next, entry) == false)
142 struct ck_hp_fifo_entry *head, *tail, *next;
152 next = ck_pr_load_ptr(&head->next);
153 ck_hp_set_fence(record, 1, next);
158 if (next == NULL)
161 ck_pr_cas_ptr(&fifo->tail, tail, next);
163 } else if (ck_pr_cas_ptr(&fifo->head, head, next) == true)
167 ck_pr_store_ptr_unsafe(value, next->value);
176 struct ck_hp_fifo_entry *head, *tail, *next;
185 next = ck_pr_load_ptr(&head->next);
186 ck_hp_set_fence(record, 1, next);
191 if (next == NULL)
194 ck_pr_cas_ptr(&fifo->tail, tail, next);
196 } else if (ck_pr_cas_ptr(&fifo->head, head, next) == false)
199 ck_pr_store_ptr_unsafe(value, next->value);
203 #define CK_HP_FIFO_ISEMPTY(f) ((f)->head->next == NULL)
204 #define CK_HP_FIFO_FIRST(f) ((f)->head->next)
205 #define CK_HP_FIFO_NEXT(m) ((m)->next)
212 (entry) != NULL && ((T) = (entry)->next, 1); \