| /kernel/linux/linux-5.10/arch/powerpc/kernel/ |
| H A D | pci_32.c | 75 make_one_node_map(struct device_node* node, u8 pci_bus) in make_one_node_map() argument
82 bus_range = of_get_property(node, "bus-range", &len); in make_one_node_map()
85 "assuming it starts at 0\n", node); in make_one_node_map()
90 for_each_child_of_node(node, node) { in make_one_node_map()
94 class_code = of_get_property(node, "class-code", NULL); in make_one_node_map()
98 reg = of_get_property(node, "reg", NULL); in make_one_node_map()
107 make_one_node_map(node, dev->subordinate->number); in make_one_node_map()
134 struct device_node* node = hose->dn; in pcibios_make_OF_bus_map() local
136 if (!node) in pcibios_make_OF_bus_map()
161 pci_device_from_OF_node(struct device_node *node, u8 *bus, u8 *devfn) pci_device_from_OF_node() argument
[all...] |
| /kernel/linux/linux-5.10/drivers/acpi/acpica/ |
| H A D | dspkginit.c | 98 obj_desc->package.node = parent->common.node; in acpi_ds_build_internal_package_obj()
155 if (!arg->common.node) { in acpi_ds_build_internal_package_obj()
181 if (arg->common.node->type == ACPI_TYPE_METHOD) { in acpi_ds_build_internal_package_obj()
198 arg->common.node); in acpi_ds_build_internal_package_obj()
269 if (arg->common.node) { in acpi_ds_build_internal_package_obj()
273 arg->common.node)); in acpi_ds_build_internal_package_obj()
274 arg->common.node = NULL; in acpi_ds_build_internal_package_obj()
307 op->common.node = ACPI_CAST_PTR(struct acpi_namespace_node, obj_desc); in acpi_ds_build_internal_package_obj()
357 /* Attempt to resolve the (named) reference to a namespace node */ in acpi_ds_init_package_element()
[all...] |
| /kernel/linux/linux-6.6/arch/powerpc/kernel/ |
| H A D | pci_32.c | 74 make_one_node_map(struct device_node* node, u8 pci_bus) in make_one_node_map() argument
81 bus_range = of_get_property(node, "bus-range", &len); in make_one_node_map()
84 "assuming it starts at 0\n", node); in make_one_node_map()
89 for_each_child_of_node(node, node) { in make_one_node_map()
93 class_code = of_get_property(node, "class-code", NULL); in make_one_node_map()
97 reg = of_get_property(node, "reg", NULL); in make_one_node_map()
106 make_one_node_map(node, dev->subordinate->number); in make_one_node_map()
133 struct device_node* node = hose->dn; in pcibios_make_OF_bus_map() local
135 if (!node) in pcibios_make_OF_bus_map()
162 pci_device_from_OF_node(struct device_node *node, u8 *bus, u8 *devfn) pci_device_from_OF_node() argument
[all...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/ |
| H A D | i915_gem_gtt.c | 77 * i915_gem_gtt_reserve - reserve a node in an address_space (GTT)
79 * @node: the &struct drm_mm_node (typically i915_vma.mode)
83 * must be #I915_GTT_MIN_ALIGNMENT aligned, and the node
85 * @color: color to apply to node, if this node is not from a VMA,
89 * i915_gem_gtt_reserve() tries to insert the @node at the exact @offset inside
90 * the address space (using @size and @color). If the @node does not fit, it
95 * evicting active overlapping objects, and any overlapping node that is pinned
102 struct drm_mm_node *node, in i915_gem_gtt_reserve()
113 GEM_BUG_ON(drm_mm_node_allocated(node)); in i915_gem_gtt_reserve()
101 i915_gem_gtt_reserve(struct i915_address_space *vm, struct drm_mm_node *node, u64 size, u64 offset, unsigned long color, unsigned int flags) i915_gem_gtt_reserve() argument
192 i915_gem_gtt_insert(struct i915_address_space *vm, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, u64 start, u64 end, unsigned int flags) i915_gem_gtt_insert() argument
[all...] |
| /kernel/linux/linux-5.10/include/drm/ |
| H A D | drm_mm.h | 73 * the desired node.
75 * Allocates the node from the bottom of the found hole.
83 * range) that fits the desired node.
85 * Allocates the node from the bottom of the found hole.
93 * search range) that fits the desired node.
95 * Allocates the node from the *top* of the found hole. The specified
96 * alignment for the node is applied to the base of the node
105 * that fits the desired node. This is appropriate for use immediately
109 * Allocates the node fro
256 drm_mm_node_allocated(const struct drm_mm_node *node) drm_mm_node_allocated() argument
291 drm_mm_hole_follows(const struct drm_mm_node *node) drm_mm_hole_follows() argument
432 drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, enum drm_mm_insert_mode mode) drm_mm_insert_node_generic() argument
456 drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node, u64 size) drm_mm_insert_node() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/acpi/acpica/ |
| H A D | dspkginit.c | 98 obj_desc->package.node = parent->common.node; in acpi_ds_build_internal_package_obj()
155 if (!arg->common.node) { in acpi_ds_build_internal_package_obj()
181 if (arg->common.node->type == ACPI_TYPE_METHOD) { in acpi_ds_build_internal_package_obj()
198 arg->common.node); in acpi_ds_build_internal_package_obj()
269 if (arg->common.node) { in acpi_ds_build_internal_package_obj()
273 arg->common.node)); in acpi_ds_build_internal_package_obj()
274 arg->common.node = NULL; in acpi_ds_build_internal_package_obj()
307 op->common.node = ACPI_CAST_PTR(struct acpi_namespace_node, obj_desc); in acpi_ds_build_internal_package_obj()
357 /* Attempt to resolve the (named) reference to a namespace node */ in acpi_ds_init_package_element()
[all...] |
| H A D | exstore.c | 28 struct acpi_namespace_node *node,
36 * *dest_desc - Where to store it. Must be an NS node
68 /* dest_desc can be either a namespace node or an ACPI object */ in acpi_ex_store()
72 * Dest is a namespace node, in acpi_ex_store()
73 * Storing an object into a Named node. in acpi_ex_store()
335 * node - Named object to receive the value
362 struct acpi_namespace_node *node, in acpi_ex_store_object_to_node()
373 /* Get current type of the node, and object attached to Node */ in acpi_ex_store_object_to_node()
375 target_type = acpi_ns_get_type(node); in acpi_ex_store_object_to_node()
376 target_desc = acpi_ns_get_attached_object(node); in acpi_ex_store_object_to_node()
361 acpi_ex_store_object_to_node(union acpi_operand_object *source_desc, struct acpi_namespace_node *node, struct acpi_walk_state *walk_state, u8 implicit_conversion) acpi_ex_store_object_to_node() argument
560 acpi_ex_store_direct_to_node(union acpi_operand_object *source_desc, struct acpi_namespace_node *node, struct acpi_walk_state *walk_state) acpi_ex_store_direct_to_node() argument
[all...] |
| /kernel/linux/linux-6.6/include/drm/ |
| H A D | drm_mm.h | 75 * the desired node.
77 * Allocates the node from the bottom of the found hole.
85 * range) that fits the desired node.
87 * Allocates the node from the bottom of the found hole.
95 * search range) that fits the desired node.
97 * Allocates the node from the *top* of the found hole. The specified
98 * alignment for the node is applied to the base of the node
107 * that fits the desired node. This is appropriate for use immediately
111 * Allocates the node fro
258 drm_mm_node_allocated(const struct drm_mm_node *node) drm_mm_node_allocated() argument
293 drm_mm_hole_follows(const struct drm_mm_node *node) drm_mm_hole_follows() argument
434 drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, enum drm_mm_insert_mode mode) drm_mm_insert_node_generic() argument
458 drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node, u64 size) drm_mm_insert_node() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/clk/sunxi/ |
| H A D | clk-sun4i-display.c | 101 static void __init sun4i_a10_display_init(struct device_node *node, in sun4i_a10_display_init() argument
105 const char *clk_name = node->name; in sun4i_a10_display_init()
115 of_property_read_string(node, "clock-output-names", &clk_name); in sun4i_a10_display_init()
117 reg = of_io_request_and_map(node, 0, of_node_full_name(node)); in sun4i_a10_display_init()
123 ret = of_clk_parent_fill(node, parents, data->parents); in sun4i_a10_display_init()
169 ret = of_clk_add_provider(node, of_clk_src_simple_get, clk); in sun4i_a10_display_init()
187 reset_data->rcdev.of_node = node; in sun4i_a10_display_init()
207 of_clk_del_provider(node); in sun4i_a10_display_init()
218 of_address_to_resource(node, in sun4i_a10_display_init()
232 sun4i_a10_tcon_ch0_setup(struct device_node *node) sun4i_a10_tcon_ch0_setup() argument
251 sun4i_a10_display_setup(struct device_node *node) sun4i_a10_display_setup() argument
[all...] |
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/ |
| H A D | i915_gem_gtt.c | 72 * i915_gem_gtt_reserve - reserve a node in an address_space (GTT)
75 * @node: the &struct drm_mm_node (typically i915_vma.mode)
79 * must be #I915_GTT_MIN_ALIGNMENT aligned, and the node
81 * @color: color to apply to node, if this node is not from a VMA,
85 * i915_gem_gtt_reserve() tries to insert the @node at the exact @offset inside
86 * the address space (using @size and @color). If the @node does not fit, it
91 * evicting active overlapping objects, and any overlapping node that is pinned
99 struct drm_mm_node *node, in i915_gem_gtt_reserve()
110 GEM_BUG_ON(drm_mm_node_allocated(node)); in i915_gem_gtt_reserve()
97 i915_gem_gtt_reserve(struct i915_address_space *vm, struct i915_gem_ww_ctx *ww, struct drm_mm_node *node, u64 size, u64 offset, unsigned long color, unsigned int flags) i915_gem_gtt_reserve() argument
190 i915_gem_gtt_insert(struct i915_address_space *vm, struct i915_gem_ww_ctx *ww, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, u64 start, u64 end, unsigned int flags) i915_gem_gtt_insert() argument
[all...] |
| /third_party/icu/icu4c/source/common/ |
| H A D | bytestrieiterator.cpp | 67 // Pending linear-match node, append remaining bytes to str_. in Iterator()
112 // the branch node. in next()
129 // We only get here if we started in a pending linear-match node in next()
134 int32_t node=*pos++; in next() local
135 if(node>=kMinValueLead) { in next()
137 UBool isFinal=(UBool)(node&kValueIsFinal); in next()
138 value_=readValue(pos, node>>1); in next()
142 pos_=skipValue(pos, node); in next()
149 if(node<kMinLinearMatch) { in next()
150 if(node in next()
198 int32_t node=*pos++; branchNext() local
[all...] |
| /third_party/node/test/cctest/ |
| H A D | test_node_postmortem_metadata.cc | 2 #include "node.h"
38 class TestHandleWrap : public node::HandleWrap {
44 TestHandleWrap(node::Environment* env, in TestHandleWrap()
47 : node::HandleWrap(env, in TestHandleWrap()
50 node::AsyncWrap::PROVIDER_TCPWRAP) {} in TestHandleWrap()
54 class TestReqWrap : public node::ReqWrap<uv_req_t> {
60 TestReqWrap(node::Environment* env, v8::Local<v8::Object> object) in TestReqWrap()
61 : node::ReqWrap<uv_req_t>(env, in TestReqWrap()
63 node::AsyncWrap::PROVIDER_FSREQCALLBACK) {} in TestReqWrap()
67 int kEnvironmentIndex = node in TEST_F()
[all...] |
| /third_party/node/deps/icu-small/source/common/ |
| H A D | bytestrieiterator.cpp | 67 // Pending linear-match node, append remaining bytes to str_. in Iterator()
112 // the branch node. in next()
129 // We only get here if we started in a pending linear-match node in next()
134 int32_t node=*pos++; in next() local
135 if(node>=kMinValueLead) { in next()
137 UBool isFinal=(UBool)(node&kValueIsFinal); in next()
138 value_=readValue(pos, node>>1); in next()
142 pos_=skipValue(pos, node); in next()
149 if(node<kMinLinearMatch) { in next()
150 if(node in next()
198 int32_t node=*pos++; branchNext() local
[all...] |
| /third_party/nghttp2/tests/ |
| H A D | nghttp2_pq_test.c | 124 } node; typedef
127 node *ln = (node *)lhs; in node_less()
128 node *rn = (node *)rhs; in node_less()
133 node *nd = (node *)item; in node_update()
146 node nodes[10]; in test_nghttp2_pq_update()
148 node *nd; in test_nghttp2_pq_update()
162 nd = (node *)nghttp2_pq_to in test_nghttp2_pq_update()
[all...] |
| /third_party/node/deps/icu-small/source/tools/genrb/ |
| H A D | filterrb.cpp | 98 const Tree* node = &fRoot; in match() local
102 if (node->fIncluded != PARTIAL) { in match()
104 defaultResult = node->fIncluded; in match()
112 auto child = node->fChildren.find(key); in match()
114 if (child == node->fChildren.end()) { in match()
115 if (node->fWildcard) { in match()
117 node = node->fWildcard.get(); in match()
123 node = &child->second; in match()
125 if (node in match()
[all...] |
| /third_party/icu/icu4c/source/tools/genrb/ |
| H A D | filterrb.cpp | 98 const Tree* node = &fRoot; in match() local
102 if (node->fIncluded != PARTIAL) { in match()
104 defaultResult = node->fIncluded; in match()
112 auto child = node->fChildren.find(key); in match()
114 if (child == node->fChildren.end()) { in match()
115 if (node->fWildcard) { in match()
117 node = node->fWildcard.get(); in match()
123 node = &child->second; in match()
125 if (node in match()
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | escape-analysis.h | 27 // the effect output of a node from changes to the value output to reduce the
49 // Mark node for revisitation.
50 void Revisit(Node* node);
52 // Add a new root node to start reduction from. This is useful if the reducer
55 void AddRoot(Node* node) { in AddRoot() argument
56 DCHECK_EQ(State::kUnvisited, state_.Get(node)); in AddRoot()
57 state_.Set(node, State::kRevisit); in AddRoot()
58 revisit_.push(node); in AddRoot()
67 Node* node; member
70 void ReduceFrom(Node* node);
111 AddDependency(Node* node) AddDependency() argument
[all...] |
| /third_party/mesa3d/src/gallium/drivers/freedreno/ |
| H A D | freedreno_autotune.c | 37 struct list_head node; member
69 list_inithead(&history->node); in get_history()
77 list_last_entry(&at->lru, struct fd_batch_history, node); in get_history()
79 list_del(&last->node); in get_history()
88 list_delinit(&history->node); in get_history()
89 list_add(&history->node, &at->lru); in get_history()
100 list_del(&result->node); in result_destructor()
116 list_addtail(&result->node, &at->pending_results); in get_result()
129 &at->pending_results, node) { in process_results()
138 list_delinit(&result->node); in process_results()
[all...] |
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | TrailingPathOptimizer.java | 54 // Build a map of trailing "any digit" sequences (key is the node it starts from). in optimize()
58 // If the terminal node has no "any digit" sequences leading to it, there's nothing we can do in optimize()
66 // This is just a way to find a node from which we can start generating new nodes. in optimize()
108 // We now connect any new factored edges to the node we just added (not the terminal node). in optimize()
120 * current node (initially the terminal node) and working backwards. The key in the map is the
121 * node at which the AnyPath value starts from. Edges and nodes are removed from the graph,
125 * @return whether the given node is the start of an AnyPath (i.e. if it immediately follows any
129 Node node, AnyPat in recursivelyDetachTrailingPaths()
128 recursivelyDetachTrailingPaths( Node node, AnyPath path, MutableValueGraph<Node, SimpleEdge> g, Map<Node, AnyPath> anyPaths) recursivelyDetachTrailingPaths() argument
178 canTerminate(Node node, ValueGraph<Node, SimpleEdge> g) canTerminate() argument
185 addPath( Node node, Node end, AnyPath path, Node lastAdded, MutableValueGraph<Node, SimpleEdge> out) addPath() argument
[all...] |
| /third_party/skia/third_party/externals/icu/source/tools/genrb/ |
| H A D | filterrb.cpp | 98 const Tree* node = &fRoot; in match() local
102 if (node->fIncluded != PARTIAL) { in match()
104 defaultResult = node->fIncluded; in match()
112 auto child = node->fChildren.find(key); in match()
114 if (child == node->fChildren.end()) { in match()
115 if (node->fWildcard) { in match()
117 node = node->fWildcard.get(); in match()
123 node = &child->second; in match()
125 if (node in match()
[all...] |
| /third_party/skia/third_party/externals/icu/source/common/ |
| H A D | bytestrieiterator.cpp | 67 // Pending linear-match node, append remaining bytes to str_. in Iterator()
112 // the branch node. in next()
129 // We only get here if we started in a pending linear-match node in next()
134 int32_t node=*pos++; in next() local
135 if(node>=kMinValueLead) { in next()
137 UBool isFinal=(UBool)(node&kValueIsFinal); in next()
138 value_=readValue(pos, node>>1); in next()
142 pos_=skipValue(pos, node); in next()
149 if(node<kMinLinearMatch) { in next()
150 if(node in next()
198 int32_t node=*pos++; branchNext() local
[all...] |
| /kernel/linux/linux-5.10/arch/powerpc/boot/ |
| H A D | mpc8xx.c | 57 void *node; in mpc8xx_set_clocks() local
61 node = finddevice("/soc/cpm"); in mpc8xx_set_clocks()
62 if (node) in mpc8xx_set_clocks()
63 setprop(node, "clock-frequency", &sysclk, 4); in mpc8xx_set_clocks()
65 node = finddevice("/soc/cpm/brg"); in mpc8xx_set_clocks()
66 if (node) in mpc8xx_set_clocks()
67 setprop(node, "clock-frequency", &sysclk, 4); in mpc8xx_set_clocks()
|
| /kernel/linux/linux-6.6/arch/powerpc/boot/ |
| H A D | mpc8xx.c | 57 void *node; in mpc8xx_set_clocks() local
61 node = finddevice("/soc/cpm"); in mpc8xx_set_clocks()
62 if (node) in mpc8xx_set_clocks()
63 setprop(node, "clock-frequency", &sysclk, 4); in mpc8xx_set_clocks()
65 node = finddevice("/soc/cpm/brg"); in mpc8xx_set_clocks()
66 if (node) in mpc8xx_set_clocks()
67 setprop(node, "clock-frequency", &sysclk, 4); in mpc8xx_set_clocks()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/selftests/ |
| H A D | igt_mmap.c | 18 struct drm_vma_offset_node *node; in igt_mmap_offset() local
25 node = drm_vma_offset_exact_lookup_locked(i915->drm.vma_offset_manager, in igt_mmap_offset()
29 if (GEM_WARN_ON(!node)) { in igt_mmap_offset()
39 err = drm_vma_node_allow(node, file->private_data); in igt_mmap_offset()
45 addr = vm_mmap(file, 0, drm_vma_node_size(node) << PAGE_SHIFT, in igt_mmap_offset()
46 prot, flags, drm_vma_node_offset_addr(node)); in igt_mmap_offset()
48 drm_vma_node_revoke(node, file->private_data); in igt_mmap_offset()
|
| /third_party/node/test/addons/parse-encoding/ |
| H A D | binding.cc | 1 #include <node.h>
16 static_assert(node::BINARY == node::LATIN1, "BINARY == LATIN1");
19 const node::encoding encoding = in ParseEncoding()
20 node::ParseEncoding(args.GetIsolate(), args[0], in ParseEncoding()
21 static_cast<node::encoding>(-1)); in ParseEncoding()
23 #define V(name) if (encoding == node::name) encoding_name = #name; in ParseEncoding()
|