| /linux/drivers/scsi/elx/libefc/ |
| H A D | efc_node.c | 14 struct efc_node *node = rnode->node; in efc_remote_node_cb() local
18 efc_node_post_event(node, event, NULL); in efc_remote_node_cb()
27 /* Find an FC node structure given the FC port ID */ in efc_node_find()
34 struct efc_node *node = container_of(arg, struct efc_node, ref); in _efc_node_free() local
35 struct efc *efc = node->efc; in _efc_node_free()
38 dma = &node->sparm_dma_buf; in _efc_node_free()
41 mempool_free(node, efc->node_pool); in _efc_node_free()
48 struct efc_node *node = NULL; in efc_node_alloc() local
53 efc_log_debug(efc, "node allocation when shutting down %06x", in efc_node_alloc()
58 node = mempool_alloc(efc->node_pool, GFP_ATOMIC); in efc_node_alloc()
[all …]
|
| H A D | efc_device.c | 8 * device_sm Node State Machine: Remote Device States
16 efc_d_send_prli_rsp(struct efc_node *node, u16 ox_id) in efc_d_send_prli_rsp() argument
19 struct efc *efc = node->efc; in efc_d_send_prli_rsp()
21 node->ls_acc_oxid = ox_id; in efc_d_send_prli_rsp()
22 node->send_ls_acc = EFC_NODE_SEND_LS_ACC_PRLI; in efc_d_send_prli_rsp()
29 if (node->init) { in efc_d_send_prli_rsp()
31 node->display_name, node->wwpn, node->wwnn); in efc_d_send_prli_rsp()
32 if (node->nport->enable_tgt) in efc_d_send_prli_rsp()
33 rc = efc->tt.scsi_new_node(efc, node); in efc_d_send_prli_rsp()
37 efc_node_post_event(node, EFC_EVT_NODE_SESS_REG_FAIL, NULL); in efc_d_send_prli_rsp()
[all …]
|
| H A D | efc_fabric.c | 8 * This file implements remote node state machines for:
16 * fabric_sm Node State Machine: Fabric States
17 * ns_sm Node State Machine: Name/Directory Services States
18 * p2p_sm Node State Machine: Point-to-Point Node States
24 efc_fabric_initiate_shutdown(struct efc_node *node) in efc_fabric_initiate_shutdown() argument
26 struct efc *efc = node->efc; in efc_fabric_initiate_shutdown()
28 node->els_io_enabled = false; in efc_fabric_initiate_shutdown()
30 if (node->attached) { in efc_fabric_initiate_shutdown()
33 /* issue hw node free; don't care if succeeds right away in efc_fabric_initiate_shutdown()
34 * or sometime later, will check node->attached later in in efc_fabric_initiate_shutdown()
[all …]
|
| H A D | efc_els.c | 22 node->display_name, __func__); \
26 efc_log_err((struct efc *)els->node->efc,\
28 els->node->display_name,\
35 efc_els_io_alloc(struct efc_node *node, u32 reqlen) in efc_els_io_alloc() argument
37 return efc_els_io_alloc_size(node, reqlen, EFC_ELS_RSP_LEN); in efc_els_io_alloc()
41 efc_els_io_alloc_size(struct efc_node *node, u32 reqlen, u32 rsplen) in efc_els_io_alloc_size() argument
47 efc = node->efc; in efc_els_io_alloc_size()
49 if (!node->els_io_enabled) { in efc_els_io_alloc_size()
65 els->node = node; in efc_els_io_alloc_size()
92 spin_lock_irqsave(&node->els_ios_lock, flags); in efc_els_io_alloc_size()
[all …]
|
| /linux/scripts/gdb/linux/ |
| H A D | rbtree.py | 13 def inorder(node): argument
14 if node:
15 yield from inorder(node['rb_left'])
16 yield node
17 yield from inorder(node['rb_right'])
22 for node in rb_inorder_for_each(root):
23 yield utils.container_of(node, gdbtype, member)
27 node = root.address.cast(rb_root_type.get_type().pointer())
31 node = root['rb_node']
32 if node == 0:
[all …]
|
| /linux/lib/ |
| H A D | bootconfig.c | 40 * xbc_parse() parses the text to build a simple tree. Each tree node is
41 * simply a key word or a value. A key node may have a next key node or/and
42 * a child node (both key and value). A value node may have a next value
43 * node (for array).
112 * xbc_root_node() - Get the root node of extended boot config
114 * Return the address of root node of extended boot config. If the
126 * xbc_node_index() - Get the index of XBC node
127 * @node: A target node of getting index.
129 * Return the index number of @node in XBC node list.
131 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
[all …]
|
| H A D | radix-tree.c | 33 * Radix tree node cache.
45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
100 static inline void tag_set(struct radix_tree_node *node, unsigned int tag, in tag_set() argument
103 __set_bit(offset, node->tags[tag]); in tag_set()
106 static inline void tag_clear(struct radix_tree_node *node, unsigned int tag, in tag_clear() argument
109 __clear_bit(offset, node->tags[tag]); in tag_clear()
112 static inline int tag_get(const struct radix_tree_node *node, unsigned int tag, in tag_get() argument
115 return test_bit(offset, node->tags[tag]); in tag_get()
149 * Returns 1 if any slot in the node has this tag set.
152 static inline int any_tag_set(const struct radix_tree_node *node, in any_tag_set() argument
[all …]
|
| H A D | btree.c | 16 * well is that access to a random tree node is much faster than a large number
17 * of operations within each node.
35 * values are to the right, not to the left. All used slots within a node
94 unsigned long *node; in btree_node_alloc() local
96 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
97 if (likely(node)) in btree_node_alloc()
98 memset(node, 0, NODESIZE); in btree_node_alloc()
99 return node; in btree_node_alloc()
147 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
149 return &node[n * geo->keylen]; in bkey()
[all …]
|
| /linux/fs/dlm/ |
| H A D | midcomms.c | 29 * Due the fact that dlm has pre-configured node addresses on every side
35 * application layer. The version field of every node will be set on these RCOM
36 * messages as soon as they arrived and the node isn't yet part of the nodes
47 * compatibility. A node cannot send anything to another node when a DLM_FIN
51 * manager removed the node from internal lists, at this point DLM does not
52 * send any message to the other node. There exists two cases:
160 * We could send a fence signal for a specific node to the cluster
185 /* counts how many lockspaces are using this node
187 * node wants to disconnect.
200 struct midcomms_node *node; member
[all …]
|
| /linux/include/linux/ |
| H A D | rbtree.h | 33 #define RB_EMPTY_NODE(node) \ argument
34 ((node)->__rb_parent_color == (unsigned long)(node))
35 #define RB_CLEAR_NODE(node) \ argument
36 ((node)->__rb_parent_color = (unsigned long)(node))
48 * This function returns the first node (in sort order) of the tree.
63 * This function returns the last node (in sort order) of the tree.
81 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
87 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
90 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
91 node->rb_left = node->rb_right = NULL; in rb_link_node()
[all …]
|
| H A D | nodemask.h | 7 * set of Node's in a system, one bit position per Node number.
22 * void node_set(node, mask) turn on bit 'node' in mask
23 * void node_clear(node, mask) turn off bit 'node' in mask
26 * int node_isset(node, mask) true iff bit 'node' set in mask
27 * int node_test_and_set(node, mask) test and set bit 'node' in mask
43 * unsigend int next_node(node, mask) Next node past 'node', or MAX_NUMNODES
44 * unsigned int next_node_in(node, mask) Next node past 'node', or wrap to first,
46 * unsigned int first_unset_node(mask) First node not set in mask, or
49 * nodemask_t nodemask_of_node(node) Return nodemask with bit 'node' set
61 * for_each_node_mask(node, mask) for-loop node over mask
[all …]
|
| /linux/tools/net/sunrpc/xdrgen/generators/ |
| H A D | union.py | 15 def emit_union_declaration(environment: Environment, node: _XdrUnion) -> None:
17 if node.name in public_apis:
19 print(template.render(name=node.name))
23 environment: Environment, node: _XdrDeclaration
26 assert isinstance(node, _XdrBasic)
30 name=node.name,
31 type=node.spec.type_name,
32 classifier=node.spec.c_classifier,
38 environment: Environment, node: _XdrDeclaration
41 if isinstance(node.arm, _XdrVoid):
[all …]
|
| /linux/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| H A D | htb.c | 36 struct mlx5e_qos_node *node = NULL; in mlx5e_htb_enumerate_leaves() local
39 hash_for_each(htb->qos_tc2node, bkt, node, hnode) { in mlx5e_htb_enumerate_leaves()
40 if (node->qid == MLX5E_QOS_QID_INNER) in mlx5e_htb_enumerate_leaves()
42 err = callback(data, node->qid, node->hw_id); in mlx5e_htb_enumerate_leaves()
73 struct mlx5e_qos_node *node; in mlx5e_htb_node_create_leaf() local
75 node = kzalloc(sizeof(*node), GFP_KERNEL); in mlx5e_htb_node_create_leaf()
76 if (!node) in mlx5e_htb_node_create_leaf()
79 node->parent = parent; in mlx5e_htb_node_create_leaf()
81 node->qid = qid; in mlx5e_htb_node_create_leaf()
84 node->classid = classid; in mlx5e_htb_node_create_leaf()
[all …]
|
| /linux/drivers/net/ethernet/marvell/octeontx2/nic/ |
| H A D | qos.c | 44 static void otx2_qos_get_regaddr(struct otx2_qos_node *node, in otx2_qos_get_regaddr() argument
48 if (node->level == NIX_TXSCH_LVL_SMQ) { in otx2_qos_get_regaddr()
49 cfg->reg[index++] = NIX_AF_MDQX_PARENT(node->schq); in otx2_qos_get_regaddr()
50 cfg->reg[index++] = NIX_AF_MDQX_SCHEDULE(node->schq); in otx2_qos_get_regaddr()
51 cfg->reg[index++] = NIX_AF_MDQX_PIR(node->schq); in otx2_qos_get_regaddr()
52 cfg->reg[index] = NIX_AF_MDQX_CIR(node->schq); in otx2_qos_get_regaddr()
53 } else if (node->level == NIX_TXSCH_LVL_TL4) { in otx2_qos_get_regaddr()
54 cfg->reg[index++] = NIX_AF_TL4X_PARENT(node->schq); in otx2_qos_get_regaddr()
55 cfg->reg[index++] = NIX_AF_TL4X_SCHEDULE(node->schq); in otx2_qos_get_regaddr()
56 cfg->reg[index++] = NIX_AF_TL4X_PIR(node->schq); in otx2_qos_get_regaddr()
[all …]
|
| /linux/kernel/gcov/ |
| H A D | fs.c | 34 * @list: list head for child node list
37 * @parent: parent node
251 * Return a profiling data set associated with the given node. This is
255 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
257 if (node->num_loaded > 0) in get_node_info()
258 return node->loaded_info[0]; in get_node_info()
260 return node->unloaded_info; in get_node_info()
265 * all profiling data associated with the given node.
267 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
272 if (node->unloaded_info) in get_accumulated_info()
[all …]
|
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 42 #define RB_EMPTY_NODE(node) \ argument
43 ((node)->__rb_parent_color == (unsigned long)(node))
44 #define RB_CLEAR_NODE(node) \ argument
45 ((node)->__rb_parent_color = (unsigned long)(node))
62 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
66 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
69 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
70 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 *rb_link = node; in rb_link_node()
112 * We do not cache the rightmost node based on footprint
[all …]
|
| /linux/rust/syn/gen/ |
| H A D | visit_mut.rs | 958 pub fn visit_abi_mut<V>(v: &mut V, node: &mut crate::Abi) in visit_abi_mut()
962 skip!(node.extern_token); in visit_abi_mut()
963 if let Some(it) = &mut node.name { in visit_abi_mut()
971 node: &mut crate::AngleBracketedGenericArguments, in visit_angle_bracketed_generic_arguments_mut()
976 skip!(node.colon2_token); in visit_angle_bracketed_generic_arguments_mut()
977 skip!(node.lt_token); in visit_angle_bracketed_generic_arguments_mut()
978 for mut el in Punctuated::pairs_mut(&mut node.args) { in visit_angle_bracketed_generic_arguments_mut()
982 skip!(node.gt_token); in visit_angle_bracketed_generic_arguments_mut()
986 pub fn visit_arm_mut<V>(v: &mut V, node: &mut crate::Arm) in visit_arm_mut()
990 v.visit_attributes_mut(&mut node.attrs); in visit_arm_mut()
[all …]
|
| H A D | visit.rs | 950 pub fn visit_abi<'ast, V>(v: &mut V, node: &'ast crate::Abi) in visit_abi()
954 skip!(node.extern_token); in visit_abi()
955 if let Some(it) = &node.name { in visit_abi()
963 node: &'ast crate::AngleBracketedGenericArguments, in visit_angle_bracketed_generic_arguments()
968 skip!(node.colon2_token); in visit_angle_bracketed_generic_arguments()
969 skip!(node.lt_token); in visit_angle_bracketed_generic_arguments()
970 for el in Punctuated::pairs(&node.args) { in visit_angle_bracketed_generic_arguments()
974 skip!(node.gt_token); in visit_angle_bracketed_generic_arguments()
978 pub fn visit_arm<'ast, V>(v: &mut V, node: &'ast crate::Arm) in visit_arm()
982 for it in &node.attrs { in visit_arm()
[all …]
|
| H A D | fold.rs | 1030 pub fn fold_abi<F>(f: &mut F, node: crate::Abi) -> crate::Abi in fold_abi()
1035 extern_token: node.extern_token, in fold_abi()
1036 name: (node.name).map(|it| f.fold_lit_str(it)), in fold_abi()
1043 node: crate::AngleBracketedGenericArguments, in fold_angle_bracketed_generic_arguments()
1049 colon2_token: node.colon2_token, in fold_angle_bracketed_generic_arguments()
1050 lt_token: node.lt_token, in fold_angle_bracketed_generic_arguments()
1051 args: crate::punctuated::fold(node.args, f, F::fold_generic_argument), in fold_angle_bracketed_generic_arguments()
1052 gt_token: node.gt_token, in fold_angle_bracketed_generic_arguments()
1057 pub fn fold_arm<F>(f: &mut F, node: crate::Arm) -> crate::Arm in fold_arm()
1062 attrs: f.fold_attributes(node.attrs), in fold_arm()
[all …]
|
| /linux/kernel/bpf/ |
| H A D | lpm_trie.c | 21 /* Intermediate node */
51 * lead to more nodes containing more specific matches. Each node also stores
61 * As the trie is empty initially, the new node (1) will be places as root
62 * node, denoted as (R) in the example below. As there are no other node, both
72 * Next, let's add a new node (2) matching 192.168.0.0/24. As there is already
73 * a node with the same data and a smaller prefix (ie, a less specific one),
74 * node (2) will become a child of (1). In child index depends on the next bit
92 * The child[1] slot of (1) could be filled with another node which has bit #17
110 * Let's add another node (
168 __longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) __longest_prefix_match() argument
230 longest_prefix_match(const struct lpm_trie * trie,const struct lpm_trie_node * node,const struct bpf_lpm_trie_key_u8 * key) longest_prefix_match() argument
240 struct lpm_trie_node *node, *found = NULL; trie_lookup_elem() local
294 struct lpm_trie_node *node; lpm_trie_node_alloc() local
325 struct lpm_trie_node *node, *im_node, *new_node; trie_update_elem() local
461 struct lpm_trie_node *node, *parent; trie_delete_elem() local
614 struct lpm_trie_node *node; trie_free() local
655 struct lpm_trie_node *node, *next_node = NULL, *parent, *search_root; trie_get_next_key() local
[all...] |
| /linux/net/hsr/ |
| H A D | hsr_framereg.c | 56 WARN_ONCE(1, "HSR: No self node\n"); in hsr_addr_is_self()
73 struct hsr_node *node; in find_node_by_addr_A() local
75 list_for_each_entry_rcu(node, node_db, mac_list) { in find_node_by_addr_A()
76 if (ether_addr_equal(node->macaddress_A, addr)) in find_node_by_addr_A()
77 return node; in find_node_by_addr_A()
83 /* Check if node for a given MAC address is already present in data base
131 struct hsr_node *node; in hsr_del_nodes() local
134 list_for_each_entry_safe(node, tmp, node_db, mac_list) in hsr_del_nodes()
135 kfree(node); in hsr_del_nodes()
139 struct hsr_node *node) in prp_handle_san_frame() argument
[all …]
|
| /linux/include/drm/ |
| H A D | drm_vma_manager.h | 72 struct drm_vma_offset_node *node, unsigned long pages);
74 struct drm_vma_offset_node *node);
76 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
77 int drm_vma_node_allow_once(struct drm_vma_offset_node *node, struct drm_file *tag);
78 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
80 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
84 * drm_vma_offset_exact_lookup_locked() - Look up node by exact address
89 * Same as drm_vma_offset_lookup_locked() but does not allow any offset into the node.
93 * Node at exact start address @start.
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
[all …]
|
| /linux/drivers/base/ |
| H A D | node.c | 3 * Basic Node interface support
13 #include <linux/node.h>
27 .name = "node",
28 .dev_name = "node",
36 struct node *node_dev = to_node(dev); in cpumap_read()
57 struct node *node_dev = to_node(dev); in cpulist_read()
77 * @list_node: List element in the node's access list
136 static void node_remove_accesses(struct node *node) in node_remove_accesses() argument
140 list_for_each_entry_safe(c, cnext, &node->access_list, list_node) { in node_remove_accesses()
151 static struct node_access_nodes *node_init_node_access(struct node *node, in node_init_node_access() argument
[all …]
|
| /linux/arch/sparc/prom/ |
| H A D | tree_32.c | 24 static phandle __prom_getchild(phandle node) in __prom_getchild() argument
30 cnode = prom_nodeops->no_child(node); in __prom_getchild()
37 /* Return the child of node 'node' or zero if no this node has no
40 phandle prom_getchild(phandle node) in prom_getchild() argument
44 if ((s32)node == -1) in prom_getchild()
47 cnode = __prom_getchild(node); in prom_getchild()
56 static phandle __prom_getsibling(phandle node) in __prom_getsibling() argument
62 cnode = prom_nodeops->no_nextnode(node); in __prom_getsibling()
69 /* Return the next sibling of node 'node' or zero if no more siblings
72 phandle prom_getsibling(phandle node) in prom_getsibling() argument
[all …]
|
| /linux/drivers/base/test/ |
| H A D | property-entry-test.c | 20 struct fwnode_handle *node; in pe_test_uints() local
27 node = fwnode_create_software_node(entries, NULL); in pe_test_uints()
28 KUNIT_ASSERT_NOT_ERR_OR_NULL(test, node); in pe_test_uints()
30 error = fwnode_property_count_u8(node, "prop-u8"); in pe_test_uints()
33 error = fwnode_property_read_u8(node, "prop-u8", &val_u8); in pe_test_uints()
37 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 1); in pe_test_uints()
41 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 2); in pe_test_uints()
44 error = fwnode_property_read_u8(node, "no-prop-u8", &val_u8); in pe_test_uints()
47 error = fwnode_property_read_u8_array(node, "no-prop-u8", array_u8, 1); in pe_test_uints()
50 error = fwnode_property_read_u16(node, "prop-u16", &val_u16); in pe_test_uints()
[all …]
|