Lines Matching defs:next
68 struct lock_queue_element *next;
97 struct list_head *next;
132 struct lock *next;
167 struct fuse_direntry *next;
224 mod->next = fuse_modules;
233 for (mp = &fuse_modules; *mp; mp = &(*mp)->next) {
235 *mp = (*mp)->next;
294 for (m = fuse_modules; m; m = m->next) {
336 mp = &(*mp)->next;
349 list->next = list;
355 return head->next == head;
359 struct list_head *next)
361 next->prev = new;
362 new->next = next;
364 prev->next = new;
369 list_add(new, head, head->next);
380 struct list_head *next = entry->next;
382 next->prev = prev;
383 prev->next = next;
457 slab = list_to_slab(f->partial_slabs.next);
459 node = slab->freelist.next;
649 struct node **next;
657 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
662 next = nodep;
667 next = &node->id_next;
762 struct node **next;
770 for (nodep = &t->array[hash]; *nodep != NULL; nodep = next) {
775 next = nodep;
780 next = &node->name_next;
1129 for (qe = f->lockq; qe != NULL; qe = qe->next)
1158 qe->next = NULL;
1159 for (qp = &f->lockq; *qp != NULL; qp = &(*qp)->next);
1168 for (qp = &f->lockq; *qp != qe; qp = &(*qp)->next);
1169 *qp = qe->next;
3438 de->next = NULL;
3441 dh->last = &de->next;
3600 struct fuse_direntry *next = de->next;
3603 de = next;
3662 de = de->next;
3686 de = de->next;
3936 for (l = node->locks; l; l = l->next)
3948 *lockp = l->next;
3954 lock->next = *pos;
4011 insert_lock(&l->next, newl2);
4015 lp = &l->next;
4400 struct list_head *curr, *next;
4408 for (curr = f->lru_table.next; curr != &f->lru_table; curr = next) {
4411 next = curr->next;
4742 char *next;
4746 for (module = conf.modules; module; module = next) {
4749 next = *p ? p + 1 : NULL;
4942 char *next;
4944 for (module = f->conf.modules; module; module = next) {
4947 next = *p ? p + 1 : NULL;
5086 struct node *next;
5088 for (node = f->id_table.array[i]; node != NULL; node = next) {
5089 next = node->id_next;