| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 68 unsigned getLatency(unsigned NodeNum) const {
69 assert(NodeNum < (*SUnits).size());
70 return (*SUnits)[NodeNum].getHeight();
73 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const {
74 assert(NodeNum < NumNodesSolelyBlocking.size());
75 return NumNodesSolelyBlocking[NodeNum];
|
| ResourcePriorityQueue.h | 98 unsigned getLatency(unsigned NodeNum) const {
99 assert(NodeNum < (*SUnits).size());
100 return (*SUnits)[NodeNum].getHeight();
103 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const {
104 assert(NodeNum < NumNodesSolelyBlocking.size());
105 return NumNodesSolelyBlocking[NodeNum];
|
| ScheduleDFS.h | 149 return DFSNodeData[SU->NodeNum].InstrCount;
162 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth());
175 assert(SU->NodeNum < DFSNodeData.size() && "New Node");
176 return DFSNodeData[SU->NodeNum].SubtreeID;
|
| ScheduleDAG.h | 271 unsigned NodeNum; // Entry # of node in the node vector.
311 SUnit(SDNode *node, unsigned nodenum)
312 : Node(node), Instr(0), OrigNode(0), SchedClass(0), NodeNum(nodenum),
325 SUnit(MachineInstr *instr, unsigned nodenum)
326 : Node(0), Instr(instr), OrigNode(0), SchedClass(0), NodeNum(nodenum),
339 : Node(0), Instr(0), OrigNode(0), SchedClass(0), NodeNum(BoundaryID),
357 bool isBoundaryNode() const { return NodeNum == BoundaryID; };
|
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlTree.java | 71 * @param nodeNum The number of the node among the list of all notes.
73 * otherwise the same as {@code nodeNum}.
75 void addNode(HtmlDocument.Node n, int nodeNum, int endNum);
449 int nodenum = Arrays.binarySearch(textPositions, textPos); local
450 if (nodenum >= 0) {
453 while ((nodenum - 1) >= 0 && textPositions[nodenum - 1] == textPos) {
454 nodenum--;
458 nodenum = -nodenum - 1
469 int nodenum = Arrays.binarySearch(textPositions, textPos); local
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 74 * @param nodeNum The number of the node among the list of all notes.
76 * otherwise the same as {@code nodeNum}.
78 void addNode(HtmlDocument.Node n, int nodeNum, int endNum);
482 int nodenum = Arrays.binarySearch(textPositions, textPos); local
483 if (nodenum >= 0) {
486 while ((nodenum - 1) >= 0 && textPositions[nodenum - 1] == textPos) {
487 nodenum--;
491 nodenum = -nodenum - 1
502 int nodenum = Arrays.binarySearch(textPositions, textPos); local
960 int nodenum = nodes.size(); local
971 int nodenum = nodes.size(); local
983 int nodenum = nodes.size(); local
992 int nodenum = nodes.size(); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 317 dbgs() << "SU(" << NodeNum << "): ";
346 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
366 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
473 int NodeNum = SU->NodeNum;
476 Node2Index[NodeNum] = Degree;
490 if (SU->NodeNum < DAGSize)
491 Allocate(SU->NodeNum, --Id);
495 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum])
[all...] |
| LatencyPriorityQueue.cpp | 31 unsigned LHSNum = LHS->NodeNum;
32 unsigned RHSNum = RHS->NodeNum;
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
|
| ScheduleDAGInstrs.cpp | 648 << SUa->NodeNum << ") and SU("
649 << SUb->NodeNum << ")\n");
[all...] |
| MachineScheduler.cpp | 311 dbgs() << Queue[i]->NodeNum << " ";
835 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU("
836 << SUb->NodeNum << ")\n");
845 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n");
857 // Map DAG NodeNum to store chain ID.
869 ChainPredID = PI->getSUnit()->NodeNum;
[all...] |
| ScoreboardHazardRecognizer.cpp | 165 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 246 if (NewNode->NodeNum >= NumSUnits)
257 if (NewNode->NodeNum >= NumSUnits)
[all...] |
| ScheduleDAGFast.cpp | 241 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n");
255 N->setNodeId(NewSU->NodeNum);
277 LoadNode->setNodeId(LoadSU->NodeNum);
353 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n");
597 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum
598 << " to SU #" << Copies.front()->NodeNum << "\n");
603 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum
604 << " to SU #" << TrySU->NodeNum << "\n");
|
| ResourcePriorityQueue.cpp | 192 unsigned LHSNum = LHS->NodeNum;
193 unsigned RHSNum = RHS->NodeNum;
241 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
436 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
|
| ScheduleDAGSDNodes.cpp | 357 N->setNodeId(NodeSUnit->NodeNum);
374 N->setNodeId(NodeSUnit->NodeNum);
397 N->setNodeId(NodeSUnit->NodeNum);
[all...] |
| SelectionDAGPrinter.cpp | 272 O << "SU(" << SU->NodeNum << "): ";
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ACBTree.m | 163 NSInteger h, nodeNum;
171 nodeNum = tnew.nodeid;
173 self.nodeid = nodeNum;
|
| /packages/apps/UnifiedEmail/src/com/android/mail/utils/ |
| NotificationUtils.java | [all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 123 DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");
|
| /external/strace/ |
| system.c | [all...] |
