| /dports/textproc/jade/jade-1.2.1/lib/ |
| H A D | OffsetOrderedList.cxx | 25 Offset curOffset = blocks_.size() > 0 ? blocks_.back()->offset : 0; in append()
39 blocks_.resize(blocks_.size() + 1); in addByte()
42 if (blocks_.size() == 1) { in addByte()
47 OffsetOrderedListBlock &lastButOne = *blocks_[blocks_.size() - 2]; in addByte()
55 blocks_.back()->offset += 255; in addByte()
58 blocks_.back()->nextIndex += 1; in addByte()
74 size_t lim = blocks_.size(); in findPreceding()
91 if (i == blocks_.size()) { in findPreceding()
103 int j = (i == blocks_.size() - 1 in findPreceding()
120 curOff = blocks_[i]->offset; in findPreceding()
[all …]
|
| /dports/textproc/opensp/OpenSP-1.5.2/lib/ |
| H A D | OffsetOrderedList.cxx | 25 Offset curOffset = blocks_.size() > 0 ? blocks_.back()->offset : 0;
39 blocks_.resize(blocks_.size() + 1); in main()
42 if (blocks_.size() == 1) { in main()
47 OffsetOrderedListBlock &lastButOne = *blocks_[blocks_.size() - 2]; in main()
55 blocks_.back()->offset += 255; in main()
58 blocks_.back()->nextIndex += 1; in main()
74 size_t lim = blocks_.size();
91 if (i == blocks_.size()) {
103 int j = (i == blocks_.size() - 1
120 curOff = blocks_[i]->offset;
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/gpu/command_buffer/client/ |
| H A D | fenced_allocator.cc | 36 blocks_.push_back(block); in FencedAllocator()
66 Block &block = blocks_[i]; in Alloc()
116 Block &block = blocks_[i]; in GetLargestFreeSize()
129 Block &block = blocks_[i]; in GetLargestFreeOrPendingSize()
146 Block& block = blocks_[i]; in GetFreeSize()
176 return blocks_.size() != 1 || blocks_[0].state != FREE; in InUseOrFreePending()
197 blocks_.erase(blocks_.begin() + index + 1); in CollapseFreeBlock()
204 blocks_.erase(blocks_.begin() + index); in CollapseFreeBlock()
253 blocks_.insert(blocks_.begin() + index + 1, newblock); in AllocInBlock()
260 Container::iterator it = std::lower_bound(blocks_.begin(), blocks_.end(), in GetBlockByOffset()
[all …]
|
| H A D | ring_buffer.cc | 53 blocks_.pop_front(); in FreeOldestBlock()
95 it != blocks_.rend(); in FreePendingToken()
127 while (!blocks_.empty() && blocks_.back().state == PADDING) { in DiscardBlock()
129 blocks_.pop_back(); in DiscardBlock()
133 while (!blocks_.empty() && blocks_.front().state == PADDING) { in DiscardBlock()
134 blocks_.pop_front(); in DiscardBlock()
135 if (blocks_.empty()) in DiscardBlock()
142 if (blocks_.empty()) { in DiscardBlock()
159 while (!blocks_.empty()) { in GetLargestFreeSizeNoWaitingInternal()
165 if (blocks_.empty()) { in GetLargestFreeSizeNoWaitingInternal()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/gpu/command_buffer/client/ |
| H A D | fenced_allocator.cc | 36 blocks_.push_back(block); in FencedAllocator()
66 Block &block = blocks_[i]; in Alloc()
116 Block &block = blocks_[i]; in GetLargestFreeSize()
129 Block &block = blocks_[i]; in GetLargestFreeOrPendingSize()
146 Block& block = blocks_[i]; in GetFreeSize()
176 return blocks_.size() != 1 || blocks_[0].state != FREE; in InUseOrFreePending()
197 blocks_.erase(blocks_.begin() + index + 1); in CollapseFreeBlock()
204 blocks_.erase(blocks_.begin() + index); in CollapseFreeBlock()
253 blocks_.insert(blocks_.begin() + index + 1, newblock); in AllocInBlock()
260 Container::iterator it = std::lower_bound(blocks_.begin(), blocks_.end(), in GetBlockByOffset()
[all …]
|
| H A D | ring_buffer.cc | 54 blocks_.pop_front(); in FreeOldestBlock()
96 it != blocks_.rend(); in FreePendingToken()
128 while (!blocks_.empty() && blocks_.back().state == PADDING) { in DiscardBlock()
130 blocks_.pop_back(); in DiscardBlock()
134 while (!blocks_.empty() && blocks_.front().state == PADDING) { in DiscardBlock()
135 blocks_.pop_front(); in DiscardBlock()
136 if (blocks_.empty()) in DiscardBlock()
143 if (blocks_.empty()) { in DiscardBlock()
160 while (!blocks_.empty()) { in GetLargestFreeSizeNoWaitingInternal()
166 if (blocks_.empty()) { in GetLargestFreeSizeNoWaitingInternal()
[all …]
|
| /dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/util/stream/ |
| H A D | rewindable_stream.cc | 34 assert(blocks_it_ < blocks_.size()); in operator ++()
38 if (++blocks_it_ == blocks_.size()) { in operator ++()
40 Flush(blocks_.begin() + blocks_it_); in operator ++()
47 Block &cur_block = blocks_[blocks_it_]; in operator ++()
60 Flush(blocks_.begin() + blocks_it_); in Mark()
79 if (blocks_.empty()) return; in Poison()
84 blocks_.back().SetValidSize(current_ - static_cast<uint8_t*>(blocks_.back().Get())); in Poison()
85 Flush(blocks_.end()); in Poison()
113 blocks_.push_back(get); in AppendBlock()
122 blocks_it_ = blocks_.size() - 1; in AppendBlock()
[all …]
|
| /dports/cad/openroad/OpenROAD-2.0/src/mpl2/src/ |
| H A D | block_placement.cpp | 332 blocks_ = blocks; in SimulatedAnnealingCore()
363 float t = blocks_[b].GetX() + blocks_[b].GetWidth(); in PackFloorplan()
391 float t = blocks_[b].GetY() + blocks_[b].GetHeight(); in PackFloorplan()
480 float cur_x2 = blocks_[i].GetX() + blocks_[i].GetWidth(); in Resize()
493 float cur_x2 = blocks_[i].GetX() + blocks_[i].GetWidth(); in Resize()
514 float cur_y2 = blocks_[i].GetY() + blocks_[i].GetHeight(); in Resize()
527 float cur_y2 = blocks_[i].GetY() + blocks_[i].GetHeight(); in Resize()
840 float ux = blocks_[i].GetX() + blocks_[i].GetWidth(); in FitFloorplan()
841 float uy = blocks_[i].GetY() + blocks_[i].GetHeight(); in FitFloorplan()
842 float x = blocks_[i].GetX() + 1.0 * blocks_[i].GetWidth(); in FitFloorplan()
[all …]
|
| /dports/math/stanmath/math-4.2.0/stan/math/memory/ |
| H A D | stack_alloc.hpp | 102 if (unlikely(cur_block_ >= blocks_.size())) { in move_to_next_block()
109 if (!blocks_.back()) { in move_to_next_block()
114 result = blocks_[cur_block_]; in move_to_next_block()
136 next_loc_(blocks_[0]) { in stack_alloc()
137 if (!blocks_[0]) { in stack_alloc()
150 for (auto& block : blocks_) { in ~stack_alloc()
201 next_loc_ = blocks_[0]; in recover_all()
241 if (blocks_[i]) { in free_all()
242 free(blocks_[i]); in free_all()
246 blocks_.resize(1); in free_all()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/stan/math/memory/ |
| H A D | stack_alloc.hpp | 106 if (!blocks_.back()) in move_to_next_block()
110 result = blocks_[cur_block_]; in move_to_next_block()
132 next_loc_(blocks_[0]) { in stack_alloc()
133 if (!blocks_[0]) in stack_alloc()
145 for (auto& block : blocks_) in ~stack_alloc()
193 next_loc_ = blocks_[0]; in recover_all()
231 for (size_t i = 1; i < blocks_.size(); ++i) in free_all()
232 if (blocks_[i]) in free_all()
233 free(blocks_[i]); in free_all()
235 blocks_.resize(1); in free_all()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/util/src/ |
| H A D | sparse_matrices.hpp | 21 std::vector<RealMatrix> blocks_; member in Pecos::util::BlockDiagonalMatrix
33 blocks_.resize( num_blocks ); in resize()
39 return blocks_.size(); in num_blocks()
46 num_rows += blocks_[i].numRows(); in num_rows()
54 num_cols += blocks_[i].numCols(); in num_cols()
75 blocks_[block_num] = empty_matrix; in set_matrix()
76 blocks_[block_num] = block; in set_matrix()
80 blocks_[block_num].assign( block ); in set_matrix()
112 blocks_[i].print( os ); in print()
126 blocks_[i](j,k); in get_dense_matrix()
[all …]
|
| H A D | sparse_matrices.cpp | 21 num_total_rows += blocks_[i].numRows(); in get_row()
29 for ( int j=0; j<blocks_[i].numCols(); j++) in get_row()
30 row(0,j) = blocks_[i](block_row,j); in get_row()
53 int num_block_rows = blocks_[i].numRows(); in pre_multiply()
54 int num_block_cols = blocks_[i].numCols(); in pre_multiply()
56 num_block_rows = blocks_[i].numCols(); in pre_multiply()
57 num_block_cols = blocks_[i].numRows(); in pre_multiply()
67 1.0, blocks_[i], sub_matrix, 0.0 ); in pre_multiply()
109 int num_block_rows = blocks_[i].numRows(); in post_multiply()
112 num_block_rows = blocks_[i].numCols(); in post_multiply()
[all …]
|
| /dports/www/aria2/aria2-1.36.0/src/ |
| H A D | BitfieldMan.cc | 58 blocks_(0), in BitfieldMan()
64 bitfieldLength_ = blocks_ / 8 + (blocks_ % 8 ? 1 : 0); in BitfieldMan()
84 blocks_(bitfieldMan.blocks_), in BitfieldMan()
102 blocks_ = bitfieldMan.blocks_; in operator =()
142 if (index == blocks_ - 1) { in getBlockLength()
179 blocks_); in getFirstMissingUnusedIndex()
194 blocks_); in getFirstNMissingUnusedIndex()
199 blocks_); in getFirstNMissingUnusedIndex()
546 return blocks_ - bitfield::countSetBit(bitfield_, blocks_); in countMissingBlockNow()
562 if (blocks_ <= index) { in setBitInternal()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/core/vil/ |
| H A D | vil_block_cache.cxx | 14 for (auto & block : blocks_) in ~vil_block_cache()
19 blocks_.clear(); // empty the index in ~vil_block_cache()
31 if (blocks_.size() >= nblocks_) in add_block()
34 blocks_.push_back(cell); in add_block()
35 std::sort(blocks_.begin(), blocks_.end(), bcell_less()); in add_block()
45 for (auto bit = blocks_.begin(); bit != blocks_.end() && !found; ++bit) in get_block()
63 if (blocks_.empty()) in remove_block()
70 auto bit = blocks_.begin(); in remove_block()
71 blocks_.erase(bit); in remove_block()
|
| /dports/emulators/ppsspp-qt5/ppsspp-1.12.3/Core/MIPS/JitCommon/ |
| H A D | JitBlockCache.cpp | 90 delete [] blocks_; in Shutdown()
91 blocks_ = 0; in Shutdown()
123 return &blocks_[no]; in GetBlock()
127 return &blocks_[no]; in GetBlock()
140 blocks_[num].invalid = true; in AllocateBlock()
145 blocks_[num].proxyFor = 0; in AllocateBlock()
345 …if (blocks_[blockIndex].originalAddress == addr && !blocks_[blockIndex].proxyFor && !blocks_[block… in GetBlockNumberFromStartAddress()
369 const auto &b = blocks_[i]; in GetAddressFromBlockPtr()
387 JitBlock &b = blocks_[i]; in LinkBlockExits()
416 JitBlock &b = blocks_[i]; in LinkBlock()
[all …]
|
| /dports/emulators/ppsspp/ppsspp-1.12.3/Core/MIPS/JitCommon/ |
| H A D | JitBlockCache.cpp | 90 delete [] blocks_; in Shutdown()
91 blocks_ = 0; in Shutdown()
123 return &blocks_[no]; in GetBlock()
127 return &blocks_[no]; in GetBlock()
140 blocks_[num].invalid = true; in AllocateBlock()
145 blocks_[num].proxyFor = 0; in AllocateBlock()
345 …if (blocks_[blockIndex].originalAddress == addr && !blocks_[blockIndex].proxyFor && !blocks_[block… in GetBlockNumberFromStartAddress()
369 const auto &b = blocks_[i]; in GetAddressFromBlockPtr()
387 JitBlock &b = blocks_[i]; in LinkBlockExits()
416 JitBlock &b = blocks_[i]; in LinkBlock()
[all …]
|
| /dports/emulators/libretro-ppsspp/ppsspp-1.12.3/Core/MIPS/JitCommon/ |
| H A D | JitBlockCache.cpp | 90 delete [] blocks_; in Shutdown()
91 blocks_ = 0; in Shutdown()
123 return &blocks_[no]; in GetBlock()
127 return &blocks_[no]; in GetBlock()
140 blocks_[num].invalid = true; in AllocateBlock()
145 blocks_[num].proxyFor = 0; in AllocateBlock()
345 …if (blocks_[blockIndex].originalAddress == addr && !blocks_[blockIndex].proxyFor && !blocks_[block… in GetBlockNumberFromStartAddress()
369 const auto &b = blocks_[i]; in GetAddressFromBlockPtr()
387 JitBlock &b = blocks_[i]; in LinkBlockExits()
416 JitBlock &b = blocks_[i]; in LinkBlock()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/handles/ |
| H A D | local-handles.cc | 17 DCHECK(blocks_.empty()); in ~LocalHandles()
21 for (int i = 0; i < static_cast<int>(blocks_.size()) - 1; i++) { in Iterate()
22 Address* block = blocks_[i]; in Iterate()
28 if (!blocks_.empty()) { in Iterate()
29 Address* block = blocks_.back(); in Iterate()
39 for (auto it = blocks_.begin(); it != blocks_.end(); ++it) { in Contains()
43 Address* upper_bound = lower_bound != blocks_.back() in Contains()
57 blocks_.push_back(block); in AddBlock()
64 while (!blocks_.empty()) { in RemoveUnusedBlocks()
65 Address* block_start = blocks_.back(); in RemoveUnusedBlocks()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/perfetto/src/protozero/ |
| H A D | message_arena.cc | 29 blocks_.emplace_front(); in MessageArena()
30 static_assert(std::alignment_of<decltype(blocks_.back().storage[0])>::value >= in MessageArena()
38 PERFETTO_DCHECK(!blocks_.empty()); // Should never become empty. in NewMessage()
40 Block* block = &blocks_.back(); in NewMessage()
42 blocks_.emplace_back(); in NewMessage()
43 block = &blocks_.back(); in NewMessage()
52 PERFETTO_DCHECK(!blocks_.empty()); // Should never be empty, see below. in DeleteLastMessageInternal()
53 Block* block = &blocks_.back(); in DeleteLastMessageInternal()
66 if (block->entries == 0 && blocks_.size() > 1) { in DeleteLastMessageInternal()
67 blocks_.pop_back(); in DeleteLastMessageInternal()
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/ |
| H A D | function.h | 87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
90 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
94 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
97 return const_iterator(&blocks_, blocks_.cend()); in cend()
155 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
181 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
192 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
197 std::remove_if(std::begin(blocks_), std::end(blocks_), in RemoveEmptyBlocks()
201 blocks_.erase(first_empty, std::end(blocks_)); in RemoveEmptyBlocks()
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/ |
| H A D | function.h | 87 const std::unique_ptr<BasicBlock>& entry() const { return blocks_.front(); } in entry()
89 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
90 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
94 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
97 return const_iterator(&blocks_, blocks_.cend()); in cend()
155 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
181 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
192 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
197 std::remove_if(std::begin(blocks_), std::end(blocks_), in RemoveEmptyBlocks()
201 blocks_.erase(first_empty, std::end(blocks_)); in RemoveEmptyBlocks()
|
| /dports/emulators/ppsspp-qt5/ppsspp-1.12.3/Core/MIPS/IR/ |
| H A D | IRJit.cpp | 67 blocks_.Clear(); in ClearCache()
131 blocks_.FinalizeBlock(block_num); in CompileBlock()
265 blocks_[i].Destroy(i); in Clear()
267 blocks_.clear(); in Clear()
284 blocks_[i].Destroy(i); in InvalidateICache()
292 blocks_[i].Finalize(i); in FinalizeBlock()
334 result.resize(blocks_.size()); in SaveAndClearEmuHackOps()
337 IRBlock &b = blocks_[number]; in SaveAndClearEmuHackOps()
355 IRBlock &b = blocks_[number]; in RestoreSavedEmuHackOps()
390 for (const auto &b : blocks_) { in ComputeStats()
[all …]
|
| /dports/emulators/ppsspp/ppsspp-1.12.3/Core/MIPS/IR/ |
| H A D | IRJit.cpp | 67 blocks_.Clear(); in ClearCache()
131 blocks_.FinalizeBlock(block_num); in CompileBlock()
265 blocks_[i].Destroy(i); in Clear()
267 blocks_.clear(); in Clear()
284 blocks_[i].Destroy(i); in InvalidateICache()
292 blocks_[i].Finalize(i); in FinalizeBlock()
334 result.resize(blocks_.size()); in SaveAndClearEmuHackOps()
337 IRBlock &b = blocks_[number]; in SaveAndClearEmuHackOps()
355 IRBlock &b = blocks_[number]; in RestoreSavedEmuHackOps()
390 for (const auto &b : blocks_) { in ComputeStats()
[all …]
|
| /dports/emulators/libretro-ppsspp/ppsspp-1.12.3/Core/MIPS/IR/ |
| H A D | IRJit.cpp | 67 blocks_.Clear(); in ClearCache()
131 blocks_.FinalizeBlock(block_num); in CompileBlock()
265 blocks_[i].Destroy(i); in Clear()
267 blocks_.clear(); in Clear()
284 blocks_[i].Destroy(i); in InvalidateICache()
292 blocks_[i].Finalize(i); in FinalizeBlock()
334 result.resize(blocks_.size()); in SaveAndClearEmuHackOps()
337 IRBlock &b = blocks_[number]; in SaveAndClearEmuHackOps()
355 IRBlock &b = blocks_[number]; in RestoreSavedEmuHackOps()
390 for (const auto &b : blocks_) { in ComputeStats()
[all …]
|
| /dports/devel/intel-graphics-compiler/SPIRV-Tools/source/opt/ |
| H A D | function.h | 104 BasicBlock* tail() { return blocks_.back().get(); } in tail()
105 const BasicBlock* tail() const { return blocks_.back().get(); } in tail()
107 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin()
108 iterator end() { return iterator(&blocks_, blocks_.end()); } in end()
112 return const_iterator(&blocks_, blocks_.cbegin()); in cbegin()
115 return const_iterator(&blocks_, blocks_.cend()); in cend()
191 std::vector<std::unique_ptr<BasicBlock>> blocks_; variable
225 blocks_.insert(ip.Get(), std::make_move_iterator(src_begin), in AddBasicBlocks()
231 blocks_.erase(std::find(std::begin(blocks_), std::end(blocks_), nullptr)); in MoveBasicBlockToAfter()
241 std::remove_if(std::begin(blocks_), std::end(blocks_), in RemoveEmptyBlocks()
[all …]
|