Home
last modified time | relevance | path

Searched refs:node (Results 1701 - 1725 of 2502) sorted by relevance

1...<<61626364656667686970>>...101

/third_party/glslang/glslang/MachineIndependent/
H A Dreflection.cpp83 virtual bool visitBinary(TVisit, TIntermBinary* node);
341 // the base offset of this node, that children are relative to in blowUpActiveAggregate()
543 // Handles the situation where the left node is at the correct or too coarse a
684 TIntermSymbol* findBase(const TIntermBinary* node) in findBase() argument
686 TIntermSymbol *base = node->getLeft()->getAsSymbolNode(); in findBase()
689 TIntermBinary* left = node->getLeft()->getAsBinaryNode(); in findBase()
1032 bool TReflectionTraverser::visitBinary(TVisit /* visit */, TIntermBinary* node) in visitBinary() argument
1034 switch (node->getOp()) { in visitBinary()
1038 addDereferencedUniform(node); in visitBinary()
1206 // If we just want reflect only live node, w in addStage()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUtility.java575 int node = 0; in RLEStringToByteArray()
596 // if we could look ahead, but we can't, so we use 'node' to in RLEStringToByteArray()
598 switch (node) { in RLEStringToByteArray()
600 // Normal idle node in RLEStringToByteArray()
602 node = 1; in RLEStringToByteArray()
613 node = 0; in RLEStringToByteArray()
619 node = 2; in RLEStringToByteArray()
626 node = 0; in RLEStringToByteArray()
631 if (node != 0) in RLEStringToByteArray()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DUtility.java578 int node = 0; in RLEStringToByteArray()
599 // if we could look ahead, but we can't, so we use 'node' to in RLEStringToByteArray()
601 switch (node) { in RLEStringToByteArray()
603 // Normal idle node in RLEStringToByteArray()
605 node = 1; in RLEStringToByteArray()
616 node = 0; in RLEStringToByteArray()
622 node = 2; in RLEStringToByteArray()
629 node = 0; in RLEStringToByteArray()
634 if (node != 0) in RLEStringToByteArray()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_opt_if.c86 * condition is a phi node of two constants and moves half of the if to above
196 foreach_list_typed(nir_cf_node, cf_node, node, entry_list) { in opt_peel_loop_initial_if()
246 cf_node.node)); in opt_peel_loop_initial_if()
331 * Splits ALU instructions that have a source that is a phi node
339 * - At least one source of the instruction is a phi node from the header block.
345 * - The phi node selects a constant or undef from the block before the loop or
352 * on. A new phi node is added to the header block that selects either the
519 /* Make a new phi node that selects a value from prev_block and the in opt_split_alu_of_phi()
562 * - The phi node representing the condition of the bcsel instruction chooses
567 * from the continue block. Since each of these sources is also a phi node i
[all...]
/third_party/node/src/
H A Dnode_worker.cc18 using node::kAllowedInEnvvar;
19 using node::kDisallowedInEnvvar;
43 namespace node { namespace
215 // (Refs: https://github.com/nodejs/node/issues/30846) in ~WorkerThreadData()
850 node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_START]; in LoopStartTime()
853 (loop_start_time - node::performance::timeOrigin) / 1e6); in LoopStartTime()
962 } // namespace node
964 NODE_BINDING_CONTEXT_AWARE_INTERNAL(worker, node::worker::InitWorker)
966 node::worker::RegisterExternalReferences)
H A Dnode.cc22 #include "node.h"
133 namespace node { namespace
155 // process-relative uptime base in nanoseconds, initialized in node::Start()
238 "(node:%d) [Thread %" PRIu64 "] Atomics.wait(%p + %zx, %" PRId64 in AtomicsWaitCallback()
775 // Anything that's still in v8_argv is not a V8 or a node option. in ProcessGlobalArgs()
905 // We should set node_is_initialized here instead of in node::Start, in InitializeNodeWithArgs()
906 // otherwise embedders using node::Init to initialize everything will not be in InitializeNodeWithArgs()
939 int lp_result = node::MapStaticCodeToLargePages(); in InitializeOncePerProcess()
941 result->errors_.emplace_back(node::LargePagesError(lp_result)); in InitializeOncePerProcess()
999 // loop and the node proces in InitializeOncePerProcess()
[all...]
H A Dnode_builtins.cc10 namespace node { namespace
271 std::string filename_s = std::string("node:") + id; in LookupAndCompileInternal()
651 node::Utf8Value id_v(realm->isolate(), args[0].As<String>()); in CompileFunction()
739 } // namespace node
742 builtins, node::builtins::BuiltinLoader::CreatePerIsolateProperties)
744 builtins, node::builtins::BuiltinLoader::CreatePerContextProperties)
746 builtins, node::builtins::BuiltinLoader::RegisterExternalReferences)
H A Dbase_object_types.h8 namespace node { namespace
67 } // namespace node
H A Dcleanup_queue-inl.h11 namespace node { namespace
58 } // namespace node
/third_party/skia/third_party/vulkanmemoryallocator/include/
H A Dvk_mem_alloc.h783 allocate memory of certain size, a free node in the tree is located. If it's too
785 requested allocation size is not a power of two, the size of a tree node is
787 two buddy nodes become free, they are merged back into one larger node.
6755 void DeleteNode(Node* node);
6761 void CalcAllocationStatInfoNode(VmaStatInfo& outInfo, const Node* node, VkDeviceSize levelNodeSize) const;
6762 // Adds node to the front of FreeList at given level.
6763 // node->type must be FREE.
6764 // node->free.prev, next can be undefined.
6765 void AddToFreeListFront(uint32_t level, Node* node);
6766 // Removes node fro
11960 DeleteNode(Node* node) DeleteNode() argument
11968 vma_delete(GetAllocationCallbacks(), node); DeleteNode() local
12033 Node* node = m_Root; FreeAtOffset() local
12069 vma_delete(GetAllocationCallbacks(), node); FreeAtOffset() local
12081 CalcAllocationStatInfoNode(VmaStatInfo& outInfo, const Node* node, VkDeviceSize levelNodeSize) const CalcAllocationStatInfoNode() argument
12123 AddToFreeListFront(uint32_t level, Node* node) AddToFreeListFront() argument
12145 RemoveFromFreeList(uint32_t level, Node* node) RemoveFromFreeList() argument
12177 PrintDetailedMapNode(class VmaJsonWriter& json, const Node* node, VkDeviceSize levelNodeSize) const PrintDetailedMapNode() argument
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_from_nir.cpp1398 foreach_list_typed(nir_cf_node, node, node, &function->impl->body) {
1399 if (!visit(node))
1417 Converter::visit(nir_cf_node *node)
1419 switch (node->type) {
1421 return visit(nir_cf_node_as_block(node));
1423 return visit(nir_cf_node_as_if(node));
1425 return visit(nir_cf_node_as_loop(node));
1427 ERROR("unknown nir_cf_node type %u\n", node->type);
1469 foreach_list_typed(nir_cf_node, node, nod
[all...]
/third_party/icu/icu4c/source/common/
H A Drbbiscan.cpp252 // The openParen node is a dummy operation type with a low precedence, in doParseActions()
268 // The top of the node stack has the $variable ref node. in doParseActions()
270 // Save the start position of the RHS text in the StartExpression node in doParseActions()
271 // that precedes the $variableReference node on the stack. in doParseActions()
277 // Push a new start-of-expression node; needed to keep parse of the in doParseActions()
290 // Terminate expression, leaves expression parse tree rooted in TOS node. in doParseActions()
298 // in the root of the node for the right-hand-side expression. in doParseActions()
303 // Expression parse tree becomes l. child of the $variable reference node. in doParseActions()
307 // Make a symbol table entry for the $variableRef node in doParseActions()
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_bc_finalize.cpp254 node *prev_node = NULL; in run_on()
256 node *n = *I; in run_on()
299 void bc_finalizer::finalize_alu_group(alu_group_node* g, node *prev_node) { in finalize_alu_group()
890 unsigned bc_finalizer::get_stack_depth(node *n, unsigned &loops, in get_stack_depth()
990 node *p = c->prev; in cf_peephole()
/third_party/node/deps/icu-small/source/common/
H A Drbbiscan.cpp252 // The openParen node is a dummy operation type with a low precedence, in doParseActions()
268 // The top of the node stack has the $variable ref node. in doParseActions()
270 // Save the start position of the RHS text in the StartExpression node in doParseActions()
271 // that precedes the $variableReference node on the stack. in doParseActions()
277 // Push a new start-of-expression node; needed to keep parse of the in doParseActions()
290 // Terminate expression, leaves expression parse tree rooted in TOS node. in doParseActions()
298 // in the root of the node for the right-hand-side expression. in doParseActions()
303 // Expression parse tree becomes l. child of the $variable reference node. in doParseActions()
307 // Make a symbol table entry for the $variableRef node in doParseActions()
[all...]
/third_party/mesa3d/src/gallium/drivers/freedreno/
H A Dfreedreno_gmem.c284 list_inithead(&gmem->node); in gmem_stateobj_init()
465 list_del(&gmem->node); in __fd_gmem_destroy()
570 list_last_entry(&cache->lru, struct fd_gmem_stateobj, node); in lookup_gmem_state()
580 list_delinit(&gmem->node); in lookup_gmem_state()
581 list_add(&gmem->node, &cache->lru); in lookup_gmem_state()
/third_party/mesa3d/src/panfrost/lib/
H A Dpan_blend.c794 &shader->variants, node) { in pan_blend_get_shader_locked()
806 list_add(&variant->node, &shader->variants); in pan_blend_get_shader_locked()
809 variant = list_last_entry(&shader->variants, struct pan_blend_shader_variant, node); in pan_blend_get_shader_locked()
810 list_del(&variant->node); in pan_blend_get_shader_locked()
811 list_add(&variant->node, &shader->variants); in pan_blend_get_shader_locked()
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbiscan.cpp252 // The openParen node is a dummy operation type with a low precedence, in doParseActions()
268 // The top of the node stack has the $variable ref node. in doParseActions()
270 // Save the start position of the RHS text in the StartExpression node in doParseActions()
271 // that precedes the $variableReference node on the stack. in doParseActions()
277 // Push a new start-of-expression node; needed to keep parse of the in doParseActions()
290 // Terminate expression, leaves expression parse tree rooted in TOS node. in doParseActions()
298 // in the root of the node for the right-hand-side expression. in doParseActions()
303 // Expression parse tree becomes l. child of the $variable reference node. in doParseActions()
307 // Make a symbol table entry for the $variableRef node in doParseActions()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc25 // (1) Maintain a rank for each node that is consistent
193 // HASH_FOR_EACH(elem, node->out) { ... }
259 // We encode a node index and a node version in GraphId. The version
288 void* stack[40]; // stack[0,nstack-1] holds stack trace for node.
291 // Hash table for pointer to node index lookups.
372 for (auto* node : rep_->nodes_) { in ~GraphCycles()
373 node->Node::~Node(); in ~GraphCycles()
374 base_internal::LowLevelAlloc::Free(node); in ~GraphCycles()
387 ABSL_RAW_LOG(FATAL, "Did not find live node i in CheckInvariants()
466 HasNode(GraphId node) HasNode() argument
[all...]
/third_party/selinux/libsepol/src/
H A Dhierarchy.c134 avtab_ptr_t n = cur->node; in bounds_expand_cond_rules()
332 avtab_ptr_t ap = cur->node; in bounds_check_cond_rules()
392 cond_list_t *node = cur->cond_list; in bounds_check_child_rules() local
395 node->true_list, child, parent, in bounds_check_child_rules()
401 node->false_list, child, parent, in bounds_check_child_rules()
/third_party/curl/lib/
H A Daltsvc.h51 struct Curl_llist_element node; member
/third_party/mesa3d/src/freedreno/vulkan/
H A Dtu_autotune.h112 struct list_head node; member
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_rt_common.h50 nir_ssa_def *build_node_to_addr(struct radv_device *device, nir_builder *b, nir_ssa_def *node);
67 * nodes + 1 triangle node
68 * + 1 instance node. Furthermore, when processing a box node, worst case we actually
/third_party/mesa3d/src/imagination/rogue/
H A Drogue_instr.h88 struct list_head node; /** Linked list node. */ member
/third_party/node/src/crypto/
H A Dcrypto_hkdf.h12 namespace node { namespace
60 } // namespace node
H A Dcrypto_scrypt.h11 namespace node { namespace
84 } // namespace node

Completed in 37 milliseconds

1...<<61626364656667686970>>...101