Home
last modified time | relevance | path

Searched refs:node (Results 751 - 775 of 14418) sorted by relevance

1...<<31323334353637383940>>...577

/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h42 #define RB_EMPTY_NODE(node) \
43 ((node)->__rb_parent_color == (unsigned long)(node))
44 #define RB_CLEAR_NODE(node) \
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 in rb_link_node()
129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
138 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) rb_erase_cached() argument
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dintlist.c18 struct int_node *node = malloc(sizeof(*node)); in intlist__node_new() local
20 if (node != NULL) { in intlist__node_new()
21 node->i = i; in intlist__node_new()
22 node->priv = NULL; in intlist__node_new()
23 rc = &node->rb_node; in intlist__node_new()
37 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete() local
39 int_node__delete(node); in intlist__node_delete()
45 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp() local
47 return node in intlist__node_cmp()
55 intlist__remove(struct intlist *ilist, struct int_node *node) intlist__remove() argument
63 struct int_node *node = NULL; __intlist__findnew() local
137 struct int_node *node = NULL; intlist__entry() local
[all...]
H A Dblock-range.c23 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
41 entry = rb_entry(parent, struct block_range, node); in block_range__find()
54 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node() argument
56 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
58 node = *p; in rb_link_left_of_node()
59 p = &node->rb_right; in rb_link_left_of_node()
61 rb_link_node(left, node, p); in rb_link_left_of_node()
64 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) in rb_link_right_of_node() argument
66 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
68 node in rb_link_right_of_node()
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dqrtr.h14 unsigned int node, unsigned int port),
16 TP_ARGS(service, instance, node, port),
21 __field(unsigned int, node)
28 __entry->node = node;
33 __entry->service, __entry->instance, __entry->node,
41 unsigned int node, unsigned int port),
43 TP_ARGS(service, instance, node, port),
48 __field(unsigned int, node)
55 __entry->node
[all...]
/kernel/linux/linux-6.6/drivers/clk/
H A Dclk-conf.c14 static int __set_clk_parents(struct device_node *node, bool clk_supplier) in __set_clk_parents() argument
20 num_parents = of_count_phandle_with_args(node, "assigned-clock-parents", in __set_clk_parents()
24 node); in __set_clk_parents()
27 rc = of_parse_phandle_with_args(node, "assigned-clock-parents", in __set_clk_parents()
36 if (clkspec.np == node && !clk_supplier) { in __set_clk_parents()
45 index, node); in __set_clk_parents()
49 rc = of_parse_phandle_with_args(node, "assigned-clocks", in __set_clk_parents()
53 if (clkspec.np == node && !clk_supplier) { in __set_clk_parents()
63 index, node); in __set_clk_parents()
81 static int __set_clk_rates(struct device_node *node, boo argument
139 of_clk_set_defaults(struct device_node *node, bool clk_supplier) of_clk_set_defaults() argument
[all...]
/kernel/linux/linux-6.6/include/trace/events/
H A Dqrtr.h14 unsigned int node, unsigned int port),
16 TP_ARGS(service, instance, node, port),
21 __field(unsigned int, node)
28 __entry->node = node;
33 __entry->service, __entry->instance, __entry->node,
41 unsigned int node, unsigned int port),
43 TP_ARGS(service, instance, node, port),
48 __field(unsigned int, node)
55 __entry->node
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dredundancy-elimination.h23 Reduction Reduce(Node* node) final;
27 Check(Node* node, Check* next) : node(node), next(next) {} in Check()
28 Node* node; member
39 EffectPathChecks const* AddCheck(Zone* zone, Node* node) const;
40 Node* LookupCheck(Node* node) const;
41 Node* LookupBoundsCheckFor(Node* node) const;
57 EffectPathChecks const* Get(Node* node) const;
58 void Set(Node* node, EffectPathCheck
[all...]
H A Dload-elimination.cc10 #include "src/compiler/node-properties.h"
20 bool IsRename(Node* node) { in IsRename() argument
21 switch (node->opcode()) { in IsRename()
25 return !node->IsDead(); in IsRename()
31 Node* ResolveRenames(Node* node) { in ResolveRenames() argument
32 while (IsRename(node)) { in ResolveRenames()
33 node = node->InputAt(0); in ResolveRenames()
35 return node; in ResolveRenames()
74 Reduction LoadElimination::Reduce(Node* node) { in Reduce() argument
731 Set( Node* node, AbstractState const* state) Set() argument
738 ReduceMapGuard(Node* node) ReduceMapGuard() argument
753 ReduceCheckMaps(Node* node) ReduceCheckMaps() argument
768 ReduceCompareMaps(Node* node) ReduceCompareMaps() argument
786 ReduceEnsureWritableFastElements(Node* node) ReduceEnsureWritableFastElements() argument
813 ReduceMaybeGrowFastElements(Node* node) ReduceMaybeGrowFastElements() argument
841 ReduceTransitionElementsKind(Node* node) ReduceTransitionElementsKind() argument
881 ReduceTransitionAndStoreElement(Node* node) ReduceTransitionAndStoreElement() argument
906 ReduceLoadField(Node* node, FieldAccess const& access) ReduceLoadField() argument
970 ReduceStoreField(Node* node, FieldAccess const& access) ReduceStoreField() argument
1054 ReduceLoadElement(Node* node) ReduceLoadElement() argument
1103 ReduceStoreElement(Node* node) ReduceStoreElement() argument
1146 ReduceStoreTypedElement(Node* node) ReduceStoreTypedElement() argument
1174 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument
1215 ReduceStart(Node* node) ReduceStart() argument
1219 ReduceOtherNode(Node* node) ReduceOtherNode() argument
1243 UpdateState(Node* node, AbstractState const* state) UpdateState() argument
1275 ComputeLoopState( Node* node, AbstractState const* state) const ComputeLoopState() argument
[all...]
/third_party/node/deps/v8/src/heap/cppgc/
H A Dpersistent-node.cc5 #include "include/cppgc/internal/persistent-node.h"
28 for (auto& node : *slots) { in ClearAllUsedNodes()
29 if (!node.IsUsed()) continue; in ClearAllUsedNodes()
31 static_cast<PersistentBaseClass*>(node.owner())->ClearFromGC(); in ClearAllUsedNodes()
35 node.InitializeAsFreeNode(free_list_head_); in ClearAllUsedNodes()
36 free_list_head_ = &node; in ClearAllUsedNodes()
57 [](const PersistentNode& node) { in NodesInUse()
58 return node.IsUsed(); in NodesInUse()
72 for (auto& node : *nodes_.back()) { in RefillFreeList()
73 node in RefillFreeList()
81 auto* node = TryAllocateNodeFromFreeList(owner, trace); RefillFreeListAndAllocateNode() local
[all...]
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-verifier.h42 void CheckValueInputIs(NodeBase* node, int i, ValueRepresentation repr) { in CheckValueInputIs() argument
43 ValueNode* input = node->input(i).node(); in CheckValueInputIs()
46 str << "Type representation error: node "; in CheckValueInputIs()
48 str << "#" << graph_labeller_->NodeId(node) << " : "; in CheckValueInputIs()
50 str << node->opcode() << " (input @" << i << " = " << input->opcode() in CheckValueInputIs()
56 void Process(NodeBase* node, const ProcessingState& state) { in Process() argument
57 switch (node->opcode()) { in Process()
69 DCHECK_EQ(node->input_count(), 0); in Process()
84 DCHECK_EQ(node in Process()
[all...]
/third_party/python/Lib/lib2to3/fixes/
H A Dfix_next.py46 def transform(self, node, results):
59 node.replace(Call(Name("next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
78 ### The following functions help test if node is part of an assignment
81 def is_assign_target(node):
82 assign = find_assign(node)
89 elif is_subtree(child, node)
[all...]
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/config/src/model/
H A Dcomponent_config.cpp19 bool ComponentConfig::Marshal(json &node) const in Marshal()
21 SetValue(node[GET_NAME(description)], description); in Marshal()
22 SetValue(node[GET_NAME(lib)], lib); in Marshal()
23 SetValue(node[GET_NAME(constructor)], constructor); in Marshal()
24 SetValue(node[GET_NAME(destructor)], destructor); in Marshal()
26 node[GET_NAME(params)] = ToJson(params); in Marshal()
31 bool ComponentConfig::Unmarshal(const json &node) in Unmarshal() argument
33 GetValue(node, GET_NAME(description), description); in Unmarshal()
34 GetValue(node, GET_NAME(lib), lib); in Unmarshal()
35 GetValue(node, GET_NAM in Unmarshal()
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_verify.c400 int cil_verify_decl_does_not_shadow_macro_parameter(struct cil_macro *macro, struct cil_tree_node *node, const char *name) in cil_verify_decl_does_not_shadow_macro_parameter() argument
407 if (param->flavor == node->flavor) { in cil_verify_decl_does_not_shadow_macro_parameter()
409 cil_log(CIL_ERR, "%s %s shadows a macro parameter in macro declaration\n", cil_node_to_string(node), name); in cil_verify_decl_does_not_shadow_macro_parameter()
525 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, void *extra_args) in __cil_verify_ordered_node_helper() argument
530 if (node->flavor == *flavor) { in __cil_verify_ordered_node_helper()
531 if (node->flavor == CIL_SID) { in __cil_verify_ordered_node_helper()
532 struct cil_sid *sid = node->data; in __cil_verify_ordered_node_helper()
534 cil_tree_log(node, CIL_ERR, "SID %s not in sidorder statement", sid->datum.name); in __cil_verify_ordered_node_helper()
537 } else if (node->flavor == CIL_CLASS) { in __cil_verify_ordered_node_helper()
538 struct cil_class *class = node in __cil_verify_ordered_node_helper()
586 struct cil_tree_node *node = sid->datum.nodes->head->data; __cil_verify_initsids() local
742 __cil_verify_named_levelrange(struct cil_db *db, struct cil_tree_node *node) __cil_verify_named_levelrange() argument
758 __cil_verify_user_pre_eval(struct cil_tree_node *node) __cil_verify_user_pre_eval() argument
798 __cil_verify_user_post_eval(struct cil_db *db, struct cil_tree_node *node) __cil_verify_user_post_eval() argument
817 __cil_verify_role(struct cil_tree_node *node) __cil_verify_role() argument
848 __cil_verify_type(struct cil_tree_node *node) __cil_verify_type() argument
957 __cil_verify_named_context(struct cil_db *db, struct cil_tree_node *node) __cil_verify_named_context() argument
1022 __cil_verify_booleanif_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, __attribute__((unused)) void *extra_args) __cil_verify_booleanif_helper() argument
1110 __cil_verify_booleanif(struct cil_tree_node *node, struct cil_complex_symtab *symtab) __cil_verify_booleanif() argument
1134 __cil_verify_netifcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_netifcon() argument
1164 __cil_verify_ibendportcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_ibendportcon() argument
1184 __cil_verify_genfscon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_genfscon() argument
1205 __cil_verify_filecon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_filecon() argument
1231 __cil_verify_nodecon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_nodecon() argument
1252 __cil_verify_ibpkeycon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_ibpkeycon() argument
1272 __cil_verify_portcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_portcon() argument
1293 __cil_verify_pirqcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_pirqcon() argument
1314 __cil_verify_iomemcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_iomemcon() argument
1335 __cil_verify_ioportcon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_ioportcon() argument
1356 __cil_verify_pcidevicecon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_pcidevicecon() argument
1377 __cil_verify_devicetreecon(struct cil_db *db, struct cil_tree_node *node) __cil_verify_devicetreecon() argument
1398 __cil_verify_fsuse(struct cil_db *db, struct cil_tree_node *node) __cil_verify_fsuse() argument
1419 __cil_verify_permissionx(struct cil_permissionx *permx, struct cil_tree_node *node) __cil_verify_permissionx() argument
1466 __cil_verify_avrulex(struct cil_tree_node *node) __cil_verify_avrulex() argument
1472 __cil_verify_class(struct cil_tree_node *node) __cil_verify_class() argument
1508 __cil_verify_policycap(struct cil_tree_node *node) __cil_verify_policycap() argument
1525 __cil_verify_helper(struct cil_tree_node *node, uint32_t *finished, void *extra_args) __cil_verify_helper() argument
1788 __cil_verify_classpermission(struct cil_tree_node *node) __cil_verify_classpermission() argument
1797 struct cil_tree_node *node; global() member
1815 __cil_verify_map_class(struct cil_tree_node *node) __cil_verify_map_class() argument
1833 __cil_pre_verify_helper(struct cil_tree_node *node, uint32_t *finished, __attribute__((unused)) void *extra_args) __cil_pre_verify_helper() argument
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dnir.c52 static void register_node_ssa(gpir_block *block, gpir_node *node, nir_ssa_def *ssa) in register_node_ssa() argument
54 block->comp->node_for_ssa[ssa->index] = node; in register_node_ssa()
55 snprintf(node->name, sizeof(node->name), "ssa%d", ssa->index); in register_node_ssa()
80 store->child = node; in register_node_ssa()
82 gpir_node_add_dep(&store->node, node, GPIR_DEP_INPUT); in register_node_ssa()
83 list_addtail(&store->node.list, &block->node_list); in register_node_ssa()
88 static void register_node_reg(gpir_block *block, gpir_node *node, nir_reg_dest *nir_reg) in register_node_reg() argument
90 block->comp->node_for_reg[nir_reg->reg->index] = node; in register_node_reg()
107 register_node(gpir_block *block, gpir_node *node, nir_dest *dest) register_node() argument
193 gpir_alu_node *node = gpir_node_create(block, op); gpir_emit_alu() local
239 gpir_node *node = gpir_create_load(block, dest, gpir_op_load_uniform, gpir_create_vector_load() local
299 gpir_const_node *node = gpir_node_create(block, gpir_op_const); gpir_emit_load_const() local
[all...]
/kernel/linux/linux-5.10/fs/befs/
H A Dbtree.c58 * it states that the overflow field of node headers is used by internal nodes
59 * to point to another node that "effectively continues this one". Here is what
60 * I believe that means. Each key in internal nodes points to another node that
62 * in the internal node is not the last key in the index. Keys that are
63 * greater than the last key in the internal node go into the overflow node.
66 * Second, it states that the header of a btree node is sufficient to
79 * In memory structure of each btree node
82 befs_host_btree_nodehead head; /* head of node converted to cpu byteorder */
84 befs_btree_nodehead *od_node; /* on disk node */
191 befs_bt_read_node(struct super_block *sb, const befs_data_stream *ds, struct befs_btree_node *node, befs_off_t node_off) befs_bt_read_node() argument
330 befs_find_key(struct super_block *sb, struct befs_btree_node *node, const char *findkey, befs_off_t * value) befs_find_key() argument
599 befs_leafnode(struct befs_btree_node *node) befs_leafnode() argument
622 befs_bt_keylen_index(struct befs_btree_node *node) befs_bt_keylen_index() argument
643 befs_bt_valarray(struct befs_btree_node *node) befs_bt_valarray() argument
659 befs_bt_keydata(struct befs_btree_node *node) befs_bt_keydata() argument
675 befs_bt_get_key(struct super_block *sb, struct befs_btree_node *node, int index, u16 * keylen) befs_bt_get_key() argument
[all...]
/kernel/linux/linux-6.6/fs/befs/
H A Dbtree.c58 * it states that the overflow field of node headers is used by internal nodes
59 * to point to another node that "effectively continues this one". Here is what
60 * I believe that means. Each key in internal nodes points to another node that
62 * in the internal node is not the last key in the index. Keys that are
63 * greater than the last key in the internal node go into the overflow node.
66 * Second, it states that the header of a btree node is sufficient to
79 * In memory structure of each btree node
82 befs_host_btree_nodehead head; /* head of node converted to cpu byteorder */
84 befs_btree_nodehead *od_node; /* on disk node */
191 befs_bt_read_node(struct super_block *sb, const befs_data_stream *ds, struct befs_btree_node *node, befs_off_t node_off) befs_bt_read_node() argument
330 befs_find_key(struct super_block *sb, struct befs_btree_node *node, const char *findkey, befs_off_t * value) befs_find_key() argument
599 befs_leafnode(struct befs_btree_node *node) befs_leafnode() argument
622 befs_bt_keylen_index(struct befs_btree_node *node) befs_bt_keylen_index() argument
643 befs_bt_valarray(struct befs_btree_node *node) befs_bt_valarray() argument
659 befs_bt_keydata(struct befs_btree_node *node) befs_bt_keydata() argument
675 befs_bt_get_key(struct super_block *sb, struct befs_btree_node *node, int index, u16 * keylen) befs_bt_get_key() argument
[all...]
/kernel/linux/linux-5.10/lib/
H A Dassoc_array.c26 const struct assoc_array_node *node; in assoc_array_subtree_iterate() local
40 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
43 /* We perform two passes of each node. in assoc_array_subtree_iterate()
45 * The first pass does all the leaves in this node. This means we in assoc_array_subtree_iterate()
46 * don't miss any leaves if the node is split up by insertion whilst in assoc_array_subtree_iterate()
52 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */ in assoc_array_subtree_iterate()
68 * back to a replacement node with the leaves in a different layout. in assoc_array_subtree_iterate()
79 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
81 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */ in assoc_array_subtree_iterate()
90 parent = READ_ONCE(node in assoc_array_subtree_iterate()
153 struct assoc_array_node *node; /* Node in which leaf might be found */ global() member
176 struct assoc_array_node *node; assoc_array_walk() local
309 const struct assoc_array_node *node; assoc_array_find() local
347 struct assoc_array_node *node; assoc_array_destroy_subtree() local
480 struct assoc_array_node *node, *new_n0, *new_n1, *side; assoc_array_insert_into_terminal_node() local
798 struct assoc_array_node *node, *new_n0, *side; assoc_array_insert_mid_shortcut() local
1038 struct assoc_array_node *node; global() member
1085 struct assoc_array_node *node, *new_n0; assoc_array_delete() local
1349 struct assoc_array_node *node; assoc_array_apply_edit() local
1460 struct assoc_array_node *node, *new_n; assoc_array_gc() local
[all...]
/kernel/linux/linux-6.6/lib/
H A Dassoc_array.c26 const struct assoc_array_node *node; in assoc_array_subtree_iterate() local
40 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
43 /* We perform two passes of each node. in assoc_array_subtree_iterate()
45 * The first pass does all the leaves in this node. This means we in assoc_array_subtree_iterate()
46 * don't miss any leaves if the node is split up by insertion whilst in assoc_array_subtree_iterate()
52 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */ in assoc_array_subtree_iterate()
68 * back to a replacement node with the leaves in a different layout. in assoc_array_subtree_iterate()
79 node = assoc_array_ptr_to_node(cursor); in assoc_array_subtree_iterate()
81 ptr = READ_ONCE(node->slots[slot]); /* Address dependency. */ in assoc_array_subtree_iterate()
90 parent = READ_ONCE(node in assoc_array_subtree_iterate()
153 struct assoc_array_node *node; /* Node in which leaf might be found */ global() member
176 struct assoc_array_node *node; assoc_array_walk() local
309 const struct assoc_array_node *node; assoc_array_find() local
347 struct assoc_array_node *node; assoc_array_destroy_subtree() local
480 struct assoc_array_node *node, *new_n0, *new_n1, *side; assoc_array_insert_into_terminal_node() local
797 struct assoc_array_node *node, *new_n0, *side; assoc_array_insert_mid_shortcut() local
1037 struct assoc_array_node *node; global() member
1084 struct assoc_array_node *node, *new_n0; assoc_array_delete() local
1348 struct assoc_array_node *node; assoc_array_apply_edit() local
1459 struct assoc_array_node *node, *new_n; assoc_array_gc() local
[all...]
/third_party/libfuse/lib/
H A Dfuse.c73 struct node **wnode1;
77 struct node **wnode2;
83 struct node **array;
135 struct node { struct
136 struct node *name_next;
137 struct node *id_next;
141 struct node *parent;
159 struct node node; member
391 static struct node_lru *node_lru(struct node *nod argument
410 node_to_slab(struct fuse *f, struct node *node) node_to_slab() argument
450 struct list_head *node; alloc_node() local
481 free_node_mem(struct fuse *f, struct node *node) free_node_mem() argument
503 free_node_mem(struct fuse *f, struct node *node) free_node_mem() argument
524 struct node *node; get_node_nocheck() local
535 struct node *node = get_node_nocheck(f, nodeid); get_node() local
548 remove_node_lru(struct node *node) remove_node_lru() argument
555 set_forget_time(struct fuse *f, struct node *node) set_forget_time() argument
564 free_node(struct fuse *f, struct node *node) free_node() argument
613 unhash_id(struct fuse *f, struct node *node) unhash_id() argument
658 struct node *node = *nodep; rehash_id() local
674 hash_id(struct fuse *f, struct node *node) hash_id() argument
730 unhash_name(struct fuse *f, struct node *node) unhash_name() argument
771 struct node *node = *nodep; rehash_name() local
787 hash_name(struct fuse *f, struct node *node, fuse_ino_t parentid, const char *name) hash_name() argument
813 delete_node(struct fuse *f, struct node *node) delete_node() argument
827 unref_node(struct fuse *f, struct node *node) unref_node() argument
850 struct node *node; lookup_node() local
860 inc_nlookup(struct node *node) inc_nlookup() argument
870 struct node *node; find_node() local
920 struct node *node = lookup_node(f, ino, path_element); lookup_path_in_cache() local
972 struct node *node; unlock_path() local
996 struct node *node; try_get_path() local
1249 struct node *node, *node1, *node2; check_dir_loop() local
1363 struct node *node; forget_node() local
1399 unlink_node(struct fuse *f, struct node *node) unlink_node() argument
1410 struct node *node; remove_node() local
1422 struct node *node; rename_node() local
2357 struct node *node; is_open() local
2371 struct node *node; hidden_name() local
2448 update_stat(struct node *node, const struct stat *stbuf) update_stat() argument
2462 struct node *node; do_lookup() local
2738 struct node *node; fuse_lib_getattr() local
3100 struct node *node; fuse_do_release() local
3190 struct node *node; open_auto_cache() local
3449 struct node *node; lookup_nodeid() local
3932 locks_conflict(struct node *node, const struct lock *lock) locks_conflict() argument
3958 locks_insert(struct node *node, struct lock *lock) locks_insert() argument
4401 struct node *node; fuse_clean_cache() local
5070 struct node *node; fuse_destroy() local
5085 struct node *node; fuse_destroy() local
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Ddswload.c107 struct acpi_namespace_node *node; in acpi_ds_load1_begin_op() local
129 if (op->common.node) { in acpi_ds_load1_begin_op()
155 walk_state, &(node)); in acpi_ds_load1_begin_op()
169 &node); in acpi_ds_load1_begin_op()
182 switch (node->type) { in acpi_ds_load1_begin_op()
209 acpi_ut_get_node_name(node), in acpi_ds_load1_begin_op()
210 acpi_ut_get_type_name(node->type))); in acpi_ds_load1_begin_op()
212 node->type = ACPI_TYPE_ANY; in acpi_ds_load1_begin_op()
221 if ((node == acpi_gbl_root_node) && in acpi_ds_load1_begin_op()
236 acpi_ut_get_type_name(node in acpi_ds_load1_begin_op()
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Ddswload.c107 struct acpi_namespace_node *node; in acpi_ds_load1_begin_op() local
129 if (op->common.node) { in acpi_ds_load1_begin_op()
155 walk_state, &(node)); in acpi_ds_load1_begin_op()
169 &node); in acpi_ds_load1_begin_op()
182 switch (node->type) { in acpi_ds_load1_begin_op()
209 acpi_ut_get_node_name(node), in acpi_ds_load1_begin_op()
210 acpi_ut_get_type_name(node->type))); in acpi_ds_load1_begin_op()
212 node->type = ACPI_TYPE_ANY; in acpi_ds_load1_begin_op()
221 if ((node == acpi_gbl_root_node) && in acpi_ds_load1_begin_op()
236 acpi_ut_get_type_name(node in acpi_ds_load1_begin_op()
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dblock-range.c19 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
37 entry = rb_entry(parent, struct block_range, node); in block_range__find()
50 static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) in rb_link_left_of_node() argument
52 struct rb_node **p = &node->rb_left; in rb_link_left_of_node()
54 node = *p; in rb_link_left_of_node()
55 p = &node->rb_right; in rb_link_left_of_node()
57 rb_link_node(left, node, p); in rb_link_left_of_node()
60 static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) in rb_link_right_of_node() argument
62 struct rb_node **p = &node->rb_right; in rb_link_right_of_node()
64 node in rb_link_right_of_node()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.c81 struct cso_node *node = MALLOC(sizeof(struct cso_node)); in cso_hash_create_node() local
83 if (!node) in cso_hash_create_node()
86 node->key = akey; in cso_hash_create_node()
87 node->value = avalue; in cso_hash_create_node()
89 node->next = *anextNode; in cso_hash_create_node()
90 *anextNode = node; in cso_hash_create_node()
92 return node; in cso_hash_create_node()
179 struct cso_node *node = cso_hash_create_node(hash, key, data, nextNode); in cso_hash_insert() local
180 if (!node) { in cso_hash_insert()
185 struct cso_hash_iter iter = {hash, node}; in cso_hash_insert()
224 cso_hash_data_next(struct cso_node *node) cso_hash_data_next() argument
256 struct cso_node **node = cso_hash_find_node(hash, akey); cso_hash_take() local
284 struct cso_node *node = iter.node; cso_hash_erase() local
302 struct cso_node **node = cso_hash_find_node(hash, key); cso_hash_contains() local
[all...]
/kernel/linux/linux-5.10/security/selinux/ss/
H A Dconditional.c34 struct cond_expr_node *node = &expr->nodes[i]; in cond_evaluate_expr() local
36 switch (node->expr_type) { in cond_evaluate_expr()
41 s[sp] = p->bool_val_to_struct[node->bool - 1]->state; in cond_evaluate_expr()
88 * current state of the node it sets the rules in the true/false
92 static void evaluate_cond_node(struct policydb *p, struct cond_node *node) in evaluate_cond_node() argument
98 new_state = cond_evaluate_expr(p, &node->expr); in evaluate_cond_node()
99 if (new_state != node->cur_state) { in evaluate_cond_node()
100 node->cur_state = new_state; in evaluate_cond_node()
104 for (i = 0; i < node->true_list.len; i++) { in evaluate_cond_node()
105 avnode = node in evaluate_cond_node()
140 cond_node_destroy(struct cond_node *node) cond_node_destroy() argument
375 cond_read_node(struct policydb *p, struct cond_node *node, void *fp) cond_read_node() argument
501 cond_write_node(struct policydb *p, struct cond_node *node, struct policy_file *fp) cond_write_node() argument
559 struct avtab_node *node; cond_compute_xperms() local
578 struct avtab_node *node; cond_compute_av() local
[all...]
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dconditional.c34 struct cond_expr_node *node = &expr->nodes[i]; in cond_evaluate_expr() local
36 switch (node->expr_type) { in cond_evaluate_expr()
41 s[sp] = p->bool_val_to_struct[node->boolean - 1]->state; in cond_evaluate_expr()
88 * current state of the node it sets the rules in the true/false
92 static void evaluate_cond_node(struct policydb *p, struct cond_node *node) in evaluate_cond_node() argument
98 new_state = cond_evaluate_expr(p, &node->expr); in evaluate_cond_node()
99 if (new_state != node->cur_state) { in evaluate_cond_node()
100 node->cur_state = new_state; in evaluate_cond_node()
104 for (i = 0; i < node->true_list.len; i++) { in evaluate_cond_node()
105 avnode = node in evaluate_cond_node()
140 cond_node_destroy(struct cond_node *node) cond_node_destroy() argument
376 cond_read_node(struct policydb *p, struct cond_node *node, void *fp) cond_read_node() argument
502 cond_write_node(struct policydb *p, struct cond_node *node, struct policy_file *fp) cond_write_node() argument
560 struct avtab_node *node; cond_compute_xperms() local
577 struct avtab_node *node; cond_compute_av() local
[all...]

Completed in 21 milliseconds

1...<<31323334353637383940>>...577