Lines Matching refs:blocks_
38 blocks_.push_back(block);
43 for (unsigned int i = 0; i < blocks_.size(); ++i) {
44 if (blocks_[i].state == FREE_PENDING_TOKEN) {
49 // GPU_DCHECK_EQ(blocks_.size(), 1u);
50 // GPU_DCHECK_EQ(blocks_[0].state, FREE);
69 for (unsigned int i = 0; i < blocks_.size(); ++i) {
70 Block &block = blocks_[i];
78 for (unsigned int i = 0; i < blocks_.size(); ++i) {
79 if (blocks_[i].state != FREE_PENDING_TOKEN)
82 if (blocks_[i].size >= size)
92 GPU_DCHECK_NE(blocks_[index].state, FREE);
93 blocks_[index].state = FREE;
101 Block &block = blocks_[index];
110 for (unsigned int i = 0; i < blocks_.size(); ++i) {
111 Block &block = blocks_[i];
123 for (unsigned int i = 0; i < blocks_.size(); ++i) {
124 Block &block = blocks_[i];
141 if (blocks_.size() < 1) return false;
142 for (unsigned int i = 0; i < blocks_.size() - 1; ++i) {
143 Block ¤t = blocks_[i];
144 Block &next = blocks_[i + 1];
157 return blocks_.size() != 1 || blocks_[0].state != FREE;
164 if (index + 1 < blocks_.size()) {
165 Block &next = blocks_[index + 1];
167 blocks_[index].size += next.size;
168 blocks_.erase(blocks_.begin() + index + 1);
172 Block &prev = blocks_[index - 1];
174 prev.size += blocks_[index].size;
175 blocks_.erase(blocks_.begin() + index);
185 Block &block = blocks_[index];
195 for (unsigned int i = 0; i < blocks_.size();) {
196 Block& block = blocks_[i];
210 Block &block = blocks_[index];
222 blocks_.insert(blocks_.begin() + index + 1, newblock);
229 Container::iterator it = std::lower_bound(blocks_.begin(), blocks_.end(),
231 GPU_DCHECK(it != blocks_.end() && it->offset == offset);
232 return it-blocks_.begin();
