| /external/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 597 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
598 LocalQueue.push_back({S, false});
600 while (!LocalQueue.empty()) {
601 auto &CurrSAndVisited = LocalQueue.back();
605 LocalQueue.pop_back();
615 size_t N = LocalQueue.size();
616 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
618 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
620 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/AST/ |
| RecursiveASTVisitor.h | 615 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
616 LocalQueue.push_back({S, false});
618 while (!LocalQueue.empty()) {
619 auto &CurrSAndVisited = LocalQueue.back();
623 LocalQueue.pop_back();
633 size_t N = LocalQueue.size();
634 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
636 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
638 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/ |
| RecursiveASTVisitor.h | 635 SmallVector<llvm::PointerIntPair<Stmt *, 1, bool>, 8> LocalQueue;
636 LocalQueue.push_back({S, false});
638 while (!LocalQueue.empty()) {
639 auto &CurrSAndVisited = LocalQueue.back();
643 LocalQueue.pop_back();
653 size_t N = LocalQueue.size();
654 TRY_TO(dataTraverseNode(CurrS, &LocalQueue));
656 std::reverse(LocalQueue.begin() + N, LocalQueue.end());
658 LocalQueue.pop_back()
[all...] |
