| /lib/ |
| D | timerqueue.c | 39 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
46 WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); in timerqueue_add()
50 ptr = rb_entry(parent, struct timerqueue_node, node); in timerqueue_add()
51 if (node->expires.tv64 < ptr->expires.tv64) in timerqueue_add()
56 rb_link_node(&node->node, parent, p); in timerqueue_add()
57 rb_insert_color(&node->node, &head->head); in timerqueue_add()
59 if (!head->next || node->expires.tv64 < head->next->expires.tv64) { in timerqueue_add()
60 head->next = node; in timerqueue_add()
75 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del() argument
77 WARN_ON_ONCE(RB_EMPTY_NODE(&node->node)); in timerqueue_del()
[all …]
|
| D | btree.c | 95 unsigned long *node; in btree_node_alloc() local
97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
98 if (likely(node)) in btree_node_alloc()
99 memset(node, 0, NODESIZE); in btree_node_alloc()
100 return node; in btree_node_alloc()
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
150 return &node[n * geo->keylen]; in bkey()
153 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() argument
155 return (void *)node[geo->no_longs + n]; in bval()
158 static void setkey(struct btree_geo *geo, unsigned long *node, int n, in setkey() argument
[all …]
|
| D | rbtree.c | 97 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
100 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
111 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
136 node = gparent; in __rb_insert()
137 parent = rb_parent(node); in __rb_insert()
138 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
143 if (node == tmp) { in __rb_insert()
156 tmp = node->rb_left; in __rb_insert()
158 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
162 rb_set_parent_color(parent, node, RB_RED); in __rb_insert()
[all …]
|
| D | radix-tree.c | 88 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
91 __set_bit(offset, node->tags[tag]); in tag_set()
94 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
97 __clear_bit(offset, node->tags[tag]); in tag_clear()
100 static inline int tag_get(struct radix_tree_node *node, unsigned int tag, in tag_get() argument
103 return test_bit(offset, node->tags[tag]); in tag_get()
130 static inline int any_tag_set(struct radix_tree_node *node, unsigned int tag) in any_tag_set() argument
134 if (node->tags[tag][idx]) in any_tag_set()
221 struct radix_tree_node *node = in radix_tree_node_rcu_free() local
231 tag_clear(node, i, 0); in radix_tree_node_rcu_free()
[all …]
|
| D | plist.c | 74 void plist_add(struct plist_node *node, struct plist_head *head) in plist_add() argument
80 WARN_ON(!plist_node_empty(node)); in plist_add()
81 WARN_ON(!list_empty(&node->prio_list)); in plist_add()
89 if (node->prio < iter->prio) { in plist_add()
99 if (!prev || prev->prio != node->prio) in plist_add()
100 list_add_tail(&node->prio_list, &iter->prio_list); in plist_add()
102 list_add_tail(&node->node_list, node_next); in plist_add()
113 void plist_del(struct plist_node *node, struct plist_head *head) in plist_del() argument
117 if (!list_empty(&node->prio_list)) { in plist_del()
118 if (node->node_list.next != &head->node_list) { in plist_del()
[all …]
|
| D | rbtree_test.c | 31 static void insert(struct test_node *node, struct rb_root *root) in insert() argument
34 u32 key = node->key; in insert()
44 rb_link_node(&node->rb, parent, new); in insert()
45 rb_insert_color(&node->rb, root); in insert()
48 static inline void erase(struct test_node *node, struct rb_root *root) in erase() argument
50 rb_erase(&node->rb, root); in erase()
53 static inline u32 augment_recompute(struct test_node *node) in augment_recompute() argument
55 u32 max = node->val, child_augmented; in augment_recompute()
56 if (node->rb.rb_left) { in augment_recompute()
57 child_augmented = rb_entry(node->rb.rb_left, struct test_node, in augment_recompute()
[all …]
|
| D | assoc_array.c | 30 const struct assoc_array_node *node; in assoc_array_subtree_iterate() local
45 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
58 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
88 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
92 ptr = ACCESS_ONCE(node->slots[slot]); in assoc_array_subtree_iterate()
101 parent = ACCESS_ONCE(node->back_pointer); in assoc_array_subtree_iterate()
102 slot = node->parent_slot; in assoc_array_subtree_iterate()
165 struct assoc_array_node *node; /* Node in which leaf might be found */ member
188 struct assoc_array_node *node; in assoc_array_walk() local
218 node = assoc_array_ptr_to_node(cursor); in assoc_array_walk()
[all …]
|
| D | cpumask.c | 93 bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in alloc_cpumask_var_node() argument
95 *mask = kmalloc_node(cpumask_size(), flags, node); in alloc_cpumask_var_node()
108 bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node) in zalloc_cpumask_var_node() argument
110 return alloc_cpumask_var_node(mask, flags | __GFP_ZERO, node); in zalloc_cpumask_var_node()
183 unsigned int cpumask_local_spread(unsigned int i, int node) in cpumask_local_spread() argument
190 if (node == -1) { in cpumask_local_spread()
196 for_each_cpu_and(cpu, cpumask_of_node(node), cpu_online_mask) in cpumask_local_spread()
202 if (cpumask_test_cpu(cpu, cpumask_of_node(node))) in cpumask_local_spread()
|
| D | interval_tree.c | 6 #define START(node) ((node)->start) argument
7 #define LAST(node) ((node)->last) argument
|
| D | debugobjects.c | 104 hlist_add_head(&new->node, &obj_pool); in fill_pool()
118 hlist_for_each_entry(obj, &b->list, node) { in lookup_object()
140 obj = hlist_entry(obj_pool.first, typeof(*obj), node); in alloc_object()
146 hlist_del(&obj->node); in alloc_object()
148 hlist_add_head(&obj->node, &b->list); in alloc_object()
173 obj = hlist_entry(obj_pool.first, typeof(*obj), node); in free_obj_work()
174 hlist_del(&obj->node); in free_obj_work()
203 hlist_add_head(&obj->node, &obj_pool); in free_object()
232 hlist_for_each_entry_safe(obj, tmp, &freelist, node) { in debug_objects_oom()
233 hlist_del(&obj->node); in debug_objects_oom()
[all …]
|
| D | interval_tree_test.c | 31 struct interval_tree_node *node; in search() local
34 for (node = interval_tree_iter_first(root, start, last); node; in search()
35 node = interval_tree_iter_next(node, start, last)) in search()
|
| D | test_rhashtable.c | 57 struct rhash_head node; member
69 .head_offset = offsetof(struct test_obj, node),
174 err = rhashtable_insert_fast(ht, &obj->node, test_rht_params); in test_rhashtable()
205 rhashtable_remove_fast(ht, &obj->node, test_rht_params); in test_rhashtable()
254 err = rhashtable_insert_fast(&ht, &tdata->objs[i].node, in threadfunc()
280 err = rhashtable_remove_fast(&ht, &tdata->objs[i].node, in threadfunc()
|
| D | klist.c | 176 struct klist_node *node; member
193 if (waiter->node != n) in klist_release()
243 waiter.node = n; in klist_remove()
|
| /lib/842/ |
| D | 842_compress.c | 77 struct hlist_node node; member
83 struct hlist_node node; member
89 struct hlist_node node; member
124 for (_i = 0; _i < ARRAY_SIZE((p)->node##b); _i++) { \
125 (p)->node##b[_i].index = _i; \
126 (p)->node##b[_i].data = 0; \
127 INIT_HLIST_NODE(&(p)->node##b[_i].node); \
134 hash_for_each_possible(p->htable##b, _n, node, p->data##b[n]) { \
149 struct sw842_hlist_node##b *_n = &(p)->node##b[(i)+(d)]; \
150 hash_del(&_n->node); \
[all …]
|
| /lib/zlib_deflate/ |
| D | deftree.c | 548 int node; /* new node being created */ in build_tree() local
571 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
572 tree[node].Freq = 1; in build_tree()
573 s->depth[node] = 0; in build_tree()
574 s->opt_len--; if (stree) s->static_len -= stree[node].Len; in build_tree()
587 node = elems; /* next internal node of the tree */ in build_tree()
596 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
597 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1); in build_tree()
598 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
602 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); in build_tree()
[all …]
|