Home
last modified time | relevance | path

Searched refs:node (Results 726 - 750 of 12430) sorted by relevance

1...<<21222324252627282930>>...498

/third_party/node/deps/v8/src/compiler/
H A Dint64-lowering.h14 #include "src/compiler/node-marker.h"
61 void PushNode(Node* node);
62 void LowerNode(Node* node);
63 bool DefaultLowering(Node* node, bool low_word_only = false);
64 void LowerComparison(Node* node, const Operator* signed_op,
66 void LowerWord64AtomicBinop(Node* node, const Operator* op);
67 void LowerWord64AtomicNarrowOp(Node* node, const Operator* op);
68 void LowerLoadOperator(Node* node, MachineRepresentation rep,
70 void LowerStoreOperator(Node* node, MachineRepresentation rep,
77 bool HasReplacementLow(Node* node);
87 Node* node; global() member
[all...]
H A Dvalue-numbering-reducer.cc10 #include "src/compiler/node-properties.h"
11 #include "src/compiler/node.h"
27 Reduction ValueNumberingReducer::Reduce(Node* node) { in Reduce() argument
28 if (!node->op()->HasProperty(Operator::kIdempotent)) return NoChange(); in Reduce()
30 const size_t hash = NodeProperties::HashCode(node); in Reduce()
38 entries_[hash & (kInitialCapacity - 1)] = node; in Reduce()
54 entries_[dead] = node; in Reduce()
57 entries_[i] = node; in Reduce()
67 if (entry == node) { in Reduce()
81 // No collision, {node} i in Reduce()
127 ReplaceIfTypesMatch(Node* node, Node* replacement) ReplaceIfTypesMatch() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DPruneNoOps.cpp26 bool IsNoOp(TIntermNode *node) in IsNoOp() argument
28 if (node->getAsConstantUnion() != nullptr) in IsNoOp()
32 bool isEmptyDeclaration = node->getAsDeclarationNode() != nullptr && in IsNoOp()
33 node->getAsDeclarationNode()->getSequence()->empty(); in IsNoOp()
50 bool visitDeclaration(Visit, TIntermDeclaration *node) override;
51 bool visitBlock(Visit visit, TIntermBlock *node) override;
53 bool visitBranch(Visit visit, TIntermBranch *node) override;
69 bool PruneNoOpsTraverser::visitDeclaration(Visit visit, TIntermDeclaration *node) in visitDeclaration() argument
76 TIntermSequence *sequence = node->getSequence(); in visitDeclaration()
94 mMultiReplacements.emplace_back(node, declaratorSymbo in visitDeclaration()
137 visitBlock(Visit visit, TIntermBlock *node) visitBlock() argument
199 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
[all...]
H A DSplitSequenceOperator.cpp28 bool visitUnary(Visit visit, TIntermUnary *node) override;
29 bool visitBinary(Visit visit, TIntermBinary *node) override;
30 bool visitAggregate(Visit visit, TIntermAggregate *node) override;
31 bool visitTernary(Visit visit, TIntermTernary *node) override;
59 bool SplitSequenceOperatorTraverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate() argument
67 mFoundExpressionToSplit = mPatternToSplitMatcher.match(node, getParentNode()); in visitAggregate()
74 bool SplitSequenceOperatorTraverser::visitUnary(Visit visit, TIntermUnary *node) in visitUnary() argument
82 mFoundExpressionToSplit = mPatternToSplitMatcher.match(node); in visitUnary()
89 bool SplitSequenceOperatorTraverser::visitBinary(Visit visit, TIntermBinary *node) in visitBinary() argument
91 if (node in visitBinary()
133 visitTernary(Visit visit, TIntermTernary *node) visitTernary() argument
[all...]
H A DRewriteDfdy.cpp40 bool visitAggregate(Visit visit, TIntermAggregate *node) override;
42 bool visitAggregateWithRotation(Visit visit, TIntermAggregate *node);
43 bool visitAggregateWithoutRotation(Visit visit, TIntermAggregate *node);
74 bool Traverser::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate() argument
78 return visitAggregateWithRotation(visit, node); in visitAggregate()
80 return visitAggregateWithoutRotation(visit, node); in visitAggregate()
83 bool Traverser::visitAggregateWithRotation(Visit visit, TIntermAggregate *node) in visitAggregateWithRotation() argument
85 // Decide if the node represents a call to dFdx() or dFdy() in visitAggregateWithRotation()
86 if ((node->getOp() != EOpDFdx) && (node in visitAggregateWithRotation()
186 visitAggregateWithoutRotation(Visit visit, TIntermAggregate *node) visitAggregateWithoutRotation() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/tests/compiler_tests/
H A DQualificationOrderESSL31_test.cpp50 const TIntermSymbol *node = findSymbolInAST(ImmutableString("something")); in TEST_F() local
51 ASSERT_NE(nullptr, node); in TEST_F()
53 const TType &type = node->getType(); in TEST_F()
73 const TIntermSymbol *node = findSymbolInAST(ImmutableString("something")); in TEST_F() local
74 ASSERT_NE(nullptr, node); in TEST_F()
76 const TType &type = node->getType(); in TEST_F()
98 const TIntermSymbol *node = findSymbolInAST(ImmutableString("something")); in TEST_F() local
99 ASSERT_NE(nullptr, node); in TEST_F()
101 const TType &type = node->getType(); in TEST_F()
125 const TIntermSymbol *node in TEST_F() local
153 const TIntermSymbol *node = findSymbolInAST(ImmutableString("MyInterfaceName")); TEST_F() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dscalar_analysis.cpp27 // constant node or an instruction which we do not know how to compute the
30 // 2. Create a new node for each instruction traversed and build the nodes for
33 // 3. Add the operand nodes as children of the first and hash the node. Use the
34 // hash to see if the node is already in the cache. We ensure the children are
37 // will return true. If the node is already in the cache return the cached
101 "Multiply node did not come from a multiply instruction"); in AnalyzeMultiplyOp()
231 "Add node must be created from a OpIAdd or OpISub instruction"); in AnalyzeAddOp()
241 // To handle subtraction we wrap the second operand in a unary negation node. in AnalyzeAddOp()
288 // We add the node to this map to allow it to be returned before the node i in AnalyzePhiInstruction()
397 GetCoefficientFromRecurrentTerm( SENode* node, const Loop* loop) GetCoefficientFromRecurrentTerm() argument
434 BuildGraphWithoutRecurrentTerm( SENode* node, const Loop* loop) BuildGraphWithoutRecurrentTerm() argument
468 GetRecurrentTerm(SENode* node, const Loop* loop) GetRecurrentTerm() argument
661 Eval(const SENode* node, bool or_equal_zero, bool* result) Eval() argument
808 Visit(const SENode* node) Visit() argument
836 Visit(const SEConstantNode* node) Visit() argument
844 Visit(const SEValueUnknown* node) Visit() argument
855 Visit(const SERecurrentNode* node) Visit() argument
873 Visit(const SENegative* node) Visit() argument
900 VisitExpr( const SENode* node, std::function<Signedness(Signedness, Signedness)> reduce) VisitExpr() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dscalar_analysis.cpp27 // constant node or an instruction which we do not know how to compute the
30 // 2. Create a new node for each instruction traversed and build the nodes for
33 // 3. Add the operand nodes as children of the first and hash the node. Use the
34 // hash to see if the node is already in the cache. We ensure the children are
37 // will return true. If the node is already in the cache return the cached
101 "Multiply node did not come from a multiply instruction"); in AnalyzeMultiplyOp()
231 "Add node must be created from a OpIAdd or OpISub instruction"); in AnalyzeAddOp()
241 // To handle subtraction we wrap the second operand in a unary negation node. in AnalyzeAddOp()
288 // We add the node to this map to allow it to be returned before the node i in AnalyzePhiInstruction()
397 GetCoefficientFromRecurrentTerm( SENode* node, const Loop* loop) GetCoefficientFromRecurrentTerm() argument
434 BuildGraphWithoutRecurrentTerm( SENode* node, const Loop* loop) BuildGraphWithoutRecurrentTerm() argument
468 GetRecurrentTerm(SENode* node, const Loop* loop) GetRecurrentTerm() argument
661 Eval(const SENode* node, bool or_equal_zero, bool* result) Eval() argument
808 Visit(const SENode* node) Visit() argument
836 Visit(const SEConstantNode* node) Visit() argument
844 Visit(const SEValueUnknown* node) Visit() argument
855 Visit(const SERecurrentNode* node) Visit() argument
873 Visit(const SENegative* node) Visit() argument
900 VisitExpr( const SENode* node, std::function<Signedness(Signedness, Signedness)> reduce) VisitExpr() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dscalar_analysis.cpp26 // constant node or an instruction which we do not know how to compute the
29 // 2. Create a new node for each instruction traversed and build the nodes for
32 // 3. Add the operand nodes as children of the first and hash the node. Use the
33 // hash to see if the node is already in the cache. We ensure the children are
36 // will return true. If the node is already in the cache return the cached
100 "Multiply node did not come from a multiply instruction"); in AnalyzeMultiplyOp()
230 "Add node must be created from a OpIAdd or OpISub instruction"); in AnalyzeAddOp()
240 // To handle subtraction we wrap the second operand in a unary negation node. in AnalyzeAddOp()
287 // We add the node to this map to allow it to be returned before the node i in AnalyzePhiInstruction()
396 GetCoefficientFromRecurrentTerm( SENode* node, const Loop* loop) GetCoefficientFromRecurrentTerm() argument
433 BuildGraphWithoutRecurrentTerm( SENode* node, const Loop* loop) BuildGraphWithoutRecurrentTerm() argument
467 GetRecurrentTerm(SENode* node, const Loop* loop) GetRecurrentTerm() argument
660 Eval(const SENode* node, bool or_equal_zero, bool* result) Eval() argument
807 Visit(const SENode* node) Visit() argument
835 Visit(const SEConstantNode* node) Visit() argument
843 Visit(const SEValueUnknown* node) Visit() argument
854 Visit(const SERecurrentNode* node) Visit() argument
872 Visit(const SENegative* node) Visit() argument
899 VisitExpr( const SENode* node, std::function<Signedness(Signedness, Signedness)> reduce) VisitExpr() argument
[all...]
/kernel/linux/linux-5.10/security/selinux/
H A Davc.c156 struct avc_node *node; in avc_get_hash_stats() local
168 hlist_for_each_entry_rcu(node, head, list) in avc_get_hash_stats()
330 static int avc_add_xperms_decision(struct avc_node *node, in avc_add_xperms_decision() argument
335 node->ae.xp_node->xp.len++; in avc_add_xperms_decision()
340 list_add(&dest_xpd->xpd_list, &node->ae.xp_node->xpd_head); in avc_add_xperms_decision()
355 static int avc_xperms_populate(struct avc_node *node, in avc_xperms_populate() argument
379 node->ae.xp_node = dest; in avc_xperms_populate()
436 struct avc_node *node = container_of(rhead, struct avc_node, rhead); in avc_node_free() local
437 avc_xperms_free(node->ae.xp_node); in avc_node_free()
438 kmem_cache_free(avc_node_cachep, node); in avc_node_free()
442 avc_node_delete(struct selinux_avc *avc, struct avc_node *node) avc_node_delete() argument
449 avc_node_kill(struct selinux_avc *avc, struct avc_node *node) avc_node_kill() argument
467 struct avc_node *node; avc_reclaim_node() local
502 struct avc_node *node; avc_alloc_node() local
519 avc_node_populate(struct avc_node *node, u32 ssid, u32 tsid, u16 tclass, struct av_decision *avd) avc_node_populate() argument
530 struct avc_node *node, *ret = NULL; avc_search_node() local
563 struct avc_node *node; avc_lookup() local
621 struct avc_node *pos, *node = NULL; avc_insert() local
844 struct avc_node *pos, *node, *orig = NULL; avc_update_node() local
946 struct avc_node *node; avc_flush() local
1044 struct avc_node *node; avc_has_extended_perms() local
1143 struct avc_node *node; avc_has_perm_noaudit() local
[all...]
/device/board/hihope/rk3568/audio_drivers/headset_monitor/src/
H A Danalog_headset_core.c91 static int32_t LinuxReadMicConfig(struct device_node *node, struct HeadsetPdata *pdata) in LinuxReadMicConfig() argument
97 if ((node == NULL) || (pdata == NULL)) { in LinuxReadMicConfig()
98 AUDIO_DEVICE_LOG_ERR("node or pdata is NULL."); in LinuxReadMicConfig()
102 ret = of_get_named_gpio_flags(node, "mic_switch_gpio", 0, &pdata->micGpioFlags); in LinuxReadMicConfig()
107 ret = of_property_read_u32(node, "hp_mic_io_value", &pdata->hpMicIoValue); in LinuxReadMicConfig()
112 ret = of_property_read_u32(node, "main_mic_io_value", &pdata->mainMicIoValue); in LinuxReadMicConfig()
123 static int32_t LinuxReadConfig(struct device_node *node, struct HeadsetPdata *pdata) in LinuxReadConfig() argument
128 if ((node == NULL) || (pdata == NULL)) { in LinuxReadConfig()
129 AUDIO_DEVICE_LOG_ERR("node or pdata is NULL."); in LinuxReadConfig()
134 ret = of_get_named_gpio_flags(node, "headset_gpi in LinuxReadConfig()
170 ReadHookModeConfig(struct DeviceResourceIface *parser, const struct DeviceResourceNode *node, struct HeadsetPdata *pdata) ReadHookModeConfig() argument
211 ReadMicConfig(struct DeviceResourceIface *parser, const struct DeviceResourceNode *node, struct HeadsetPdata *pdata) ReadMicConfig() argument
244 ReadConfig(const struct DeviceResourceNode *node, struct HeadsetPdata *pdata) ReadConfig() argument
340 struct device_node *node = pdev->dev.of_node; AudioHeadsetProbe() local
429 const struct DeviceResourceNode *node = NULL; HdfHeadsetInit() local
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dnode.c316 gpir_node *node = rzalloc_size(block, size); in gpir_node_create() local
317 if (unlikely(!node)) in gpir_node_create()
320 snprintf(node->name, sizeof(node->name), "new"); in gpir_node_create()
322 list_inithead(&node->succ_list); in gpir_node_create()
323 list_inithead(&node->pred_list); in gpir_node_create()
325 node->op = op; in gpir_node_create()
326 node->type = type; in gpir_node_create()
327 node->index = block->comp->cur_index++; in gpir_node_create()
328 node in gpir_node_create()
425 gpir_node_delete(gpir_node *node) gpir_node_delete() argument
443 gpir_node_print_node(gpir_node *node, int type, int space) gpir_node_print_node() argument
[all...]
/third_party/python/Lib/xml/dom/
H A Dpulldom.py71 node = self.document.createElementNS(uri, tagName)
73 node = self.buildDocument(uri, tagName)
78 node = self.document.createElement(localname)
80 node = self.buildDocument(None, localname)
90 node.setAttributeNodeNS(attr)
98 node.setAttributeNodeNS(attr)
101 node.setAttributeNode(attr)
104 self.lastEvent[1] = [(START_ELEMENT, node), None]
106 self.push(node)
114 node
[all...]
/kernel/linux/linux-5.10/arch/powerpc/boot/
H A Dsimpleboot.c30 int node, size, i; in platform_init() local
37 node = fdt_path_offset(_dtb_start, "/"); in platform_init()
38 if (node < 0) in platform_init()
39 fatal("Cannot find root node\n"); in platform_init()
40 na = fdt_getprop(_dtb_start, node, "#address-cells", &size); in platform_init()
43 ns = fdt_getprop(_dtb_start, node, "#size-cells", &size); in platform_init()
48 node = fdt_node_offset_by_prop_value(_dtb_start, -1, "device_type", in platform_init()
50 if (node < 0) in platform_init()
51 fatal("Cannot find memory node\n"); in platform_init()
52 reg = fdt_getprop(_dtb_start, node, "re in platform_init()
[all...]
/kernel/linux/linux-6.6/arch/powerpc/boot/
H A Dsimpleboot.c30 int node, size, i; in platform_init() local
37 node = fdt_path_offset(_dtb_start, "/"); in platform_init()
38 if (node < 0) in platform_init()
39 fatal("Cannot find root node\n"); in platform_init()
40 na = fdt_getprop(_dtb_start, node, "#address-cells", &size); in platform_init()
43 ns = fdt_getprop(_dtb_start, node, "#size-cells", &size); in platform_init()
48 node = fdt_node_offset_by_prop_value(_dtb_start, -1, "device_type", in platform_init()
50 if (node < 0) in platform_init()
51 fatal("Cannot find memory node\n"); in platform_init()
52 reg = fdt_getprop(_dtb_start, node, "re in platform_init()
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_loop_analyze.h33 contains_other_jump(nir_cf_node *node, nir_instr *expected_jump) in contains_other_jump() argument
35 switch (node->type) { in contains_other_jump()
37 nir_instr *lst_instr = nir_block_last_instr(nir_cf_node_as_block(node)); in contains_other_jump()
41 nir_foreach_instr(instr, nir_cf_node_as_block(node)) in contains_other_jump()
51 nir_if *if_stmt = nir_cf_node_as_if(node); in contains_other_jump()
53 foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->then_list) { in contains_other_jump()
54 if (contains_other_jump(node, expected_jump)) in contains_other_jump()
58 foreach_list_typed_safe(nir_cf_node, node, node, in contains_other_jump()
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__llist.h36 * - Delete: O(1) -- delete assumes you hold a node pointer
48 /*! Opaque data structure for a node in a linked list */
51 /*! Callback to free user-defined node data
73 /*! Insert value as the first node in the linked list
77 * \return node object referencing place in list, or null if out of memory or
82 /*! Insert value as the last node in the linked list
86 * \return node object referencing place in list, or null if out of memory or
91 /*! Insert value before specified node in the linked list
93 * \param[in] node node reference
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_tree.h53 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t *hll_line, char **path);
54 char *cil_tree_get_cil_path(struct cil_tree_node *node);
55 __attribute__((format (printf, 3, 4))) void cil_tree_log(struct cil_tree_node *node, enum cil_log_level lvl, const char* msg, ...);
57 int cil_tree_subtree_has_decl(struct cil_tree_node *node);
61 void cil_tree_subtree_destroy(struct cil_tree_node *node);
62 void cil_tree_children_destroy(struct cil_tree_node *node);
64 void cil_tree_node_init(struct cil_tree_node **node);
65 void cil_tree_node_destroy(struct cil_tree_node **node);
72 int cil_tree_walk(struct cil_tree_node *start_node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, voi
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/
H A Dicc-clk.c51 static int icc_clk_get_bw(struct icc_node *node, u32 *avg, u32 *peak) in icc_clk_get_bw() argument
53 struct icc_clk_node *qn = node->data; in icc_clk_get_bw()
66 * @first_id: an ID of the first provider's node
84 struct icc_node *node; in icc_clk_register() local
111 node = icc_node_create(first_id + j); in icc_clk_register()
112 if (IS_ERR(node)) { in icc_clk_register()
113 ret = PTR_ERR(node); in icc_clk_register()
117 node->name = devm_kasprintf(dev, GFP_KERNEL, "%s_master", data[i].name); in icc_clk_register()
118 node->data = &qp->clocks[i]; in icc_clk_register()
119 icc_node_add(node, provide in icc_clk_register()
[all...]
/third_party/mesa3d/src/intel/genxml/
H A Dgen_sort_tags.py39 def add_struct_refs(items, node):
40 if node.tag == 'field':
41 if 'type' in node.attrib and not is_base_type(node.attrib['type']):
42 t = node.attrib['type']
45 if node.tag != 'struct' and node.tag != 'group':
47 for c in node:
86 def print_node(f, offset, node):
87 if node
[all...]
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcmru.h73 FTC_MruNode node );
77 FTC_MruNode node );
81 FTC_MruNode node );
90 (*FTC_MruNode_CompareFunc)( FTC_MruNode node,
94 (*FTC_MruNode_InitFunc)( FTC_MruNode node,
99 (*FTC_MruNode_ResetFunc)( FTC_MruNode node,
104 (*FTC_MruNode_DoneFunc)( FTC_MruNode node,
154 FTC_MruNode node );
164 #define FTC_MRULIST_LOOKUP_CMP( list, key, compare, node, error ) \
185 node
[all...]
/third_party/rust/crates/syn/codegen/src/
H A Dhash.rs19 fn expand_impl_body(defs: &Definitions, node: &Node) -> TokenStream { in expand_impl_body()
20 let type_name = &node.ident; in expand_impl_body()
23 match &node.data { in expand_impl_body()
63 if node.ident == "Expr" { in expand_impl_body()
65 if !lookup::node(defs, ty).features.any.contains("derive") { in expand_impl_body()
79 let nonexhaustive = if node.ident == "Expr" { in expand_impl_body()
116 fn expand_impl(defs: &Definitions, node: &Node) -> TokenStream { in expand_impl()
117 let manual_hash = node.data == Data::Private in expand_impl()
118 || node.ident == "Member" in expand_impl()
119 || node in expand_impl()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Drelocation.c157 struct btrfs_backref_node *node) in mark_block_processed()
161 if (node->level == 0 || in mark_block_processed()
162 in_range(node->bytenr, rc->block_group->start, in mark_block_processed()
165 set_extent_bits(&rc->processed_blocks, node->bytenr, in mark_block_processed()
166 node->bytenr + blocksize - 1, EXTENT_DIRTY); in mark_block_processed()
168 node->processed = 1; in mark_block_processed()
179 * walk up backref nodes until reach node presents tree root
182 struct btrfs_backref_node *node, in walk_up_backref()
188 while (!list_empty(&node->upper)) { in walk_up_backref()
189 edge = list_entry(node in walk_up_backref()
156 mark_block_processed(struct reloc_control *rc, struct btrfs_backref_node *node) mark_block_processed() argument
181 walk_up_backref( struct btrfs_backref_node *node, struct btrfs_backref_edge *edges[], int *index) walk_up_backref() argument
226 update_backref_node(struct btrfs_backref_cache *cache, struct btrfs_backref_node *node, u64 bytenr) update_backref_node() argument
243 struct btrfs_backref_node *node; update_backref_cache() local
354 struct mapping_node *node; find_reloc_root() local
381 handle_useless_nodes(struct reloc_control *rc, struct btrfs_backref_node *node) handle_useless_nodes() argument
465 struct btrfs_backref_node *node = NULL; build_backref_tree() local
542 struct btrfs_backref_node *node = NULL; clone_backref_node() local
626 struct mapping_node *node; __add_reloc_root() local
658 struct mapping_node *node = NULL; __del_reloc_root() local
702 struct mapping_node *node = NULL; __update_reloc_root() local
943 struct rb_node *node; find_next_inode() local
2035 select_reloc_root(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_backref_edge *edges[]) select_reloc_root() argument
2103 select_one_root(struct btrfs_backref_node *node) select_one_root() argument
2139 calcu_metadata_size(struct reloc_control *rc, struct btrfs_backref_node *node, int reserve) calcu_metadata_size() argument
2172 reserve_metadata_space(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node) reserve_metadata_space() argument
2220 do_relocation(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_key *key, struct btrfs_path *path, int lowest) do_relocation() argument
2381 link_to_upper(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_path *path) link_to_upper() argument
2398 struct btrfs_backref_node *node; finish_pending_nodes() local
2424 update_processed_blocks(struct reloc_control *rc, struct btrfs_backref_node *node) update_processed_blocks() argument
2487 relocate_tree_block(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_key *key, struct btrfs_path *path) relocate_tree_block() argument
2551 struct btrfs_backref_node *node; relocate_tree_blocks() local
3556 struct mapping_node *node, *tmp; free_reloc_control() local
3961 struct btrfs_backref_node *node; btrfs_reloc_cow_block() local
[all...]
/kernel/linux/linux-5.10/drivers/base/
H A Dswnode.c3 * Software nodes for the firmware node framework.
18 const struct software_node *node; member
52 software_node_to_swnode(const struct software_node *node) in software_node_to_swnode() argument
57 if (!node) in software_node_to_swnode()
64 if (swnode->node == node) in software_node_to_swnode()
78 return swnode ? swnode->node : NULL; in to_software_node()
82 struct fwnode_handle *software_node_fwnode(const struct software_node *node) in software_node_fwnode() argument
84 struct swnode *swnode = software_node_to_swnode(node); in software_node_fwnode()
371 return !!property_entry_get(swnode->node in software_node_property_present()
600 software_node_register_properties(struct software_node *node, const struct property_entry *properties) software_node_register_properties() argument
639 swnode_register(const struct software_node *node, struct swnode *parent, unsigned int allocated) swnode_register() argument
785 software_node_register(const struct software_node *node) software_node_register() argument
803 software_node_unregister(const struct software_node *node) software_node_unregister() argument
817 struct software_node *node; fwnode_create_software_node() local
[all...]
/kernel/linux/linux-5.10/drivers/media/platform/sti/bdisp/
H A Dbdisp-debug.c322 struct bdisp_node *node; in last_nodes_show() local
326 seq_puts(s, "No node built yet\n"); in last_nodes_show()
331 node = bdisp->dbg.copy_node[i]; in last_nodes_show()
332 if (!node) in last_nodes_show()
336 seq_printf(s, "NIP\t0x%08X\n", node->nip); in last_nodes_show()
337 seq_printf(s, "CIC\t0x%08X\n", node->cic); in last_nodes_show()
338 bdisp_dbg_dump_ins(s, node->ins); in last_nodes_show()
339 seq_printf(s, "ACK\t0x%08X\n", node->ack); in last_nodes_show()
341 seq_printf(s, "TBA\t0x%08X\n", node->tba); in last_nodes_show()
342 bdisp_dbg_dump_tty(s, node in last_nodes_show()
394 struct bdisp_node *node; last_nodes_raw_show() local
[all...]

Completed in 16 milliseconds

1...<<21222324252627282930>>...498