HomeSort by relevance Sort by last modified time
    Searched full:succ (Results 151 - 175 of 715) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/tensorflow/tensorflow/core/graph/
mkl_layout_pass.cc 448 string succ; // Successor node string member in struct:tensorflow::MklLayoutRewritePass::__anon39628
578 // Input nodes succ and pred may be deleted if the call to
582 // @input g - input graph, succ - successor node, pred - predecessor node
587 Status MergeNode(std::unique_ptr<Graph>* g, Node* succ, Node* pred);
    [all...]
  /art/compiler/optimizing/
graph_checker_test.cc 31 * BasicBlock 0, succ: 1
pretty_printer.h 87 PrintString(", succ: ");
  /cts/hostsidetests/security/securityPatch/CVE-2016-8424/
poc.c 72 printf("[*] open file(%s) succ!\n", dev_path);
  /cts/hostsidetests/security/securityPatch/CVE-2016-8429/
poc.c 100 printf("[*] open file(%s) succ!\n", dev_path);
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
util.rb 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
  /external/clang/include/clang/Analysis/Analyses/
ThreadSafetyCommon.h 114 void handleSuccessor(const CFGBlock *Succ) {}
117 void handleSuccessorBackEdge(const CFGBlock *Succ) {}
452 void handleSuccessor(const CFGBlock *Succ);
453 void handleSuccessorBackEdge(const CFGBlock *Succ);
  /external/clang/lib/Analysis/
ThreadSafetyTIL.cpp 239 for (auto *Succ : successors()) {
241 if (Succ->BlockID <= BlockID) continue;
244 Candidate = Succ;
248 auto *Alternate = Succ;
  /external/llvm/include/llvm/Analysis/
RegionIterator.h 73 NodeType *succ; local
74 succ = getNode()->getParent()->getNode(BB);
75 assert(succ && "BB not in Region or entered subregion!");
76 return succ;
  /external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h 92 typename GraphT::NodeType* Succ = *NextSucc;
95 DT.Info[Succ];
98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
  /external/llvm/lib/Analysis/
DivergenceAnalysis.cpp 216 for (BasicBlock *Succ : successors(ThisBB)) {
217 if (Succ != End && InfluenceRegion.insert(Succ).second)
218 InfluenceStack.push_back(Succ);
  /external/llvm/lib/IR/
BasicBlock.cpp 420 for (BasicBlock *Succ : TI->successors()) {
421 // N.B. Succ might not be a complete BasicBlock, so don't assume
423 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
  /external/llvm/lib/Transforms/Scalar/
LoopUnswitch.cpp     [all...]
  /external/llvm/test/CodeGen/X86/
hoist-spill-lpad.ll 4 ; through succ block and the landingpad block of a call which may throw
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DominatorInternals.h 93 typename GraphT::NodeType* Succ = *NextSucc;
96 DT.Info[Succ];
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
RegionIterator.h 70 RegionNode *succ; local
71 succ = getNode()->getParent()->getNode(BB);
72 assert(succ && "BB not in Region or entered subregion!");
73 return succ;
  /external/swiftshader/third_party/LLVM/lib/VMCore/
BasicBlock.cpp 344 BasicBlock *Succ = TI->getSuccessor(i);
345 // N.B. Succ might not be a complete BasicBlock, so don't assume
347 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
  /external/tensorflow/tensorflow/compiler/xla/service/
hlo_scheduling.cc 217 for (const HloInstruction* succ : instruction->control_successors()) {
218 unscheduled_pred_count[succ]++;
279 for (HloInstruction* succ : best->control_successors()) {
280 update_pred_count(succ);
  /external/v8/src/crankshaft/
hydrogen-load-elimination.cc 146 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block,
155 TRACE((" copy-to B%d\n", succ->block_id()));
162 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that,
190 TRACE((" merge-to B%d\n", succ->block_id()));
  /external/valgrind/memcheck/tests/darwin/
scalar.h 34 #define SUCC assert(-1 != res);
  /external/valgrind/memcheck/tests/x86-solaris/
scalar.c 41 SY(SYS_statvfs64, x0 + path, x0 + &stats); SUCC;
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/
ThreadSafetyCommon.h 114 void handleSuccessor(const CFGBlock *Succ) {}
117 void handleSuccessorBackEdge(const CFGBlock *Succ) {}
435 void handleSuccessor(const CFGBlock *Succ);
436 void handleSuccessorBackEdge(const CFGBlock *Succ);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
RegionIterator.h 79 NodeRef succ; local
80 succ = getNode()->getParent()->getNode(BB);
81 assert(succ && "BB not in Region or entered subregion!");
82 return succ;
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/Analysis/Analyses/
ThreadSafetyCommon.h 114 void handleSuccessor(const CFGBlock *Succ) {}
117 void handleSuccessorBackEdge(const CFGBlock *Succ) {}
435 void handleSuccessor(const CFGBlock *Succ);
436 void handleSuccessorBackEdge(const CFGBlock *Succ);
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/
RegionIterator.h 79 NodeRef succ; local
80 succ = getNode()->getParent()->getNode(BB);
81 assert(succ && "BB not in Region or entered subregion!");
82 return succ;

Completed in 706 milliseconds

1 2 3 4 5 67 8 91011>>