Home
last modified time | relevance | path

Searched refs:node (Results 801 - 825 of 12430) sorted by relevance

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

/third_party/musl/libc-test/src/functionalext/supplement/network/network_gtest/
H A Dnetdb_test.cpp126 char node[BUFSIZ]; in HWTEST_F() local
127 memset(&node, 0, sizeof(node)); in HWTEST_F()
130 int result = getnameinfo(sa, plumb, node, sizeof(node), nullptr, 0, NI_NUMERICHOST); in HWTEST_F()
132 EXPECT_STREQ("0.0.0.0", node); in HWTEST_F()
138 * it in the "node" buffer. In this case, the expected result is "0.0.0.0".
146 char node[BUFSIZ]; in HWTEST_F() local
147 memset(&node, 0, sizeof(node)); in HWTEST_F()
166 char node[BUFSIZ]; HWTEST_F() local
185 char node[BUFSIZ]; HWTEST_F() local
205 char node[BUFSIZ]; HWTEST_F() local
225 char node[BUFSIZ]; HWTEST_F() local
[all...]
/kernel/linux/linux-5.10/arch/arm/mach-exynos/
H A Dexynos.c50 struct device_node *node; in exynos_sysram_init() local
52 for_each_compatible_node(node, NULL, "samsung,exynos4210-sysram") { in exynos_sysram_init()
53 if (!of_device_is_available(node)) in exynos_sysram_init()
55 sysram_base_addr = of_iomap(node, 0); in exynos_sysram_init()
56 sysram_base_phys = of_translate_address(node, in exynos_sysram_init()
57 of_get_address(node, 0, NULL, NULL)); in exynos_sysram_init()
58 of_node_put(node); in exynos_sysram_init()
62 for_each_compatible_node(node, NULL, "samsung,exynos4210-sysram-ns") { in exynos_sysram_init()
63 if (!of_device_is_available(node)) in exynos_sysram_init()
65 sysram_ns_base_addr = of_iomap(node, in exynos_sysram_init()
71 exynos_fdt_map_chipid(unsigned long node, const char *uname, int depth, void *data) exynos_fdt_map_chipid() argument
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Devmisc.c25 * PARAMETERS: node - Node to check
29 * DESCRIPTION: Check type of node for a object that supports notifies.
31 * TBD: This could be replaced by a flag bit in the node.
35 u8 acpi_ev_is_notify_object(struct acpi_namespace_node *node) in acpi_ev_is_notify_object() argument
38 switch (node->type) { in acpi_ev_is_notify_object()
57 * PARAMETERS: node - NS node for the notified object
68 acpi_ev_queue_notify_request(struct acpi_namespace_node *node, u32 notify_value) in acpi_ev_queue_notify_request() argument
80 if (!acpi_ev_is_notify_object(node)) { in acpi_ev_queue_notify_request()
94 obj_desc = acpi_ns_get_attached_object(node); in acpi_ev_queue_notify_request()
[all...]
/kernel/linux/linux-5.10/scripts/gdb/linux/
H A Dlists.py30 node = head['next'].dereference()
31 while node.address != head.address:
32 yield node.address
33 node = node['next'].dereference()
37 for node in list_for_each(head):
38 yield utils.container_of(node, gdbtype, member)
48 node = head['first'].dereference()
49 while node.address:
50 yield node
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Devmisc.c25 * PARAMETERS: node - Node to check
29 * DESCRIPTION: Check type of node for a object that supports notifies.
31 * TBD: This could be replaced by a flag bit in the node.
35 u8 acpi_ev_is_notify_object(struct acpi_namespace_node *node) in acpi_ev_is_notify_object() argument
38 switch (node->type) { in acpi_ev_is_notify_object()
57 * PARAMETERS: node - NS node for the notified object
68 acpi_ev_queue_notify_request(struct acpi_namespace_node *node, u32 notify_value) in acpi_ev_queue_notify_request() argument
80 if (!acpi_ev_is_notify_object(node)) { in acpi_ev_queue_notify_request()
94 obj_desc = acpi_ns_get_attached_object(node); in acpi_ev_queue_notify_request()
[all...]
/kernel/linux/linux-6.6/scripts/gdb/linux/
H A Dlists.py35 node = head['next'].dereference()
36 while node.address != head.address:
37 yield node.address
38 node = node['next'].dereference()
42 for node in list_for_each(head):
43 yield utils.container_of(node, gdbtype, member)
53 node = head['first'].dereference()
54 while node.address:
55 yield node
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dstate-values-utils.h37 Node* node; member
39 explicit NodeKey(Node* node) : node(node) {} in NodeKey()
43 // ValueArray - array of nodes ({node} has to be nullptr).
53 static bool IsKeysEqualToNode(StateValuesKey* key, Node* node);
86 Node* node; member
88 TypedNode(Node* node, MachineType type) : node(node), typ
122 StateValuesAccess(Node* node) StateValuesAccess() argument
[all...]
H A Dwasm-loop-peeling.cc40 // node, except Terminate nodes which will be deleted anyway. in PeelWasmLoop()
41 for (Node* node : copied_nodes) { in PeelWasmLoop()
42 if (IrOpcode::IsGraphTerminator(node->opcode()) && in PeelWasmLoop()
43 node->opcode() != IrOpcode::kTerminate && node->UseCount() == 0) { in PeelWasmLoop()
44 NodeProperties::MergeControlToEnd(graph, common, node); in PeelWasmLoop()
49 for (Node* node : loop_node->uses()) { in PeelWasmLoop()
50 // We do not need the Terminate node for the peeled iteration. in PeelWasmLoop()
51 if (node->opcode() == IrOpcode::kTerminate) { in PeelWasmLoop()
52 copier.map(node) in PeelWasmLoop()
[all...]
/kernel/linux/linux-5.10/drivers/clk/sunxi/
H A Dclk-simple-gates.c18 static void __init sunxi_simple_gates_setup(struct device_node *node, in sunxi_simple_gates_setup() argument
33 reg = of_io_request_and_map(node, 0, of_node_full_name(node)); in sunxi_simple_gates_setup()
37 clk_parent = of_clk_get_parent_name(node, 0); in sunxi_simple_gates_setup()
43 number = of_property_count_u32_elems(node, "clock-indices"); in sunxi_simple_gates_setup()
44 of_property_read_u32_index(node, "clock-indices", number - 1, &number); in sunxi_simple_gates_setup()
50 of_property_for_each_u32(node, "clock-indices", prop, p, index) { in sunxi_simple_gates_setup()
51 of_property_read_string_index(node, "clock-output-names", in sunxi_simple_gates_setup()
76 of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in sunxi_simple_gates_setup()
84 of_address_to_resource(node, in sunxi_simple_gates_setup()
88 sunxi_simple_gates_init(struct device_node *node) sunxi_simple_gates_init() argument
146 sun4i_a10_ahb_init(struct device_node *node) sun4i_a10_ahb_init() argument
164 sun4i_a10_dram_init(struct device_node *node) sun4i_a10_dram_init() argument
[all...]
/kernel/linux/linux-6.6/drivers/clk/sunxi/
H A Dclk-simple-gates.c18 static void __init sunxi_simple_gates_setup(struct device_node *node, in sunxi_simple_gates_setup() argument
33 reg = of_io_request_and_map(node, 0, of_node_full_name(node)); in sunxi_simple_gates_setup()
37 clk_parent = of_clk_get_parent_name(node, 0); in sunxi_simple_gates_setup()
43 number = of_property_count_u32_elems(node, "clock-indices"); in sunxi_simple_gates_setup()
44 of_property_read_u32_index(node, "clock-indices", number - 1, &number); in sunxi_simple_gates_setup()
50 of_property_for_each_u32(node, "clock-indices", prop, p, index) { in sunxi_simple_gates_setup()
51 of_property_read_string_index(node, "clock-output-names", in sunxi_simple_gates_setup()
76 of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in sunxi_simple_gates_setup()
84 of_address_to_resource(node, in sunxi_simple_gates_setup()
88 sunxi_simple_gates_init(struct device_node *node) sunxi_simple_gates_init() argument
146 sun4i_a10_ahb_init(struct device_node *node) sun4i_a10_ahb_init() argument
164 sun4i_a10_dram_init(struct device_node *node) sun4i_a10_dram_init() argument
[all...]
/third_party/mesa3d/src/compiler/glsl/tests/
H A Dlist_iterators.cpp53 test_node_inherite *node = new(mem_ctx) test_node_inherite(); in SetUp() local
54 node->value = i; in SetUp()
55 exec_list_push_tail(&node_list, node); in SetUp()
147 exec_node node; member in test_node_embed
171 test_node_embed *node = new(mem_ctx) test_node_embed(); in SetUp() local
172 node->value_header = i; in SetUp()
173 node->value_footer = i; in SetUp()
174 exec_list_push_tail(&node_list, &node->node); in SetUp()
196 foreach_list_typed(test_node_embed, n, node, in TEST_P()
[all...]
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/
H A DAnalyzeCallDepth.cpp34 AnalyzeCallDepth::FunctionNode::FunctionNode(TIntermAggregate *node) : node(node) in FunctionNode() argument
42 return node->getName(); in getName()
101 node->setOp(EOpPrototype); in removeIfUnreachable()
102 node->getSequence().resize(1); // Remove function body in removeIfUnreachable()
121 bool AnalyzeCallDepth::visitSwitch(Visit visit, TIntermSwitch *node) in visitSwitch() argument
123 TIntermTyped* switchValue = node->getInit(); in visitSwitch()
124 TIntermAggregate* opList = node->getStatementList(); in visitSwitch()
165 bool AnalyzeCallDepth::visitAggregate(Visit visit, TIntermAggregate *node) in visitAggregate() argument
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/intel/ice/
H A Dice_sched.c8 * ice_sched_add_root_node - Insert the Tx scheduler root node in SW DB
12 * This function inserts the root node of the scheduling tree topology
45 * ice_sched_find_node_by_teid - Find the Tx scheduler node in SW DB
47 * @teid: node TEID to search
49 * This function searches for a node matching the TEID in the scheduling tree
64 /* The node has no children or is at the max layer */ in ice_sched_find_node_by_teid()
142 * ice_sched_add_node - Insert the Tx scheduler node in SW DB
144 * @layer: Scheduler layer of the node
148 * This function inserts a scheduler node to the SW DB.
157 struct ice_sched_node *node; in ice_sched_add_node() local
194 devm_kfree(ice_hw_to_dev(hw), node); ice_sched_add_node() local
309 ice_free_sched_node(struct ice_port_info *pi, struct ice_sched_node *node) ice_free_sched_node() argument
364 devm_kfree(ice_hw_to_dev(hw), node); ice_free_sched_node() local
1183 struct ice_sched_node *node; ice_rm_dflt_leaf_node() local
1211 struct ice_sched_node *node; ice_sched_rm_dflt_nodes() local
1441 ice_sched_find_node_in_subtree(struct ice_hw *hw, struct ice_sched_node *base, struct ice_sched_node *node) ice_sched_find_node_in_subtree() argument
1568 struct ice_sched_node *node; ice_sched_get_vsi_node() local
1597 struct ice_sched_node *node; ice_sched_get_agg_node() local
1660 struct ice_sched_node *parent, *node; ice_sched_add_vsi_child_nodes() local
1715 struct ice_sched_node *node; ice_sched_calc_vsi_support_nodes() local
2016 ice_sched_is_leaf_node_present(struct ice_sched_node *node) ice_sched_is_leaf_node_present() argument
2156 ice_sched_get_free_vsi_parent(struct ice_hw *hw, struct ice_sched_node *node, u16 *num_nodes) ice_sched_get_free_vsi_parent() argument
2198 ice_sched_update_parent(struct ice_sched_node *new_parent, struct ice_sched_node *node) ice_sched_update_parent() argument
2236 struct ice_sched_node *node; ice_sched_move_nodes() local
2416 ice_sched_is_agg_inuse(struct ice_port_info *pi, struct ice_sched_node *node) ice_sched_is_agg_inuse() argument
2895 ice_sched_update_elem(struct ice_hw *hw, struct ice_sched_node *node, struct ice_aqc_txsched_elem_data *info) ice_sched_update_elem() argument
2937 ice_sched_cfg_node_bw_alloc(struct ice_hw *hw, struct ice_sched_node *node, enum ice_rl_type rl_type, u16 bw_alloc) ice_sched_cfg_node_bw_alloc() argument
3293 ice_sched_cfg_node_bw_lmt(struct ice_hw *hw, struct ice_sched_node *node, enum ice_rl_type rl_type, u16 rl_prof_id) ice_sched_cfg_node_bw_lmt() argument
3359 ice_sched_get_node_rl_prof_id(struct ice_sched_node *node, enum ice_rl_type rl_type) ice_sched_get_node_rl_prof_id() argument
3439 ice_sched_get_srl_node(struct ice_sched_node *node, u8 srl_layer) ice_sched_get_srl_node() argument
3505 ice_sched_set_node_bw_dflt(struct ice_port_info *pi, struct ice_sched_node *node, enum ice_rl_type rl_type, u8 layer_num) ice_sched_set_node_bw_dflt() argument
3562 ice_sched_set_eir_srl_excl(struct ice_port_info *pi, struct ice_sched_node *node, u8 layer_num, enum ice_rl_type rl_type, u32 bw) ice_sched_set_eir_srl_excl() argument
3606 ice_sched_set_node_bw(struct ice_port_info *pi, struct ice_sched_node *node, enum ice_rl_type rl_type, u32 bw, u8 layer_num) ice_sched_set_node_bw() argument
3650 ice_sched_set_node_priority(struct ice_port_info *pi, struct ice_sched_node *node, u16 priority) ice_sched_set_node_priority() argument
3674 ice_sched_set_node_weight(struct ice_port_info *pi, struct ice_sched_node *node, u16 weight) ice_sched_set_node_weight() argument
3703 ice_sched_set_node_bw_lmt(struct ice_port_info *pi, struct ice_sched_node *node, enum ice_rl_type rl_type, u32 bw) ice_sched_set_node_bw_lmt() argument
3752 ice_sched_set_node_bw_dflt_lmt(struct ice_port_info *pi, struct ice_sched_node *node, enum ice_rl_type rl_type) ice_sched_set_node_bw_dflt_lmt() argument
3770 ice_sched_validate_srl_node(struct ice_sched_node *node, u8 sel_layer) ice_sched_validate_srl_node() argument
3829 struct ice_sched_node *node; ice_sched_set_q_bw_lmt() local
3929 struct ice_sched_node *node = NULL; ice_sched_get_node_by_id_type() local
3979 struct ice_sched_node *node; ice_sched_set_node_bw_lmt_per_tc() local
4112 ice_sched_replay_node_prio(struct ice_hw *hw, struct ice_sched_node *node, u8 priority) ice_sched_replay_node_prio() argument
4139 ice_sched_replay_node_bw(struct ice_hw *hw, struct ice_sched_node *node, struct ice_bw_type_info *bw_t_info) ice_sched_replay_node_bw() argument
[all...]
/kernel/linux/linux-5.10/block/
H A Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
27 return rb_entry(node, struct bfq_entity, rb_node); in bfq_root_active_entity()
307 * bfq_entity_of - get an entity from a node.
308 * @node: the node field of the entity.
310 * Convert a node pointer to the relative entity. This is used only
315 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of() argument
319 if (node) in bfq_entity_of()
320 entity = rb_entry(node, struct bfq_entity, rb_node); in bfq_entity_of()
374 struct rb_node **node in bfq_insert() local
403 bfq_update_min(struct bfq_entity *entity, struct rb_node *node) bfq_update_min() argument
422 bfq_update_active_node(struct rb_node *node) bfq_update_active_node() argument
441 bfq_update_active_tree(struct rb_node *node) bfq_update_active_tree() argument
476 struct rb_node *node = &entity->rb_node; bfq_active_insert() local
548 bfq_find_deepest(struct rb_node *node) bfq_find_deepest() argument
578 struct rb_node *node; bfq_active_extract() local
1354 struct rb_node *node = st->active.rb_node; bfq_first_active_entity() local
[all...]
/kernel/linux/linux-5.10/drivers/of/
H A Dproperty.c34 * @node: pointer to device_node containing graph port
36 * Return: True if @node has a port or ports (with a port) sub-node,
39 bool of_graph_is_present(const struct device_node *node) in of_graph_is_present() argument
43 ports = of_get_child_by_name(node, "ports"); in of_graph_is_present()
45 node = ports; in of_graph_is_present()
47 port = of_get_child_by_name(node, "port"); in of_graph_is_present()
58 * @np: device node from which the property value is to be read.
62 * Search for a property in a device node and count the number of elements of
80 pr_err("size of %s in node in of_property_count_elems_of_size()
573 of_graph_parse_endpoint(const struct device_node *node, struct of_endpoint *endpoint) of_graph_parse_endpoint() argument
607 struct device_node *node, *port; of_graph_get_port_by_id() local
652 struct device_node *node; of_graph_get_next_endpoint() local
710 struct device_node *node = NULL; of_graph_get_endpoint_by_regs() local
730 of_graph_get_remote_endpoint(const struct device_node *node) of_graph_get_remote_endpoint() argument
744 of_graph_get_port_parent(struct device_node *node) of_graph_get_port_parent() argument
774 of_graph_get_remote_port_parent( const struct device_node *node) of_graph_get_remote_port_parent() argument
797 of_graph_get_remote_port(const struct device_node *node) of_graph_get_remote_port() argument
830 of_graph_get_remote_node(const struct device_node *node, u32 port, u32 endpoint) of_graph_get_remote_node() argument
885 const struct device_node *node = to_of_node(fwnode); of_fwnode_property_read_int_array() local
910 const struct device_node *node = to_of_node(fwnode); of_fwnode_property_read_string_array() local
949 const struct device_node *node = to_of_node(fwnode); of_fwnode_get_named_child_node() local
1026 const struct device_node *node = to_of_node(fwnode); of_fwnode_graph_parse_endpoint() local
[all...]
/kernel/linux/linux-6.6/block/
H A Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node; in bfq_root_active_entity() local
27 return rb_entry(node, struct bfq_entity, rb_node); in bfq_root_active_entity()
315 * bfq_entity_of - get an entity from a node.
316 * @node: the node field of the entity.
318 * Convert a node pointer to the relative entity. This is used only
323 struct bfq_entity *bfq_entity_of(struct rb_node *node) in bfq_entity_of() argument
327 if (node) in bfq_entity_of()
328 entity = rb_entry(node, struct bfq_entity, rb_node); in bfq_entity_of()
382 struct rb_node **node in bfq_insert() local
411 bfq_update_min(struct bfq_entity *entity, struct rb_node *node) bfq_update_min() argument
430 bfq_update_active_node(struct rb_node *node) bfq_update_active_node() argument
449 bfq_update_active_tree(struct rb_node *node) bfq_update_active_tree() argument
484 struct rb_node *node = &entity->rb_node; bfq_active_insert() local
544 bfq_find_deepest(struct rb_node *node) bfq_find_deepest() argument
574 struct rb_node *node; bfq_active_extract() local
1300 struct rb_node *node = st->active.rb_node; bfq_first_active_entity() local
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_gem_evict.c61 return drm_mm_scan_add_block(scan, &vma->node); in mark_free()
97 struct drm_mm_node *node; in i915_gem_evict_something() local
167 ret = drm_mm_scan_remove_block(&scan, &vma->node); in i915_gem_evict_something()
213 if (drm_mm_scan_remove_block(&scan, &vma->node)) in i915_gem_evict_something()
227 while (ret == 0 && (node = drm_mm_scan_color_evict(&scan))) { in i915_gem_evict_something()
228 vma = container_of(node, struct i915_vma, node); in i915_gem_evict_something()
231 if (vma->node.color != I915_COLOR_UNEVICTABLE) in i915_gem_evict_something()
246 * This function will try to evict vmas that overlap the target node.
256 struct drm_mm_node *node; in i915_gem_evict_for_node() local
[all...]
/third_party/gn/src/gn/
H A Dunique_vector.h17 // A HashTableBase node type used by all UniqueVector<> instantiations.
18 // The node stores the item's hash value and its index plus 1, in order
62 return BaseType::NodeLookup(hash32, [&](const Node* node) { in Lookup()
63 return hash32 == node->hash32 && EqualTo()(vector[node->index()], item); in Lookup()
69 void Insert(Node* node, size_t hash, size_t index) { in Insert() argument
70 *node = Node::Make(hash, index); in Insert()
114 auto* node = Lookup(t, &hash);
115 if (node->is_valid()) {
119 set_.Insert(node, has
[all...]
/third_party/node/test/common/
H A Dheap.js26 for (const node of nodes) {
27 node.incomingEdges = [];
28 node.outgoingEdges = [];
51 for (const node of nodes) {
52 assert.strictEqual(node.edge_count, node.outgoingEdges.length,
53 `${node.edge_count} !== ${node.outgoingEdges.length}`);
77 } else if (type === 'number' || type === 'node') {
115 (node)
[all...]
/third_party/vk-gl-cts/framework/common/
H A DtcuTestHierarchyIterator.cpp98 // Init traverse state and "seek" to first reportable node. in TestHierarchyIterator()
110 TestNode* const node = iter->node; in ~TestHierarchyIterator() local
111 const TestNodeType nodeType = node->getNodeType(); in ~TestHierarchyIterator()
116 case NODETYPE_PACKAGE: m_inflater.leaveTestPackage(static_cast<TestPackage*>(node)); break; in ~TestHierarchyIterator()
117 case NODETYPE_GROUP: m_inflater.leaveGroupNode(static_cast<TestCaseGroup*>(node)); break; in ~TestHierarchyIterator()
142 return m_sessionStack.back().node; in getNode()
159 nodePath += iter.node->getName(); in buildNodePath()
169 TestNode* const node = iter.node; in next() local
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Doptimizer.py15 def optimize(node, environment):
19 return optimizer.visit(node)
26 def generic_visit(self, node, *args, **kwargs):
27 node = super(Optimizer, self).generic_visit(node, *args, **kwargs)
31 if isinstance(node, nodes.Expr):
34 node.as_const(args[0] if args else None),
35 lineno=node.lineno,
41 return node
/third_party/skia/third_party/externals/jinja2/
H A Doptimizer.py15 def optimize(node, environment):
19 return optimizer.visit(node)
26 def generic_visit(self, node, *args, **kwargs):
27 node = super(Optimizer, self).generic_visit(node, *args, **kwargs)
31 if isinstance(node, nodes.Expr):
34 node.as_const(args[0] if args else None),
35 lineno=node.lineno,
41 return node
/kernel/linux/linux-6.6/arch/loongarch/mm/
H A Dkasan_init.c95 static phys_addr_t __init kasan_alloc_zeroed_page(int node) in kasan_alloc_zeroed_page() argument
98 __pa(MAX_DMA_ADDRESS), MEMBLOCK_ALLOC_ACCESSIBLE, node); in kasan_alloc_zeroed_page()
101 __func__, PAGE_SIZE, PAGE_SIZE, node, __pa(MAX_DMA_ADDRESS)); in kasan_alloc_zeroed_page()
106 static pte_t *__init kasan_pte_offset(pmd_t *pmdp, unsigned long addr, int node, bool early) in kasan_pte_offset() argument
110 __pa_symbol(kasan_early_shadow_pte) : kasan_alloc_zeroed_page(node); in kasan_pte_offset()
119 static pmd_t *__init kasan_pmd_offset(pud_t *pudp, unsigned long addr, int node, bool early) in kasan_pmd_offset() argument
123 __pa_symbol(kasan_early_shadow_pmd) : kasan_alloc_zeroed_page(node); in kasan_pmd_offset()
132 static pud_t *__init kasan_pud_offset(p4d_t *p4dp, unsigned long addr, int node, bool early) in kasan_pud_offset() argument
136 __pa_symbol(kasan_early_shadow_pud) : kasan_alloc_zeroed_page(node); in kasan_pud_offset()
146 unsigned long end, int node, boo in kasan_pte_populate()
145 kasan_pte_populate(pmd_t *pmdp, unsigned long addr, unsigned long end, int node, bool early) kasan_pte_populate() argument
160 kasan_pmd_populate(pud_t *pudp, unsigned long addr, unsigned long end, int node, bool early) kasan_pmd_populate() argument
172 kasan_pud_populate(p4d_t *p4dp, unsigned long addr, unsigned long end, int node, bool early) kasan_pud_populate() argument
184 kasan_p4d_populate(pgd_t *pgdp, unsigned long addr, unsigned long end, int node, bool early) kasan_p4d_populate() argument
196 kasan_pgd_populate(unsigned long addr, unsigned long end, int node, bool early) kasan_pgd_populate() argument
212 kasan_map_populate(unsigned long start, unsigned long end, int node) kasan_map_populate() argument
[all...]
/kernel/linux/linux-6.6/drivers/acpi/
H A Dviot.c71 pr_err(FW_BUG "Empty node\n"); in viot_check_bounds()
136 } *node = (void *)hdr; in viot_get_iommu() local
152 if (hdr->length < sizeof(node->pci)) in viot_get_iommu()
155 ret = viot_get_pci_iommu_fwnode(viommu, node->pci.segment, in viot_get_iommu()
156 node->pci.bdf); in viot_get_iommu()
159 if (hdr->length < sizeof(node->mmio)) in viot_get_iommu()
163 node->mmio.base_address); in viot_get_iommu()
187 } *node = (void *)hdr; in viot_parse_node() local
202 if (hdr->length < sizeof(node->pci)) { in viot_parse_node()
203 pr_err(FW_BUG "Invalid PCI node siz in viot_parse_node()
281 struct acpi_viot_header *node; acpi_viot_init() local
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dcollationbuilder.h63 * Returns the secondary or tertiary weight preceding the current node's weight.
64 * node=nodes[index].
66 uint32_t getWeight16Before(int32_t index, int64_t node, int32_t level);
77 * Picks one of the current CEs and finds or inserts a node in the graph
83 /** Finds or inserts the node for a root CE's primary weight. */
85 /** Finds or inserts the node for a secondary or tertiary weight. */
90 * Makes and inserts a new tailored node into the list, after the one at index.
93 * @return the new node's index
98 * Inserts a new node into the list, between list-adjacent items.
99 * The node'
260 weight32FromNode(int64_t node) weight32FromNode() argument
263 weight16FromNode(int64_t node) weight16FromNode() argument
266 previousIndexFromNode(int64_t node) previousIndexFromNode() argument
269 nextIndexFromNode(int64_t node) nextIndexFromNode() argument
272 strengthFromNode(int64_t node) strengthFromNode() argument
276 nodeHasBefore2(int64_t node) nodeHasBefore2() argument
279 nodeHasBefore3(int64_t node) nodeHasBefore3() argument
282 nodeHasAnyBefore(int64_t node) nodeHasAnyBefore() argument
285 isTailoredNode(int64_t node) isTailoredNode() argument
289 changeNodePreviousIndex(int64_t node, int32_t previous) changeNodePreviousIndex() argument
292 changeNodeNextIndex(int64_t node, int32_t next) changeNodeNextIndex() argument
[all...]

Completed in 15 milliseconds

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