Home
last modified time | relevance | path

Searched refs:nodes (Results 26 - 50 of 820) sorted by relevance

12345678910>>...33

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DSpillPlacement.cpp77 /// value can change when linked nodes change, but convergence is very fast
102 // Undecided nodes (Value==0) go on the stack. in preferReg()
156 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
161 if (nodes[I->second].Value == -1) in update()
163 else if (nodes[I->second].Value == 1) in update()
186 const Node nodes[]) const { in getDissentingNeighbors()
191 if (Value != nodes[n].Value) in getDissentingNeighbors()
202 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
203 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
221 delete[] nodes; in releaseMemory()
[all...]
/third_party/node/test/parallel/
H A Dtest-whatwg-events-eventtarget-this-of-listener.js19 const nodes = [
28 for (const node of nodes) {
37 assert_equals(callCount, nodes.length);
41 const nodes = [
50 for (const node of nodes) {
62 assert_equals(callCount, nodes.length);
66 const nodes = [
75 for (const node of nodes) {
90 assert_equals(callCount, nodes.length);
94 const nodes
[all...]
/third_party/python/Lib/lib2to3/
H A Dpatcomp.py100 nodes = node.children
101 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
102 name = nodes[0].value
103 nodes = nodes[2:]
105 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
106 repeat = nodes[-1]
107 nodes
[all...]
H A Dpytree.py56 Compare two nodes for equality.
68 Compare two nodes for equality.
70 This is called by __eq__ and __ne__. It is only called if the two nodes
209 """Concrete implementation for interior nodes."""
219 child nodes, and an optional context keyword argument.
254 """Compare two nodes for equality."""
319 """Concrete implementation for leaf nodes."""
363 """Compare two nodes for equality."""
427 - WildcardPattern matches a sequence of nodes of variable length.
461 updated with the nodes matchin
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/tests/
H A Ddrm_mm_test.c251 struct drm_mm_node nodes[2]; in drm_test_mm_debug() local
253 /* Create a small drm_mm with a couple of nodes and a few holes, and in drm_test_mm_debug()
259 memset(nodes, 0, sizeof(nodes)); in drm_test_mm_debug()
260 nodes[0].start = 512; in drm_test_mm_debug()
261 nodes[0].size = 1024; in drm_test_mm_debug()
262 KUNIT_ASSERT_FALSE_MSG(test, drm_mm_reserve_node(&mm, &nodes[0]), in drm_test_mm_debug()
264 nodes[0].start, nodes[0].size); in drm_test_mm_debug()
266 nodes[ in drm_test_mm_debug()
348 struct drm_mm_node tmp, *nodes, *node, *next; __drm_test_mm_reserve() local
532 struct drm_mm_node *nodes, *node, *next; __drm_test_mm_insert() local
816 struct drm_mm_node *nodes, *node, *next; __drm_test_mm_insert_range() local
950 prepare_frag(struct kunit *test, struct drm_mm *mm, struct drm_mm_node *nodes, unsigned int num_insert, const struct insert_mode *mode) prepare_frag() argument
972 get_insert_time(struct kunit *test, struct drm_mm *mm, unsigned int num_insert, struct drm_mm_node *nodes, const struct insert_mode *mode) get_insert_time() argument
995 struct drm_mm_node *nodes, *node, *next; drm_test_mm_frag() local
1058 struct drm_mm_node *nodes, *node, *next; drm_test_mm_align() local
1186 evict_nodes(struct kunit *test, struct drm_mm_scan *scan, struct evict_node *nodes, unsigned int *order, unsigned int count, bool use_color, struct list_head *evict_list) evict_nodes() argument
1232 evict_nothing(struct kunit *test, struct drm_mm *mm, unsigned int total_size, struct evict_node *nodes) evict_nothing() argument
1278 evict_everything(struct kunit *test, struct drm_mm *mm, unsigned int total_size, struct evict_node *nodes) evict_everything() argument
1326 evict_something(struct kunit *test, struct drm_mm *mm, u64 range_start, u64 range_end, struct evict_node *nodes, unsigned int *order, unsigned int count, unsigned int size, unsigned int alignment, const struct insert_mode *mode) evict_something() argument
1396 struct evict_node *nodes; drm_test_mm_evict() local
1490 struct evict_node *nodes; drm_test_mm_evict_range() local
1577 struct drm_mm_node *nodes, *node, *next; drm_test_mm_topdown() local
1684 struct drm_mm_node *nodes, *node, *next; drm_test_mm_bottomup() local
1983 evict_color(struct kunit *test, struct drm_mm *mm, u64 range_start, u64 range_end, struct evict_node *nodes, unsigned int *order, unsigned int count, unsigned int size, unsigned int alignment, unsigned long color, const struct insert_mode *mode) evict_color() argument
2052 struct evict_node *nodes; drm_test_mm_color_evict() local
2136 struct evict_node *nodes; drm_test_mm_color_evict_range() local
[all...]
/third_party/jinja2/
H A Dext.py9 from . import nodes namespace
117 def parse(self, parser: "Parser") -> t.Union[nodes.Node, t.List[nodes.Node]]:
121 list of multiple nodes.
127 ) -> nodes.ExtensionAttribute:
135 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno)
140 args: t.Optional[t.List[nodes.Expr]] = None,
141 kwargs: t.Optional[t.List[nodes.Keyword]] = None,
142 dyn_args: t.Optional[nodes.Expr] = None,
143 dyn_kwargs: t.Optional[nodes
[all...]
H A Doptimizer.py12 from . import nodes namespace
19 def optimize(node: nodes.Node, environment: "Environment") -> nodes.Node:
23 return t.cast(nodes.Node, optimizer.visit(node))
31 self, node: nodes.Node, *args: t.Any, **kwargs: t.Any
32 ) -> nodes.Node:
35 # Do constant folding. Some other nodes besides Expr have
37 if isinstance(node, nodes.Expr):
39 return nodes.Const.from_untrusted(
44 except nodes
[all...]
H A Dcompiler.py1 """Compiles nodes from the parser into Python code."""
12 from . import nodes namespace
19 from .nodes import EvalContext
45 self: "CodeGenerator", node: nodes.Expr, frame: "Frame", **kwargs: t.Any
59 def _make_binop(op: str) -> t.Callable[["CodeGenerator", nodes.BinExpr, "Frame"], None]:
61 def visitor(self: "CodeGenerator", node: nodes.BinExpr, frame: Frame) -> None:
83 ) -> t.Callable[["CodeGenerator", nodes.UnaryExpr, "Frame"], None]:
85 def visitor(self: "CodeGenerator", node: nodes.UnaryExpr, frame: Frame) -> None:
102 node: nodes.Template,
111 if not isinstance(node, nodes
[all...]
H A Didtracking.py3 from . import nodes namespace
13 nodes: t.Iterable[nodes.Node], parent_symbols: t.Optional["Symbols"] = None
17 for node in nodes:
23 node: nodes.Node, parent_symbols: t.Optional["Symbols"] = None
46 def analyze_node(self, node: nodes.Node, **kwargs: t.Any) -> None:
178 def _simple_visit(self, node: nodes.Node, **kwargs: t.Any) -> None:
190 def visit_AssignBlock(self, node: nodes.AssignBlock, **kwargs: t.Any) -> None:
194 def visit_CallBlock(self, node: nodes.CallBlock, **kwargs: t.Any) -> None:
198 def visit_OverlayScope(self, node: nodes
[all...]
/third_party/node/test/fixtures/wpt/encoding/resources/
H A Ddecode-common.js11 nodes = iframe.querySelectorAll("span");
13 for (var i = 0; i < nodes.length; i++) {
16 nodes[i].dataset.cp +
18 String.fromCodePoint(parseInt(nodes[i].dataset.cp, 16)) +
20 decoder(nodes[i].dataset.bytes) +
22 nodes[i].dataset.bytes
29 for (var i = 0; i < nodes.length; i++) {
33 nodes[i].textContent,
34 decoder(nodes[i].dataset.bytes)
/third_party/python/Doc/tools/extensions/
H A Dpyspecific.py21 from docutils import nodes, utils namespace
32 from sphinx.util.nodes import split_explicit_title
70 refnode = nodes.reference(text, text, refuri=ISSUE_URI % issue)
86 refnode = nodes.reference(text, text, refuri=GH_ISSUE_URI % issue)
96 refnode = nodes.reference(title, title, refuri=SOURCE_URI % target)
112 pnode = nodes.compound(classes=['impl-detail'])
115 add_text = nodes.strong(label, label)
117 content = nodes.inline(pnode[0].rawsource, translatable=True)
121 pnode[0].replace_self(nodes.paragraph(
122 '', '', add_text, nodes
[all...]
/kernel/linux/linux-6.6/drivers/media/pci/intel/
H A Dipu-bridge.c300 struct software_node *nodes = sensor->swnodes; in ipu_bridge_create_fwnode_properties() local
306 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
308 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IVSC_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
310 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
312 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
337 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_IPU_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
339 SOFTWARE_NODE_REFERENCE(&nodes[SWNODE_SENSOR_ENDPOINT]); in ipu_bridge_create_fwnode_properties()
394 /* append link to distinguish nodes with same model VCM */ in ipu_bridge_init_swnode_names()
411 struct software_node *nodes = sensor->swnodes; in ipu_bridge_init_swnode_group() local
413 sensor->group[SWNODE_SENSOR_HID] = &nodes[SWNODE_SENSOR_HI in ipu_bridge_init_swnode_group()
445 struct software_node *nodes = sensor->swnodes; ipu_bridge_create_connection_swnodes() local
[all...]
/kernel/linux/linux-5.10/mm/
H A Dmempolicy.c15 * interleave Allocate memory interleaved over a set of nodes,
22 * bind Only allocate memory on a specific set of nodes,
26 * the allocation to memory nodes instead
176 int (*create)(struct mempolicy *pol, const nodemask_t *nodes);
177 void (*rebind)(struct mempolicy *pol, const nodemask_t *nodes);
193 static int mpol_new_interleave(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_interleave() argument
195 if (nodes_empty(*nodes)) in mpol_new_interleave()
197 pol->v.nodes = *nodes; in mpol_new_interleave()
201 static int mpol_new_preferred(struct mempolicy *pol, const nodemask_t *nodes) in mpol_new_preferred() argument
212 mpol_new_bind(struct mempolicy *pol, const nodemask_t *nodes) mpol_new_bind() argument
229 mpol_set_nodemask(struct mempolicy *pol, const nodemask_t *nodes, struct nodemask_scratch *nsc) mpol_set_nodemask() argument
268 mpol_new(unsigned short mode, unsigned short flags, nodemask_t *nodes) mpol_new() argument
320 mpol_rebind_default(struct mempolicy *pol, const nodemask_t *nodes) mpol_rebind_default() argument
324 mpol_rebind_nodemask(struct mempolicy *pol, const nodemask_t *nodes) mpol_rebind_nodemask() argument
344 mpol_rebind_preferred(struct mempolicy *pol, const nodemask_t *nodes) mpol_rebind_preferred() argument
743 queue_pages_range(struct mm_struct *mm, unsigned long start, unsigned long end, nodemask_t *nodes, unsigned long flags, struct list_head *pagelist) queue_pages_range() argument
858 do_set_mempolicy(unsigned short mode, unsigned short flags, nodemask_t *nodes) do_set_mempolicy() argument
897 get_policy_nodemask(struct mempolicy *p, nodemask_t *nodes) get_policy_nodemask() argument
1372 get_nodes(nodemask_t *nodes, const unsigned long __user *nmask, unsigned long maxnode) get_nodes() argument
1433 copy_nodes_to_user(unsigned long __user *mask, unsigned long maxnode, nodemask_t *nodes) copy_nodes_to_user() argument
1453 nodemask_t nodes; kernel_mbind() local
1483 nodemask_t nodes; kernel_set_mempolicy() local
1609 nodemask_t nodes; kernel_get_mempolicy() local
2875 nodemask_t nodes; mpol_parse_str() local
3006 nodemask_t nodes = NODE_MASK_NONE; mpol_to_str() local
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dparser.py2 """Parse tokens from the lexer into nodes for the compiler."""
3 from . import nodes namespace
29 "add": nodes.Add,
30 "sub": nodes.Sub,
31 "mul": nodes.Mul,
32 "div": nodes.Div,
33 "floordiv": nodes.FloorDiv,
34 "mod": nodes.Mod,
126 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
128 rv = object.__new__(nodes
[all...]
H A Dmeta.py5 from . import nodes namespace
69 (nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include)
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
77 if isinstance(template_name, nodes.Const):
93 elif isinstance(node, nodes
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dparser.py11 from jinja2 import nodes namespace
23 'add': nodes.Add,
24 'sub': nodes.Sub,
25 'mul': nodes.Mul,
26 'div': nodes.Div,
27 'floordiv': nodes.FloorDiv,
28 'mod': nodes.Mod,
115 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
117 rv = object.__new__(nodes.InternalName)
118 nodes
[all...]
H A Dmeta.py12 from jinja2 import nodes namespace
75 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
76 nodes.Include)):
77 if not isinstance(node.template, nodes.Const):
79 if isinstance(node.template, (nodes.Tuple, nodes.List)):
83 if isinstance(template_name, nodes.Const):
99 elif isinstance(node, nodes
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dparser.py2 """Parse tokens from the lexer into nodes for the compiler."""
3 from . import nodes namespace
29 "add": nodes.Add,
30 "sub": nodes.Sub,
31 "mul": nodes.Mul,
32 "div": nodes.Div,
33 "floordiv": nodes.FloorDiv,
34 "mod": nodes.Mod,
126 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
128 rv = object.__new__(nodes
[all...]
H A Dmeta.py5 from . import nodes namespace
69 (nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include)
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
77 if isinstance(template_name, nodes.Const):
93 elif isinstance(node, nodes
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-spine.c128 s->nodes[0] = NULL; in init_ro_spine()
129 s->nodes[1] = NULL; in init_ro_spine()
137 unlock_block(s->info, s->nodes[i]); in exit_ro_spine()
145 unlock_block(s->info, s->nodes[0]); in ro_step()
146 s->nodes[0] = s->nodes[1]; in ro_step()
150 r = bn_read_lock(s->info, new_child, s->nodes + s->count); in ro_step()
161 unlock_block(s->info, s->nodes[s->count]); in ro_pop()
169 block = s->nodes[s->count - 1]; in ro_node()
187 unlock_block(s->info, s->nodes[ in exit_shadow_spine()
[all...]
/third_party/ltp/testcases/kernel/syscalls/mbind/
H A Dmbind02.c29 static struct tst_nodemap *nodes; variable
35 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * page_size / 1024); in setup()
36 if (nodes->cnt <= 1) in setup()
37 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); in setup()
42 tst_nodemap_free(nodes); in cleanup()
54 tst_nodemap_reset_counters(nodes); in verify_policy()
56 tst_nodemap_count_pages(nodes, ptr, size); in verify_policy()
57 tst_nodemap_print_counters(nodes); in verify_policy()
59 for (i = 0; i < nodes->cnt; i++) { in verify_policy()
60 if (!nodes in verify_policy()
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Dfunction_call_mutator.js18 function _liftExpressionsToStatements(path, nodes) {
20 // lift the replacement nodes into statements too.
22 return nodes;
25 return nodes.map(n => babelTypes.expressionStatement(n));
67 const nodes = [
82 nodes.push(path.node);
84 path, babelTypes.sequenceExpression(nodes));
87 path, _liftExpressionsToStatements(path, nodes));
93 const nodes = [
100 nodes[
[all...]
/kernel/linux/linux-5.10/Documentation/sphinx/
H A DrstFlatTable.py47 from docutils import nodes namespace
104 class rowSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
105 class colSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
127 nodes.literal_block(self.block_text, self.block_text),
132 node = nodes.Element() # anonymous container for parsing
166 table = nodes.table()
167 tgroup = nodes.tgroup(cols=len(colwidths))
172 colspec = nodes
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A DrstFlatTable.py45 from docutils import nodes namespace
94 class rowSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
95 class colSpan(nodes.General, nodes.Element): pass # pylint: disable=C0103,C0321
117 nodes.literal_block(self.block_text, self.block_text),
122 node = nodes.Element() # anonymous container for parsing
156 table = nodes.table()
157 tgroup = nodes.tgroup(cols=len(colwidths))
162 colspec = nodes
[all...]
/third_party/node/deps/npm/test/lib/utils/
H A Dsbom-cyclonedx.js75 const res = cyclonedxOutput({ npm, nodes: [root], packageType: 'application' })
81 const res = cyclonedxOutput({ npm, nodes: [root], packageLockOnly: true })
88 const res = cyclonedxOutput({ npm, nodes: [node] })
96 const res = cyclonedxOutput({ npm, nodes: [node] })
104 const res = cyclonedxOutput({ npm, nodes: [node] })
112 const res = cyclonedxOutput({ npm, nodes: [node] })
119 const res = cyclonedxOutput({ npm, nodes: [node] })
126 const res = cyclonedxOutput({ npm, nodes: [node] })
133 const res = cyclonedxOutput({ npm, nodes: [node] })
141 const res = cyclonedxOutput({ npm, nodes
[all...]

Completed in 18 milliseconds

12345678910>>...33