Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 3402) sorted by relevance

12345678910>>...137

/linux/drivers/scsi/elx/libefc/
A Defc_device.c31 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 …]
A Defc_node.c14 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 …]
A Defc_fabric.c30 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/dlm/
A Dmidcomms.c331 node = kmalloc(sizeof(*node), alloc); in nodeid2node()
451 node->nodeid, dlm_state_str(node->state)); in dlm_pas_fin_ack_rcv()
482 dlm_send_ack(node->nodeid, node->seq_next); in dlm_midcomms_receive_buffer()
486 node->nodeid, dlm_state_str(node->state)); in dlm_midcomms_receive_buffer()
541 dlm_send_ack(node->nodeid, node->seq_next); in dlm_midcomms_receive_buffer()
544 seq, node->seq_next, node->nodeid); in dlm_midcomms_receive_buffer()
966 dlm_send_ack(node->nodeid, node->seq_next); in dlm_midcomms_receive_done()
1079 mh->node = node; in dlm_midcomms_get_mhandle()
1164 node->nodeid, dlm_state_str(node->state)); in dlm_act_fin_ack_rcv()
1322 node->nodeid, dlm_state_str(node->state)); in midcomms_shutdown()
[all …]
/linux/fs/hfs/
A Dbnode.c216 if (!node->prev && !node->next) { in hfs_bnode_unlink()
243 node; node = node->next_hash) { in hfs_bnode_findhash()
267 if (!node) in __hfs_bnode_create()
274 node->tree->cnid, node->this); in __hfs_bnode_create()
317 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
336 if (node) { in hfs_bnode_find()
346 if (!node) in hfs_bnode_find()
372 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
435 if (!node) in hfs_bnode_create()
463 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
A Dbrec.c35 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/scripts/dtc/
A Dchecks.c62 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 …]
A Dlivetree.c119 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
786 struct node *node; in build_and_name_child_node() local
824 struct node *an, struct node *node, in generate_label_tree_internal() argument
908 struct node *node) in generate_fixups_tree_internal() argument
952 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
[all …]
/linux/scripts/gdb/linux/
A Drbtree.py20 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/
A Dbnode.c367 if (!node->prev && !node->next) in hfs_bnode_unlink()
394 node; node = node->next_hash) in hfs_bnode_findhash()
417 if (!node) in __hfs_bnode_create()
424 node->tree->cnid, node->this); in __hfs_bnode_create()
468 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
487 if (node) { in hfs_bnode_find()
498 if (!node) in hfs_bnode_find()
525 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
588 if (!node) in hfs_bnode_create()
616 node->tree->cnid, node->this, in hfs_bnode_get()
[all …]
A Dbrec.c36 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/
A Dradix-tree.c298 memset(node->slots, 0, sizeof(node->slots)); in radix_tree_node_rcu_free()
299 memset(node->tags, 0, sizeof(node->tags)); in radix_tree_node_rcu_free()
394 node = entry_to_node(node); in radix_tree_load_root()
476 node = entry_to_node(node); in radix_tree_shrink()
945 node = node->parent; in node_tag_set()
1005 node = node->parent; in node_tag_clear()
1231 iter->node = node; in radix_tree_next_chunk()
1378 return node && delete_node(root, node); in __radix_tree_delete()
1526 node = node->parent; in idr_get_free()
1541 iter->node = node; in idr_get_free()
[all …]
A Dbootconfig.c217 node = xbc_node_get_next(node); in xbc_node_find_subkey()
219 node = xbc_node_get_subkey(node); in xbc_node_find_subkey()
251 node = xbc_node_get_child(node); in xbc_node_find_value()
284 if (!node || node == root) in xbc_node_compose_key_after()
288 node = xbc_node_get_parent(node); in xbc_node_compose_key_after()
290 while (node && node != root) { in xbc_node_compose_key_after()
357 node = xbc_node_get_next(node); in xbc_node_find_next_leaf()
362 node = xbc_node_get_child(node); in xbc_node_find_next_leaf()
427 node = xbc_node_get_next(node); in xbc_last_sibling()
435 node = xbc_node_get_child(node); in xbc_last_child()
[all …]
A Dbtree.c211 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() local
256 node = bval(geo, node, i); in btree_lookup()
286 node = bval(geo, node, i); in btree_update()
327 node = head->node; in btree_get_prev()
335 node = bval(geo, node, i); in btree_get_prev()
407 node = bval(geo, node, i); in find_level()
427 head->node = node; in btree_grow()
440 node = head->node; in btree_shrink()
[all …]
/linux/kernel/gcov/
A Dfs.c393 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/
A Dallowedips.c24 node->cidr = cidr; in copy_and_assign_cidr()
36 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose()
105 return common_bits(node, key, bits) >= node->cidr; in prefix_matches()
113 while (node && prefix_matches(node, key, bits)) { in find_node()
115 found = node; in find_node()
118 node = rcu_dereference_bh(node->bit[choose(node, key)]); in find_node()
137 if (node) { in lookup()
154 while (node && node->cidr <= cidr && prefix_matches(node, key, bits)) { in node_placement()
209 if (!node) { in add()
312 if (node->bit[0] && node->bit[1]) in wg_allowedips_remove_by_peer()
[all …]
/linux/include/linux/
A Drbtree.h34 ((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/
A Dbpf_lru_list.c92 node->ref = 0; in __bpf_lru_node_move_in()
113 node->ref = 0; in __bpf_lru_node_move()
368 if (node) in __local_list_pop_free()
371 return node; in __local_list_pop_free()
428 return node; in bpf_percpu_lru_pop_free()
446 if (!node) { in bpf_common_lru_pop_free()
451 if (node) in bpf_common_lru_pop_free()
456 if (node) in bpf_common_lru_pop_free()
475 if (!node) in bpf_common_lru_pop_free()
485 if (node) { in bpf_common_lru_pop_free()
[all …]
A Dlpm_trie.c268 node = rcu_dereference_check(node->child[next_bit], in trie_lookup_elem()
289 if (!node) in lpm_trie_node_alloc()
298 return node; in lpm_trie_node_alloc()
472 if (!node || node->prefixlen != key->prefixlen || in trie_delete_elem()
498 !node->child[0] && !node->child[1]) { in trie_delete_elem()
651 for (node = search_root; node;) { in trie_get_next_key()
659 node = rcu_dereference(node->child[next_bit]); in trie_get_next_key()
661 if (!node || node->prefixlen != key->prefixlen || in trie_get_next_key()
693 for (node = search_root; node;) { in trie_get_next_key()
695 node = rcu_dereference(node->child[0]); in trie_get_next_key()
[all …]
/linux/drivers/gpu/drm/i915/gt/
A Dintel_gt_buffer_pool.c61 node = list_entry(pos, typeof(*node), link); in pool_free_older_than()
72 stale = node; in pool_free_older_than()
85 node_free(node); in pool_free_older_than()
148 node = kmalloc(sizeof(*node), in node_create()
150 if (!node) in node_create()
153 node->age = 0; in node_create()
161 kfree(node); in node_create()
168 node->obj = obj; in node_create()
169 return node; in node_create()
210 return node; in intel_gt_get_buffer_pool()
[all …]
/linux/drivers/usb/typec/
A Dport-mapper.c98 list_del(&node->list); in __unlink_port()
112 node = kzalloc(sizeof(*node), GFP_KERNEL); in create_port_node()
113 if (!node) in create_port_node()
119 return node; in create_port_node()
124 put_device(node->dev); in remove_port_node()
125 free_pld(node->pld); in remove_port_node()
126 kfree(node); in remove_port_node()
141 if (!node->pld) in find_connector()
163 if (IS_ERR(node)) in typec_link_port()
164 return PTR_ERR(node); in typec_link_port()
[all …]
/linux/drivers/gpu/drm/
A Ddrm_mm.c130 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/tools/include/linux/
A Drbtree.h43 ((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/net/hsr/
A Dhsr_framereg.c47 if (!node) { in hsr_addr_is_self()
69 return node; in find_node_by_addr_A()
85 node = kmalloc(sizeof(*node), GFP_KERNEL); in hsr_create_self_node()
86 if (!node) in hsr_create_self_node()
114 if (node) { in hsr_del_self_node()
127 kfree(node); in hsr_del_nodes()
191 return node; in hsr_add_node()
225 return node; in hsr_get_node()
564 if (node) in hsr_get_next_node()
569 node = _pos; in hsr_get_next_node()
[all …]
/linux/drivers/base/test/
A Dproperty-entry-test.c20 struct fwnode_handle *node; in pe_test_uints() local
28 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in pe_test_uints()
114 fwnode_remove_software_node(node); in pe_test_uints()
131 struct fwnode_handle *node; in pe_test_uint_arrays() local
249 fwnode_remove_software_node(node); in pe_test_uint_arrays()
266 struct fwnode_handle *node; in pe_test_strings() local
321 fwnode_remove_software_node(node); in pe_test_strings()
331 struct fwnode_handle *node; in pe_test_bool() local
339 fwnode_remove_software_node(node); in pe_test_bool()
426 struct fwnode_handle *node; in pe_test_reference() local
[all …]

Completed in 100 milliseconds

12345678910>>...137