Home
last modified time | relevance | path

Searched refs:node (Results 1376 - 1400 of 2512) sorted by relevance

1...<<51525354555657585960>>...101

/third_party/node/deps/zlib/
H A Dtrees.c479 /* Index within the heap array of least frequent node in the Huffman tree */
502 * Restore the heap property by moving down the tree starting at node k,
503 * exchanging a node with the smallest of its two sons if necessary, stopping
566 if (n > max_code) continue; /* not a leaf node */ in gen_bitlen()
631 int node; /* new node being created */ in build_tree() local
654 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
655 tree[node].Freq = 1; in build_tree()
656 s->depth[node] = 0; in build_tree()
657 s->opt_len--; if (stree) s->static_len -= stree[node] in build_tree()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c431 /* Index within the heap array of least frequent node in the Huffman tree */
454 * Restore the heap property by moving down the tree starting at node k,
455 * exchanging a node with the smallest of its two sons if necessary, stopping
462 int k; /* node to move down */
525 if (n > max_code) continue; /* not a leaf node */
632 int node; /* new node being created */ local
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
656 tree[node].Freq = 1;
657 s->depth[node]
[all...]
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c423 /* Index within the heap array of least frequent node in the Huffman tree */
446 * Restore the heap property by moving down the tree starting at node k,
447 * exchanging a node with the smallest of its two sons if necessary, stopping
454 int k; /* node to move down */
517 if (n > max_code) continue; /* not a leaf node */
624 int node; /* new node being created */ local
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
648 tree[node].Freq = 1;
649 s->depth[node]
[all...]
/third_party/zlib/
H A Dtrees.c496 /* Index within the heap array of least frequent node in the Huffman tree */
519 * Restore the heap property by moving down the tree starting at node k,
520 * exchanging a node with the smallest of its two sons if necessary, stopping
585 if (n > max_code) continue; /* not a leaf node */ in gen_bitlen()
651 int node; /* new node being created */ in build_tree() local
674 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
675 tree[node].Freq = 1; in build_tree()
676 s->depth[node] = 0; in build_tree()
677 s->opt_len--; if (stree) s->static_len -= stree[node] in build_tree()
[all...]
/third_party/node/deps/v8/tools/profview/
H A Dprofview.js517 let node = children[i];
521 if (node.type === "CAT") {
524 row.style.backgroundColor = bucketFromKind(node.type).backgroundColor;
529 c.textContent = (node.ticks * 100 / this.tickCount).toFixed(2) + "%";
533 c.textContent = (node.ticks * 100 / tree.ticks).toFixed(2) + "%";
538 c.textContent = (node.ownTicks * 100 / this.tickCount).toFixed(2) + "%";
547 nameCell.appendChild(createTypeNode(node.type));
548 nameCell.appendChild(createFunctionNode(node.name, node.codeId));
550 node
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_sched.cpp67 bool rp_kcache_tracker::try_reserve(node* n) { in try_reserve()
95 void rp_kcache_tracker::unreserve(node* n) { in unreserve()
742 node *d = v->any_def(); in init_uc_val()
762 unsigned post_scheduler::init_ucm(container_node *c, node *n) { in init_ucm()
784 node *n; in schedule_bb()
914 node *n = *I; in process_fetch()
969 node *n = *I; in process_alu()
1060 void post_scheduler::update_live(node *n, val_set *born) { in update_live()
1096 node *n = rt.slot(i); in process_group()
1640 unsigned post_scheduler::try_add_instruction(node *
[all...]
/third_party/ffmpeg/libavcodec/
H A Dj2kenc.c251 /** code the value stored in node */
252 static void tag_tree_code(Jpeg2000EncoderContext *s, Jpeg2000TgtNode *node, int threshold) in tag_tree_code() argument
257 while(node->parent){ in tag_tree_code()
258 stack[++sp] = node; in tag_tree_code()
259 node = node->parent; in tag_tree_code()
263 if (curval > node->temp_val) in tag_tree_code()
264 node->temp_val = curval; in tag_tree_code()
266 curval = node->temp_val; in tag_tree_code()
269 if (node in tag_tree_code()
289 tag_tree_update(Jpeg2000TgtNode *node) tag_tree_update() argument
[all...]
/third_party/gn/src/gn/
H A Derr.cc111 Err::Err(const ParseNode* node, in Err() argument
116 if (node) { in Err()
117 LocationRange range = node->GetRange(); in Err()
/third_party/NuttX/fs/vfs/
H A Dfs_open.c115 static int do_creat(struct Vnode *parentNode, char *fullpath, mode_t mode, struct Vnode **node) in do_creat() argument
123 ret = parentNode->vop->Create(parentNode, name, mode, node); in do_creat()
136 struct PathCache *dt = PathCacheAlloc(parentNode, *node, name, strlen(name)); in do_creat()
/third_party/node/src/api/
H A Dembed_helpers.cc1 #include "node.h"
17 namespace node { namespace
35 node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_START); in SpinEventLoop()
61 node::performance::NODE_PERFORMANCE_MILESTONE_LOOP_EXIT); in SpinEventLoop()
194 } // namespace node
/third_party/node/src/
H A Dfs_event_wrap.cc25 #include "node.h"
29 namespace node { namespace
238 } // namespace node
241 node::FSEventWrap::Initialize)
243 node::FSEventWrap::RegisterExternalReferences)
H A Dnode_trace_events.cc4 #include "node.h"
14 namespace node { namespace
169 } // namespace node
172 node::NodeCategorySet::Initialize)
174 trace_events, node::NodeCategorySet::RegisterExternalReferences)
/third_party/musl/src/network/
H A Dgetnameinfo.c147 char *restrict node, socklen_t nodelen, in getnameinfo()
177 if (node && nodelen) { in getnameinfo()
210 strcpy(node, buf); in getnameinfo()
146 getnameinfo(const struct sockaddr *restrict sa, socklen_t sl, char *restrict node, socklen_t nodelen, char *restrict serv, socklen_t servlen, int flags) getnameinfo() argument
/third_party/musl/porting/linux/user/src/network/
H A Dgetnameinfo.c146 char *restrict node, socklen_t nodelen, in getnameinfo()
176 if (node && nodelen) { in getnameinfo()
207 strcpy(node, buf); in getnameinfo()
145 getnameinfo(const struct sockaddr *restrict sa, socklen_t sl, char *restrict node, socklen_t nodelen, char *restrict serv, socklen_t servlen, int flags) getnameinfo() argument
/third_party/musl/porting/liteos_a/user/src/network/
H A Dgetnameinfo.c122 char *restrict node, socklen_t nodelen, in getnameinfo()
152 if (node && nodelen) { in getnameinfo()
183 strcpy(node, buf); in getnameinfo()
121 getnameinfo(const struct sockaddr *restrict sa, socklen_t sl, char *restrict node, socklen_t nodelen, char *restrict serv, socklen_t servlen, int flags) getnameinfo() argument
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages12.c210 static void alloc_free_huge_on_node(unsigned int node, size_t size) in alloc_free_huge_on_node() argument
216 tst_res(TINFO, "Allocating and freeing %zu hugepages on node %u", in alloc_free_huge_on_node()
217 size / hpsz, node); in alloc_free_huge_on_node()
232 numa_bitmask_setbit(bm, node); in alloc_free_huge_on_node()
279 "/sys/devices/system/node/node%u/hugepages/hugepages-%dkB/nr_hugepages", in setup()
283 "/sys/devices/system/node/node%u/hugepages/hugepages-%dkB/nr_hugepages", in setup()
290 "Increasing %dkB hugepages pool on node %u to %ld", in setup()
300 "Increasing %dkB hugepages pool on node in setup()
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dsampling-heap-profiler.h67 std::unique_ptr<AllocationNode> node) { in AddChildNode()
68 return children_.emplace(id, std::move(node)).first->second.get(); in AddChildNode()
81 // Use script_id, start_position pair to uniquelly identify the node. in function_id()
174 // Translates the provided AllocationNode *node* returning an equivalent
180 AllocationProfile* profile, SamplingHeapProfiler::AllocationNode* node,
66 AddChildNode(FunctionId id, std::unique_ptr<AllocationNode> node) AddChildNode() argument
/third_party/python/Lib/idlelib/
H A Dstackviewer.py11 global sc, item, node # For testing.
17 node = TreeNode(sc.canvas, None, item)
18 node.expand()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.h29 // This helper struct forms the nodes in the tree, with each node containing its
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
83 // These indexes are used to compare two given nodes. A node is a child or
84 // grandchild of another node if its preorder index is greater than the
92 // node is dominated by its parent.
169 // Check if the dominator tree node |a| dominates the dominator tree node |b|.
178 // Check if the dominator tree node |a| strictly dominates the dominator tree
179 // node |
233 VisitChildrenIf(std::function<bool(DominatorTreeNode*)> func, iterator node) VisitChildrenIf() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddominator_tree.h29 // This helper struct forms the nodes in the tree, with each node containing its
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
83 // These indexes are used to compare two given nodes. A node is a child or
84 // grandchild of another node if its preorder index is greater than the
92 // node is dominated by its parent.
169 // Check if the dominator tree node |a| dominates the dominator tree node |b|.
178 // Check if the dominator tree node |a| strictly dominates the dominator tree
179 // node |
233 VisitChildrenIf(std::function<bool(DominatorTreeNode*)> func, iterator node) VisitChildrenIf() argument
[all...]
/third_party/skia/third_party/externals/tint/src/transform/
H A Dfirst_index_offset.cc81 for (auto* node : ctx.src->ASTNodes().Objects()) { in Run()
82 if (auto* var = node->As<ast::Variable>()) { in Run()
99 if (auto* member = node->As<ast::StructMember>()) { in Run()
/third_party/skia/modules/skottie/src/layers/shapelayer/
H A DGradient.cpp46 const sk_sp<sksg::Gradient>& node() const { return fGradient; } in node() function in skottie::internal::__anon18577::final
212 ? AttachFill(jgrad, abuilder, sksg::ShaderPaint::Make(adapter->node()), adapter)
221 ? AttachStroke(jgrad, abuilder, sksg::ShaderPaint::Make(adapter->node()), adapter)
/third_party/spirv-tools/source/opt/
H A Ddominator_tree.h29 // This helper struct forms the nodes in the tree, with each node containing its
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
83 // These indexes are used to compare two given nodes. A node is a child or
84 // grandchild of another node if its preorder index is greater than the
92 // node is dominated by its parent.
169 // Check if the dominator tree node |a| dominates the dominator tree node |b|.
178 // Check if the dominator tree node |a| strictly dominates the dominator tree
179 // node |
233 VisitChildrenIf(std::function<bool(DominatorTreeNode*)> func, iterator node) VisitChildrenIf() argument
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_read_image.cpp476 LZWExpanderNode *node = &fTable [0]; in InitTable() local
481 node->prefix = -1; in InitTable()
482 node->final = (int16) code; in InitTable()
483 node->depth = 1; in InitTable()
485 node++; in InitTable()
508 LZWExpanderNode *node = &fTable [nextCode]; in AddTable() local
510 node->prefix = (int16) w; in AddTable()
511 node->final = (int16) k; in AddTable()
512 node->depth = 1 + parentNode->depth; in AddTable()
709 const LZWExpanderNode &node in Expand() local
745 const LZWExpanderNode &node = fTable [code]; Expand() local
763 const LZWExpanderNode &node = fTable [code]; Expand() local
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/pipeline/
H A DvktPipelineLibraryTests.cpp121 for (const auto& node: pipelineTreeConfiguration) in getTestName()
123 if (level != node.parentIndex) in getTestName()
125 DE_ASSERT(level < node.parentIndex); in getTestName()
129 level = node.parentIndex; in getTestName()
132 result += de::toString(node.shaderCount); in getTestName()
878 for (deInt32 nodeNdx = nodeNdxLast; nodeNdx >= 0 ; --nodeNdx) // We expect only backward node reference, thus build pipielines from end is safe in runTest()
880 RuntimePipelineTreeNode& node = runtimePipelineTreeConfiguration[nodeNdx]; in runTest() local
883 const VkGraphicsPipelineLibraryFlagsEXT subtreeGraphicsPipelineLibraryFlags = node.subtreeGraphicsPipelineLibraryFlags | node.graphicsPipelineLibraryFlags; in runTest()
905 const VkRenderPass renderPassHandle = getRenderPass(node in runTest()
1115 RuntimePipelineTreeNode& node = runtimePipelineTreeConfiguration[nodeNdx]; iterate() local
1147 const RuntimePipelineTreeNode& node = runtimePipelineTreeConfiguration[nodeNdx]; iterate() local
[all...]

Completed in 21 milliseconds

1...<<51525354555657585960>>...101