| /external/llvm/include/llvm/CodeGen/ |
| H A D | LatencyPriorityQueue.h | 57 void addNode(const SUnit *SU) { function in class:llvm::LatencyPriorityQueue
|
| /external/chromium/chrome/browser/resources/net_internals/ |
| H A D | util.js | 50 function addNode(parentNode, tagName) { function
313 var table = addNode(parent, 'table');
316 var thead = addNode(table, 'thead');
317 var tbody = addNode(table, 'tbody');
321 var tableTitleRow = addNode(thead, 'tr');
332 row = addNode(thead, 'tr');
335 row = addNode(tbody, 'tr');
341 var tableCell = addNode(row, cellType, cell.text);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| H A D | ExplodedGraph.cpp | 142 Preds.addNode(V, G);
143 V->Succs.addNode(this, G);
155 void ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { function in class:ExplodedNode::NodeGroup
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| H A D | DOM2DTM.java | 130 m_last_kid=addNode(m_root, m_last_parent,m_last_kid, NULL);
135 // %REVIEW% Move this logic into addNode and recurse? Cleaner!
153 // addNode() will take care of switching it from
155 attrIndex=addNode(attrs.item(i),0,attrIndex,NULL);
182 protected int addNode(Node node, int parentIndex, method in class:DOM2DTM
470 // contiguous sequence, and -- AFTER the DTM addNode -- can be used to
523 int nextindex=addNode(next,m_last_parent,m_last_kid,
540 // addNode() will take care of switching it from
542 attrIndex=addNode(attrs.item(i),
570 attrIndex=addNode(ne
[all...] |
| /external/guava/src/com/google/common/collect/ |
| H A D | LinkedListMultimap.java | 183 private Node<K, V> addNode( method in class:LinkedListMultimap
411 previous = addNode((K) key, value, next);
459 addNode(key, value, null);
|
| /external/llvm/include/llvm/ADT/ |
| H A D | Trie.h | 159 inline Node* addNode(const Payload& data, const std::string label = "") { function in class:llvm::Trie
174 Node* nNode = addNode(Empty, l1);
189 addNode(Empty);
231 tNode = addNode(data, s1.substr(r));
235 tNode = addNode(data, s1);
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| H A D | NodeSet.java | 135 addNode(node);
379 public void addNode(Node n) method in class:NodeSet
|
| H A D | NodeSetDTM.java | 173 addNode(handle); // addNodeInDocOrder(handle, xctxt);
189 addNode(node);
535 public void addNode(int n) method in class:NodeSetDTM
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 168 NodeItr addNode(const Vector &costs) { function in class:PBQP::Graph
417 nodeMap[nItr] = addNode(other.getNodeCosts(nItr));
|
| /external/llvm/lib/Analysis/ |
| H A D | PathNumbering.cpp | 239 _root = addNode(&(_function.getEntryBlock()));
240 _exit = addNode(NULL);
435 childNode = addNode(succBB);
490 BallLarusNode* BallLarusDag::addNode(BasicBlock* BB) { function in class:BallLarusDag
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
| H A D | SAX2DTM.java | 867 protected int addNode(int type, int expandedTypeID, method in class:SAX2DTM
1535 m_previous = addNode(m_coalescedTextType, exName,
1693 int doc = addNode(DTM.DOCUMENT_NODE,
1883 int elemNode = addNode(DTM.ELEMENT_NODE, exName,
1903 prev = addNode(DTM.NAMESPACE_NODE, exName, elemNode,
1921 prev = addNode(DTM.NAMESPACE_NODE, exName, elemNode,
1978 prev = addNode(nodeType, exName, elemNode, prev, val,
2139 m_previous = addNode(DTM.PROCESSING_INSTRUCTION_NODE, exName,
2461 m_previous = addNode(DTM.COMMENT_NODE, exName,
|
| H A D | SAX2DTM2.java | 2093 int elemNode = addNode(DTM.ELEMENT_NODE, exName,
2113 addNode(DTM.NAMESPACE_NODE, exName, elemNode,
2132 addNode(DTM.NAMESPACE_NODE, exName, elemNode, DTM.NULL, val, false);
2187 addNode(nodeType, exName, elemNode, DTM.NULL, val,
2271 m_previous = addNode(DTM.COMMENT_NODE, DTM.COMMENT_NODE,
2285 int doc = addNode(DTM.DOCUMENT_NODE,
2334 protected final int addNode(int type, int expandedTypeID, method in class:SAX2DTM2
2415 m_previous = addNode(m_coalescedTextType, DTM.TEXT_NODE,
2424 m_previous = addNode(m_coalescedTextType, DTM.TEXT_NODE,
2462 m_previous = addNode(DT
[all...] |
| /external/icu4c/common/ |
| H A D | triedict.cpp | 742 void addNode(UChar ch, BuildCompactTrieNode *link, UErrorCode &status) { function in class:BuildCompactTrieHorizontalNode
867 building->addNode(node->ch, link, status);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGRRList.cpp | 922 AvailableQueue->addNode(LoadSU);
923 AvailableQueue->addNode(NewSU);
963 AvailableQueue->addNode(NewSU);
1014 AvailableQueue->addNode(CopyFromSU);
1015 AvailableQueue->addNode(CopyToSU);
1566 void addNode(const SUnit *SU);
1764 void RegReductionPQBase::addNode(const SUnit *SU) { function in class:RegReductionPQBase
|