| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 102 if (SEMI(ei.getNode()->tag) < 0) {
103 buildDFS(ei.getNode());
104 PARENT(ei.getNode()->tag) = node->tag;
145 nv = ei.getNode();
200 BasicBlock *dfLocal = BasicBlock::get(succIt.getNode());
206 BasicBlock *cb = BasicBlock::get(chldIt.getNode());
230 BasicBlock *out = BasicBlock::get(ei.getNode());
271 BasicBlock *in = BasicBlock::get(ei.getNode());
491 BasicBlock *sb = BasicBlock::get(ei.getNode());
495 if (ei.getNode() == &bb->cfg
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 127 m_pos=m_root = domSource.getNode();
604 public Node getNode(int nodeHandle)
816 Node node = getNode(nodeHandle);
871 Node node = getNode(nodeHandle);
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 310 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
373 /// getNode - return the (Post)DominatorTree node for the specified basic
377 DomTreeNodeBase<NodeT> *getNode(NodeT *BB) const {
384 /// See getNode.
385 DomTreeNodeBase<NodeT> *operator[](NodeT *BB) const { return getNode(BB); }
400 const DomTreeNodeBase<NodeT> *RN = getNode(R);
432 return isReachableFromEntry(getNode(const_cast<NodeT *>(A)));
505 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
506 DomTreeNodeBase<NodeT> *NodeB = getNode(B);
559 assert(getNode(BB) == nullptr && "Block already in dominator tree!")
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 286 const SDNode *Node = RegDefPos.GetNode();
419 if (IsChainDependent(Op.getNode(), Inner, NestLevel, TII))
438 N = Op.getNode();
470 if (SDNode *New = FindCallSeqStart(Op.getNode(),
498 N = Op.getNode();
551 for (SDNode *Node = SU->getNode(); Node; Node = Node->getGluedNode())
631 // if (!SU->getNode() || !SU->getNode()->isMachineOpcode()) return;
669 if (!SU->getNode())
672 switch (SU->getNode()->getOpcode())
[all...] |
| SelectionDAG.cpp | 102 N = N->getOperand(0).getNode();
150 N = N->getOperand(0).getNode();
365 ID.AddPointer(Op.getNode());
375 ID.AddPointer(Op.getNode());
632 SDNode *Operand = Use.getNode();
[all...] |
| StatepointLowering.cpp | 213 if (OldLocation.getNode())
322 SDNode *CallEnd = CallEndVal.getNode();
342 CallEnd = CallEnd->getOperand(0).getNode();
345 CallEnd = CallEnd->getOperand(0).getNode();
386 return CallEnd->getOperand(0).getNode();
427 if (!Loc.getNode()) {
446 assert(Loc.getNode());
606 if (Loc.getNode()) {
722 DAG.getNode(ISD::GC_TRANSITION_START, getCurSDLoc(), NodeTys, TSOps);
745 SDValue CallTarget = SDValue(CallNode->getOperand(1).getNode(), 0)
[all...] |
| ScheduleDAGFast.cpp | 214 if (SU->getNode()->getGluedNode())
217 SDNode *N = SU->getNode();
231 MVT VT = Op.getNode()->getSimpleValueType(Op.getResNo());
247 unsigned OldNumVals = SU->getNode()->getNumValues();
249 DAG->ReplaceAllUsesOfValueWith(SDValue(SU->getNode(), i), SDValue(N, i));
250 DAG->ReplaceAllUsesOfValueWith(SDValue(SU->getNode(), OldNumVals-1),
289 else if (I->getSUnit()->getNode() &&
290 I->getSUnit()->getNode()->isOperandOf(LoadNode))
490 for (SDNode *Node = SU->getNode(); Node; Node = Node->getGluedNode()) {
540 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRMap.h | 77 - (NSInteger)getNode:(ANTLRMapElement *)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRMap.h | 77 - (NSInteger)getNode:(ANTLRMapElement *)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRMap.h | 77 - (NSInteger)getNode:(ANTLRMapElement *)aNode;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRMap.h | 77 - (NSInteger)getNode:(ANTLRMapElement *)aNode;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeProxy.java | 342 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
355 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
384 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
397 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
410 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
427 return (newnode == DTM.NULL) ? null : dtm.getNode(newnode);
478 return (Document)(dtm.getNode(dtm.getOwnerDocument(node)));
625 return (Element)(dtm.getNode(elementhandle));
746 Node retNode = dtm.getNode(node);
759 traverseChildren(listVector, dtm.getNode(node), tagname
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| WorkList.h | 49 ExplodedNode *getNode() const { return node; }
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| MethodItem.java | 57 public ICoverageNode getNode() {
|
| TablePage.java | 73 context.getTable().render(body, items, getNode(),
|
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/page/ |
| NodePageTest.java | 62 assertSame(node, page.getNode());
|
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizePICCall.cpp | 50 const MachineDomTreeNode *getNode() const;
163 const MachineDomTreeNode *MBBInfo::getNode() const { return Node; }
200 const MachineDomTreeNode *Node = MBBI.getNode();
210 MachineBasicBlock *MBB = MBBI.getNode()->getBlock();
|
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 230 DomTreeNode *TINode = DT->getNode(TIBB);
241 DestBBNode = DT->getNode(DestBB);
243 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
253 if (!DestBBNode) DestBBNode = DT->getNode(DestBB);
|
| LCSSA.cpp | 102 DomTreeNode *DomNode = DT.getNode(DomBB);
113 if (!DT.dominates(DomNode, DT.getNode(ExitBB)))
211 DomTreeNode *DomNode = DT.getNode(BB);
213 if (DT.dominates(DomNode, DT.getNode(ExitBB)))
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/findUsages/ |
| SmaliUsageTargetProvider.java | 63 ASTNode node = element.getNode();
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/psi/impl/ |
| SmaliLiteral.java | 54 ASTNode literalNode = getNode().getFirstChildNode();
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 118 if (U.getNode()->getLocation().getAs<BlockEntrance>())
221 ExplodedNode *Node = WU.getNode();
514 ExplodedNode *Node = G.getNode(Loc, State, false, &IsNew);
569 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew);
585 ExplodedNode *Node = G.getNode(Loc, N->getState(), false, &isNew);
631 ExplodedNode *N = C.Eng.G.getNode(Loc, State, MarkAsSink, &IsNew);
674 Eng.G.getNode(BlockEdge(Src, I.getBlock(), Pred->getLocationContext()),
694 Eng.G.getNode(BlockEdge(Src, I.getBlock(), Pred->getLocationContext()),
719 Eng.G.getNode(BlockEdge(Src, DefaultBlock, Pred->getLocationContext()),
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/ |
| ModelInstance.java | 131 Node copy, node = model.getNode(nodeId, recursive);
263 bindPose.keys[j] = getNode(bindPose.keys[j].id);
293 final Node node = getNode(nanim.node.id);
452 public Node getNode (final String id) {
453 return getNode(id, true);
459 public Node getNode (final String id, boolean recursive) {
460 return getNode(id, recursive, false);
467 public Node getNode (final String id, boolean recursive, boolean ignoreCase) {
468 return Node.getNode(nodes, id, recursive, ignoreCase);
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| SIISelLowering.cpp | 299 SDValue OpNode = DAG.getNode(VCCNode, DL, MVT::i64,
300 DAG.getNode(SIISD::VCC_BITCAST, DL, MVT::i64,
302 DAG.getNode(SIISD::VCC_BITCAST, DL, MVT::i64,
305 return DAG.getNode(SIISD::VCC_BITCAST, DL, MVT::i1, OpNode);
317 CmpValue = DAG.getNode(
324 Result = DAG.getNode(
384 SDValue Cond = DAG.getNode(ISD::SETCC, DL, MVT::i1, LHS, RHS, CC);
385 return DAG.getNode(ISD::SELECT, DL, VT, Cond, True, False);
409 return DAG.getNode(ISD::SETCC, DL, VT, N->getOperand(0),
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCISelDAGToDAG.cpp | 354 .getNode();
373 return isIntS16Immediate(Op.getNode(), Imm);
400 return isInt32Immediate(N.getNode(), Imm);
460 && isInt32Immediate(N->getOperand(1).getNode(), Imm);
487 !isInt32Immediate(N->getOperand(1).getNode(), Shift) || (Shift > 31))
881 DEBUG(dbgs() << "\tbit group for " << V.getNode() << " RLAmt = " << R <<
[all...] |
