HomeSort by relevance Sort by last modified time
    Searched refs:BB (Results 1 - 25 of 2113) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
decl-in-prototype.c 6 int f1(enum {AA,BB} E) {
8 return BB;
12 int f2(enum {AA=7,BB} E) {
18 int f(void (*g)(), enum {AA,BB} h) {
  /external/llvm/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) {
59 GetPreds(BB);
    [all...]
  /external/llvm/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Utils/
BypassSlowDivision.h 26 /// This optimization identifies DIV instructions in a BB that can be
29 /// This optimization may add basic blocks immediately after BB; for obvious
32 BasicBlock *BB, const DenseMap<unsigned int, unsigned int> &BypassWidth);
  /toolchain/binutils/binutils-2.27/gas/testsuite/gas/tic54x/
in_mlib.asm 1 IN_MLIB .macro AA,BB,CC
3 ADD #BB,b
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/
PredIteratorCache.h 39 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
43 BasicBlock **GetPreds(BasicBlock *BB) {
44 BasicBlock **&Entry = BlockToPredsMap[BB];
48 SmallVector<BasicBlock *, 32> PredCache(pred_begin(BB), pred_end(BB));
51 BlockToPredCountMap[BB] = PredCache.size() - 1;
58 unsigned GetNumPreds(BasicBlock *BB) const {
59 auto Result = BlockToPredCountMap.find(BB);
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Support/
PredIteratorCache.h 38 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
41 /// for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI)
42 BasicBlock **GetPreds(BasicBlock *BB) {
43 BasicBlock **&Entry = BlockToPredsMap[BB];
46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
49 BlockToPredCountMap[BB] = PredCache.size()-1;
56 unsigned GetNumPreds(BasicBlock *BB) {
57 GetPreds(BB);
    [all...]

Completed in 740 milliseconds

1 2 3 4 5 6 7 8 91011>>