Lines Matching defs:node
598 struct percpu_list_node *node,
610 newval = (intptr_t)node;
612 node->next = (struct percpu_list_node *)expect;
631 struct percpu_list_node *node = NULL;
649 node = head;
658 return node;
667 struct percpu_list_node *node;
669 node = list->c[cpu].head;
670 if (!node)
672 list->c[cpu].head = node->next;
673 return node;
686 struct percpu_list_node *node;
688 node = this_cpu_list_pop(list, NULL);
691 if (node)
692 this_cpu_list_push(list, node, NULL);
721 struct percpu_list_node *node;
725 node = malloc(sizeof(*node));
726 assert(node);
727 node->data = j;
728 node->next = list.c[i].head;
729 list.c[i].head = node;
753 struct percpu_list_node *node;
758 while ((node = __percpu_list_pop(&list, i))) {
759 sum += node->data;
760 free(node);
773 struct percpu_buffer_node *node,
789 newval_spec = (intptr_t)node;
869 struct percpu_buffer_node *node;
871 node = this_cpu_buffer_pop(buffer, NULL);
874 if (node) {
875 if (!this_cpu_buffer_push(buffer, node, NULL)) {
914 struct percpu_buffer_node *node;
923 * for each node.
925 node = malloc(sizeof(*node));
926 assert(node);
927 node->data = j;
928 buffer.c[i].array[j - 1] = node;
953 struct percpu_buffer_node *node;
958 while ((node = __percpu_buffer_pop(&buffer, i))) {
959 sum += node->data;
960 free(node);
1132 * for each node.
1262 struct percpu_list_node *node;
1264 node = malloc(sizeof(*node));
1265 assert(node);
1266 node->data = 0;
1267 node->next = NULL;
1268 list->c[i].head = node;