Home
last modified time | relevance | path

Searched full:node (Results 1 – 25 of 3782) sorted by relevance

12345678910>>...152

/linux/drivers/scsi/elx/libefc/
H A Defc_node.c14 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 Defc_device.c8 * 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 Defc_fabric.c8 * 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 Defc_node.h19 io->node->display_name, io->instance_index, io->init_task_tag, \
26 struct efc_node *node = ctx->app; in efc_node_evt_set() local
29 strscpy_pad(node->current_state_name, handler, in efc_node_evt_set()
30 sizeof(node->current_state_name)); in efc_node_evt_set()
32 memcpy(node->prev_state_name, node->current_state_name, in efc_node_evt_set()
33 sizeof(node->prev_state_name)); in efc_node_evt_set()
34 strscpy_pad(node->current_state_name, "invalid", in efc_node_evt_set()
35 sizeof(node->current_state_name)); in efc_node_evt_set()
37 node->prev_evt = node->current_evt; in efc_node_evt_set()
38 node->current_evt = evt; in efc_node_evt_set()
[all …]
H A Defc_els.h17 struct efc_node *node; member
33 efc_els_io_alloc(struct efc_node *node, u32 reqlen);
35 efc_els_io_alloc_size(struct efc_node *node, u32 reqlen, u32 rsplen);
39 typedef void (*els_cb_t)(struct efc_node *node,
42 efc_send_plogi(struct efc_node *node);
44 efc_send_flogi(struct efc_node *node);
46 efc_send_fdisc(struct efc_node *node);
48 efc_send_prli(struct efc_node *node);
50 efc_send_prlo(struct efc_node *node);
52 efc_send_logo(struct efc_node *node);
[all …]
/linux/scripts/gdb/linux/
H A Drbtree.py13 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 …]
H A Dradixtree.py20 def is_internal_node(node): argument
22 …return ((node.cast(long_type) & constants.LX_RADIX_TREE_ENTRY_MASK) == constants.LX_RADIX_TREE_INT…
24 def entry_to_node(node): argument
26 node_type = node.type
27 indirect_ptr = node.cast(long_type) & ~constants.LX_RADIX_TREE_INTERNAL_NODE
30 def node_maxindex(node): argument
31 return (constants.LX_RADIX_TREE_MAP_SIZE << node['shift']) - 1
43 node = root['xa_head']
44 if node == 0:
47 if not (is_internal_node(node)):
[all …]
/linux/tools/net/sunrpc/xdrgen/generators/
H A Dunion.py15 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
[all...]
/linux/drivers/net/ethernet/marvell/octeontx2/nic/
H A Dqos.c44 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/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dhtb.c36 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_obj(*node); 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/lib/
H A Dbootconfig.c42 * xbc_parse() parses the text to build a simple tree. Each tree node is
43 * simply a key word or a value. A key node may have a next key node or/and
44 * a child node (both key and value). A value node may have a next value
45 * node (for array).
115 * xbc_root_node() - Get the root node of extended boot config
117 * Return the address of root node of extended boot config. If the
129 * xbc_node_index() - Get the index of XBC node
130 * @node: A target node of getting index.
132 * Return the index number of @node in XBC node list.
134 uint16_t __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
[all …]
H A Dradix-tree.c33 * 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 Dbtree.c16 * 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/kernel/gcov/
H A Dfs.c34 * @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/drivers/gpu/drm/i915/gt/
H A Dintel_gt_buffer_pool.c31 static void node_free(struct intel_gt_buffer_pool_node *node) in node_free() argument
33 i915_gem_object_put(node->obj); in node_free()
34 i915_active_fini(&node->active); in node_free()
35 kfree_rcu(node, rcu); in node_free()
40 struct intel_gt_buffer_pool_node *node, *stale = NULL; in pool_free_older_than() local
58 node = list_entry(pos, typeof(*node), link); in pool_free_older_than()
60 age = READ_ONCE(node->age); in pool_free_older_than()
64 /* Check we are the first to claim this node */ in pool_free_older_than()
65 if (!xchg(&node->age, 0)) in pool_free_older_than()
68 node->free = stale; in pool_free_older_than()
[all …]
/linux/tools/include/linux/
H A Drbtree.h42 #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/drivers/net/ethernet/mellanox/mlx5/core/esw/
H A Dqos.c87 /* A computed value indicating relative min_rate between node's children. */
89 /* The parent node in the rate hierarchy. */
91 /* Entry in the parent node's children list. */
93 /* The type of this node in the rate hierarchy. */
95 /* The eswitch this node belongs to. */
97 /* The children nodes of this node, empty list for leaf nodes. */
99 /* Valid only if this node is associated with a vport. */
101 /* Level in the hierarchy. The root node level is 1. */
103 /* Valid only when this node represents a traffic class. */
105 /* Valid only for a TC arbiter node or vport TC arbiter. */
[all …]
/linux/rust/syn/gen/
H A Dvisit_mut.rs958 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 Dvisit.rs950 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 Dfold.rs1030 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/include/drm/
H A Ddrm_vma_manager.h72 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/arch/sparc/prom/
H A Dtree_32.c24 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/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst60 struct rb_node node;
65 宏访问。此外，个体成员可直接用rb_entry(node, type, member)访问。
81 struct rb_node *node = root->rb_node;
83 while (node) {
84 struct mytype *data = container_of(node, struct mytype, node);
90 node = node->rb_left;
92 node = node->rb_right;
114 /* Figure out where to put new node */
116 struct mytype *this = container_of(*new, struct mytype, node);
128 /* Add new node and rebalance tree. */
[all …]
/linux/drivers/infiniband/hw/irdma/
H A Dws.c12 * irdma_alloc_node - Allocate a WS node and init
15 * @node_type: Type of node, leaf or parent
16 * @parent: parent node pointer
24 struct irdma_ws_node *node; in irdma_alloc_node() local
40 node = ws_mem.va; in irdma_alloc_node()
41 node->index = node_index; in irdma_alloc_node()
42 node->vsi_index = vsi->vsi_idx; in irdma_alloc_node()
43 INIT_LIST_HEAD(&node->child_list_head); in irdma_alloc_node()
45 node->type_leaf = true; in irdma_alloc_node()
46 node->traffic_class = vsi->qos[user_pri].traffic_class; in irdma_alloc_node()
[all …]
/linux/drivers/base/test/
H A Dproperty-entry-test.c20 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 …]

12345678910>>...152