HomeSort by relevance Sort by last modified time
    Searched full:bbe (Results 1 - 25 of 159) sorted by null

1 2 3 4 5 6 7

  /external/swiftshader/third_party/LLVM/lib/Analysis/
ProfileEstimatorPass.cpp 131 for ( pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
132 bbi != bbe; ++bbi ) {
263 succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
266 if (bbi == bbe) {
271 for ( ; bbi != bbe; ++bbi ) {
312 for (succ_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
313 bbi != bbe; ++bbi) {
366 for (std::set<BasicBlock*>::iterator BBI = BBToVisit.begin(), BBE = BBToVisit.end();
367 (BBI != BBE) && (!found); ++BBI) {
370 for (pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB)
    [all...]
ProfileVerifierPass.cpp 101 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
102 bbi != bbe; ++bbi ) {
116 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
117 bbi != bbe; ++bbi ) {
138 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
139 bbi != bbe; ++bbi ) {
262 succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB); local
271 for (;bbi != bbe; ++bbi) {
341 for ( succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
342 bbi != bbe; ++bbi )
    [all...]
ProfileInfoLoaderPass.cpp 117 for (succ_const_iterator bbi = succ_begin(BB), bbe = succ_end(BB);
118 bbi != bbe; ++bbi) {
121 for (const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB);
122 bbi != bbe; ++bbi) {
ProfileInfo.cpp 386 for(succ_const_iterator BBI = succ_begin(FirstBB), BBE = succ_end(FirstBB);
387 BBI != BBE; ++BBI) {
514 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); local
515 if (bbi==bbe) {
519 for (;bbi != bbe; ++bbi) {
586 const_pred_iterator bbi = pred_begin(BB), bbe = pred_end(BB); local
587 if (bbi == bbe) {
590 for( ; bbi != bbe; ++bbi ) {
    [all...]
  /external/llvm/lib/IR/
Dominators.cpp 138 bool DominatorTree::dominates(const BasicBlockEdge &BBE,
143 assert(BBE.isSingleEdge() &&
148 const BasicBlock *Start = BBE.getStart();
149 const BasicBlock *End = BBE.getEnd();
190 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const {
194 assert(BBE.isSingleEdge() &&
200 if (PN && PN->getParent() == BBE.getEnd() &&
201 PN->getIncomingBlock(U) == BBE.getStart())
211 return dominates(BBE, UseBB);
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
StrongPHIElimination.cpp 242 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
243 BBI != BBE && BBI->isPHI(); ++BBI) {
275 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
276 BBI != BBE && BBI->isPHI(); ++BBI) {
286 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
287 BBI != BBE && BBI->isPHI(); ++BBI) {
303 MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end();
304 while (BBI != BBE && BBI->isPHI()) {
532 BBE = DefInstrs.end(); BBI != BBE; ++BBI)
    [all...]
  /device/linaro/bootloader/edk2/StdLib/LibC/gdtoa/
strtod.c 93 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, decpt, dsign, local
551 bb = d2b(dval(rv), &bbe, &bbbits); /* rv = bb * 2^bbe */
566 if (bbe >= 0)
567 bb2 += bbe;
569 bd2 -= bbe;
576 j = bbe - scale;
585 j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
590 j = bbe;
  /bionic/libc/upstream-openbsd/lib/libc/gdtoa/
strtod.c 93 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, decpt, dsign, local
585 bb = d2b(dval(&rv), &bbe, &bbbits); /* rv = bb * 2^bbe */
600 if (bbe >= 0)
601 bb2 += bbe;
603 bd2 -= bbe;
612 j = bbe - scale;
626 j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
631 j = bbe;
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/
Dominators.h 150 /// If BBE is not a unique edge between start and end of the edge, it can
152 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
153 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/
Dominators.h 150 /// If BBE is not a unique edge between start and end of the edge, it can
152 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
153 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/
Dominators.h 150 /// If BBE is not a unique edge between start and end of the edge, it can
152 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
153 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/
Dominators.h 150 /// If BBE is not a unique edge between start and end of the edge, it can
152 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
153 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/
Dominators.h 173 /// If BBE is not a unique edge between start and end of the edge, it can
175 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
176 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /external/python/cpython3/Modules/_sha3/kcp/
KeccakP-1600-64.macros 22 UINT64 Bba, Bbe, Bbi, Bbo, Bbu; \
57 Bbe = ROL64(A##ge, 44); \
64 E##ba = Bba ^( Bbe | Bbi ); \
67 E##be = Bbe ^((~Bbi)| Bbo ); \
73 E##bu = Bbu ^( Bba & Bbe ); \
175 Bbe = ROL64(A##ge, 44); \
182 E##ba = Bba ^( Bbe | Bbi ); \
184 E##be = Bbe ^((~Bbi)| Bbo ); \
187 E##bu = Bbu ^( Bba & Bbe ); \
270 Bbe = ROL64(A##ge, 44);
    [all...]
  /packages/inputmethods/LatinIME/java/res/xml/
rowkeys_tamil1.xml 37 U+0BBE: "?" TAMIL VOWEL SIGN AA -->
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/cris/
fragtest.d 57 [ ]+8bbe:[ ]+0000[ ]+bcc[ ]+.*
  /external/llvm/include/llvm/IR/
Dominators.h 137 bool dominates(const BasicBlockEdge &BBE, const Use &U) const;
138 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
  /external/llvm/unittests/IR/
PassManagerTest.cpp 35 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI)

Completed in 3613 milliseconds

1 2 3 4 5 6 7