| /external/llvm/bindings/ocaml/target/ |
| llvm_target.ml | 90 external succ : t -> t option = "llvm_target_succ"
102 | Some target -> step (succ target) (target :: lst)
|
| /external/llvm/lib/Analysis/ |
| EHPersonalities.cpp | 105 for (BasicBlock *Succ : successors(Visiting))
106 Worklist.push_back({Succ, SuccColor});
|
| /external/llvm/lib/CodeGen/GlobalISel/ |
| IRTranslator.cpp | 97 for (const BasicBlock *Succ : BrInst.successors())
98 CurBB.addSuccessor(&getOrCreateBB(*Succ));
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 257 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
258 /// The Predecessors list of succ is automatically updated. WEIGHT
262 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
265 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
267 void removeSuccessor(MachineBasicBlock *succ);
270 /// this MachineBasicBlock. The Predecessors list of succ is automatically
342 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P);
427 uint32_t getSuccWeight(MachineBasicBlock *succ);
|
| /external/toolchain-utils/automation/common/ |
| job.py | 94 res.extend(['%d' % succ.id for succ in self.successors])
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LoopInfoImpl.h | 38 for (const auto &Succ : children<BlockT*>(BB))
39 if (!contains(Succ)) {
64 for (const auto &Succ : children<BlockT*>(BB))
65 if (!contains(Succ))
67 ExitBlocks.push_back(Succ);
86 for (const auto &Succ : children<BlockT*>(BB))
87 if (!contains(Succ))
89 ExitEdges.emplace_back(BB, Succ);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LoopInfoImpl.h | 38 for (const auto &Succ : children<BlockT*>(BB))
39 if (!contains(Succ)) {
64 for (const auto &Succ : children<BlockT*>(BB))
65 if (!contains(Succ))
67 ExitBlocks.push_back(Succ);
86 for (const auto &Succ : children<BlockT*>(BB))
87 if (!contains(Succ))
89 ExitEdges.emplace_back(BB, Succ);
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LoopInfoImpl.h | 38 for (const auto &Succ : children<BlockT*>(BB))
39 if (!contains(Succ)) {
64 for (const auto &Succ : children<BlockT*>(BB))
65 if (!contains(Succ))
67 ExitBlocks.push_back(Succ);
86 for (const auto &Succ : children<BlockT*>(BB))
87 if (!contains(Succ))
89 ExitEdges.emplace_back(BB, Succ);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LoopInfoImpl.h | 38 for (const auto &Succ : children<BlockT*>(BB))
39 if (!contains(Succ)) {
64 for (const auto &Succ : children<BlockT*>(BB))
65 if (!contains(Succ))
67 ExitBlocks.push_back(Succ);
86 for (const auto &Succ : children<BlockT*>(BB))
87 if (!contains(Succ))
89 ExitEdges.emplace_back(BB, Succ);
|
| /prebuilts/go/darwin-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 127 for _, succ := range b.Succs {
128 fmt.Fprintf(&buf, " %d", succ.index)
|
| /prebuilts/go/linux-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 127 for _, succ := range b.Succs {
128 fmt.Fprintf(&buf, " %d", succ.index)
|
| /external/libpcap/ |
| optimize.c | 314 if (ep->succ) {
315 SET_INTERSECT(ep->succ->et.edom, ep->edom, opt_state->edgewords);
316 SET_INTERSECT(ep->succ->ef.edom, ep->edom, opt_state->edgewords);
1280 * Return true if any register that is used on exit from 'succ', has
1285 use_conflict(struct block *b, struct block *succ)
1288 atomset use = succ->out_use;
1295 if (b->val[atom] != succ->val[atom])
1358 if (JT(ep->succ) == 0)
1361 if (JT(ep->succ) == JF(ep->succ)) {
[all...] |
| gencode.h | 242 struct block *succ; member in struct:edge
394 #define JT(b) ((b)->et.succ)
395 #define JF(b) ((b)->ef.succ)
|
| /external/v8/src/compiler/ |
| schedule.cc | 196 void Schedule::AddGoto(BasicBlock* block, BasicBlock* succ) {
199 AddSuccessor(block, succ);
423 void Schedule::AddSuccessor(BasicBlock* block, BasicBlock* succ) {
424 block->AddSuccessor(succ);
425 succ->AddPredecessor(block);
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 212 * - all live nodes are reachable from head via succ()
226 * - the last node is always reachable from tail via succ()
285 * as sentinel for succ(), below.
298 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
455 for (Node<E> p = first(); p != null; p = succ(p)) {
483 next = succ(p);
489 next = succ(p);
738 for (Node<E> p = succ(pred), q;; p = q) {
746 if ((q = succ(p)) != null)
775 for (Node<E> p = first(); p != null; p = succ(p))
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedList.java | 153 * Inserts element e before non-null Node succ.
155 void linkBefore(E e, Node<E> succ) {
156 // assert succ != null;
157 final Node<E> pred = succ.prev;
158 final Node<E> newNode = new Node<>(pred, e, succ);
159 succ.prev = newNode;
413 Node<E> pred, succ;
415 succ = null;
418 succ = node(index);
419 pred = succ.prev
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| TreeMultiset.java | 370 node = node.succ;
373 node = header.succ;
425 if (current.succ == header) {
428 current = current.succ;
531 private AvlNode<E> succ;
557 successor(this, right, succ);
783 successor(pred, succ);
797 AvlNode<E> newTop = succ;
938 a.succ = b;
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 42 for (BasicBlock *Succ : BBTerm->successors())
43 Succ->removePredecessor(BB);
210 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT,
212 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
220 // If the edge isn't critical, then BB has a single successor or Succ has a
222 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
227 return SplitBlock(Succ, &Succ->front(), DT, LI);
233 "Should have a single succ!");
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 242 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) {
249 if (Term->getSuccessor(i) == Succ)
257 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) {
258 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
265 // If the edge isn't critical, then BB has a single successor or Succ has a
268 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
273 return SplitBlock(Succ, Succ->begin(), P);
279 "Should have a single succ!");
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 271 const BasicBlock *Succ = *SI;
272 if (Succ != StartBB && !Visited.count(Succ)) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 126 Loop *succ = LI.getLoopFor(SuccToSinkTo);
128 if (succ != nullptr && succ != cur)
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 327 BlockT *Succ = *SI;
328 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
329 << " = " << getEdgeFreq(BB, Succ) << "\n";
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 84 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
125 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) {
129 if (TI->getSuccessor(i) == Succ)
|
| /external/swiftshader/third_party/LLVM/tools/llvm-prof/ |
| llvm-prof.cpp | 109 BasicBlock* Succ = TI->getSuccessor(s);
110 double w = ignoreMissing(PI.getEdgeWeight(std::make_pair(BB, Succ)));
112 SuccCounts.push_back(std::make_pair(std::make_pair(BB, Succ), w));
|
| /system/media/camera/docs/ |
| metadata-generate | 71 local succ=$?
73 if [[ $succ -eq 0 ]]
83 return $succ
|
