| /linux/drivers/scsi/elx/libefc/ |
| H A D | efc_device.c | 31 node->display_name, node->wwpn, node->wwnn); in efc_d_send_prli_rsp()
216 if (node->init && !node->targ) { in __efc_d_initiate_shutdown()
220 node->wwpn, node->wwnn); in __efc_d_initiate_shutdown()
232 } else if (node->targ && !node->init) { in __efc_d_initiate_shutdown()
236 node->wwpn, node->wwnn); in __efc_d_initiate_shutdown()
248 } else if (node->init && node->targ) { in __efc_d_initiate_shutdown()
251 node->display_name, node->wwpn, node->wwnn); in __efc_d_initiate_shutdown()
293 if (!node->init && !node->targ) { in __efc_d_initiate_shutdown()
1310 node->wwpn, node->wwnn); in __efc_d_device_ready()
1444 labels[(node->targ << 1) | (node->init)], in __efc_d_device_gone()
[all …]
|
| H A D | efc_node.c | 14 struct efc_node *node = rnode->node; in efc_remote_node_cb() local
59 if (!node) { in efc_node_alloc()
63 memset(node, 0, sizeof(*node)); in efc_node_alloc()
91 node->rnode.node = node; in efc_node_alloc()
92 node->sm.app = node; in efc_node_alloc()
170 kref_put(&node->ref, node->release); in efc_node_free()
263 node->display_name, node->ls_acc_oxid); in efc_node_send_ls_io_cleanup()
314 node->nport->enable_ini, node->targ); in efc_node_handle_explicit_logo()
318 if (node->nport->enable_ini && node->targ) { in efc_node_handle_explicit_logo()
784 if (!node->hold_frames && node->evtdepth == 1) in efc_node_post_event()
[all …]
|
| H A D | efc_fabric.c | 30 if (node->attached) { in efc_fabric_initiate_shutdown()
56 node = ctx->app; in __efc_fabric_common()
90 efc_send_flogi(node); in __efc_fabric_init()
148 node->els_req_cnt--; in __efc_fabric_flogi_wait_rsp()
172 node_printf(node, in __efc_fabric_flogi_wait_rsp()
189 node_printf(node, in __efc_fabric_flogi_wait_rsp()
222 node_printf(node, in __efc_fabric_flogi_wait_rsp()
673 node_printf(node, in efc_process_gidpt_payload()
741 node_printf(node, in efc_process_gidpt_payload()
870 !node->nport->enable_ini && node->nport->enable_tgt && in __efc_ns_idle()
[all …]
|
| /linux/fs/hfs/ |
| H A D | bnode.c | 209 if (!node->prev && !node->next) { in hfs_bnode_unlink()
236 node; node = node->next_hash) { in hfs_bnode_findhash()
260 if (!node) in __hfs_bnode_create()
267 node->tree->cnid, node->this); in __hfs_bnode_create()
307 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
326 if (node) { in hfs_bnode_find()
336 if (!node) in hfs_bnode_find()
363 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
426 if (!node) in hfs_bnode_create()
452 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
|
| H A D | brec.c | 35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
79 if (IS_ERR(node)) in hfs_brec_insert()
81 fd->bnode = node; in hfs_brec_insert()
91 node = fd->bnode; in hfs_brec_insert()
111 node->num_recs++; in hfs_brec_insert()
184 node = fd->bnode; in hfs_brec_remove()
246 node->this, new_node->this, node->next); in hfs_bnode_split()
253 if (node->next) in hfs_bnode_split()
423 node = parent; in hfs_brec_update_parent()
465 node = NULL; in hfs_btree_inc_height()
[all …]
|
| /linux/fs/dlm/ |
| H A D | midcomms.c | 354 node = kmalloc(sizeof(*node), GFP_NOFS); in dlm_midcomms_addr()
482 node->nodeid, dlm_state_str(node->state)); in dlm_pas_fin_ack_rcv()
539 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_receive_buffer()
681 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_receive_buffer_3_2()
1025 mh->node = node; in dlm_midcomms_get_mhandle()
1187 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1193 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1198 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1229 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_add_member()
1356 node->nodeid, dlm_state_str(node->state)); in midcomms_shutdown()
[all …]
|
| /linux/scripts/dtc/ |
| H A D | checks.c | 62 struct node *node, in check_msg() argument
200 struct node *node) in check_always_fail() argument
207 struct node *node) in check_is_string() argument
225 struct node *node) in check_is_string_list() argument
254 struct node *node) in check_is_cell() argument
290 struct node *node) in check_duplicate_property_names() argument
313 struct node *node) in check_node_name_chars() argument
324 struct node *node) in check_node_name_chars_strict() argument
335 struct node *node) in check_node_name_format() argument
785 struct node *node) in check_ranges_format() argument
[all …]
|
| H A D | livetree.c | 119 struct node *name_node(struct node *node, char *name) in name_node() argument
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
135 struct node *reference_node(struct node *node) in reference_node() argument
231 struct node *node; in add_orphan_node() local
321 node = node->next_sibling; in delete_node_by_name()
540 struct node *child, *node; in get_node_by_label() local
813 struct node *node; in build_and_name_child_node() local
851 struct node *an, struct node *node, in generate_label_tree_internal() argument
941 struct node *node) in generate_fixups_tree_internal() argument
985 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
|
| /linux/scripts/gdb/linux/ |
| H A D | rbtree.py | 20 if node == 0:
24 node = node['rb_left']
26 return node
36 if node == 0:
40 node = node['rb_right']
42 return node
51 return node['__rb_parent_color'] == node.address
64 node = node['rb_right']
66 node = node['rb_left']
87 node = node['rb_left']
[all …]
|
| /linux/fs/hfsplus/ |
| H A D | bnode.c | 360 if (!node->prev && !node->next) in hfs_bnode_unlink()
387 node; node = node->next_hash) in hfs_bnode_findhash()
410 if (!node) in __hfs_bnode_create()
417 node->tree->cnid, node->this); in __hfs_bnode_create()
457 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
476 if (node) { in hfs_bnode_find()
487 if (!node) in hfs_bnode_find()
514 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
577 if (!node) in hfs_bnode_create()
603 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
|
| H A D | brec.c | 36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
77 if (IS_ERR(node)) in hfs_brec_insert()
79 fd->bnode = node; in hfs_brec_insert()
89 node = fd->bnode; in hfs_brec_insert()
109 node->num_recs++; in hfs_brec_insert()
113 node->num_recs); in hfs_brec_insert()
250 node->this, new_node->this, node->next); in hfs_bnode_split()
257 if (node->next) in hfs_bnode_split()
427 node = parent; in hfs_brec_update_parent()
469 node = NULL; in hfs_btree_inc_height()
[all …]
|
| /linux/lib/ |
| H A D | radix-tree.c | 300 memset(node->slots, 0, sizeof(node->slots)); in radix_tree_node_rcu_free()
301 memset(node->tags, 0, sizeof(node->tags)); in radix_tree_node_rcu_free()
396 node = entry_to_node(node); in radix_tree_load_root()
478 node = entry_to_node(node); in radix_tree_shrink()
947 node = node->parent; in node_tag_set()
1007 node = node->parent; in node_tag_clear()
1232 iter->node = node; in radix_tree_next_chunk()
1379 return node && delete_node(root, node); in __radix_tree_delete()
1527 node = node->parent; in idr_get_free()
1542 iter->node = node; in idr_get_free()
[all …]
|
| H A D | bootconfig.c | 233 node = xbc_node_get_next(node); in xbc_node_find_subkey()
267 node = xbc_node_get_child(node); in xbc_node_find_value()
300 if (!node || node == root) in xbc_node_compose_key_after()
304 node = xbc_node_get_parent(node); in xbc_node_compose_key_after()
306 while (node && node != root) { in xbc_node_compose_key_after()
310 node = xbc_node_get_parent(node); in xbc_node_compose_key_after()
373 node = xbc_node_get_next(node); in xbc_node_find_next_leaf()
378 node = xbc_node_get_child(node); in xbc_node_find_next_leaf()
443 node = xbc_node_get_next(node); in xbc_last_sibling()
451 node = xbc_node_get_child(node); in xbc_last_child()
[all …]
|
| H A D | btree.c | 211 unsigned long *node = head->node; in btree_last() local
217 node = bval(geo, node, 0); in btree_last()
245 unsigned long *node = head->node; in btree_lookup_node() local
256 node = bval(geo, node, i); in btree_lookup_node()
323 node = head->node; in btree_get_prev()
331 node = bval(geo, node, i); in btree_get_prev()
403 node = bval(geo, node, i); in find_level()
423 head->node = node; in btree_grow()
436 node = head->node; in btree_shrink()
439 head->node = bval(geo, node, 0); in btree_shrink()
[all …]
|
| /linux/kernel/gcov/ |
| H A D | fs.c | 393 if (node) { in gcov_seq_write()
545 if (!node) in new_node()
565 return node; in new_node()
568 kfree(node); in new_node()
599 kfree(node); in release_node()
700 if (!node) { in add_node()
702 if (!node) in add_node()
709 if (!node) in add_node()
822 node->loaded_info[i] = node->loaded_info[node->num_loaded - 1]; in remove_info()
846 if (node) in gcov_event()
[all …]
|
| /linux/drivers/net/wireguard/ |
| H A D | allowedips.c | 26 node->cidr = cidr; in copy_and_assign_cidr()
38 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose()
108 return common_bits(node, key, bits) >= node->cidr; in prefix_matches()
116 while (node && prefix_matches(node, key, bits)) { in find_node()
118 found = node; in find_node()
121 node = rcu_dereference_bh(node->bit[choose(node, key)]); in find_node()
140 if (node) { in lookup()
157 while (node && node->cidr <= cidr && prefix_matches(node, key, bits)) { in node_placement()
212 if (!node) { in add()
315 if (node->bit[0] && node->bit[1]) in wg_allowedips_remove_by_peer()
[all …]
|
| /linux/include/linux/ |
| H A D | rbtree.h | 34 ((node)->__rb_parent_color == (unsigned long)(node))
36 ((node)->__rb_parent_color = (unsigned long)(node))
63 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
265 node = node->rb_left; in rb_find()
267 node = node->rb_right; in rb_find()
296 node = node->rb_left; in rb_find_first()
298 node = node->rb_right; in rb_find_first()
317 node = rb_next(node); in rb_next_match()
318 if (node && cmp(key, node)) in rb_next_match()
[all …]
|
| /linux/kernel/bpf/ |
| H A D | bpf_lru_list.c | 373 if (node) in __local_list_pop_free()
376 return node; in __local_list_pop_free()
392 return node; in __local_list_pop_pending()
433 return node; in bpf_percpu_lru_pop_free()
451 if (!node) { in bpf_common_lru_pop_free()
456 if (node) in bpf_common_lru_pop_free()
461 if (node) in bpf_common_lru_pop_free()
462 return node; in bpf_common_lru_pop_free()
480 if (!node) in bpf_common_lru_pop_free()
490 if (node) { in bpf_common_lru_pop_free()
[all …]
|
| H A D | lpm_trie.c | 280 node = rcu_dereference_check(node->child[next_bit], in trie_lookup_elem()
301 if (!node) in lpm_trie_node_alloc()
310 return node; in lpm_trie_node_alloc()
487 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
513 !node->child[0] && !node->child[1]) { in trie_delete_elem()
665 for (node = search_root; node;) { in trie_get_next_key()
673 node = rcu_dereference(node->child[next_bit]); in trie_get_next_key()
675 if (!node || node->prefixlen != key->prefixlen || in trie_get_next_key()
707 for (node = search_root; node;) { in trie_get_next_key()
709 node = rcu_dereference(node->child[0]); in trie_get_next_key()
[all …]
|
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 43 ((node)->__rb_parent_color == (unsigned long)(node))
45 ((node)->__rb_parent_color = (unsigned long)(node))
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
276 node = node->rb_left; in rb_find()
278 node = node->rb_right; in rb_find()
307 node = node->rb_left; in rb_find_first()
309 node = node->rb_right; in rb_find_first()
328 node = rb_next(node); in rb_next_match()
329 if (node && cmp(key, node)) in rb_next_match()
331 return node; in rb_next_match()
[all …]
|
| /linux/drivers/gpu/drm/i915/gt/ |
| H A D | intel_gt_buffer_pool.c | 57 node = list_entry(pos, typeof(*node), link); in pool_free_older_than()
68 stale = node; in pool_free_older_than()
81 node_free(node); in pool_free_older_than()
146 node = kmalloc(sizeof(*node), in node_create()
148 if (!node) in node_create()
151 node->age = 0; in node_create()
159 kfree(node); in node_create()
166 node->obj = obj; in node_create()
167 return node; in node_create()
208 return node; in intel_gt_get_buffer_pool()
[all …]
|
| /linux/drivers/net/ethernet/marvell/octeontx2/nic/ |
| H A D | qos.c | 108 (node->schq - node->parent->prio_anchor) << 24; in otx2_config_sched_shaping()
119 maxrate = (node->rate > node->ceil) ? node->rate : node->ceil; in otx2_config_sched_shaping()
240 otx2_txschq_free_one(pfvf, node->level, node->schq); in otx2_qos_free_hw_node_schq()
251 otx2_txschq_free_one(pfvf, node->level, node->schq); in otx2_qos_free_hw_node()
265 otx2_txschq_free_one(pfvf, node->level, node->schq); in otx2_qos_free_hw_cfg()
369 cfg->schq_list[node->level][cnt] = node->schq; in otx2_qos_read_txschq_cfg_schq()
406 node = kzalloc(sizeof(*node), GFP_KERNEL); in otx2_qos_alloc_root()
407 if (!node) in otx2_qos_alloc_root()
507 node = kzalloc(sizeof(*node), GFP_KERNEL); in otx2_qos_sw_create_leaf_node()
508 if (!node) in otx2_qos_sw_create_leaf_node()
[all …]
|
| /linux/drivers/gpu/drm/ |
| H A D | drm_mm.c | 130 node->start, node->size); in show_leaks()
136 node->start, node->size, buf); in show_leaks()
149 #define START(node) ((node)->start) argument
150 #define LAST(node) ((node)->start + (node)->size - 1) argument
172 node->__subtree_last = LAST(node); in drm_mm_interval_tree_add_node()
272 node->subtree_max_hole = node->hole_size; in add_hole()
352 return node; in find_hole_addr()
398 node = node->first; \
400 node = node->last; \
431 node = list_next_entry(node, hole_stack); in DECLARE_NEXT_HOLE_ADDR()
[all …]
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| H A D | htb.c | 42 err = callback(data, node->qid, node->hw_id); in mlx5e_htb_enumerate_leaves()
75 node = kzalloc(sizeof(*node), GFP_KERNEL); in mlx5e_htb_node_create_leaf()
76 if (!node) in mlx5e_htb_node_create_leaf()
89 return node; in mlx5e_htb_node_create_leaf()
96 node = kzalloc(sizeof(*node), GFP_KERNEL); in mlx5e_htb_node_create_root()
97 if (!node) in mlx5e_htb_node_create_root()
104 return node; in mlx5e_htb_node_create_root()
116 return node; in mlx5e_htb_node_find()
317 node->bw_share, node->max_average_bw, in mlx5e_htb_leaf_alloc_queue()
355 if (!node) in mlx5e_htb_leaf_to_inner()
[all …]
|
| /linux/tools/lib/ |
| H A D | rbtree.c | 162 parent = node; in __rb_insert()
498 node = node->rb_right; in rb_next()
500 node = node->rb_left; in rb_next()
512 node = parent; in rb_next()
529 node = node->rb_left; in rb_prev()
531 node = node->rb_right; in rb_prev()
539 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev()
540 node = parent; in rb_prev()
565 node = node->rb_left; in rb_left_deepest_node()
567 node = node->rb_right; in rb_left_deepest_node()
[all …]
|