HomeSort by relevance Sort by last modified time
    Searched defs:visited_ (Results 1 - 9 of 9) sorted by null

  /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/glslang/SPIRV/
InReadableOrder.cpp 72 if (visited_[block] || delayed_[block])
75 visited_[block] = true;
106 std::unordered_map<Block *, bool> visited_, delayed_; member in class:__anon112326::ReadableOrderTraverser
  /prebuilts/ndk/r13/sources/third_party/vulkan/glslang/SPIRV/
InReadableOrder.cpp 72 if (visited_[block] || delayed_[block])
75 visited_[block] = true;
106 std::unordered_map<Block *, bool> visited_, delayed_; member in class:__anon112400::ReadableOrderTraverser
  /external/v8/tools/clang/value_cleanup/
ListValueRewriter.h 98 std::unordered_set<const clang::VarDecl*> visited_; member in class:ListValueRewriter::AppendRawPtrCallback
  /external/regex-re2/re2/testing/
backtrack.cc 41 // like (a*)*, the visited_[] bitmap marks the (state, string-position)
45 // such infinite loops possible to avoid without keeping a giant visited_
46 // bitmap, but visited_ works fine for a reference implementation
74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::Backtracker
85 visited_(NULL),
90 delete[] visited_;
122 // Allocate new visited_ bitmap -- size is proportional
124 delete[] visited_;
126 visited_ = new uint32[nvisited_];
127 memset(visited_, 0, nvisited_*sizeof visited_[0])
    [all...]
  /art/runtime/gc/
verification.cc 158 explicit BFSFindReachable(ObjectSet* visited) : visited_(visited) {}
181 if (ref != nullptr && visited_->insert(ref).second) {
191 ObjectSet* visited_; member in class:art::gc::Verification::BFSFindReachable
197 CollectRootVisitor(ObjectSet* visited, WorkQueue* work) : visited_(visited), work_(work) {}
201 if (obj != nullptr && visited_->insert(obj).second) {
209 ObjectSet* const visited_; member in class:art::gc::Verification::CollectRootVisitor
  /external/regex-re2/re2/
bitstate.cc 63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::BitState
80 visited_(NULL),
88 delete[] visited_;
98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1))))
100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1));
315 visited_ = new uint32[nvisited_];
316 memset(visited_, 0, nvisited_*sizeof visited_[0]);
338 // but we are not clearing visited_ between calls to TrySearch,
  /art/runtime/openjdkjvmti/
ti_heap.cc 787 CollectAndReportRootsVisitor carrv(this, tag_table_, &worklist_, &visited_);
801 visited_.insert(initial_object_.Ptr());
840 visited_(visited),
1002 std::unordered_set<art::mirror::Object*>* visited_; member in class:openjdkjvmti::FINAL::FINAL
1288 std::unordered_set<art::mirror::Object*> visited_; member in class:openjdkjvmti::FINAL
    [all...]
  /art/runtime/gc/space/
image_space.cc 1065 gc::accounting::ContinuousSpaceBitmap* const visited_; member in class:art::gc::space::ImageSpaceLoader::FixupObjectVisitor::gc::accounting
    [all...]
  /art/compiler/
image_writer.cc 752 : image_writer_(image_writer), early_exit_(early_exit), visited_(visited), result_(result) {}
768 if (ref == nullptr || visited_->find(ref) != visited_->end()) {
779 visited_->emplace(ref);
782 image_writer_->PruneAppImageClassInternal(ref->AsClass(), early_exit_, visited_);
785 image_writer_->PruneAppImageClassInternal(klass, early_exit_, visited_);
789 visited_->erase(ref);
805 std::unordered_set<mirror::Object*>* visited_; member in class:art::ImageWriter::PruneObjectReferenceVisitor
    [all...]

Completed in 313 milliseconds