18 	struct int_node *node = malloc(sizeof(*node));  in intlist__node_new()  local
20 	if (node != NULL) {  in intlist__node_new()
21 		node->i = i;  in intlist__node_new()
22 		node->priv = NULL;  in intlist__node_new()
23 		rc = &node->rb_node;  in intlist__node_new()
37 	struct int_node *node = container_of(rb_node, struct int_node, rb_node);  in intlist__node_delete()  local
39 	int_node__delete(node);  in intlist__node_delete()
45 	struct int_node *node = container_of(rb_node, struct int_node, rb_node);  in intlist__node_cmp()  local
47 	if (node->i > i)  in intlist__node_cmp()
49 	else if (node->i < i)  in intlist__node_cmp()
60 void intlist__remove(struct intlist *ilist, struct int_node *node)  in intlist__remove()  argument
62 	rblist__remove_node(&ilist->rblist, &node->rb_node);  in intlist__remove()
68 	struct int_node *node = NULL;  in __intlist__findnew()  local
80 		node = container_of(rb_node, struct int_node, rb_node);  in __intlist__findnew()
82 	return node;  in __intlist__findnew()
142 	struct int_node *node = NULL;  in intlist__entry()  local
147 		node = container_of(rb_node, struct int_node, rb_node);  in intlist__entry()
149 	return node;  in intlist__entry()