Home
last modified time | relevance | path

Searched refs:node (Results 126 - 150 of 11754) sorted by relevance

12345678910>>...471

/third_party/node/deps/v8/src/compiler/
H A Dgraph-reducer.cc13 #include "src/compiler/node-observer.h"
14 #include "src/compiler/node-properties.h"
15 #include "src/compiler/node.h"
32 Reduction Reducer::Reduce(Node* node, in Reduce() argument
34 Reduction reduction = Reduce(node); in Reduce()
36 observe_node_manager->OnNodeChanged(reducer_name(), node, in Reduce() local
67 void GraphReducer::ReduceNode(Node* node) { in ReduceNode() argument
70 Push(node); in ReduceNode()
73 // Process the node on the top of the stack, potentially pushing more or in ReduceNode()
74 // popping the node of in ReduceNode()
100 Reduce(Node* const node) Reduce() argument
150 Node* node = entry.node; ReduceTop() local
212 Replace(Node* node, Node* replacement) Replace() argument
217 Replace(Node* node, Node* replacement, NodeId max_id) Replace() argument
251 ReplaceWithValue(Node* node, Node* value, Node* effect, Node* control) ReplaceWithValue() argument
290 Node* node = stack_.top().node; Pop() local
296 Push(Node* const node) Push() argument
303 Recurse(Node* node) Recurse() argument
310 Revisit(Node* node) Revisit() argument
[all...]
H A Dbranch-elimination.cc10 #include "src/compiler/node-properties.h"
32 Reduction BranchElimination::Reduce(Node* node) { in Reduce() argument
33 switch (node->opcode()) { in Reduce()
38 return ReduceDeoptimizeConditional(node); in Reduce()
40 return ReduceMerge(node); in Reduce()
42 return ReduceLoop(node); in Reduce()
44 return ReduceBranch(node); in Reduce()
46 return ReduceIf(node, false); in Reduce()
48 return ReduceIf(node, true); in Reduce()
51 return ReduceTrapConditional(node); in Reduce()
133 ReduceBranch(Node* node) ReduceBranch() argument
183 TryPullTrapIntoMerge(Node* node) TryPullTrapIntoMerge() argument
231 ReduceTrapConditional(Node* node) ReduceTrapConditional() argument
310 ReduceDeoptimizeConditional(Node* node) ReduceDeoptimizeConditional() argument
348 ReduceIf(Node* node, bool is_true_branch) ReduceIf() argument
363 ReduceLoop(Node* node) ReduceLoop() argument
370 ReduceMerge(Node* node) ReduceMerge() argument
398 ReduceStart(Node* node) ReduceStart() argument
402 ReduceOtherControl(Node* node) ReduceOtherControl() argument
407 TakeConditionsFromFirstControl(Node* node) TakeConditionsFromFirstControl() argument
415 UpdateConditions( Node* node, ControlPathConditions conditions) UpdateConditions() argument
427 UpdateConditions( Node* node, ControlPathConditions prev_conditions, Node* current_condition, Node* current_branch, bool is_true_branch, bool in_new_block) UpdateConditions() argument
[all...]
H A Djs-intrinsic-lowering.h39 Reduction Reduce(Node* node) final;
42 Reduction ReduceCopyDataProperties(Node* node);
43 Reduction ReduceCopyDataPropertiesWithExcludedPropertiesOnStack(Node* node);
44 Reduction ReduceCreateIterResultObject(Node* node);
45 Reduction ReduceDeoptimizeNow(Node* node);
46 Reduction ReduceCreateJSGeneratorObject(Node* node);
47 Reduction ReduceGeneratorClose(Node* node);
48 Reduction ReduceAsyncFunctionAwaitCaught(Node* node);
49 Reduction ReduceAsyncFunctionAwaitUncaught(Node* node);
50 Reduction ReduceAsyncFunctionEnter(Node* node);
[all...]
/kernel/linux/linux-5.10/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_read_u8(node, "prop-u8", &val_u8); in pe_test_uints()
34 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 1); in pe_test_uints()
38 error = fwnode_property_read_u8_array(node, "prop-u8", array_u8, 2); in pe_test_uints()
41 error = fwnode_property_read_u8(node, "no-prop-u8", &val_u8); in pe_test_uints()
44 error = fwnode_property_read_u8_array(node, "no-prop-u8", array_u8, 1); in pe_test_uints()
47 error = fwnode_property_read_u16(node, "prop-u16", &val_u16); in pe_test_uints()
51 error = fwnode_property_read_u16_array(node, "pro in pe_test_uints()
115 struct fwnode_handle *node; pe_test_uint_arrays() local
230 struct fwnode_handle *node; pe_test_strings() local
289 struct fwnode_handle *node; pe_test_bool() local
391 struct fwnode_handle *node; pe_test_reference() local
[all...]
/kernel/linux/linux-5.10/lib/
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
95 unsigned long *node; in btree_node_alloc() local
97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
98 if (likely(node)) in btree_node_alloc()
99 memset(node, 0, NODESIZE); in btree_node_alloc()
100 return node; in btree_node_alloc()
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
150 return &node[ in bkey()
153 bval(struct btree_geo *geo, unsigned long *node, int n) bval() argument
158 setkey(struct btree_geo *geo, unsigned long *node, int n, unsigned long *key) setkey() argument
164 setval(struct btree_geo *geo, unsigned long *node, int n, void *val) setval() argument
170 clearpair(struct btree_geo *geo, unsigned long *node, int n) clearpair() argument
211 unsigned long *node = head->node; btree_last() local
224 keycmp(struct btree_geo *geo, unsigned long *node, int pos, unsigned long *key) keycmp() argument
245 unsigned long *node = head->node; btree_lookup() local
275 unsigned long *node = head->node; btree_update() local
315 unsigned long *node, *oldnode; btree_get_prev() local
363 getpos(struct btree_geo *geo, unsigned long *node, unsigned long *key) getpos() argument
375 getfill(struct btree_geo *geo, unsigned long *node, int start) getfill() argument
391 unsigned long *node = head->node; find_level() local
416 unsigned long *node; btree_grow() local
434 unsigned long *node; btree_shrink() local
452 unsigned long *node; btree_insert_level() local
594 unsigned long *node; btree_remove_level() local
676 __btree_for_each(struct btree_head *head, struct btree_geo *geo, unsigned long *node, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2, int reap, int height, size_t count) __btree_for_each() argument
[all...]
/third_party/lame/ACM/tinyxml/
H A Dxmltest.cpp107 TiXmlNode* node = 0; in main() local
119 node = doc.FirstChild( "ToDo" ); in main()
120 assert( node ); in main()
121 todoElement = node->ToElement(); in main()
126 node = todoElement->FirstChildElement(); // This skips the "PDA" comment. in main()
127 assert( node ); in main()
128 itemElement = node->ToElement(); in main()
180 // And add the node to the existing list after the first child. in main()
181 node = todoElement->FirstChild( "Item" ); in main()
182 assert( node ); in main()
[all...]
/third_party/node/lib/internal/repl/
H A Dawait.js31 ClassDeclaration(node, state, c) {
33 state.prepend(node, `${node.id.name}=`);
36 `let ${node.id.name}; `,
40 walk.base.ClassDeclaration(node, state, c);
42 ForOfStatement(node, state, c) {
43 if (node.await === true) {
46 walk.base.ForOfStatement(node, state, c);
48 FunctionDeclaration(node, state, c) {
49 state.prepend(node, `thi
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/
H A DRemoveSwitchFallThrough.cpp32 void visitSymbol(TIntermSymbol *node) override;
33 void visitConstantUnion(TIntermConstantUnion *node) override;
34 bool visitDeclaration(Visit, TIntermDeclaration *node) override;
35 bool visitBinary(Visit, TIntermBinary *node) override;
36 bool visitUnary(Visit, TIntermUnary *node) override;
37 bool visitTernary(Visit visit, TIntermTernary *node) override;
38 bool visitSwizzle(Visit, TIntermSwizzle *node) override;
39 bool visitIfElse(Visit visit, TIntermIfElse *node) override;
40 bool visitSwitch(Visit, TIntermSwitch *node) override;
41 bool visitCase(Visit, TIntermCase *node) overrid
90 visitSymbol(TIntermSymbol *node) visitSymbol() argument
98 visitConstantUnion(TIntermConstantUnion *node) visitConstantUnion() argument
106 visitDeclaration(Visit, TIntermDeclaration *node) visitDeclaration() argument
113 visitBinary(Visit, TIntermBinary *node) visitBinary() argument
120 visitUnary(Visit, TIntermUnary *node) visitUnary() argument
127 visitTernary(Visit, TIntermTernary *node) visitTernary() argument
134 visitSwizzle(Visit, TIntermSwizzle *node) visitSwizzle() argument
141 visitIfElse(Visit, TIntermIfElse *node) visitIfElse() argument
148 visitSwitch(Visit, TIntermSwitch *node) visitSwitch() argument
202 visitCase(Visit, TIntermCase *node) visitCase() argument
212 visitAggregate(Visit, TIntermAggregate *node) visitAggregate() argument
219 DoesBlockAlwaysBreak(TIntermBlock *node) DoesBlockAlwaysBreak() argument
236 visitBlock(Visit, TIntermBlock *node) visitBlock() argument
247 visitLoop(Visit, TIntermLoop *node) visitLoop() argument
254 visitBranch(Visit, TIntermBranch *node) visitBranch() argument
[all...]
/kernel/linux/linux-5.10/arch/x86/platform/olpc/
H A Dolpc_dt.c22 static phandle __init olpc_dt_getsibling(phandle node) in olpc_dt_getsibling() argument
24 const void *args[] = { (void *)node }; in olpc_dt_getsibling()
25 void *res[] = { &node }; in olpc_dt_getsibling()
27 if ((s32)node == -1) in olpc_dt_getsibling()
30 if (olpc_ofw("peer", args, res) || (s32)node == -1) in olpc_dt_getsibling()
33 return node; in olpc_dt_getsibling()
36 static phandle __init olpc_dt_getchild(phandle node) in olpc_dt_getchild() argument
38 const void *args[] = { (void *)node }; in olpc_dt_getchild()
39 void *res[] = { &node }; in olpc_dt_getchild()
41 if ((s32)node in olpc_dt_getchild()
52 olpc_dt_getproplen(phandle node, const char *prop) olpc_dt_getproplen() argument
69 olpc_dt_getproperty(phandle node, const char *prop, char *buf, int bufsize) olpc_dt_getproperty() argument
90 olpc_dt_nextprop(phandle node, char *prev, char *buf) olpc_dt_nextprop() argument
107 olpc_dt_pkg2path(phandle node, char *buf, const int buflen, int *len) olpc_dt_pkg2path() argument
168 phandle node; olpc_dt_finddevice() local
203 phandle node; olpc_dt_get_board_revision() local
219 olpc_dt_compatible_match(phandle node, const char *compat) olpc_dt_compatible_match() argument
239 phandle node; olpc_dt_fixup() local
[all...]
/kernel/linux/linux-6.6/arch/x86/platform/olpc/
H A Dolpc_dt.c22 static phandle __init olpc_dt_getsibling(phandle node) in olpc_dt_getsibling() argument
24 const void *args[] = { (void *)node }; in olpc_dt_getsibling()
25 void *res[] = { &node }; in olpc_dt_getsibling()
27 if ((s32)node == -1) in olpc_dt_getsibling()
30 if (olpc_ofw("peer", args, res) || (s32)node == -1) in olpc_dt_getsibling()
33 return node; in olpc_dt_getsibling()
36 static phandle __init olpc_dt_getchild(phandle node) in olpc_dt_getchild() argument
38 const void *args[] = { (void *)node }; in olpc_dt_getchild()
39 void *res[] = { &node }; in olpc_dt_getchild()
41 if ((s32)node in olpc_dt_getchild()
52 olpc_dt_getproplen(phandle node, const char *prop) olpc_dt_getproplen() argument
69 olpc_dt_getproperty(phandle node, const char *prop, char *buf, int bufsize) olpc_dt_getproperty() argument
90 olpc_dt_nextprop(phandle node, char *prev, char *buf) olpc_dt_nextprop() argument
107 olpc_dt_pkg2path(phandle node, char *buf, const int buflen, int *len) olpc_dt_pkg2path() argument
168 phandle node; olpc_dt_finddevice() local
203 phandle node; olpc_dt_get_board_revision() local
219 olpc_dt_compatible_match(phandle node, const char *compat) olpc_dt_compatible_match() argument
239 phandle node; olpc_dt_fixup() local
[all...]
/kernel/linux/linux-6.6/lib/
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
95 unsigned long *node; in btree_node_alloc() local
97 node = mempool_alloc(head->mempool, gfp); in btree_node_alloc()
98 if (likely(node)) in btree_node_alloc()
99 memset(node, 0, NODESIZE); in btree_node_alloc()
100 return node; in btree_node_alloc()
148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() argument
150 return &node[ in bkey()
153 bval(struct btree_geo *geo, unsigned long *node, int n) bval() argument
158 setkey(struct btree_geo *geo, unsigned long *node, int n, unsigned long *key) setkey() argument
164 setval(struct btree_geo *geo, unsigned long *node, int n, void *val) setval() argument
170 clearpair(struct btree_geo *geo, unsigned long *node, int n) clearpair() argument
211 unsigned long *node = head->node; btree_last() local
224 keycmp(struct btree_geo *geo, unsigned long *node, int pos, unsigned long *key) keycmp() argument
245 unsigned long *node = head->node; btree_lookup_node() local
267 unsigned long *node; btree_lookup() local
284 unsigned long *node; btree_update() local
311 unsigned long *node, *oldnode; btree_get_prev() local
359 getpos(struct btree_geo *geo, unsigned long *node, unsigned long *key) getpos() argument
371 getfill(struct btree_geo *geo, unsigned long *node, int start) getfill() argument
387 unsigned long *node = head->node; find_level() local
412 unsigned long *node; btree_grow() local
430 unsigned long *node; btree_shrink() local
448 unsigned long *node; btree_insert_level() local
590 unsigned long *node; btree_remove_level() local
672 __btree_for_each(struct btree_head *head, struct btree_geo *geo, unsigned long *node, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2, int reap, int height, size_t count) __btree_for_each() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DValidateAST.cpp30 void visitSymbol(TIntermSymbol *node) override;
31 void visitConstantUnion(TIntermConstantUnion *node) override;
32 bool visitSwizzle(Visit visit, TIntermSwizzle *node) override;
33 bool visitBinary(Visit visit, TIntermBinary *node) override;
34 bool visitUnary(Visit visit, TIntermUnary *node) override;
35 bool visitTernary(Visit visit, TIntermTernary *node) override;
36 bool visitIfElse(Visit visit, TIntermIfElse *node) override;
37 bool visitSwitch(Visit visit, TIntermSwitch *node) override;
38 bool visitCase(Visit visit, TIntermCase *node) override;
39 void visitFunctionPrototype(TIntermFunctionPrototype *node) overrid
159 visitNode(Visit visit, TIntermNode *node) visitNode() argument
290 visitBuiltInFunction(TIntermOperator *node, const TFunction *function) visitBuiltInFunction() argument
322 visitFunctionCall(TIntermAggregate *node) visitFunctionCall() argument
348 validateExpressionTypeBinary(TIntermBinary *node) validateExpressionTypeBinary() argument
406 visitVariableNeedingDeclaration(TIntermSymbol *node) visitVariableNeedingDeclaration() argument
450 visitBuiltInVariable(TIntermSymbol *node) visitBuiltInVariable() argument
575 expectNonNullChildren(Visit visit, TIntermNode *node, size_t least_count) expectNonNullChildren() argument
597 visitSymbol(TIntermSymbol *node) visitSymbol() argument
631 visitConstantUnion(TIntermConstantUnion *node) visitConstantUnion() argument
636 visitSwizzle(Visit visit, TIntermSwizzle *node) visitSwizzle() argument
642 visitBinary(Visit visit, TIntermBinary *node) visitBinary() argument
654 visitUnary(Visit visit, TIntermUnary *node) visitUnary() argument
666 visitTernary(Visit visit, TIntermTernary *node) visitTernary() argument
672 visitIfElse(Visit visit, TIntermIfElse *node) visitIfElse() argument
678 visitSwitch(Visit visit, TIntermSwitch *node) visitSwitch() argument
684 visitCase(Visit visit, TIntermCase *node) visitCase() argument
690 visitFunctionPrototype(TIntermFunctionPrototype *node) visitFunctionPrototype() argument
760 visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) visitFunctionDefinition() argument
791 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
821 visitBlock(Visit visit, TIntermBlock *node) visitBlock() argument
829 visitGlobalQualifierDeclaration(Visit visit, TIntermGlobalQualifierDeclaration *node) visitGlobalQualifierDeclaration() argument
850 visitDeclaration(Visit visit, TIntermDeclaration *node) visitDeclaration() argument
969 visitLoop(Visit visit, TIntermLoop *node) visitLoop() argument
975 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
981 visitPreprocessorDirective(TIntermPreprocessorDirective *node) visitPreprocessorDirective() argument
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/nvkm/subdev/instmem/
H A Dgk20a.c176 struct gk20a_instobj *node = gk20a_instobj(memory); in gk20a_instobj_acquire_dma() local
177 struct gk20a_instmem *imem = node->imem; in gk20a_instobj_acquire_dma()
182 return node->vaddr; in gk20a_instobj_acquire_dma()
188 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); in gk20a_instobj_acquire_iommu() local
189 struct gk20a_instmem *imem = node->base.imem; in gk20a_instobj_acquire_iommu()
197 if (node->base.vaddr) { in gk20a_instobj_acquire_iommu()
198 if (!node->use_cpt) { in gk20a_instobj_acquire_iommu()
200 list_del(&node->vaddr_node); in gk20a_instobj_acquire_iommu()
209 node->base.vaddr = vmap(node in gk20a_instobj_acquire_iommu()
231 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_release_dma() local
243 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); gk20a_instobj_release_iommu() local
267 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_rd32() local
275 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_wr32() local
284 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_map() local
297 struct gk20a_instobj_dma *node = gk20a_instobj_dma(memory); gk20a_instobj_dtor_dma() local
314 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); gk20a_instobj_dtor_iommu() local
386 struct gk20a_instobj_dma *node; gk20a_instobj_ctor_dma() local
424 struct gk20a_instobj_iommu *node; gk20a_instobj_ctor_iommu() local
519 struct gk20a_instobj *node = NULL; gk20a_instobj_new() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/subdev/instmem/
H A Dgk20a.c176 struct gk20a_instobj *node = gk20a_instobj(memory); in gk20a_instobj_acquire_dma() local
177 struct gk20a_instmem *imem = node->imem; in gk20a_instobj_acquire_dma()
182 return node->vaddr; in gk20a_instobj_acquire_dma()
188 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); in gk20a_instobj_acquire_iommu() local
189 struct gk20a_instmem *imem = node->base.imem; in gk20a_instobj_acquire_iommu()
197 if (node->base.vaddr) { in gk20a_instobj_acquire_iommu()
198 if (!node->use_cpt) { in gk20a_instobj_acquire_iommu()
200 list_del(&node->vaddr_node); in gk20a_instobj_acquire_iommu()
209 node->base.vaddr = vmap(node in gk20a_instobj_acquire_iommu()
231 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_release_dma() local
243 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); gk20a_instobj_release_iommu() local
267 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_rd32() local
275 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_wr32() local
284 struct gk20a_instobj *node = gk20a_instobj(memory); gk20a_instobj_map() local
297 struct gk20a_instobj_dma *node = gk20a_instobj_dma(memory); gk20a_instobj_dtor_dma() local
314 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); gk20a_instobj_dtor_iommu() local
386 struct gk20a_instobj_dma *node; gk20a_instobj_ctor_dma() local
424 struct gk20a_instobj_iommu *node; gk20a_instobj_ctor_iommu() local
520 struct gk20a_instobj *node = NULL; gk20a_instobj_new() local
[all...]
/kernel/linux/linux-6.6/net/hsr/
H A Dhsr_framereg.c47 WARN_ONCE(1, "HSR: No self node\n"); in hsr_addr_is_self()
64 struct hsr_node *node; in find_node_by_addr_A() local
66 list_for_each_entry_rcu(node, node_db, mac_list) { in find_node_by_addr_A()
67 if (ether_addr_equal(node->macaddress_A, addr)) in find_node_by_addr_A()
68 return node; in find_node_by_addr_A()
114 struct hsr_node *node; in hsr_del_nodes() local
117 list_for_each_entry_safe(node, tmp, node_db, mac_list) in hsr_del_nodes()
118 kfree(node); in hsr_del_nodes()
122 struct hsr_node *node) in prp_handle_san_frame()
124 /* Mark if the SAN node i in prp_handle_san_frame()
121 prp_handle_san_frame(bool san, enum hsr_port_type port, struct hsr_node *node) prp_handle_san_frame() argument
144 struct hsr_node *new_node, *node; hsr_add_node() local
186 prp_update_san_info(struct hsr_node *node, bool is_sup) prp_update_san_info() argument
202 struct hsr_node *node; hsr_get_node() local
387 hsr_addr_subst_source(struct hsr_node *node, struct sk_buff *skb) hsr_addr_subst_source() argument
433 hsr_register_frame_in(struct hsr_node *node, struct hsr_port *port, u16 sequence_nr) hsr_register_frame_in() argument
456 hsr_register_frame_out(struct hsr_port *port, struct hsr_node *node, u16 sequence_nr) hsr_register_frame_out() argument
473 get_late_port(struct hsr_priv *hsr, struct hsr_node *node) get_late_port() argument
499 struct hsr_node *node; hsr_prune_nodes() local
567 struct hsr_node *node; hsr_get_next_node() local
595 struct hsr_node *node; hsr_get_node_data() local
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dlower.c30 static bool ppir_lower_const(ppir_block *block, ppir_node *node) in ppir_lower_const() argument
32 if (ppir_node_is_root(node)) { in ppir_lower_const()
33 ppir_node_delete(node); in ppir_lower_const()
37 assert(ppir_node_has_single_succ(node)); in ppir_lower_const()
39 ppir_node *succ = ppir_node_first_succ(node); in ppir_lower_const()
40 ppir_dest *dest = ppir_node_get_dest(node); in ppir_lower_const()
50 /* single succ can still have multiple references to this node */ in ppir_lower_const()
53 if (src && src->node == node) { in ppir_lower_const()
64 ppir_node *move = ppir_node_insert_mov(node); in ppir_lower_const()
83 ppir_lower_swap_args(ppir_block *block, ppir_node *node) ppir_lower_swap_args() argument
98 ppir_lower_load(ppir_block *block, ppir_node *node) ppir_lower_load() argument
143 ppir_lower_ddxy(ppir_block *block, ppir_node *node) ppir_lower_ddxy() argument
161 ppir_lower_texture(ppir_block *block, ppir_node *node) ppir_lower_texture() argument
197 ppir_lower_select(ppir_block *block, ppir_node *node) ppir_lower_select() argument
273 ppir_lower_trunc(ppir_block *block, ppir_node *node) ppir_lower_trunc() argument
284 ppir_lower_abs(ppir_block *block, ppir_node *node) ppir_lower_abs() argument
298 ppir_lower_neg(ppir_block *block, ppir_node *node) ppir_lower_neg() argument
311 ppir_lower_sat(ppir_block *block, ppir_node *node) ppir_lower_sat() argument
325 ppir_lower_branch_merge_condition(ppir_block *block, ppir_node *node) ppir_lower_branch_merge_condition() argument
417 ppir_lower_branch(ppir_block *block, ppir_node *node) ppir_lower_branch() argument
460 ppir_lower_accum(ppir_block *block, ppir_node *node) ppir_lower_accum() argument
[all...]
/kernel/linux/linux-6.6/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 in otx2_qos_get_regaddr()
82 otx2_config_sched_shaping(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct nix_txschq_config *cfg, int *num_regs) otx2_config_sched_shaping() argument
136 __otx2_qos_txschq_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct nix_txschq_config *cfg) __otx2_qos_txschq_cfg() argument
237 struct otx2_qos_node *node; otx2_qos_free_hw_node_schq() local
246 struct otx2_qos_node *node, *tmp; otx2_qos_free_hw_node() local
255 otx2_qos_free_hw_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_free_hw_cfg() argument
270 otx2_qos_sw_node_delete(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_sw_node_delete() argument
287 struct otx2_qos_node *node, *tmp; otx2_qos_free_sw_node_schq() local
298 struct otx2_qos_node *node, *tmp; __otx2_qos_free_sw_node() local
307 otx2_qos_free_sw_node(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_free_sw_node() argument
319 otx2_qos_destroy_node(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_destroy_node() argument
329 struct otx2_qos_node *node; otx2_qos_fill_cfg_schq() local
338 struct otx2_qos_node *node; otx2_qos_fill_cfg_tl() local
364 struct otx2_qos_node *node; otx2_qos_read_txschq_cfg_schq() local
378 struct otx2_qos_node *node; otx2_qos_read_txschq_cfg_tl() local
391 otx2_qos_read_txschq_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_read_txschq_cfg() argument
403 struct otx2_qos_node *node; otx2_qos_alloc_root() local
428 otx2_qos_add_child_node(struct otx2_qos_node *parent, struct otx2_qos_node *node) otx2_qos_add_child_node() argument
453 otx2_qos_alloc_txschq_node(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_alloc_txschq_node() argument
503 struct otx2_qos_node *node; otx2_qos_sw_create_leaf_node() local
550 struct otx2_qos_node *node = NULL; otx2_sw_node_find() local
563 struct otx2_qos_node *node = NULL; otx2_sw_node_find_rcu() local
575 struct otx2_qos_node *node; otx2_get_txq_by_classid() local
595 otx2_qos_txschq_config(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_txschq_config() argument
690 otx2_qos_txschq_fill_cfg_schq(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_fill_cfg_schq() argument
704 otx2_qos_txschq_fill_cfg_tl(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_fill_cfg_tl() argument
724 otx2_qos_txschq_fill_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_fill_cfg() argument
761 otx2_qos_assign_base_idx_tl(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_assign_base_idx_tl() argument
800 otx2_qos_assign_base_idx(struct otx2_nic *pfvf, struct otx2_qos_node *node) otx2_qos_assign_base_idx() argument
812 otx2_qos_txschq_push_cfg_schq(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_push_cfg_schq() argument
831 otx2_qos_txschq_push_cfg_tl(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_push_cfg_tl() argument
857 otx2_qos_txschq_push_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_push_cfg() argument
873 otx2_qos_txschq_update_config(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_txschq_update_config() argument
911 otx2_qos_enadis_sq(struct otx2_nic *pfvf, struct otx2_qos_node *node, u16 qid) otx2_qos_enadis_sq() argument
922 otx2_qos_update_smq_schq(struct otx2_nic *pfvf, struct otx2_qos_node *node, bool action) otx2_qos_update_smq_schq() argument
941 __otx2_qos_update_smq(struct otx2_nic *pfvf, struct otx2_qos_node *node, bool action) __otx2_qos_update_smq() argument
962 otx2_qos_update_smq(struct otx2_nic *pfvf, struct otx2_qos_node *node, bool action) otx2_qos_update_smq() argument
972 otx2_qos_push_txschq_cfg(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_push_txschq_cfg() argument
1002 otx2_qos_update_tree(struct otx2_nic *pfvf, struct otx2_qos_node *node, struct otx2_qos_cfg *cfg) otx2_qos_update_tree() argument
1169 struct otx2_qos_node *node; is_qos_node_dwrr() local
1208 struct otx2_qos_node *node, *parent; otx2_qos_leaf_alloc_queue() local
1346 struct otx2_qos_node *node, *child; otx2_qos_leaf_to_inner() local
1480 struct otx2_qos_node *node, *parent; otx2_qos_leaf_del() local
1525 struct otx2_qos_node *node, *parent; otx2_qos_leaf_del_last() local
[all...]
/kernel/linux/linux-5.10/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
119 * if offlen == 0 (non-branching node)
120 * RIGHTPATH - 1 bit field - set if the following node is for the
122 * TRIENODE - 1 bit field - set if the following node is an internal
123 * node, otherwise it is a leaf node
124 * if offlen != 0 (branching node)
125 * LEFTNODE - 1 bit field - set if the left-hand node is internal
126 * RIGHTNODE - 1 bit field - set if the right-hand node is internal
361 struct node { struct
382 struct node *node; lookup() local
419 struct node *node; tree_walk() local
494 struct node *node; alloc_node() local
535 struct node *node; insert() local
656 struct node *node; prune() local
817 struct node *node; mark_nodes() local
944 struct node *node; index_nodes() local
1025 mark_subtree(struct node *node) mark_subtree() argument
1051 struct node *node; size_nodes() local
1187 struct node *node; emit() local
2713 int node; utf8nlookup() local
[all...]
/kernel/linux/linux-6.6/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
119 * if offlen == 0 (non-branching node)
120 * RIGHTPATH - 1 bit field - set if the following node is for the
122 * TRIENODE - 1 bit field - set if the following node is an internal
123 * node, otherwise it is a leaf node
124 * if offlen != 0 (branching node)
125 * LEFTNODE - 1 bit field - set if the left-hand node is internal
126 * RIGHTNODE - 1 bit field - set if the right-hand node is internal
361 struct node { struct
382 struct node *node; lookup() local
419 struct node *node; tree_walk() local
494 struct node *node; alloc_node() local
535 struct node *node; insert() local
656 struct node *node; prune() local
817 struct node *node; mark_nodes() local
944 struct node *node; index_nodes() local
1025 mark_subtree(struct node *node) mark_subtree() argument
1051 struct node *node; size_nodes() local
1187 struct node *node; emit() local
2713 int node; utf8nlookup() local
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Drebuild.js15 } = require('@npmcli/node-gyp')
84 nodes = tree.inventory.filter(node =>
85 filterSet.has(node) || node.isProjectRoot
93 nodes = tree.inventory.filter(node => filterSet.has(node))
105 for (const node of nodes) {
106 if (node.isStoreLink) {
107 storeNodes.add(node)
108 } else if (node
[all...]
/third_party/node/deps/v8/src/compiler/backend/s390/
H A Dinstruction-selector-s390.cc7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
88 InstructionOperand UseOperand(Node* node, OperandModes mode) { in UseOperand() argument
89 if (CanBeImmediate(node, mode)) { in UseOperand()
90 return UseImmediate(node); in UseOperand()
92 return UseRegister(node); in UseOperand()
95 InstructionOperand UseAnyExceptImmediate(Node* node) { in UseAnyExceptImmediate() argument
96 if (NodeProperties::IsConstant(node)) in UseAnyExceptImmediate()
97 return UseRegister(node); in UseAnyExceptImmediate()
99 return Use(node); in UseAnyExceptImmediate()
102 GetImmediate(Node* node) GetImmediate() argument
111 CanBeImmediate(Node* node, OperandModes mode) CanBeImmediate() argument
241 GetRepresentation(Node* node) GetRepresentation() argument
245 Is64BitOperand(Node* node) Is64BitOperand() argument
369 ProduceWord32Result(Node* node) ProduceWord32Result() argument
421 DoZeroExtForResult(Node* node) DoZeroExtForResult() argument
435 VisitTryTruncateDouble(InstructionSelector* selector, ArchOpcode opcode, Node* node) VisitTryTruncateDouble() argument
453 GenerateRightOperands(InstructionSelector* selector, Node* node, Node* right, InstructionCode* opcode, OperandModes* operand_mode, InstructionOperand* inputs, size_t* input_count, CanCombineWithLoad canCombineWithLoad) GenerateRightOperands() argument
498 GenerateBinOpOperands(InstructionSelector* selector, Node* node, Node* left, Node* right, InstructionCode* opcode, OperandModes* operand_mode, InstructionOperand* inputs, size_t* input_count, CanCombineWithLoad canCombineWithLoad) GenerateBinOpOperands() argument
578 VisitUnaryOp(InstructionSelector* selector, Node* node, InstructionCode opcode, OperandModes operand_mode, FlagsContinuation* cont, CanCombineWithLoad canCombineWithLoad) VisitUnaryOp() argument
626 VisitBinOp(InstructionSelector* selector, Node* node, InstructionCode opcode, OperandModes operand_mode, FlagsContinuation* cont, CanCombineWithLoad canCombineWithLoad) VisitBinOp() argument
684 VisitStackSlot(Node* node) VisitStackSlot() argument
693 VisitAbortCSADcheck(Node* node) VisitAbortCSADcheck() argument
698 VisitLoad(Node* node, Node* value, InstructionCode opcode) VisitLoad() argument
710 VisitLoad(Node* node) VisitLoad() argument
716 VisitProtectedLoad(Node* node) VisitProtectedLoad() argument
721 VisitGeneralStore( InstructionSelector* selector, Node* node, MachineRepresentation rep, WriteBarrierKind write_barrier_kind = kNoWriteBarrier) VisitGeneralStore() argument
821 VisitStore(Node* node) VisitStore() argument
834 VisitProtectedStore(Node* node) VisitProtectedStore() argument
840 VisitUnalignedLoad(Node* node) VisitUnalignedLoad() argument
843 VisitUnalignedStore(Node* node) VisitUnalignedStore() argument
845 VisitStackPointerGreaterThan( Node* node, FlagsContinuation* cont) VisitStackPointerGreaterThan() argument
901 VisitWord64And(Node* node) VisitWord64And() argument
953 VisitWord64Shl(Node* node) VisitWord64Shl() argument
995 VisitWord64Shr(Node* node) VisitWord64Shr() argument
1035 TryMatchSignExtInt16OrInt8FromWord32Sar( InstructionSelector* selector, Node* node) TryMatchSignExtInt16OrInt8FromWord32Sar() argument
1062 VisitWord32Rol(Node* node) VisitWord32Rol() argument
1064 VisitWord64Rol(Node* node) VisitWord64Rol() argument
1066 VisitWord32Ctz(Node* node) VisitWord32Ctz() argument
1069 VisitWord64Ctz(Node* node) VisitWord64Ctz() argument
1072 VisitWord32ReverseBits(Node* node) VisitWord32ReverseBits() argument
1075 VisitWord64ReverseBits(Node* node) VisitWord64ReverseBits() argument
1078 VisitInt32AbsWithOverflow(Node* node) VisitInt32AbsWithOverflow() argument
1082 VisitInt64AbsWithOverflow(Node* node) VisitInt64AbsWithOverflow() argument
1086 VisitWord64ReverseBytes(Node* node) VisitWord64ReverseBytes() argument
1105 VisitWord32ReverseBytes(Node* node) VisitWord32ReverseBytes() argument
1124 VisitSimd128ReverseBytes(Node* node) VisitSimd128ReverseBytes() argument
1144 TryMatchNegFromSub(InstructionSelector* selector, Node* node) TryMatchNegFromSub() argument
1170 TryMatchShiftFromMul(InstructionSelector* selector, Node* node) TryMatchShiftFromMul() argument
1197 TryMatchInt32OpWithOverflow(InstructionSelector* selector, Node* node, OperandModes mode) TryMatchInt32OpWithOverflow() argument
1207 TryMatchInt32AddWithOverflow(InstructionSelector* selector, Node* node) TryMatchInt32AddWithOverflow() argument
1213 TryMatchInt32SubWithOverflow(InstructionSelector* selector, Node* node) TryMatchInt32SubWithOverflow() argument
1219 TryMatchInt32MulWithOverflow(InstructionSelector* selector, Node* node) TryMatchInt32MulWithOverflow() argument
1239 TryMatchInt64OpWithOverflow(InstructionSelector* selector, Node* node, OperandModes mode) TryMatchInt64OpWithOverflow() argument
1249 TryMatchInt64AddWithOverflow(InstructionSelector* selector, Node* node) TryMatchInt64AddWithOverflow() argument
1255 TryMatchInt64SubWithOverflow(InstructionSelector* selector, Node* node) TryMatchInt64SubWithOverflow() argument
1262 TryMatchDoubleConstructFromInsert( InstructionSelector* selector, Node* node) TryMatchDoubleConstructFromInsert() argument
1532 VisitTryTruncateFloat32ToInt64(Node* node) VisitTryTruncateFloat32ToInt64() argument
1536 VisitTryTruncateFloat64ToInt64(Node* node) VisitTryTruncateFloat64ToInt64() argument
1540 VisitTryTruncateFloat32ToUint64(Node* node) VisitTryTruncateFloat32ToUint64() argument
1544 VisitTryTruncateFloat64ToUint64(Node* node) VisitTryTruncateFloat64ToUint64() argument
1550 VisitBitcastWord32ToWord64(Node* node) VisitBitcastWord32ToWord64() argument
1556 VisitFloat64Mod(Node* node) VisitFloat64Mod() argument
1563 VisitFloat64Ieee754Unop(Node* node, InstructionCode opcode) VisitFloat64Ieee754Unop() argument
1570 VisitFloat64Ieee754Binop(Node* node, InstructionCode opcode) VisitFloat64Ieee754Binop() argument
1605 VisitWordCompare(InstructionSelector* selector, Node* node, InstructionCode opcode, FlagsContinuation* cont, OperandModes immediate_mode) VisitWordCompare() argument
1659 VisitWord32Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) VisitWord32Compare() argument
1667 VisitWord64Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) VisitWord64Compare() argument
1676 VisitFloat32Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) VisitFloat32Compare() argument
1682 VisitFloat64Compare(InstructionSelector* selector, Node* node, FlagsContinuation* cont) VisitFloat64Compare() argument
1687 VisitTestUnderMask(InstructionSelector* selector, Node* node, FlagsContinuation* cont) VisitTestUnderMask() argument
1704 VisitLoadAndTest(InstructionSelector* selector, InstructionCode opcode, Node* node, Node* value, FlagsContinuation* cont, bool discard_output) VisitLoadAndTest() argument
1853 Node* const node = value->InputAt(0); VisitWordCompareZero() local
1978 VisitSwitch(Node* node, const SwitchInfo& sw) VisitSwitch() argument
2014 VisitWord32Equal(Node* const node) VisitWord32Equal() argument
2024 VisitInt32LessThan(Node* node) VisitInt32LessThan() argument
2029 VisitInt32LessThanOrEqual(Node* node) VisitInt32LessThanOrEqual() argument
2035 VisitUint32LessThan(Node* node) VisitUint32LessThan() argument
2040 VisitUint32LessThanOrEqual(Node* node) VisitUint32LessThanOrEqual() argument
2047 VisitWord64Equal(Node* const node) VisitWord64Equal() argument
2057 VisitInt64LessThan(Node* node) VisitInt64LessThan() argument
2062 VisitInt64LessThanOrEqual(Node* node) VisitInt64LessThanOrEqual() argument
2068 VisitUint64LessThan(Node* node) VisitUint64LessThan() argument
2073 VisitUint64LessThanOrEqual(Node* node) VisitUint64LessThanOrEqual() argument
2080 VisitFloat32Equal(Node* node) VisitFloat32Equal() argument
2085 VisitFloat32LessThan(Node* node) VisitFloat32LessThan() argument
2090 VisitFloat32LessThanOrEqual(Node* node) VisitFloat32LessThanOrEqual() argument
2096 VisitFloat64Equal(Node* node) VisitFloat64Equal() argument
2101 VisitFloat64LessThan(Node* node) VisitFloat64LessThan() argument
2106 VisitFloat64LessThanOrEqual(Node* node) VisitFloat64LessThanOrEqual() argument
2112 ZeroExtendsWord32ToWord64NoPhis(Node* node) ZeroExtendsWord32ToWord64NoPhis() argument
2116 EmitPrepareArguments( ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor, Node* node) EmitPrepareArguments() argument
2149 VisitMemoryBarrier(Node* node) VisitMemoryBarrier() argument
2156 VisitWord32AtomicLoad(Node* node) VisitWord32AtomicLoad() argument
2162 VisitWord32AtomicStore(Node* node) VisitWord32AtomicStore() argument
2167 VisitAtomicExchange(InstructionSelector* selector, Node* node, ArchOpcode opcode, AtomicWidth width) VisitAtomicExchange() argument
2187 VisitWord32AtomicExchange(Node* node) VisitWord32AtomicExchange() argument
2206 VisitWord64AtomicExchange(Node* node) VisitWord64AtomicExchange() argument
2223 VisitAtomicCompareExchange(InstructionSelector* selector, Node* node, ArchOpcode opcode, AtomicWidth width) VisitAtomicCompareExchange() argument
2255 VisitWord32AtomicCompareExchange(Node* node) VisitWord32AtomicCompareExchange() argument
2274 VisitWord64AtomicCompareExchange(Node* node) VisitWord64AtomicCompareExchange() argument
2291 VisitAtomicBinop(InstructionSelector* selector, Node* node, ArchOpcode opcode, AtomicWidth width) VisitAtomicBinop() argument
2327 VisitWord32AtomicBinaryOperation( Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op, ArchOpcode uint16_op, ArchOpcode word32_op) VisitWord32AtomicBinaryOperation() argument
2362 VisitWord64AtomicBinaryOperation( Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode word32_op, ArchOpcode word64_op) VisitWord64AtomicBinaryOperation() argument
2395 VisitWord64AtomicLoad(Node* node) VisitWord64AtomicLoad() argument
2401 VisitWord64AtomicStore(Node* node) VisitWord64AtomicStore() argument
2690 VisitI8x16Shuffle(Node* node) VisitI8x16Shuffle() argument
2730 VisitS128Const(Node* node) VisitS128Const() argument
2754 VisitS128Zero(Node* node) VisitS128Zero() argument
2759 VisitS128Select(Node* node) VisitS128Select() argument
2766 EmitPrepareResults( ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor, Node* node) EmitPrepareResults() argument
2791 VisitLoadLane(Node* node) VisitLoadLane() argument
2820 VisitLoadTransform(Node* node) VisitLoadTransform() argument
2866 VisitStoreLane(Node* node) VisitStoreLane() argument
2895 VisitTruncateFloat32ToInt32(Node* node) VisitTruncateFloat32ToInt32() argument
2907 VisitTruncateFloat32ToUint32(Node* node) VisitTruncateFloat32ToUint32() argument
2919 AddOutputToSelectContinuation(OperandGenerator* g, int first_input_index, Node* node) AddOutputToSelectContinuation() argument
[all...]
/kernel/linux/linux-5.10/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()
72 prom_getsibling(phandle node) prom_getsibling() argument
90 prom_getproplen(phandle node, const char *prop) prom_getproplen() argument
110 prom_getproperty(phandle node, const char *prop, char *buffer, int bufsize) prom_getproperty() argument
130 prom_getint(phandle node, char *prop) prom_getint() argument
144 prom_getintdefault(phandle node, char *property, int deflt) prom_getintdefault() argument
156 prom_getbool(phandle node, char *prop) prom_getbool() argument
170 prom_getstring(phandle node, char *prop, char *user_buf, int ubuf_size) prom_getstring() argument
204 __prom_nextprop(phandle node, char * oprop) __prom_nextprop() argument
221 prom_nextprop(phandle node, char *oprop, char *buffer) prom_nextprop() argument
234 phandle node = prom_root_node, node2; prom_finddevice() local
281 prom_setprop(phandle node, const char *pname, char *value, int size) prom_setprop() argument
300 phandle node; prom_inst2pkg() local
[all...]
/kernel/linux/linux-6.6/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()
72 prom_getsibling(phandle node) prom_getsibling() argument
90 prom_getproplen(phandle node, const char *prop) prom_getproplen() argument
110 prom_getproperty(phandle node, const char *prop, char *buffer, int bufsize) prom_getproperty() argument
130 prom_getint(phandle node, char *prop) prom_getint() argument
144 prom_getintdefault(phandle node, char *property, int deflt) prom_getintdefault() argument
156 prom_getbool(phandle node, char *prop) prom_getbool() argument
170 prom_getstring(phandle node, char *prop, char *user_buf, int ubuf_size) prom_getstring() argument
204 __prom_nextprop(phandle node, char * oprop) __prom_nextprop() argument
221 prom_nextprop(phandle node, char *oprop, char *buffer) prom_nextprop() argument
234 phandle node = prom_root_node, node2; prom_finddevice() local
281 prom_setprop(phandle node, const char *pname, char *value, int size) prom_setprop() argument
300 phandle node; prom_inst2pkg() local
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DSimplifyLoopConditions.cpp37 void traverseLoop(TIntermLoop *node) override;
39 bool visitUnary(Visit visit, TIntermUnary *node) override;
40 bool visitBinary(Visit visit, TIntermBinary *node) override;
41 bool visitAggregate(Visit visit, TIntermAggregate *node) override;
42 bool visitTernary(Visit visit, TIntermTernary *node) override;
43 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override;
44 bool visitBranch(Visit visit, TIntermBranch *node) override;
74 bool SimplifyLoopConditionsTraverser::visitUnary(Visit visit, TIntermUnary *node) in visitUnary() argument
83 mFoundLoopToChange = mConditionsToSimplify->match(node); in visitUnary()
87 bool SimplifyLoopConditionsTraverser::visitBinary(Visit visit, TIntermBinary *node) in visitBinary() argument
101 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
114 visitTernary(Visit visit, TIntermTernary *node) visitTernary() argument
127 visitDeclaration(Visit visit, TIntermDeclaration *node) visitDeclaration() argument
140 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
164 traverseLoop(TIntermLoop *node) traverseLoop() argument
[all...]
/third_party/skia/experimental/skrive/tests/
H A DDomTypes.cpp12 void check_type(skiatest::Reporter* reporter, const sk_sp<U>& node, bool expected) { in check_type() argument
13 REPORTER_ASSERT(reporter, node->template is<T>() == expected); in check_type()
14 REPORTER_ASSERT(reporter, !!static_cast<const T*>(*node.get()) == expected); in check_type()
19 auto node = sk_make_sp<skrive::Node>(); in DEF_TEST() local
21 check_type<skrive::Component >(reporter, node, true); in DEF_TEST()
22 check_type<skrive::TransformableComponent>(reporter, node, true); in DEF_TEST()
23 check_type<skrive::Node >(reporter, node, true); in DEF_TEST()
24 check_type<skrive::Drawable >(reporter, node, false); in DEF_TEST()
25 check_type<skrive::Shape >(reporter, node, false); in DEF_TEST()
29 auto node in DEF_TEST() local
39 auto node = sk_make_sp<skrive::ColorPaint>(SkPaint::Style::kFill_Style); DEF_TEST() local
51 auto node = sk_make_sp<skrive::Ellipse>(); DEF_TEST() local
[all...]

Completed in 22 milliseconds

12345678910>>...471