Home
last modified time | relevance | path

Searched refs:node (Results 1076 - 1100 of 12430) sorted by relevance

1...<<41424344454647484950>>...498

/third_party/lwip/src/apps/snmp/
H A Dsnmp_mib2_udp.c52 static const struct snmp_threadsync_node node_name ## _synced = SNMP_CREATE_THREAD_SYNC_NODE(oid, &node_name.node, &snmp_mib2_lwip_locks);
65 switch (instance->node->oid) { in udp_get_value()
93 LWIP_DEBUGF(SNMP_MIB_DEBUG, ("udp_get_value(): unknown id: %"S32_F"\n", instance->node->oid)); in udp_get_value()
232 /* set reference to PCB local IP and return a generic node that copies IP4 addresses */ in udp_Table_get_cell_value_core()
236 /* set reference to PCB local port and return a generic node that copies u16_t values */ in udp_Table_get_cell_value_core()
356 &SYNC_NODE_NAME(udp_inDatagrams).node.node,
357 &SYNC_NODE_NAME(udp_noPorts).node.node,
358 &SYNC_NODE_NAME(udp_inErrors).node
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dinstr.c83 /* update add node src to use pipeline reg */ in ppir_instr_insert_mul_node()
102 /* update mul node dest to output to pipeline reg */ in ppir_instr_insert_mul_node()
152 /* make alu node src reflact the pipeline reg */
177 bool ppir_instr_insert_node(ppir_instr *instr, ppir_node *node) in ppir_instr_insert_node() argument
179 if (node->op == ppir_op_const) { in ppir_instr_insert_node()
181 ppir_const_node *c = ppir_node_to_const(node); in ppir_instr_insert_node()
190 ppir_node *succ = ppir_node_first_succ(node); in ppir_instr_insert_node()
194 if (src->node != node) in ppir_instr_insert_node()
211 int *slots = ppir_op_infos[node in ppir_instr_insert_node()
288 ppir_node *node = instr->slots[i]; ppir_instr_print_list() local
[all...]
/third_party/skia/third_party/externals/tint/tools/src/cmd/check-spec-examples/
H A Dmain.go241 // gatherExamples scans the HTML node and its children for blocks that contain
243 func gatherExamples(node *html.Node, examples *[]example) error {
244 if hasClass(node, "example") && hasClass(node, "wgsl") {
246 name: nodeID(node),
247 code: exampleCode(node),
248 globalScope: hasClass(node, "global-scope"),
249 functionScope: hasClass(node, "function-scope"),
250 expectError: hasClass(node, "expect-error"),
257 for child := node
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/exynos/
H A Dexynos_drm_g2d.c144 * processed node is finished.
271 struct g2d_cmdlist_node *node; in g2d_init_cmdlist() local
287 node = kcalloc(G2D_CMDLIST_NUM, sizeof(*node), GFP_KERNEL); in g2d_init_cmdlist()
288 if (!node) { in g2d_init_cmdlist()
296 node[nr].cmdlist = in g2d_init_cmdlist()
298 node[nr].dma_addr = in g2d_init_cmdlist()
301 buf_info = &node[nr].buf_info; in g2d_init_cmdlist()
305 list_add_tail(&node[nr].list, &g2d->free_cmdlist); in g2d_init_cmdlist()
332 struct g2d_cmdlist_node *node; in g2d_get_cmdlist() local
349 g2d_put_cmdlist(struct g2d_data *g2d, struct g2d_cmdlist_node *node) g2d_put_cmdlist() argument
356 g2d_add_cmdlist_to_inuse(struct drm_exynos_file_private *file_priv, struct g2d_cmdlist_node *node) g2d_add_cmdlist_to_inuse() argument
686 g2d_map_cmdlist_gem(struct g2d_data *g2d, struct g2d_cmdlist_node *node, struct drm_device *drm_dev, struct drm_file *file) g2d_map_cmdlist_gem() argument
773 g2d_unmap_cmdlist_gem(struct g2d_data *g2d, struct g2d_cmdlist_node *node, struct drm_file *filp) g2d_unmap_cmdlist_gem() argument
807 struct g2d_cmdlist_node *node = g2d_dma_start() local
832 struct g2d_cmdlist_node *node; g2d_free_runqueue_node() local
856 struct g2d_runqueue_node *node, *n; g2d_remove_runqueue_nodes() local
1020 g2d_check_reg_offset(struct g2d_data *g2d, struct g2d_cmdlist_node *node, int nr, bool for_addr) g2d_check_reg_offset() argument
1145 struct g2d_cmdlist_node *node; exynos_g2d_set_cmdlist_ioctl() local
1361 struct g2d_cmdlist_node *node, *n; g2d_close() local
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/exynos/
H A Dexynos_drm_g2d.c145 * processed node is finished.
273 struct g2d_cmdlist_node *node; in g2d_init_cmdlist() local
289 node = kcalloc(G2D_CMDLIST_NUM, sizeof(*node), GFP_KERNEL); in g2d_init_cmdlist()
290 if (!node) { in g2d_init_cmdlist()
298 node[nr].cmdlist = in g2d_init_cmdlist()
300 node[nr].dma_addr = in g2d_init_cmdlist()
303 buf_info = &node[nr].buf_info; in g2d_init_cmdlist()
307 list_add_tail(&node[nr].list, &g2d->free_cmdlist); in g2d_init_cmdlist()
334 struct g2d_cmdlist_node *node; in g2d_get_cmdlist() local
351 g2d_put_cmdlist(struct g2d_data *g2d, struct g2d_cmdlist_node *node) g2d_put_cmdlist() argument
358 g2d_add_cmdlist_to_inuse(struct drm_exynos_file_private *file_priv, struct g2d_cmdlist_node *node) g2d_add_cmdlist_to_inuse() argument
681 g2d_map_cmdlist_gem(struct g2d_data *g2d, struct g2d_cmdlist_node *node, struct drm_device *drm_dev, struct drm_file *file) g2d_map_cmdlist_gem() argument
768 g2d_unmap_cmdlist_gem(struct g2d_data *g2d, struct g2d_cmdlist_node *node, struct drm_file *filp) g2d_unmap_cmdlist_gem() argument
802 struct g2d_cmdlist_node *node = g2d_dma_start() local
827 struct g2d_cmdlist_node *node; g2d_free_runqueue_node() local
851 struct g2d_runqueue_node *node, *n; g2d_remove_runqueue_nodes() local
1023 g2d_check_reg_offset(struct g2d_data *g2d, struct g2d_cmdlist_node *node, int nr, bool for_addr) g2d_check_reg_offset() argument
1148 struct g2d_cmdlist_node *node; exynos_g2d_set_cmdlist_ioctl() local
1364 struct g2d_cmdlist_node *node, *n; g2d_close() local
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmap.h377 // 5. The trees' payload type is pointer to linked-list node. Tree-converting
575 Node* node = static_cast<Node*>(table_[b]); in clear() local
578 Node* next = node->next; in clear()
579 DestroyNode(node); in clear()
580 node = next; in clear()
581 } while (node != nullptr); in clear()
588 Node* node = NodeFromTreeIterator(tree_it); in clear() local
592 DestroyNode(node); in clear()
628 Node* node; in insert() local
630 node in insert()
691 Node* node = static_cast<Node*>(table_[b]); FindHelper() local
716 InsertUnique(size_type b, Node* node) InsertUnique() argument
752 ShouldInsertAfterHead(void* node) ShouldInsertAfterHead() argument
763 InsertUniqueInList(size_type b, Node* node) InsertUniqueInList() argument
778 InsertUniqueInTree(size_type b, Node* node) InsertUniqueInTree() argument
848 Node* node = static_cast<Node*>(table[index]); TransferList() local
915 Node* node = static_cast<Node*>(table_[b]); CopyListToTree() local
931 Node* node = static_cast<Node*>(table_[b]); TableEntryIsTooLong() local
976 DestroyNode(Node* node) DestroyNode() argument
[all...]
/third_party/ffmpeg/libavcodec/
H A Dvp6.c236 int comp, node; in vp6_parse_vector_models() local
246 for (node=0; node<7; node++) in vp6_parse_vector_models()
247 if (vp56_rac_get_prob_branchy(c, vp6_pdv_pct[comp][node])) in vp6_parse_vector_models()
248 model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7); in vp6_parse_vector_models()
251 for (node=0; node<8; node++) in vp6_parse_vector_models()
252 if (vp56_rac_get_prob_branchy(c, vp6_fdv_pct[comp][node])) in vp6_parse_vector_models()
290 int node, cg, ctx, pos; vp6_parse_coeff_models() local
[all...]
/kernel/linux/linux-5.10/arch/c6x/platforms/
H A Demif.c44 struct device_node *node; in c6x_emifa_init() local
49 node = of_find_matching_node(NULL, emifa_match); in c6x_emifa_init()
50 if (!node) in c6x_emifa_init()
53 regs = of_iomap(node, 0); in c6x_emifa_init()
58 err = of_property_read_u32_array(node, "ti,dscr-dev-enable", &val, 1); in c6x_emifa_init()
63 p = of_get_property(node, "ti,emifa-ce-config", &len); in c6x_emifa_init()
72 err = of_property_read_u32_array(node, "ti,emifa-burst-priority", &val, 1); in c6x_emifa_init()
76 err = of_property_read_u32_array(node, "ti,emifa-async-wait-control", &val, 1); in c6x_emifa_init()
81 of_node_put(node); in c6x_emifa_init()
/kernel/linux/linux-5.10/arch/arm64/kernel/
H A Dacpi_numa.c14 * are in one chunk. Holes between them will be included in the node.
52 int cpu, pxm, node; in acpi_parse_gicc_pxm() local
65 node = pxm_to_node(pxm); in acpi_parse_gicc_pxm()
77 acpi_early_node_map[cpu] = node; in acpi_parse_gicc_pxm()
79 cpu_logical_map(cpu), node); in acpi_parse_gicc_pxm()
94 int pxm, node; in acpi_numa_gicc_affinity_init() local
110 node = acpi_map_pxm_to_node(pxm); in acpi_numa_gicc_affinity_init()
112 if (node == NUMA_NO_NODE || node >= MAX_NUMNODES) { in acpi_numa_gicc_affinity_init()
118 node_set(node, numa_nodes_parse in acpi_numa_gicc_affinity_init()
[all...]
/kernel/linux/linux-6.6/kernel/module/
H A Dtree_lookup.c24 struct module_memory *mod_mem = container_of(n, struct module_memory, mtn.node); in __mod_tree_val()
31 struct module_memory *mod_mem = container_of(n, struct module_memory, mtn.node); in __mod_tree_size()
64 static noinline void __mod_tree_insert(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_insert() argument
66 latch_tree_insert(&node->node, &tree->root, &mod_tree_ops); in __mod_tree_insert()
69 static void __mod_tree_remove(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_remove() argument
71 latch_tree_erase(&node->node, &tree->root, &mod_tree_ops); in __mod_tree_remove()
111 return container_of(ltn, struct mod_tree_node, node)->mod; in mod_find()
/third_party/node/deps/v8/third_party/jinja2/
H A Dmeta.py68 for node in ast.find_all(
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
74 for template_name in node.template.items:
88 if isinstance(node.template.value, string_types):
89 yield node.template.value
93 elif isinstance(node, nodes.Include) and isinstance(
94 node.template.value, (tuple, list)
96 for template_name in node.template.value:
/third_party/node/test/addons/report-api/
H A Dbinding.cc1 #include <node.h>
14 node::TriggerNodeReport( in TriggerReport()
19 node::TriggerNodeReport(static_cast<Isolate*>(nullptr), in TriggerReportNoIsolate()
29 node::TriggerNodeReport( in TriggerReportEnv()
30 node::GetCurrentEnvironment(isolate->GetCurrentContext()), in TriggerReportEnv()
38 node::TriggerNodeReport(static_cast<node::Environment*>(nullptr), in TriggerReportNoEnv()
51 node::TriggerNodeReport( in TriggerReportNoContext()
65 node::TriggerNodeReport( in TriggerReportNewContext()
/third_party/node/tools/inspector_protocol/jinja2/
H A Dmeta.py75 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
77 if not isinstance(node.template, nodes.Const):
79 if isinstance(node.template, (nodes.Tuple, nodes.List)):
80 for template_name in node.template.items:
94 if isinstance(node.template.value, string_types):
95 yield node.template.value
99 elif isinstance(node, nodes.Include) and \
100 isinstance(node.template.value, (tuple, list)):
101 for template_name in node.template.value:
/third_party/node/deps/cares/src/lib/
H A Dares_destroy.c38 ares__llist_node_t *node = NULL; in ares_destroy() local
48 node = ares__llist_node_first(channel->all_queries); in ares_destroy()
49 while (node != NULL) { in ares_destroy()
50 ares__llist_node_t *next = ares__llist_node_next(node); in ares_destroy()
51 struct query *query = ares__llist_node_claim(node); in ares_destroy()
57 node = next; in ares_destroy()
127 ares__slist_node_t *node; in ares__destroy_servers_state() local
129 while ((node = ares__slist_node_first(channel->servers)) != NULL) { in ares__destroy_servers_state()
130 struct server_state *server = ares__slist_node_claim(node); in ares__destroy_servers_state()
/third_party/python/Tools/peg_generator/pegen/
H A Dgrammar_visualizer.py15 def children(self, node: Rule) -> Iterator[Any]:
16 for value in node:
22 def name(self, node: Rule) -> str:
23 if not list(self.children(node)):
24 return repr(node)
25 return node.__class__.__name__
31 def print_nodes_recursively(self, node: Rule, prefix: str = "", istail: bool = True) -> str:
33 children = list(self.children(node))
34 value = self.name(node)
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DShaderStorageBlockOutputHLSL.h51 void outputStoreFunctionCallPrefix(TIntermTyped *node);
53 void outputLoadFunctionCall(TIntermTyped *node);
55 void outputLengthFunctionCall(TIntermTyped *node);
57 void outputAtomicMemoryFunctionCallPrefix(TIntermTyped *node, TOperator op);
62 void traverseSSBOAccess(TIntermTyped *node, SSBOMethod method);
64 TIntermTyped *node,
66 int getMatrixStride(TIntermTyped *node,
71 TIntermBinary *node,
75 void collectShaderStorageBlocks(TIntermTyped *node);
/third_party/skia/third_party/externals/jinja2/
H A Dmeta.py68 for node in ast.find_all(
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
74 for template_name in node.template.items:
88 if isinstance(node.template.value, string_types):
89 yield node.template.value
93 elif isinstance(node, nodes.Include) and isinstance(
94 node.template.value, (tuple, list)
96 for template_name in node.template.value:
/third_party/typescript/tests/baselines/reference/
H A DinferenceDoesNotAddUndefinedOrNull.js5 forEachChild<T>(cbNode: (node: Node) => T | undefined, cbNodeArray?: (nodes: NodeArray<Node>) => T | undefined): T | undefined;
11 function flatMapChildren<T>(node: Node, cb: (child: Node) => readonly T[] | T | undefined): readonly T[] {
13 node.forEachChild(child => {
22 function flatMapChildren2<T>(node: Node, cb: (child: Node) => readonly T[] | T | null): readonly T[] {
24 node.forEachChild(child => {
36 function flatMapChildren(node, cb) {
38 node.forEachChild(function (child) {
46 function flatMapChildren2(node, cb) {
48 node.forEachChild(function (child) {
/third_party/skia/modules/sksg/src/
H A DSkSGGroup.cpp38 void Group::addChild(sk_sp<RenderNode> node) { in addChild() argument
41 if (child == node) { in addChild()
46 this->observeInval(node); in addChild()
47 fChildren.push_back(std::move(node)); in addChild()
52 void Group::removeChild(const sk_sp<RenderNode>& node) { in removeChild() argument
54 fChildren.erase(std::remove(fChildren.begin(), fChildren.end(), node), fChildren.end()); in removeChild()
57 this->unobserveInval(node); in removeChild()
73 if (const auto* node = (*it)->nodeAt(p)) { in onNodeAt()
74 return node; in onNodeAt()
/device/soc/rockchip/common/vendor/drivers/gpu/arm/mali400/mali/linux/
H A Dmali_memory.h56 * mmap syscalls on the Mali device node will end up here.
64 * Called when a process opens the Mali device node.
72 * Called when a process closes the Mali device node.
131 void _mali_page_node_ref(struct mali_page_node *node);
132 void _mali_page_node_unref(struct mali_page_node *node);
133 void _mali_page_node_add_page(struct mali_page_node *node, struct page *page);
135 void _mali_page_node_add_block_item(struct mali_page_node *node, mali_block_item *item);
137 void _mali_page_node_add_swap_item(struct mali_page_node *node, struct mali_swap_item *item);
139 int mali_page_node_get_ref_count(struct mali_page_node *node);
140 dma_addr_t _mali_page_node_get_dma_addr(struct mali_page_node *node);
[all...]
/device/soc/rockchip/common/kernel/drivers/gpu/arm/mali400/mali/linux/
H A Dmali_memory.h55 * mmap syscalls on the Mali device node will end up here.
63 * Called when a process opens the Mali device node.
71 * Called when a process closes the Mali device node.
131 void _mali_page_node_ref(struct mali_page_node *node);
132 void _mali_page_node_unref(struct mali_page_node *node);
133 void _mali_page_node_add_page(struct mali_page_node *node, struct page *page);
135 void _mali_page_node_add_block_item(struct mali_page_node *node, mali_block_item *item);
137 void _mali_page_node_add_swap_item(struct mali_page_node *node, struct mali_swap_item *item);
139 int _mali_page_node_get_ref_count(struct mali_page_node *node);
140 dma_addr_t _mali_page_node_get_dma_addr(struct mali_page_node *node);
[all...]
/kernel/linux/linux-5.10/arch/ia64/kernel/
H A Dnuma.c33 /* we don't have cpu-driven node hot add yet... in map_cpu_to_node()
34 In usual case, node is created from SRAT at boot time. */ in map_cpu_to_node()
52 * build_cpu_to_node_map - setup cpu to node and node to cpumask arrays
54 * Build cpu to node mapping and initialize the per node cpu masks using
59 int cpu, i, node; in build_cpu_to_node_map() local
61 for(node=0; node < MAX_NUMNODES; node in build_cpu_to_node_map()
[all...]
/kernel/linux/linux-5.10/arch/mips/include/asm/netlogic/
H A Dcommon.h57 #include <asm/mach-netlogic/multi-node.h>
94 uint64_t nlm_pci_irqmask(int node);
95 void nlm_setup_pic_irq(int node, int picirq, int irq, int irt);
96 void nlm_set_pic_extra_ack(int node, int irq, void (*xack)(struct irq_data *));
99 void nlm_dispatch_msi(int node, int lirq);
100 void nlm_dispatch_msix(int node, int msixirq);
106 static inline int nlm_irq_to_xirq(int node, int irq) in nlm_irq_to_xirq() argument
108 return node * NR_IRQS / NLM_NR_NODES + irq; in nlm_irq_to_xirq()
/kernel/linux/linux-6.6/arch/ia64/kernel/
H A Dnuma.c33 /* we don't have cpu-driven node hot add yet... in map_cpu_to_node()
34 In usual case, node is created from SRAT at boot time. */ in map_cpu_to_node()
52 * build_cpu_to_node_map - setup cpu to node and node to cpumask arrays
54 * Build cpu to node mapping and initialize the per node cpu masks using
59 int cpu, i, node; in build_cpu_to_node_map() local
61 for(node=0; node < MAX_NUMNODES; node in build_cpu_to_node_map()
[all...]
/kernel/linux/linux-5.10/drivers/usb/core/
H A Dof.c15 * usb_of_get_device_node() - get a USB device node
19 * Look up the node of a USB device given its parent hub device and one-based
22 * Return: A pointer to the node with incremented refcount if found, or
27 struct device_node *node; in usb_of_get_device_node() local
30 for_each_child_of_node(hub->dev.of_node, node) { in usb_of_get_device_node()
31 if (of_property_read_u32(node, "reg", &reg)) in usb_of_get_device_node()
35 return node; in usb_of_get_device_node()
43 * usb_of_has_combined_node() - determine whether a device has a combined node
46 * Determine whether a USB device has a so called combined node which is
48 * has a node an
94 struct device_node *node; usb_of_get_interface_node() local
[all...]

Completed in 14 milliseconds

1...<<41424344454647484950>>...498