| /linux-4.19.296/fs/hfs/ |
| D | bnode.c | 18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
26 off += node->page_offset; in hfs_bnode_read()
31 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
33 page = node->page[pagenum]; in hfs_bnode_read()
45 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
49 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
53 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
57 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
61 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
66 tree = node->tree; in hfs_bnode_read_key()
[all …]
|
| D | brec.c | 19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
25 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
38 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
[all …]
|
| D | btree.c | 139 struct hfs_bnode *node; in hfs_btree_close() local
146 while ((node = tree->node_hash[i])) { in hfs_btree_close()
147 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
148 if (atomic_read(&node->refcnt)) in hfs_btree_close()
150 node->tree->cnid, node->this, in hfs_btree_close()
151 atomic_read(&node->refcnt)); in hfs_btree_close()
152 hfs_bnode_free(node); in hfs_btree_close()
163 struct hfs_bnode *node; in hfs_btree_write() local
166 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
167 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /linux-4.19.296/fs/hfsplus/ |
| D | bnode.c | 22 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
27 off += node->page_offset; in hfs_bnode_read()
28 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
43 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
47 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
51 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
55 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
59 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
64 tree = node->tree; in hfs_bnode_read_key()
65 if (node->type == HFS_NODE_LEAF || in hfs_bnode_read_key()
[all …]
|
| D | brec.c | 20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
25 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
26 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
39 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && in hfs_brec_keylen()
41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
44 recoff = hfs_bnode_read_u16(node, in hfs_brec_keylen()
[all …]
|
| D | btree.c | 260 struct hfs_bnode *node; in hfs_btree_close() local
267 while ((node = tree->node_hash[i])) { in hfs_btree_close()
268 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
269 if (atomic_read(&node->refcnt)) in hfs_btree_close()
272 node->tree->cnid, node->this, in hfs_btree_close()
273 atomic_read(&node->refcnt)); in hfs_btree_close()
274 hfs_bnode_free(node); in hfs_btree_close()
285 struct hfs_bnode *node; in hfs_btree_write() local
288 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
289 if (IS_ERR(node)) in hfs_btree_write()
[all …]
|
| /linux-4.19.296/lib/ |
| D | radix-tree.c | 106 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
108 void __rcu **ptr = node; in is_sibling_entry()
114 bool is_sibling_entry(const struct radix_tree_node *parent, void *node) in is_sibling_entry() argument
152 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
155 __set_bit(offset, node->tags[tag]); in tag_set()
158 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
161 __clear_bit(offset, node->tags[tag]); in tag_clear()
164 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
167 return test_bit(offset, node->tags[tag]); in tag_get()
204 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
[all …]
|
| D | btree.c | 97 unsigned long *node; in btree_node_alloc() local
99 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
100 if (likely(node)) in btree_node_alloc()
101 memset(node, 0, NODESIZE); in btree_node_alloc()
102 return node; in btree_node_alloc()
150 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
152 return &node[n * geo->keylen]; in bkey()
155 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() argument
157 return (void *)node[geo->no_longs + n]; in bval()
160 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
101 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
104 *leftmost = node; in __rb_insert()
116 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
149 node = gparent; in __rb_insert()
150 parent = rb_parent(node); in __rb_insert()
151 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
156 if (node == tmp) { in __rb_insert()
170 tmp = node->rb_left; in __rb_insert()
172 WRITE_ONCE(node->rb_left, parent); in __rb_insert()
[all …]
|
| D | timerqueue.c | 40 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
48 WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); in timerqueue_add()
52 ptr = rb_entry(parent, struct timerqueue_node, node); in timerqueue_add()
53 if (node->expires < ptr->expires) { in timerqueue_add()
60 rb_link_node(&node->node, parent, p); in timerqueue_add()
61 rb_insert_color_cached(&node->node, &head->rb_root, leftmost); in timerqueue_add()
76 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_del() argument
78 WARN_ON_ONCE(RB_EMPTY_NODE(&node->node)); in timerqueue_del()
80 rb_erase_cached(&node->node, &head->rb_root); in timerqueue_del()
81 RB_CLEAR_NODE(&node->node); in timerqueue_del()
[all …]
|
| /linux-4.19.296/include/drm/ |
| D | drm_vma_manager.h | 60 struct drm_vma_offset_node *node, unsigned long pages);
62 struct drm_vma_offset_node *node);
64 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
65 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
67 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
87 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
89 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
90 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
135 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
137 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
[all …]
|
| /linux-4.19.296/include/linux/ |
| D | interval_tree_generic.h | 45 static inline ITTYPE ITPREFIX ## _compute_subtree_last(ITSTRUCT *node) \
47 ITTYPE max = ITLAST(node), subtree_last; \
48 if (node->ITRB.rb_left) { \
49 subtree_last = rb_entry(node->ITRB.rb_left, \
54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
68 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, \
72 ITTYPE start = ITSTART(node), last = ITLAST(node); \
89 node->ITSUBTREE = last; \
90 rb_link_node(&node->ITRB, rb_parent, link); \
[all …]
|
| D | rbtree_latch.h | 41 struct rb_node node[2]; member
70 __lt_from_rb(struct rb_node *node, int idx) in __lt_from_rb() argument
72 return container_of(node, struct latch_tree_node, node[idx]); in __lt_from_rb()
81 struct rb_node *node = <n->node[idx]; in __lt_insert() local
95 rb_link_node_rcu(node, parent, link); in __lt_insert()
96 rb_insert_color(node, root); in __lt_insert()
102 rb_erase(<n->node[idx], <r->tree[idx]); in __lt_erase()
107 int (*comp)(void *key, struct latch_tree_node *node)) in __lt_find() argument
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find() local
113 while (node) { in __lt_find()
[all …]
|
| D | topology.h | 38 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node)) argument
41 #define for_each_node_with_cpus(node) \ argument
42 for_each_online_node(node) \
43 if (nr_cpus_node(node))
86 static inline void set_numa_node(int node) in set_numa_node() argument
88 this_cpu_write(numa_node, node); in set_numa_node()
93 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
95 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
122 static inline void set_numa_mem(int node) in set_numa_mem() argument
124 this_cpu_write(_numa_mem_, node); in set_numa_mem()
[all …]
|
| D | nodemask.h | 127 #define node_set(node, dst) __node_set((node), &(dst)) argument
128 static __always_inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
130 set_bit(node, dstp->bits); in __node_set()
133 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
134 static inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
136 clear_bit(node, dstp->bits); in __node_clear()
152 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
154 #define node_test_and_set(node, nodemask) \ argument
155 __node_test_and_set((node), &(nodemask))
156 static inline bool __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
|
| /linux-4.19.296/fs/ocfs2/cluster/ |
| D | quorum.c | 177 static void o2quo_set_hold(struct o2quo_state *qs, u8 node) in o2quo_set_hold() argument
181 if (!test_and_set_bit(node, qs->qs_hold_bm)) { in o2quo_set_hold()
184 "node %u\n", node); in o2quo_set_hold()
185 mlog(0, "node %u, %d total\n", node, qs->qs_holds); in o2quo_set_hold()
189 static void o2quo_clear_hold(struct o2quo_state *qs, u8 node) in o2quo_clear_hold() argument
193 if (test_and_clear_bit(node, qs->qs_hold_bm)) { in o2quo_clear_hold()
194 mlog(0, "node %u, %d total\n", node, qs->qs_holds - 1); in o2quo_clear_hold()
202 node, qs->qs_holds); in o2quo_clear_hold()
210 void o2quo_hb_up(u8 node) in o2quo_hb_up() argument
218 "node %u\n", node); in o2quo_hb_up()
[all …]
|
| D | nodemanager.c | 48 struct o2nm_node *node = NULL; in o2nm_get_node_by_num() local
54 node = o2nm_single_cluster->cl_nodes[node_num]; in o2nm_get_node_by_num()
55 if (node) in o2nm_get_node_by_num()
56 config_item_get(&node->nd_item); in o2nm_get_node_by_num()
59 return node; in o2nm_get_node_by_num()
87 struct o2nm_node *node, *ret = NULL; in o2nm_node_ip_tree_lookup() local
93 node = rb_entry(parent, struct o2nm_node, nd_ip_node); in o2nm_node_ip_tree_lookup()
95 cmp = memcmp(&ip_needle, &node->nd_ipv4_address, in o2nm_node_ip_tree_lookup()
102 ret = node; in o2nm_node_ip_tree_lookup()
117 struct o2nm_node *node = NULL; in o2nm_get_node_by_ip() local
[all …]
|
| /linux-4.19.296/drivers/clk/ |
| D | clk-moxart.c | 19 static void __init moxart_of_pll_clk_init(struct device_node *node) in moxart_of_pll_clk_init() argument
25 const char *name = node->name; in moxart_of_pll_clk_init()
28 of_property_read_string(node, "clock-output-names", &name); in moxart_of_pll_clk_init()
29 parent_name = of_clk_get_parent_name(node, 0); in moxart_of_pll_clk_init()
31 base = of_iomap(node, 0); in moxart_of_pll_clk_init()
33 pr_err("%pOF: of_iomap failed\n", node); in moxart_of_pll_clk_init()
40 ref_clk = of_clk_get(node, 0); in moxart_of_pll_clk_init()
42 pr_err("%pOF: of_clk_get failed\n", node); in moxart_of_pll_clk_init()
48 pr_err("%pOF: failed to register clock\n", node); in moxart_of_pll_clk_init()
53 of_clk_add_hw_provider(node, of_clk_hw_simple_get, hw); in moxart_of_pll_clk_init()
[all …]
|
| /linux-4.19.296/drivers/clk/ti/ |
| D | dpll.c | 156 struct device_node *node) in _register_dpll() argument
163 clk = of_clk_get(node, 0); in _register_dpll()
166 node->name); in _register_dpll()
167 if (!ti_clk_retry_init(node, hw, _register_dpll)) in _register_dpll()
175 clk = of_clk_get(node, 1); in _register_dpll()
179 node->name); in _register_dpll()
180 if (!ti_clk_retry_init(node, hw, _register_dpll)) in _register_dpll()
189 clk = ti_clk_register(NULL, &clk_hw->hw, node->name); in _register_dpll()
193 of_clk_add_provider(node, of_clk_src_simple_get, clk); in _register_dpll()
217 static void _register_dpll_x2(struct device_node *node, in _register_dpll_x2() argument
[all …]
|
| D | gate.c | 161 static void __init _of_ti_gate_clk_setup(struct device_node *node, in _of_ti_gate_clk_setup() argument
174 if (ti_clk_get_reg_addr(node, 0, ®)) in _of_ti_gate_clk_setup()
177 if (!of_property_read_u32(node, "ti,bit-shift", &val)) in _of_ti_gate_clk_setup()
181 if (of_clk_get_parent_count(node) != 1) { in _of_ti_gate_clk_setup()
182 pr_err("%s must have 1 parent\n", node->name); in _of_ti_gate_clk_setup()
186 parent_name = of_clk_get_parent_name(node, 0); in _of_ti_gate_clk_setup()
188 if (of_property_read_bool(node, "ti,set-rate-parent")) in _of_ti_gate_clk_setup()
191 if (of_property_read_bool(node, "ti,set-bit-to-disable")) in _of_ti_gate_clk_setup()
194 clk = _register_gate(NULL, node->name, parent_name, flags, ®, in _of_ti_gate_clk_setup()
198 of_clk_add_provider(node, of_clk_src_simple_get, clk); in _of_ti_gate_clk_setup()
[all …]
|
| D | interface.c | 70 static void __init _of_ti_interface_clk_setup(struct device_node *node, in _of_ti_interface_clk_setup() argument
79 if (ti_clk_get_reg_addr(node, 0, ®)) in _of_ti_interface_clk_setup()
82 if (!of_property_read_u32(node, "ti,bit-shift", &val)) in _of_ti_interface_clk_setup()
85 parent_name = of_clk_get_parent_name(node, 0); in _of_ti_interface_clk_setup()
87 pr_err("%s must have a parent\n", node->name); in _of_ti_interface_clk_setup()
91 clk = _register_interface(NULL, node->name, parent_name, ®, in _of_ti_interface_clk_setup()
95 of_clk_add_provider(node, of_clk_src_simple_get, clk); in _of_ti_interface_clk_setup()
98 static void __init of_ti_interface_clk_setup(struct device_node *node) in of_ti_interface_clk_setup() argument
100 _of_ti_interface_clk_setup(node, &clkhwops_iclk_wait); in of_ti_interface_clk_setup()
105 static void __init of_ti_no_wait_interface_clk_setup(struct device_node *node) in of_ti_no_wait_interface_clk_setup() argument
[all …]
|
| /linux-4.19.296/drivers/base/ |
| D | devres.c | 26 struct devres_node node; member
38 struct devres_node node[2]; member
48 static void set_node_dbginfo(struct devres_node *node, const char *name, in set_node_dbginfo() argument
51 node->name = name; in set_node_dbginfo()
52 node->size = size; in set_node_dbginfo()
55 static void devres_log(struct device *dev, struct devres_node *node, in devres_log() argument
60 op, node, node->name, (unsigned long)node->size); in devres_log()
63 #define set_node_dbginfo(node, n, s) do {} while (0) argument
64 #define devres_log(dev, node, op) do {} while (0) argument
81 static struct devres_group * node_to_group(struct devres_node *node) in node_to_group() argument
[all …]
|
| /linux-4.19.296/fs/btrfs/ |
| D | ulist.c | 63 struct ulist_node *node; in ulist_release() local
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
67 kfree(node); in ulist_release()
135 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase() argument
137 rb_erase(&node->rb_node, &ulist->root); in ulist_rbtree_erase()
138 list_del(&node->list); in ulist_rbtree_erase()
139 kfree(node); in ulist_rbtree_erase()
195 struct ulist_node *node; in ulist_add_merge() local
197 node = ulist_rbtree_search(ulist, val); in ulist_add_merge()
198 if (node) { in ulist_add_merge()
[all …]
|
| /linux-4.19.296/fs/xfs/libxfs/ |
| D | xfs_iext_tree.c | 165 struct xfs_iext_node *node = ifp->if_u1.if_root; in xfs_iext_find_first_leaf() local
172 node = node->ptrs[0]; in xfs_iext_find_first_leaf()
173 ASSERT(node); in xfs_iext_find_first_leaf()
176 return node; in xfs_iext_find_first_leaf()
183 struct xfs_iext_node *node = ifp->if_u1.if_root; in xfs_iext_find_last_leaf() local
191 if (!node->ptrs[i]) in xfs_iext_find_last_leaf()
193 node = node->ptrs[i - 1]; in xfs_iext_find_last_leaf()
194 ASSERT(node); in xfs_iext_find_last_leaf()
197 return node; in xfs_iext_find_last_leaf()
281 struct xfs_iext_node *node, in xfs_iext_key_cmp() argument
[all …]
|
| /linux-4.19.296/drivers/clk/keystone/ |
| D | pll.c | 162 static void __init _of_pll_clk_init(struct device_node *node, bool pllctrl) in _of_pll_clk_init() argument
175 parent_name = of_clk_get_parent_name(node, 0); in _of_pll_clk_init()
176 if (of_property_read_u32(node, "fixed-postdiv", &pll_data->postdiv)) { in _of_pll_clk_init()
185 i = of_property_match_string(node, "reg-names", in _of_pll_clk_init()
187 pll_data->pllod = of_iomap(node, i); in _of_pll_clk_init()
190 i = of_property_match_string(node, "reg-names", "control"); in _of_pll_clk_init()
191 pll_data->pll_ctl0 = of_iomap(node, i); in _of_pll_clk_init()
206 i = of_property_match_string(node, "reg-names", "multiplier"); in _of_pll_clk_init()
207 pll_data->pllm = of_iomap(node, i); in _of_pll_clk_init()
215 clk = clk_register_pll(NULL, node->name, parent_name, pll_data); in _of_pll_clk_init()
[all …]
|