| /third_party/node/tools/dep_updaters/ |
| H A D | update-uvwasi.sh | 8 [ -z "$NODE" ] && NODE="$BASE_DIR/out/Release/node"
9 [ -x "$NODE" ] || NODE=$(command -v node)
|
| /third_party/node/test/fixtures/postject-copy/node_modules/postject/dist/ |
| H A D | cli.js | 1 #!/usr/bin/env node
|
| /third_party/nghttp2/src/ |
| H A D | shrpx_router.h | 49 // Stores pointer to the string this node represents. Not
54 // Index of pattern if match ends in this node. Note that we don't
57 // Index of wildcard pattern if query includes this node as prefix
87 // the first node to start matching. If it is nullptr, match will
90 // |*last_node| has the last matched node. One can continue to
96 void add_node(RNode *node, const char *pattern, size_t patlen, ssize_t index,
103 // The root node of Patricia tree. This is special node and its s
|
| /third_party/node/benchmark/ |
| H A D | scatter.js | 10 const cli = new CLI(`usage: ./node scatter.js [options] [--] <filename>
22 // Create queue from the benchmarks list such both node versions are tested
|
| /third_party/node/deps/npm/node_modules/is-core-module/ |
| H A D | index.js | 47 ? process.versions && process.versions.node
51 throw new TypeError(typeof nodeVersion === 'undefined' ? 'Unable to determine current node version' : 'If provided, a valid node version is required');
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | loop-peeling.h | 24 // Maps {node} to its corresponding copy in the peeled iteration, if
25 // the node was part of the body of the loop. Returns {node} otherwise.
26 Node* map(Node* node);
|
| H A D | raw-machine-assembler.h | 18 #include "src/compiler/node-matchers.h"
19 #include "src/compiler/node.h"
147 bool IsMapOffsetConstant(Node* node) { in IsMapOffsetConstant() argument
148 Int64Matcher m(node); in IsMapOffsetConstant()
150 // Test if `node` is a `Phi(Int64Constant(0))` in IsMapOffsetConstant()
151 if (node->opcode() == IrOpcode::kPhi) { in IsMapOffsetConstant()
152 for (Node* input : node->inputs()) { in IsMapOffsetConstant()
159 bool IsMapOffsetConstantMinusTag(Node* node) { in IsMapOffsetConstantMinusTag() argument
160 Int64Matcher m(node); in IsMapOffsetConstantMinusTag()
935 Node* StoreToPointer(void* address, MachineRepresentation rep, Node* node) { in StoreToPointer() argument
942 UnalignedStoreToPointer(void* address, MachineRepresentation rep, Node* node) UnalignedStoreToPointer() argument
[all...] |
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-compilation-unit.h | 50 void RegisterNodeInGraphLabeller(const Node* node);
|
| /third_party/mesa3d/src/gallium/drivers/freedreno/ |
| H A D | freedreno_gmem.h | 67 struct list_head node; member
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/ |
| H A D | Name.h | 64 ANGLE_NO_DISCARD bool ExpressionContainsName(const Name &name, TIntermTyped &node);
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/ |
| H A D | ShaderStorageBlockFunctionHLSL.h | 62 TIntermSwizzle *node);
|
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| H A D | ftccback.h | 85 ftc_node_destroy( FTC_Node node,
|
| /third_party/python/Lib/idlelib/idle_test/ |
| H A D | test_stackviewer.py | 43 isi(stackviewer.node, TreeNode)
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| H A D | graphcycles.h | 49 // Opaque identifier for a graph node.
72 // Remove "ptr" from the graph. Its corresponding node and all
88 // Return whether node exists in the graph.
89 bool HasNode(GraphId node);
106 // shortest, but no node will appear twice in the path, except the
107 // source and destination node if they are identical; therefore, the
|
| /third_party/skia/modules/skottie/src/effects/ |
| H A D | DirectionalBlur.cpp | 46 this->node()->setImageFilter(std::move(filter));
|
| H A D | ThresholdEffect.cpp | 64 this->node()->setColorFilter(std::move(cf));
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/utils/ |
| H A D | http-utils.h | 43 xml_node_t * soap_send_receive(struct http_ctx *ctx, xml_node_t *node);
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/utils/ |
| H A D | http-utils.h | 43 xml_node_t * soap_send_receive(struct http_ctx *ctx, xml_node_t *node);
|
| /third_party/gn/src/gn/ |
| H A D | functions.h | 34 // This type of function invocation takes a block node that it will execute.
497 bool EnsureNotReadingFromSameDeclareArgs(const ParseNode* node,
503 // will set the error, blame the given parse node for it, and return false.
504 bool EnsureNotProcessingImport(const ParseNode* node,
509 bool EnsureNotProcessingBuildConfig(const ParseNode* node,
|
| /third_party/curl/lib/ |
| H A D | hsts.c | 143 Curl_llist_insert_next(&h->list, h->list.tail, sts, &sts->node); in hsts_create()
223 Curl_llist_remove(&h->list, &sts->node, NULL); in Curl_hsts_parse()
278 Curl_llist_remove(&h->list, &sts->node, NULL); in Curl_hsts()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| H A D | TextTrieMap.java | 104 private synchronized void find(Node node, CharIterator chitr, ResultHandler<V> handler, Output output) { in find() argument
105 Iterator<V> values = node.values(); in find()
112 Node nextMatch = node.findMatch(chitr, output); in find()
235 * Inner class representing a text node in the trie.
351 // add a new child to this node in add()
390 // split the current node at the offset in split()
|
| /third_party/icu/icu4c/source/common/ |
| H A D | ucharstriebuilder.cpp | 399 UCharsTrieBuilder::writeValueAndType(UBool hasValue, int32_t value, int32_t node) { in writeValueAndType() argument
401 return write(node); in writeValueAndType()
418 intUnits[0]|=(UChar)node; in writeValueAndType()
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| H A D | list.h | 311 #define INIT_HLIST_NODE(node) \
313 (node)->next = NULL; \
314 (node)->pprev = NULL; \
|
| /third_party/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/coverage/ |
| H A D | JacocoReportCheck.java | 155 Node node = nodes.item(idx); in parseReport()
156 if (node.getNodeType() != Node.ELEMENT_NODE) { in parseReport()
159 Element reportElement = (Element)node; in parseReport()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/ |
| H A D | TextTrieMap.java | 109 private synchronized void find(Node node, CharIterator chitr, ResultHandler<V> handler, Output output) { in find() argument
110 Iterator<V> values = node.values(); in find()
117 Node nextMatch = node.findMatch(chitr, output); in find()
244 * Inner class representing a text node in the trie.
360 // add a new child to this node in add()
399 // split the current node at the offset in split()
|