| /bootable/recovery/otautil/include/otautil/ |
| rangeset.h | 29 RangeSet() : blocks_(0) {}
67 return blocks_;
124 size_t blocks_; member in class:RangeSet
|
| /art/compiler/optimizing/ |
| optimizing_cfi_test.cc | 50 blocks_(GetAllocator()->Adapter()) {}
85 code_gen_->block_order_ = &blocks_;
146 ArenaVector<HBasicBlock*> blocks_; member in class:art::OptimizingCFITest
|
| nodes.h | 326 blocks_(allocator->Adapter(kArenaAllocBlockList)),
359 blocks_.reserve(kDefaultNumberOfBlocks);
367 const ArenaVector<HBasicBlock*>& GetBlocks() const { return blocks_; }
664 ArenaVector<HBasicBlock*> blocks_; member in class:art::HGraph
793 blocks_(graph->GetAllocator(),
865 const ArenaBitVector& GetBlocks() const { return blocks_; }
871 blocks_.ClearAllBits();
877 return blocks_.GetHighestBitSet() != -1;
900 ArenaBitVector blocks_; member in class:art::HLoopInformation
7910 const ArenaVector<HBasicBlock*>& blocks_; member in class:art::final::final::ComparisonBias::final::art::HBlocksInLoopIterator
7943 const ArenaVector<HBasicBlock*>& blocks_; member in class:art::final::final::ComparisonBias::final::art::HBlocksInLoopReversePostOrderIterator
[all...] |
| /bootable/recovery/otautil/ |
| rangeset.cpp | 33 blocks_ = 0;
91 if (blocks_ >= SIZE_MAX - sz) {
97 blocks_ += sz;
103 blocks_ = 0;
109 if (blocks_ < groups) {
110 groups = blocks_;
114 size_t mean = blocks_ / groups;
116 std::fill_n(blocks_per_group.begin(), blocks_ % groups, mean + 1);
160 CHECK_LT(idx, blocks_) << "Out of bound index " << idx << " (total blocks: " << blocks_ << ")"; local
[all...] |
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| function.h | 87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); }
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); }
90 iterator end() { return iterator(&blocks_, blocks_.end()); }
94 return const_iterator(&blocks_, blocks_.cbegin());
97 return const_iterator(&blocks_, blocks_.cend());
143 std::vector<std::unique_ptr<BasicBlock>> blocks_; member in namespace:spvtools::opt
[all...] |
| propagator.h | 285 std::queue<BasicBlock*> blocks_; member in class:spvtools::opt::SSAPropagator
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| function.h | 87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); }
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); }
90 iterator end() { return iterator(&blocks_, blocks_.end()); }
94 return const_iterator(&blocks_, blocks_.cbegin());
97 return const_iterator(&blocks_, blocks_.cend());
147 std::vector<std::unique_ptr<BasicBlock>> blocks_; member in namespace:spvtools::opt
[all...] |
| propagator.h | 285 std::queue<BasicBlock*> blocks_; member in class:spvtools::opt::SSAPropagator
|
| /external/deqp-deps/SPIRV-Tools/source/val/ |
| function.h | 268 std::unordered_map<uint32_t, BasicBlock> blocks_; member in class:spvtools::val::Function
|
| /external/swiftshader/third_party/SPIRV-Tools/source/val/ |
| function.h | 268 std::unordered_map<uint32_t, BasicBlock> blocks_; member in class:spvtools::val::Function
|
| /external/v8/src/ |
| global-handles.h | 312 return &blocks_[index >> kShift][index & kMask];
316 std::vector<Object**> blocks_; member in class:v8::internal::EternalHandles
|
| api.h | 307 std::vector<Object**> blocks_; member in class:v8::internal::DeferredHandles
412 inline DetachableVector<Object**>* blocks() { return &blocks_; }
423 blocks_.detach();
434 DCHECK(blocks_.empty());
439 blocks_.free();
453 DetachableVector<Object**> blocks_; member in class:v8::internal::HandleScopeImplementer
566 while (!blocks_.empty()) {
567 internal::Object** block_start = blocks_.back();
578 blocks_.pop_back();
587 DCHECK((blocks_.empty() && prev_limit == nullptr) |
[all...] |
| /external/protobuf/src/google/protobuf/ |
| arena.h | 881 google::protobuf::internal::AtomicWord blocks_; \/\/ Head of linked list of all allocated blocks member in class:google::protobuf::final
[all...] |
