Home
last modified time | relevance | path

Searched refs:newNode (Results 1 - 25 of 38) sorted by relevance

12

/third_party/icu/icu4c/source/common/
H A Dstringtriebuilder.cpp319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) { in registerNode() argument
321 delete newNode; in registerNode()
324 if(newNode==NULL) { in registerNode()
328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
330 delete newNode; in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
338 uhash_puti(nodes, newNode, 1, &errorCode); in registerNode()
341 delete newNode; in registerNode()
344 return newNode; in registerNode()
357 Node *newNode in registerFinalValue() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dstringtriebuilder.cpp319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) { in registerNode() argument
321 delete newNode; in registerNode()
324 if(newNode==nullptr) { in registerNode()
328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
330 delete newNode; in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
338 uhash_puti(nodes, newNode, 1, &errorCode); in registerNode()
341 delete newNode; in registerNode()
344 return newNode; in registerNode()
357 Node *newNode in registerFinalValue() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dstringtriebuilder.cpp319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) { in registerNode() argument
321 delete newNode; in registerNode()
324 if(newNode==NULL) { in registerNode()
328 const UHashElement *old=uhash_find(nodes, newNode); in registerNode()
330 delete newNode; in registerNode()
334 // registered node, then uhash_find() failed to find that and we will leak newNode. in registerNode()
338 uhash_puti(nodes, newNode, 1, &errorCode); in registerNode()
341 delete newNode; in registerNode()
344 return newNode; in registerNode()
357 Node *newNode in registerFinalValue() local
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DScalarizeVecAndMatConstructorArgs.cpp140 TIntermBinary *newNode = in scalarizeArgs() local
142 sequence->push_back(newNode); in scalarizeArgs()
161 TIntermBinary *newNode = in scalarizeArgs() local
163 sequence->push_back(newNode); in scalarizeArgs()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DStringTrieBuilder.java136 * equivalent to newNode, unless BUILDING_FAST.
137 * @param newNode Input node. The builder takes ownership.
138 * @return newNode if it is the first of its kind, or
139 * an equivalent node if newNode is a duplicate.
141 private final Node registerNode(Node newNode) { in registerNode() argument
143 return newNode; in registerNode()
146 Node oldNode=nodes.get(newNode); in registerNode()
151 // registered node, then get() failed to find that and we will leak newNode. in registerNode()
152 oldNode=nodes.put(newNode, newNode); in registerNode()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DStringTrieBuilder.java135 * equivalent to newNode, unless BUILDING_FAST.
136 * @param newNode Input node. The builder takes ownership.
137 * @return newNode if it is the first of its kind, or
138 * an equivalent node if newNode is a duplicate.
140 private final Node registerNode(Node newNode) { in registerNode() argument
142 return newNode; in registerNode()
145 Node oldNode=nodes.get(newNode); in registerNode()
150 // registered node, then get() failed to find that and we will leak newNode. in registerNode()
151 oldNode=nodes.put(newNode, newNode); in registerNode()
[all...]
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/selectors/
H A Dcontainer.js71 _proto.insertAfter = function insertAfter(oldNode, newNode) {
72 newNode.parent = this;
74 this.nodes.splice(oldIndex + 1, 0, newNode);
75 newNode.parent = this;
85 _proto.insertBefore = function insertBefore(oldNode, newNode) {
86 newNode.parent = this;
88 this.nodes.splice(oldIndex, 0, newNode);
89 newNode.parent = this;
/third_party/icu/icu4c/source/tools/ctestfw/
H A Dctest.c176 TestNode *newNode; in createTestNode() local
178 newNode = (TestNode*)malloc(sizeof(TestNode) + (nameLen + 1)); in createTestNode()
180 newNode->test = NULL; in createTestNode()
181 newNode->sibling = NULL; in createTestNode()
182 newNode->child = NULL; in createTestNode()
184 strncpy( newNode->name, name, nameLen ); in createTestNode()
185 newNode->name[nameLen] = 0; in createTestNode()
187 return newNode; in createTestNode()
210 TestNode *newNode; in addTest() local
216 newNode in addTest()
[all...]
/third_party/skia/third_party/externals/icu/source/tools/ctestfw/
H A Dctest.c174 TestNode *newNode; in createTestNode() local
176 newNode = (TestNode*)malloc(sizeof(TestNode) + (nameLen + 1)); in createTestNode()
178 newNode->test = NULL; in createTestNode()
179 newNode->sibling = NULL; in createTestNode()
180 newNode->child = NULL; in createTestNode()
182 strncpy( newNode->name, name, nameLen ); in createTestNode()
183 newNode->name[nameLen] = 0; in createTestNode()
185 return newNode; in createTestNode()
208 TestNode *newNode; in addTest() local
214 newNode in addTest()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dcrystalhd.c194 OpaqueList *newNode = av_mallocz(sizeof (OpaqueList)); in opaque_list_push() local
195 if (!newNode) { in opaque_list_push()
201 newNode->fake_timestamp = TIMESTAMP_UNIT; in opaque_list_push()
202 priv->head = newNode; in opaque_list_push()
204 newNode->fake_timestamp = priv->tail->fake_timestamp + TIMESTAMP_UNIT; in opaque_list_push()
205 priv->tail->next = newNode; in opaque_list_push()
207 priv->tail = newNode; in opaque_list_push()
208 newNode->reordered_opaque = reordered_opaque; in opaque_list_push()
210 return newNode->fake_timestamp; in opaque_list_push()
/third_party/FreeBSD/sys/compat/linuxkpi/common/src/
H A Dlinux_workqueue.c226 STATIC VOID ListAdd(struct list_head *newNode, struct list_head *prev, struct list_head *next) in ListAdd() argument
228 next->prev = newNode; in ListAdd()
229 newNode->next = next; in ListAdd()
230 newNode->prev = prev; in ListAdd()
231 prev->next = newNode; in ListAdd()
235 STATIC VOID WorkListAdd(struct list_head *newNode, struct list_head *head, UINT32 workPri) in WorkListAdd() argument
247 ListAdd(newNode, list->prev, list); in WorkListAdd()
250 STATIC VOID WorkListAddTail(struct list_head *newNode, struct list_head *head) in WorkListAddTail() argument
252 ListAdd(newNode, head->prev, head); in WorkListAddTail()
/third_party/skia/infra/bots/gen_tasks_logic/
H A Dcompile_cas.go106 // newNode returns a node instance.
107 func newNode(name string) *node {
141 child = newNode(name)
192 root: newNode(""),
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DSeparateCompoundExpressions.cpp346 auto &newNode = *new TIntermDeclaration(); variable
347 newNode.appendDeclarator(
349 pushStmt(newNode); variable
439 TIntermBinary *newNode; variable
442 newNode = &node;
446 newNode = new TIntermBinary(op, newLeft, newRight);
448 pushBinding(node, *newNode);
H A DRewriteUnaddressableReferences.cpp330 auto *newNode = asNode<TIntermTyped>(rebuild(node).single());
331 ASSERT(newNode);
336 return *newNode;
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/
H A Dparser.js364 this.newNode(new _attribute["default"](node));
501 return _this3.newNode(n);
568 return this.newNode(node);
588 this.newNode(new _comment["default"]({
635 this.newNode(new _nesting["default"]({
691 this.newNode(new _string["default"]({
716 _this4.newNode(new _pseudo["default"]({
748 this.newNode(new _string["default"]({
762 this.newNode(new _universal["default"]({
837 _this5.newNode(nod
951 _proto.newNode = function newNode(node, namespace) { global() function
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.cpp209 auto *newNode = traverseAnyAs<Node>(node); in rebuildInPlaceImpl() local
210 if (!newNode) in rebuildInPlaceImpl()
215 if (newNode != &node) in rebuildInPlaceImpl()
217 *node.getSequence() = std::move(*newNode->getSequence()); in rebuildInPlaceImpl()
275 for (TIntermNode *newNode : result.mMulti) in traverseAggregateBaseChildren()
277 if (newNode) in traverseAggregateBaseChildren()
279 newChildren.push_back(newNode); in traverseAggregateBaseChildren()
/third_party/glslang/glslang/MachineIndependent/
H A DParseHelper.cpp8251 TIntermTyped *newNode; in addConstructor() local
8256 newNode = constructAggregate(node, elementType, 1, node->getLoc()); in addConstructor()
8258 newNode = constructAggregate(node, *(*memberTypes).type, 1, node->getLoc()); in addConstructor()
8260 newNode = constructBuiltIn(type, op, node->getAsTyped(), node->getLoc(), false); in addConstructor()
8262 if (newNode && (type.isArray() || op == EOpConstructStruct)) in addConstructor()
8263 newNode = intermediate.setAggregateOperator(newNode, EOpConstructStruct, type, loc); in addConstructor()
8265 return newNode; in addConstructor()
8283 newNode = constructAggregate(*p, elementType, paramCount+1, node->getLoc()); in addConstructor()
8285 newNode in addConstructor()
8327 TIntermTyped* newNode; constructBuiltIn() local
8360 TIntermTyped* newNode = intermediate.addBuiltInFunctionCall(node->getLoc(), EOpConvPtrToUvec2, true, node, constructBuiltIn() local
8370 TIntermTyped* newNode = constructBuiltIn() local
8391 TIntermTyped* newNode = constructBuiltIn() local
8544 TIntermTyped* newNode = intermediate.addBuiltInFunctionCall(node->getLoc(), EOpConvPtrToUint64, true, node, type); constructBuiltIn() local
8566 TIntermTyped* newNode = intermediate.addBuiltInFunctionCall(node->getLoc(), EOpConvUint64ToPtr, true, node, constructBuiltIn() local
8573 TIntermTyped* newNode = intermediate.addBuiltInFunctionCall(node->getLoc(), EOpConvUvec2ToPtr, true, node, constructBuiltIn() local
[all...]
H A DConstant.cpp356 TIntermConstantUnion *newNode = new TIntermConstantUnion(newConstArray, returnType); in fold() local
357 newNode->setLoc(getLoc()); in fold()
359 return newNode; in fold()
942 TIntermConstantUnion *newNode = new TIntermConstantUnion(newConstArray, returnType); in fold() local
943 newNode->getWritableType().getQualifier().storage = EvqConst; in fold()
944 newNode->setLoc(getLoc()); in fold()
946 return newNode; in fold()
1284 TIntermConstantUnion *newNode = new TIntermConstantUnion(newConstArray, aggrNode->getType()); in fold() local
1285 newNode->getWritableType().getQualifier().storage = EvqConst; in fold()
1286 newNode in fold()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DRDFGraph.cpp778 NodeAddr<NodeBase*> DataFlowGraph::newNode(uint16_t Attrs) {
788 NodeAddr<NodeBase*> NA = newNode(0); in cloneNode()
808 NodeAddr<UseNode*> UA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags); in newUse()
815 NodeAddr<PhiUseNode*> PUA = newNode(NodeAttrs::Ref | NodeAttrs::Use | Flags); in newPhiUse()
824 NodeAddr<DefNode*> DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags); in newDef()
831 NodeAddr<DefNode*> DA = newNode(NodeAttrs::Ref | NodeAttrs::Def | Flags); in newDef()
838 NodeAddr<PhiNode*> PA = newNode(NodeAttrs::Code | NodeAttrs::Phi); in newPhi()
845 NodeAddr<StmtNode*> SA = newNode(NodeAttrs::Code | NodeAttrs::Stmt); in newStmt()
853 NodeAddr<BlockNode*> BA = newNode(NodeAttrs::Code | NodeAttrs::Block); in newBlock()
860 NodeAddr<FuncNode*> FA = newNode(NodeAttr in newFunc()
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dload-actual.js121 this.#actualTree = this.#newNode(params)
295 node = this.#newNode(params)
304 #newNode (options) {
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h152 * equivalent to newNode.
153 * @param newNode Input node. The builder takes ownership.
155 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
156 * @return newNode if it is the first of its kind, or
157 * an equivalent node if newNode is a duplicate.
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
167 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h152 * equivalent to newNode.
153 * @param newNode Input node. The builder takes ownership.
155 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==nullptr.
156 * @return newNode if it is the first of its kind, or
157 * an equivalent node if newNode is a duplicate.
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
167 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==nullptr.
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h152 * equivalent to newNode.
153 * @param newNode Input node. The builder takes ownership.
155 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
156 * @return newNode if it is the first of its kind, or
157 * an equivalent node if newNode is a duplicate.
160 Node *registerNode(Node *newNode, UErrorCode &errorCode);
167 Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java252 final DistanceTable newNode = new DistanceTable(distance); in addSubtable()
253 sub2.put(supported, newNode); in addSubtable()
254 return newNode; in addSubtable()
/third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/locale/
H A DLocaleDistanceBuilder.java252 final DistanceTable newNode = new DistanceTable(distance); in addSubtable()
253 sub2.put(supported, newNode); in addSubtable()
254 return newNode; in addSubtable()

Completed in 42 milliseconds

12