| /external/u-boot/fs/cbfs/ |
| cbfs.c | 70 * @param newNode A pointer to the file structure to load.
77 struct cbfs_cachenode *newNode, u32 *used)
104 newNode->next = NULL;
105 newNode->type = header.type;
106 newNode->data = start + header.offset;
107 newNode->data_length = header.len;
109 newNode->name = (char *)fileHeader +
111 newNode->name_length = name_len;
112 newNode->checksum = header.checksum;
128 struct cbfs_cachenode *newNode;
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_deadlock_detector_test.cc | 53 uptr node = d.newNode(0);
61 uptr node = d.newNode(0);
69 uptr node = d.newNode(0);
77 uptr n1 = d.newNode(1);
78 uptr n2 = d.newNode(2);
101 uptr n1 = d.newNode(1);
102 uptr n2 = d.newNode(2);
103 uptr n3 = d.newNode(3);
143 uptr l0 = d.newNode(0);
144 uptr l1 = d.newNode(1)
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/observer/ |
| AstObserver.java | 69 void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode);
|
| AstObserverAdapter.java | 45 public void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode) {
|
| PropagatingAstObserver.java | 76 public void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode) {
77 if (oldNode == newNode) {
81 considerAdding(newNode);
82 concreteListReplacement(observedNode, index, oldNode, newNode);
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
| rexpr.c | 81 static NodePtr newNode( void );
98 static NodePtr newNode();
439 static NodePtr newNode(void)
441 static NodePtr newNode()
478 g.left = newNode();
479 g.right = newNode();
508 g.left = newNode();
511 g.right = newNode();
528 g.left = newNode();
529 g.right = newNode();
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMBuilder.java | 173 * @param newNode New node to append
175 protected void append(Node newNode) throws org.xml.sax.SAXException
183 currentNode.insertBefore(newNode, m_nextSibling);
185 currentNode.appendChild(newNode);
187 // System.out.println(newNode.getNodeName());
192 m_docFrag.insertBefore(newNode, m_nextSibling);
194 m_docFrag.appendChild(newNode);
199 short type = newNode.getNodeType();
203 String data = newNode.getNodeValue();
229 m_doc.insertBefore(newNode, m_nextSibling)
[all...] |
| /external/icu/icu4c/source/common/ |
| stringtriebuilder.cpp | 319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) {
321 delete newNode;
324 if(newNode==NULL) {
328 const UHashElement *old=uhash_find(nodes, newNode);
330 delete newNode;
334 // registered node, then uhash_find() failed to find that and we will leak newNode.
338 uhash_puti(nodes, newNode, 1, &errorCode);
341 delete newNode;
344 return newNode;
357 Node *newNode=new FinalValueNode(value)
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/icu/ |
| ResourceSplitter.java | 340 ResourceTable newNode = new ResourceTable();
341 newNode.name = nodeName;
342 parent.first = newNode;
343 return newNode;
362 ResourceTable newNode = new ResourceTable();
363 newNode.name = nodeName;
364 child.next = newNode;
365 return newNode;
|
| /external/antlr/runtime/ObjC/Framework/ |
| Entry.h | 43 + (LMNode *) newNode:(LMNode *)aPrev element:(id)anElement next:(LMNode *)aNext;
|
| LinkedList.h | 20 + (LLNode *) newNode:(LLNode *)aPrev element:(id)anElement next:(LLNode *)aNext;
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| StringTrieBuilder.java | 135 * 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) {
142 return newNode;
145 Node oldNode=nodes.get(newNode);
150 // registered node, then get() failed to find that and we will leak newNode.
151 oldNode=nodes.put(newNode, newNode);
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| StringTrieBuilder.java | 136 * 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) {
143 return newNode;
146 Node oldNode=nodes.get(newNode);
151 // registered node, then get() failed to find that and we will leak newNode.
152 oldNode=nodes.put(newNode, newNode);
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/json/ |
| CldrItem.java | 187 CldrNode newNode = CldrNode.createNode(parent, node.getName(),
190 newNode.getDistinguishingAttributes().putAll(
192 newNode.getDistinguishingAttributes().remove("type");
194 newNode.getDistinguishingAttributes().put("type", segments[j]);
195 nodesInPath.add(newNode);
|
| /external/icu/icu4c/source/tools/ctestfw/ |
| ctest.c | 174 TestNode *newNode;
176 newNode = (TestNode*)malloc(sizeof(TestNode) + (nameLen + 1));
178 newNode->test = NULL;
179 newNode->sibling = NULL;
180 newNode->child = NULL;
182 strncpy( newNode->name, name, nameLen );
183 newNode->name[nameLen] = 0;
185 return newNode;
208 TestNode *newNode;
214 newNode = addTestNode( *root, name )
[all...] |
| /external/testng/src/test/java/test/ |
| GraphTest.java | 165 String newNode = String.valueOf(i + (100 * depth));
166 g.addNode(newNode);
172 g.addPredecessor(newNode, prevNode);
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNamedNodeMap.java | 146 * @param newNode node to store in this map. The node will later be
161 public Node setNamedItem(Node newNode)
|
| /external/antlr/runtime/C/src/ |
| antlr3basetree.c | 276 pANTLR3_BASE_TREE newNode;
282 newNode = (pANTLR3_BASE_TREE)t->dupTree(t);
283 newTree->addChild(newTree, newNode);
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| PathNumbering.cpp | 491 BallLarusNode* newNode = createNode(BB);
492 _nodes.push_back(newNode);
493 return( newNode );
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPNode.java | 435 XMPNode newNode = new XMPNode(name, value, newOptions);
436 cloneSubtree(newNode);
438 return newNode;
|
| /build/soong/cmd/fileslist/ |
| fileslist.go | 58 func newNode(hostPath string, devicePath string, stat os.FileInfo) Node {
144 ch <- newNode(absPath, devicePath, stat)
|
| /external/deqp-deps/glslang/glslang/MachineIndependent/ |
| Constant.cpp | 387 TIntermConstantUnion *newNode = new TIntermConstantUnion(newConstArray, returnType);
388 newNode->setLoc(getLoc());
390 return newNode;
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| EscapeAnalysis.java | 182 * newNode will have its old links as well as all links from the oldNode.
185 * @param newNode {@code non-null;} the EscapeSet to merge all links into
188 private void replaceNode(EscapeSet newNode, EscapeSet oldNode) {
191 e.childSets.add(newNode);
192 newNode.parentSets.add(e);
196 e.parentSets.add(newNode);
197 newNode.childSets.add(e);
[all...] |
| /external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/ast/ |
| NodeListTest.java | 64 public void listReplacement(NodeList observedNode, int index, Node oldNode, Node newNode) {
66 changes.add(String.format("'%s' %s in list at %d", newNode, ListChangeType.ADDITION, index));
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_deadlock_detector1.cc | 100 m->id = dd.newNode(reinterpret_cast<uptr>(m));
|
