Home
last modified time | relevance | path

Searched refs:node (Results 851 - 875 of 12430) sorted by relevance

1...<<31323334353637383940>>...498

/third_party/node/deps/v8/src/compiler/
H A Dgraph.cc11 #include "src/compiler/node-properties.h"
12 #include "src/compiler/node.h"
32 void Graph::Decorate(Node* node) { in Decorate() argument
34 decorator->Decorate(node); in Decorate()
52 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); in NewNode() local
53 Verifier::VerifyNode(node); in NewNode()
54 return node; in NewNode()
59 Node* const node = in NewNodeUnchecked() local
61 Decorate(node); in NewNodeUnchecked()
62 return node; in NewNodeUnchecked()
66 CloneNode(const Node* node) CloneNode() argument
[all...]
H A Dbranch-elimination.h12 #include "src/compiler/node-aux-data.h"
37 Reduction Reduce(Node* node) final;
41 // Also stores the node that branched on this condition.
103 Reduction ReduceBranch(Node* node);
104 Reduction ReduceDeoptimizeConditional(Node* node);
105 Reduction ReduceIf(Node* node, bool is_true_branch);
106 Reduction ReduceTrapConditional(Node* node);
107 Reduction ReduceLoop(Node* node);
108 Reduction ReduceMerge(Node* node);
109 Reduction ReduceStart(Node* node);
[all...]
/kernel/linux/linux-5.10/drivers/irqchip/
H A Dirq-csky-apb-intc.c60 static void __init ck_set_gc(struct device_node *node, void __iomem *reg_base, in ck_set_gc() argument
71 if (of_find_property(node, "csky,support-pulse-signal", NULL)) in ck_set_gc()
102 ck_intc_init_comm(struct device_node *node, struct device_node *parent) in ck_intc_init_comm() argument
111 reg_base = of_iomap(node, 0); in ck_intc_init_comm()
113 pr_err("C-SKY Intc unable to map: %p.\n", node); in ck_intc_init_comm()
117 root_domain = irq_domain_add_linear(node, nr_irq, in ck_intc_init_comm()
164 gx_intc_init(struct device_node *node, struct device_node *parent) in gx_intc_init() argument
168 ret = ck_intc_init_comm(node, parent); in gx_intc_init()
186 ck_set_gc(node, reg_base, GX_INTC_NEN31_00, 0); in gx_intc_init()
187 ck_set_gc(node, reg_bas in gx_intc_init()
231 ck_intc_init(struct device_node *node, struct device_node *parent) ck_intc_init() argument
258 ck_dual_intc_init(struct device_node *node, struct device_node *parent) ck_dual_intc_init() argument
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.c42 #define START(node) ((node)->start)
43 #define LAST(node) ((node)->last)
45 #define MAKE_NODE(node, start, end, ref_cnt, flags, err, err_out) \
47 node = usnic_uiom_interval_node_alloc(start, \
49 if (!node) { \
55 #define MARK_FOR_ADD(node, list) (list_add_tail(&node->link, list))
57 #define MAKE_NODE_AND_APPEND(node, star
108 struct usnic_uiom_interval_node *node; find_intervals_intersection_sorted() local
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dcallchain.h77 struct callchain_node node; member
147 /* Indicate valid cursor node for LBR stitch */
159 struct list_head node; member
175 INIT_LIST_HEAD(&root->node.val); in callchain_init()
176 INIT_LIST_HEAD(&root->node.parent_val); in callchain_init()
178 root->node.parent = NULL; in callchain_init()
179 root->node.hit = 0; in callchain_init()
180 root->node.children_hit = 0; in callchain_init()
181 root->node.rb_root_in = RB_ROOT; in callchain_init()
185 static inline u64 callchain_cumul_hits(struct callchain_node *node) in callchain_cumul_hits() argument
190 callchain_cumul_counts(struct callchain_node *node) callchain_cumul_counts() argument
[all...]
/kernel/linux/linux-5.10/kernel/locking/
H A Dqspinlock.c45 * (8 bytes) and needs the next pointer (another 8 bytes) of its own node to
59 * node; whereby avoiding the need to carry a node from lock to unlock, and
101 * Per-CPU queue node structures; we can never have more than 4 nested
174 * p,*,* -> n,*,* ; prev = xchg(lock, node)
180 * MCS node is properly initialized before updating the tail. in xchg_tail()
218 * p,*,* -> n,*,* ; prev = xchg(lock, node)
228 * the MCS node is properly initialized before updating the in xchg_tail()
272 static __always_inline void __pv_init_node(struct mcs_spinlock *node) { } in __pv_init_node() argument
273 static __always_inline void __pv_wait_node(struct mcs_spinlock *node, in __pv_wait_node() argument
275 __pv_kick_node(struct qspinlock *lock, struct mcs_spinlock *node) __pv_kick_node() argument
277 __pv_wait_head_or_lock(struct qspinlock *lock, struct mcs_spinlock *node) __pv_wait_head_or_lock() argument
317 struct mcs_spinlock *prev, *next, *node; queued_spin_lock_slowpath() local
[all...]
/kernel/linux/linux-6.6/kernel/locking/
H A Dqspinlock.c46 * (8 bytes) and needs the next pointer (another 8 bytes) of its own node to
60 * node; whereby avoiding the need to carry a node from lock to unlock, and
102 * Per-CPU queue node structures; we can never have more than 4 nested
175 * p,*,* -> n,*,* ; prev = xchg(lock, node)
181 * MCS node is properly initialized before updating the tail. in xchg_tail()
219 * p,*,* -> n,*,* ; prev = xchg(lock, node)
229 * the MCS node is properly initialized before updating the in xchg_tail()
273 static __always_inline void __pv_init_node(struct mcs_spinlock *node) { } in __pv_init_node() argument
274 static __always_inline void __pv_wait_node(struct mcs_spinlock *node, in __pv_wait_node() argument
276 __pv_kick_node(struct qspinlock *lock, struct mcs_spinlock *node) __pv_kick_node() argument
278 __pv_wait_head_or_lock(struct qspinlock *lock, struct mcs_spinlock *node) __pv_wait_head_or_lock() argument
318 struct mcs_spinlock *prev, *next, *node; queued_spin_lock_slowpath() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/
H A Di915_vma_resource.c300 struct i915_vma_resource *node; in i915_vma_resource_bind_dep_sync() local
307 node = vma_res_itree_iter_first(&vm->pending_unbind, offset, last); in i915_vma_resource_bind_dep_sync()
308 while (node) { in i915_vma_resource_bind_dep_sync()
309 int ret = dma_fence_wait(&node->unbind_fence, intr); in i915_vma_resource_bind_dep_sync()
314 node = vma_res_itree_iter_next(node, offset, last); in i915_vma_resource_bind_dep_sync()
332 struct i915_vma_resource *node; in i915_vma_resource_bind_dep_sync_all() local
338 node = vma_res_itree_iter_first(&vm->pending_unbind, 0, in i915_vma_resource_bind_dep_sync_all()
340 if (node) in i915_vma_resource_bind_dep_sync_all()
341 fence = dma_fence_get_rcu(&node in i915_vma_resource_bind_dep_sync_all()
386 struct i915_vma_resource *node; i915_vma_resource_bind_dep_await() local
[all...]
/kernel/linux/linux-6.6/drivers/irqchip/
H A Dirq-csky-apb-intc.c60 static void __init ck_set_gc(struct device_node *node, void __iomem *reg_base, in ck_set_gc() argument
71 if (of_property_read_bool(node, "csky,support-pulse-signal")) in ck_set_gc()
102 ck_intc_init_comm(struct device_node *node, struct device_node *parent) in ck_intc_init_comm() argument
111 reg_base = of_iomap(node, 0); in ck_intc_init_comm()
113 pr_err("C-SKY Intc unable to map: %p.\n", node); in ck_intc_init_comm()
117 root_domain = irq_domain_add_linear(node, nr_irq, in ck_intc_init_comm()
164 gx_intc_init(struct device_node *node, struct device_node *parent) in gx_intc_init() argument
168 ret = ck_intc_init_comm(node, parent); in gx_intc_init()
186 ck_set_gc(node, reg_base, GX_INTC_NEN31_00, 0); in gx_intc_init()
187 ck_set_gc(node, reg_bas in gx_intc_init()
231 ck_intc_init(struct device_node *node, struct device_node *parent) ck_intc_init() argument
258 ck_dual_intc_init(struct device_node *node, struct device_node *parent) ck_dual_intc_init() argument
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.c42 #define START(node) ((node)->start)
43 #define LAST(node) ((node)->last)
45 #define MAKE_NODE(node, start, end, ref_cnt, flags, err, err_out) \
47 node = usnic_uiom_interval_node_alloc(start, \
49 if (!node) { \
55 #define MARK_FOR_ADD(node, list) (list_add_tail(&node->link, list))
57 #define MAKE_NODE_AND_APPEND(node, star
108 struct usnic_uiom_interval_node *node; find_intervals_intersection_sorted() local
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dcallchain.h77 struct callchain_node node; member
147 /* Indicate valid cursor node for LBR stitch */
159 struct list_head node; member
173 INIT_LIST_HEAD(&root->node.val); in callchain_init()
174 INIT_LIST_HEAD(&root->node.parent_val); in callchain_init()
176 root->node.parent = NULL; in callchain_init()
177 root->node.hit = 0; in callchain_init()
178 root->node.children_hit = 0; in callchain_init()
179 root->node.rb_root_in = RB_ROOT; in callchain_init()
183 static inline u64 callchain_cumul_hits(struct callchain_node *node) in callchain_cumul_hits() argument
188 callchain_cumul_counts(struct callchain_node *node) callchain_cumul_counts() argument
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dindex.js106 // Get the actual nodes corresponding to a root node's child workspaces,
124 const node = tree.inventory.get(loc)
126 if (!node) {
131 nodes.push(node)
151 for (const node of wsDepSet) {
152 for (const edge of node.edgesOut.values()) {
161 for (const child of node.children.values()) {
180 visit: node => {
181 for (const { to } of node.edgesOut.values()) {
191 return node
[all...]
/third_party/protobuf/csharp/src/Google.Protobuf/
H A DFieldMaskTree.cs42 /// <para>A tree representation of a FieldMask. Each leaf node in this tree represent
96 /// exists, which will turn the tree node for "foo.bar" to a leaf node.
97 /// Likewise, if the field path to add is a sub-path of an existing leaf node,
108 var node = root; in AddFieldPath()
111 // Find the matching node in the tree. in AddFieldPath()
114 // Check whether the path matches an existing leaf node. in AddFieldPath()
116 && node != root in AddFieldPath()
117 && node.Children.Count == 0) in AddFieldPath()
119 // The path to add is a sub-path of an existing leaf node in AddFieldPath()
170 GetFieldPaths(Node node, string path, List<string> paths) GetFieldPaths() argument
249 Merge( Node node, string path, IMessage source, IMessage destination, FieldMask.MergeOptions options) Merge() argument
[all...]
/kernel/linux/linux-5.10/arch/alpha/kernel/
H A Dgct.c14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
20 if (node->magic != GCT_NODE_MAGIC) { in gct6_find_nodes()
29 if (node->type != wanted->type) in gct6_find_nodes()
31 if (node->subtype != wanted->subtype) in gct6_find_nodes()
36 wanted->callout(node); in gct6_find_nodes()
40 if (node->next) in gct6_find_nodes()
41 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); in gct6_find_nodes()
44 if (node->child) in gct6_find_nodes()
45 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); in gct6_find_nodes()
/kernel/linux/linux-6.6/arch/alpha/kernel/
H A Dgct.c14 gct6_find_nodes(gct6_node *node, gct6_search_struct *search) in gct6_find_nodes() argument
20 if (node->magic != GCT_NODE_MAGIC) { in gct6_find_nodes()
29 if (node->type != wanted->type) in gct6_find_nodes()
31 if (node->subtype != wanted->subtype) in gct6_find_nodes()
36 wanted->callout(node); in gct6_find_nodes()
40 if (node->next) in gct6_find_nodes()
41 status |= gct6_find_nodes(GCT_NODE_PTR(node->next), search); in gct6_find_nodes()
44 if (node->child) in gct6_find_nodes()
45 status |= gct6_find_nodes(GCT_NODE_PTR(node->child), search); in gct6_find_nodes()
/third_party/jinja2/
H A Doptimizer.py19 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
33 node = super().generic_visit(node, *args, **kwargs)
37 if isinstance(node, nodes.Expr):
40 node.as_const(args[0] if args else None),
41 lineno=node.lineno,
47 return node
/third_party/python/Lib/lib2to3/fixes/
H A Dfix_unicode.py24 def transform(self, node, results):
25 if node.type == token.NAME:
26 new = node.clone()
27 new.value = _mapping[node.value]
29 elif node.type == token.STRING:
30 val = node.value
38 if val == node.value:
39 return node
40 new = node.clone()
H A Dfix_urllib.py76 def transform_import(self, node, results):
92 def transform_member(self, node, results):
103 # this may be a list of length one, or just a node
114 self.cannot_convert(node, "This is an invalid module element")
138 indentation = find_indentation(node)
155 if not first or node.parent.prefix.endswith(indentation):
164 node.replace(nodes)
166 self.cannot_convert(node, "All module elements are invalid")
168 def transform_dot(self, node, results):
183 self.cannot_convert(node, "Thi
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DRemoveAtomicCounterBuiltins.cpp19 bool IsAtomicCounterDecl(const TIntermDeclaration *node) in IsAtomicCounterDecl() argument
21 const TIntermSequence &sequence = *(node->getSequence()); in IsAtomicCounterDecl()
34 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override
40 ASSERT(!IsAtomicCounterDecl(node));
44 bool visitAggregate(Visit visit, TIntermAggregate *node) override
46 if (node->getOp() == EOpMemoryBarrierAtomicCounter)
51 mMultiReplacements.emplace_back(getParentNode()->getAsBlock(), node,
59 ASSERT(!(BuiltInGroup::IsBuiltIn(node->getOp()) &&
60 node->getFunction()->isAtomicCounterFunction()));
/third_party/node/deps/cares/src/lib/
H A Dares__addrinfo_localhost.c61 struct ares_addrinfo_node *node; in ares_append_ai_node() local
63 node = ares__append_addrinfo_node(nodes); in ares_append_ai_node()
64 if (!node) { in ares_append_ai_node()
68 memset(node, 0, sizeof(*node)); in ares_append_ai_node()
81 node->ai_addr = (struct sockaddr *)sin; in ares_append_ai_node()
82 node->ai_family = AF_INET; in ares_append_ai_node()
83 node->ai_addrlen = sizeof(*sin); in ares_append_ai_node()
84 node->ai_addr = (struct sockaddr *)sin; in ares_append_ai_node()
85 node in ares_append_ai_node()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dflat_hash_set_test.cc111 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() local
112 EXPECT_TRUE(node); in TEST()
113 EXPECT_THAT(node.value(), Pointee(7)); in TEST()
116 auto insert_result = set2.insert(std::move(node)); in TEST()
117 EXPECT_FALSE(node); in TEST()
119 EXPECT_TRUE(insert_result.node); in TEST()
120 EXPECT_THAT(insert_result.node.value(), Pointee(7)); in TEST()
122 EXPECT_NE(insert_result.position->get(), insert_result.node.value().get()); in TEST()
125 node = set1.extract(absl::make_unique<int>(17)); in TEST()
126 EXPECT_TRUE(node); in TEST()
[all...]
H A Dnode_hash_set_test.cc76 auto node = set1.extract(absl::make_unique<int>(7)); in TEST() local
77 EXPECT_TRUE(node); in TEST()
78 EXPECT_THAT(node.value(), Pointee(7)); in TEST()
81 auto insert_result = set2.insert(std::move(node)); in TEST()
82 EXPECT_FALSE(node); in TEST()
84 EXPECT_TRUE(insert_result.node); in TEST()
85 EXPECT_THAT(insert_result.node.value(), Pointee(7)); in TEST()
87 EXPECT_NE(insert_result.position->get(), insert_result.node.value().get()); in TEST()
90 node = set1.extract(absl::make_unique<int>(17)); in TEST()
91 EXPECT_TRUE(node); in TEST()
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Dnsarguments.c45 if (!info->predefined || (info->node->flags & ANOBJ_EVALUATED)) { in acpi_ns_check_argument_types()
72 info->node->flags |= ANOBJ_EVALUATED; in acpi_ns_check_argument_types()
81 * PARAMETERS: pathname - Full pathname to the node (for error msgs)
82 * node - Namespace node for the method/object
95 struct acpi_namespace_node *node, in acpi_ns_check_acpi_compliance()
101 if (!predefined || (node->flags & ANOBJ_EVALUATED)) { in acpi_ns_check_acpi_compliance()
114 if (node->type != ACPI_TYPE_METHOD) { in acpi_ns_check_acpi_compliance()
122 acpi_ut_get_type_name(node-> in acpi_ns_check_acpi_compliance()
134 acpi_ut_get_type_name(node in acpi_ns_check_acpi_compliance()
94 acpi_ns_check_acpi_compliance(char *pathname, struct acpi_namespace_node *node, const union acpi_predefined_info *predefined) acpi_ns_check_acpi_compliance() argument
187 acpi_ns_check_argument_count(char *pathname, struct acpi_namespace_node *node, u32 user_param_count, const union acpi_predefined_info *predefined) acpi_ns_check_argument_count() argument
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Dnsarguments.c45 if (!info->predefined || (info->node->flags & ANOBJ_EVALUATED)) { in acpi_ns_check_argument_types()
72 info->node->flags |= ANOBJ_EVALUATED; in acpi_ns_check_argument_types()
81 * PARAMETERS: pathname - Full pathname to the node (for error msgs)
82 * node - Namespace node for the method/object
95 struct acpi_namespace_node *node, in acpi_ns_check_acpi_compliance()
101 if (!predefined || (node->flags & ANOBJ_EVALUATED)) { in acpi_ns_check_acpi_compliance()
114 if (node->type != ACPI_TYPE_METHOD) { in acpi_ns_check_acpi_compliance()
122 acpi_ut_get_type_name(node-> in acpi_ns_check_acpi_compliance()
134 acpi_ut_get_type_name(node in acpi_ns_check_acpi_compliance()
94 acpi_ns_check_acpi_compliance(char *pathname, struct acpi_namespace_node *node, const union acpi_predefined_info *predefined) acpi_ns_check_acpi_compliance() argument
187 acpi_ns_check_argument_count(char *pathname, struct acpi_namespace_node *node, u32 user_param_count, const union acpi_predefined_info *predefined) acpi_ns_check_argument_count() argument
[all...]
/kernel/linux/linux-6.6/drivers/acpi/arm64/
H A Dapmt.c27 struct acpi_apmt_node *node) in apmt_init_resources()
32 res[num_res].start = node->base_address0; in apmt_init_resources()
33 res[num_res].end = node->base_address0 + SZ_4K - 1; in apmt_init_resources()
38 if (node->flags & ACPI_APMT_FLAGS_DUAL_PAGE) { in apmt_init_resources()
39 res[num_res].start = node->base_address1; in apmt_init_resources()
40 res[num_res].end = node->base_address1 + SZ_4K - 1; in apmt_init_resources()
46 if (node->ovflw_irq != 0) { in apmt_init_resources()
47 trigger = (node->ovflw_irq_flags & ACPI_APMT_OVFLW_IRQ_FLAGS_MODE); in apmt_init_resources()
50 irq = acpi_register_gsi(NULL, node->ovflw_irq, trigger, in apmt_init_resources()
69 * apmt_add_platform_device() - Allocate a platform device for APMT node
26 apmt_init_resources(struct resource *res, struct acpi_apmt_node *node) apmt_init_resources() argument
75 apmt_add_platform_device(struct acpi_apmt_node *node, struct fwnode_handle *fwnode) apmt_add_platform_device() argument
[all...]

Completed in 11 milliseconds

1...<<31323334353637383940>>...498