1 // Copyright 2014 The Chromium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "cc/quads/list_container.h"
10 #include "cc/base/scoped_ptr_vector.h"
11 #include "cc/quads/draw_quad.h"
12 #include "cc/quads/shared_quad_state.h"
15 const size_t kDefaultNumElementTypesToReserve = 32;
20 // ListContainerCharAllocator
21 ////////////////////////////////////////////////////
22 // This class deals only with char* and void*. It does allocation and passing
23 // out raw pointers, as well as memory deallocation when being destroyed.
24 template <typename BaseElementType>
25 class ListContainer<BaseElementType>::ListContainerCharAllocator {
27 // ListContainerCharAllocator::InnerList
28 /////////////////////////////////////////////
29 // This class holds the raw memory chunk, as well as information about its
30 // size and availability.
32 scoped_ptr<char[]> data;
33 // The number of elements in total the memory can hold. The difference
34 // between capacity and size is the how many more elements this list can
37 // The number of elements have been put into this list.
39 // The size of each element is in bytes. This is used to move from between
40 // elements' memory locations.
43 InnerList() : capacity(0), size(0), step(0) {}
45 void Erase(char* position) {
46 // Confident that destructor is called by caller of this function. Since
47 // ListContainerCharAllocator does not handle construction after
48 // allocation, it doesn't handle desctrution before deallocation.
49 DCHECK_LE(position, LastElement());
50 DCHECK_GE(position, Begin());
51 char* start = position + step;
52 std::copy(start, End(), position);
55 // Decrease capacity to avoid creating not full not last InnerList.
59 bool IsFull() { return capacity == size; }
60 size_t NumElementsAvailable() const { return capacity - size; }
63 DCHECK_LT(size, capacity);
68 char* Begin() const { return data.get(); }
69 char* End() const { return data.get() + size * step; }
70 char* LastElement() const { return data.get() + (size - 1) * step; }
71 char* ElementAt(size_t index) const { return data.get() + index * step; }
74 DISALLOW_COPY_AND_ASSIGN(InnerList);
77 explicit ListContainerCharAllocator(size_t element_size)
78 : element_size_(element_size),
82 AllocateNewList(kDefaultNumElementTypesToReserve);
85 ListContainerCharAllocator(size_t element_size, size_t element_count)
86 : element_size_(element_size),
90 DCHECK_NE(0u, element_count);
91 AllocateNewList(element_count);
94 ~ListContainerCharAllocator() {}
97 if (last_list_->IsFull())
98 AllocateNewList(last_list_->capacity * 2);
101 return last_list_->AddElement();
104 size_t element_size() const { return element_size_; }
105 size_t list_count() const { return list_count_; }
106 size_t size() const { return size_; }
107 bool IsEmpty() const { return size() == 0; }
109 size_t Capacity() const {
110 size_t capacity_sum = 0;
111 for (typename ScopedPtrVector<InnerList>::const_iterator iter =
113 iter != storage_.end();
115 capacity_sum += (*iter)->capacity;
121 size_t initial_allocation_size = storage_.front()->capacity;
126 AllocateNewList(initial_allocation_size);
129 void Erase(PositionInListContainerCharAllocator position) {
130 DCHECK_EQ(this, position.ptr_to_container);
131 storage_[position.vector_index]->Erase(position.item_iterator);
132 // TODO(weiliangc): Free the InnerList if it is empty.
136 InnerList* InnerListById(size_t id) const {
137 DCHECK_LT(id, list_count_);
141 void AllocateNewList(size_t list_size) {
143 scoped_ptr<InnerList> new_list(new InnerList);
144 storage_.push_back(new_list.Pass());
145 last_list_ = storage_.back();
146 InnerList* list = last_list_;
147 list->capacity = list_size;
149 list->step = element_size_;
150 list->data.reset(new char[list->capacity * list->step]);
153 size_t NumAvailableElementsInLastList() const {
154 return last_list_->NumElementsAvailable();
158 ScopedPtrVector<InnerList> storage_;
159 const size_t element_size_;
162 InnerList* last_list_;
164 DISALLOW_COPY_AND_ASSIGN(ListContainerCharAllocator);
167 // PositionInListContainerCharAllocator
168 //////////////////////////////////////////////////////
169 template <typename BaseElementType>
170 ListContainer<BaseElementType>::PositionInListContainerCharAllocator::
171 PositionInListContainerCharAllocator(const typename ListContainer<
172 BaseElementType>::PositionInListContainerCharAllocator& other)
173 : ptr_to_container(other.ptr_to_container),
174 vector_index(other.vector_index),
175 item_iterator(other.item_iterator) {
178 template <typename BaseElementType>
179 ListContainer<BaseElementType>::PositionInListContainerCharAllocator::
180 PositionInListContainerCharAllocator(
181 typename ListContainer<BaseElementType>::ListContainerCharAllocator*
185 : ptr_to_container(container),
186 vector_index(vector_ind),
187 item_iterator(item_iter) {
190 template <typename BaseElementType>
191 bool ListContainer<BaseElementType>::PositionInListContainerCharAllocator::
192 operator==(const typename ListContainer<
193 BaseElementType>::PositionInListContainerCharAllocator& other) const {
194 DCHECK_EQ(ptr_to_container, other.ptr_to_container);
195 return vector_index == other.vector_index &&
196 item_iterator == other.item_iterator;
199 template <typename BaseElementType>
200 bool ListContainer<BaseElementType>::PositionInListContainerCharAllocator::
201 operator!=(const typename ListContainer<
202 BaseElementType>::PositionInListContainerCharAllocator& other) const {
203 return !(*this == other);
206 template <typename BaseElementType>
207 typename ListContainer<BaseElementType>::PositionInListContainerCharAllocator
209 BaseElementType>::PositionInListContainerCharAllocator::Increment() {
210 typename ListContainerCharAllocator::InnerList* list =
211 ptr_to_container->InnerListById(vector_index);
212 if (item_iterator == list->LastElement()) {
213 if (vector_index < ptr_to_container->list_count() - 1) {
215 item_iterator = ptr_to_container->InnerListById(vector_index)->Begin();
217 item_iterator = NULL;
220 item_iterator += list->step;
225 template <typename BaseElementType>
226 typename ListContainer<BaseElementType>::PositionInListContainerCharAllocator
228 BaseElementType>::PositionInListContainerCharAllocator::ReverseIncrement() {
229 typename ListContainerCharAllocator::InnerList* list =
230 ptr_to_container->InnerListById(vector_index);
231 if (item_iterator == list->Begin()) {
232 if (vector_index > 0) {
235 ptr_to_container->InnerListById(vector_index)->LastElement();
237 item_iterator = NULL;
240 item_iterator -= list->step;
246 ////////////////////////////////////////////
247 template <typename BaseElementType>
248 ListContainer<BaseElementType>::ListContainer(size_t max_size_for_derived_class)
249 : data_(new ListContainerCharAllocator(max_size_for_derived_class)) {
252 template <typename BaseElementType>
253 ListContainer<BaseElementType>::ListContainer(
254 size_t max_size_for_derived_class,
255 size_t num_of_elements_to_reserve_for)
256 : data_(new ListContainerCharAllocator(max_size_for_derived_class,
257 num_of_elements_to_reserve_for)) {
260 template <typename BaseElementType>
261 ListContainer<BaseElementType>::ListContainer()
262 : data_(new ListContainerCharAllocator(sizeof(BaseElementType))) {
265 template <typename BaseElementType>
266 ListContainer<BaseElementType>::~ListContainer() {
267 for (Iterator i = begin(); i != end(); ++i) {
268 i->~BaseElementType();
272 template <typename BaseElementType>
273 void ListContainer<BaseElementType>::EraseAndInvalidateAllPointers(
274 typename ListContainer<BaseElementType>::Iterator position) {
275 BaseElementType* item = &*position;
276 item->~BaseElementType();
277 data_->Erase(position);
280 template <typename BaseElementType>
281 typename ListContainer<BaseElementType>::ConstReverseIterator
282 ListContainer<BaseElementType>::rbegin() const {
283 if (data_->IsEmpty())
284 return ConstReverseIterator(data_.get(), 0, NULL);
286 size_t last_id = data_->list_count() - 1;
287 return ConstReverseIterator(
288 data_.get(), last_id, data_->InnerListById(last_id)->LastElement());
291 template <typename BaseElementType>
292 typename ListContainer<BaseElementType>::ConstReverseIterator
293 ListContainer<BaseElementType>::rend() const {
294 return ConstReverseIterator(data_.get(), 0, NULL);
297 template <typename BaseElementType>
298 typename ListContainer<BaseElementType>::ReverseIterator
299 ListContainer<BaseElementType>::rbegin() {
300 if (data_->IsEmpty())
301 return ReverseIterator(data_.get(), 0, NULL);
303 size_t last_id = data_->list_count() - 1;
304 return ReverseIterator(
305 data_.get(), last_id, data_->InnerListById(last_id)->LastElement());
308 template <typename BaseElementType>
309 typename ListContainer<BaseElementType>::ReverseIterator
310 ListContainer<BaseElementType>::rend() {
311 return ReverseIterator(data_.get(), 0, NULL);
314 template <typename BaseElementType>
315 typename ListContainer<BaseElementType>::ConstIterator
316 ListContainer<BaseElementType>::begin() const {
317 if (data_->IsEmpty())
318 return ConstIterator(data_.get(), 0, NULL);
320 return ConstIterator(data_.get(), 0, data_->InnerListById(0)->Begin());
323 template <typename BaseElementType>
324 typename ListContainer<BaseElementType>::ConstIterator
325 ListContainer<BaseElementType>::end() const {
326 if (data_->IsEmpty())
327 return ConstIterator(data_.get(), 0, NULL);
329 size_t last_id = data_->list_count() - 1;
330 return ConstIterator(data_.get(), last_id, NULL);
333 template <typename BaseElementType>
334 typename ListContainer<BaseElementType>::Iterator
335 ListContainer<BaseElementType>::begin() {
336 if (data_->IsEmpty())
337 return Iterator(data_.get(), 0, NULL);
339 return Iterator(data_.get(), 0, data_->InnerListById(0)->Begin());
342 template <typename BaseElementType>
343 typename ListContainer<BaseElementType>::Iterator
344 ListContainer<BaseElementType>::end() {
345 if (data_->IsEmpty())
346 return Iterator(data_.get(), 0, NULL);
348 size_t last_id = data_->list_count() - 1;
349 return Iterator(data_.get(), last_id, NULL);
352 template <typename BaseElementType>
353 BaseElementType* ListContainer<BaseElementType>::front() {
354 Iterator iter = begin();
358 template <typename BaseElementType>
359 BaseElementType* ListContainer<BaseElementType>::back() {
360 ReverseIterator iter = rbegin();
364 template <typename BaseElementType>
365 const BaseElementType* ListContainer<BaseElementType>::front() const {
366 ConstIterator iter = begin();
370 template <typename BaseElementType>
371 const BaseElementType* ListContainer<BaseElementType>::back() const {
372 ConstReverseIterator iter = rbegin();
376 template <typename BaseElementType>
377 const BaseElementType* ListContainer<BaseElementType>::ElementAt(
378 size_t index) const {
379 DCHECK_LT(index, size());
381 for (list_index = 0; list_index < data_->list_count(); ++list_index) {
382 size_t current_size = data_->InnerListById(list_index)->size;
383 if (index < current_size)
385 index -= current_size;
387 return &*ConstIterator(data_.get(),
389 data_->InnerListById(list_index)->ElementAt(index));
392 template <typename BaseElementType>
393 BaseElementType* ListContainer<BaseElementType>::ElementAt(size_t index) {
394 DCHECK_LT(index, size());
396 for (list_index = 0; list_index < data_->list_count(); ++list_index) {
397 size_t current_size = data_->InnerListById(list_index)->size;
398 if (index < current_size)
400 index -= current_size;
402 return &*Iterator(data_.get(),
404 data_->InnerListById(list_index)->ElementAt(index));
407 template <typename BaseElementType>
408 BaseElementType* ListContainer<BaseElementType>::Allocate(
409 size_t size_of_actual_element_in_bytes) {
410 DCHECK_LE(size_of_actual_element_in_bytes, data_->element_size());
411 void* result = data_->Allocate();
412 return static_cast<BaseElementType*>(result);
415 template <typename BaseElementType>
416 size_t ListContainer<BaseElementType>::size() const {
417 return data_->size();
420 template <typename BaseElementType>
421 bool ListContainer<BaseElementType>::empty() const {
422 return data_->IsEmpty();
425 template <typename BaseElementType>
426 void ListContainer<BaseElementType>::clear() {
427 for (Iterator i = begin(); i != end(); ++i) {
428 i->~BaseElementType();
433 template <typename BaseElementType>
434 size_t ListContainer<
435 BaseElementType>::AvailableSizeWithoutAnotherAllocationForTesting() const {
436 return data_->NumAvailableElementsInLastList();
439 // ListContainer::Iterator
440 /////////////////////////////////////////////////
441 template <typename BaseElementType>
442 ListContainer<BaseElementType>::Iterator::Iterator(
443 ListContainerCharAllocator* container,
446 : PositionInListContainerCharAllocator(container, vector_ind, item_iter) {
449 template <typename BaseElementType>
450 ListContainer<BaseElementType>::Iterator::~Iterator() {
453 template <typename BaseElementType>
454 BaseElementType* ListContainer<BaseElementType>::Iterator::operator->() const {
455 return reinterpret_cast<BaseElementType*>(this->item_iterator);
458 template <typename BaseElementType>
459 BaseElementType& ListContainer<BaseElementType>::Iterator::operator*() const {
460 return *(reinterpret_cast<BaseElementType*>(this->item_iterator));
463 template <typename BaseElementType>
464 typename ListContainer<BaseElementType>::Iterator
465 ListContainer<BaseElementType>::Iterator::
466 operator++(int unused_post_increment) {
467 Iterator tmp = *this;
472 template <typename BaseElementType>
473 typename ListContainer<BaseElementType>::Iterator
474 ListContainer<BaseElementType>::Iterator::
480 // ListContainer::ConstIterator
481 /////////////////////////////////////////////////
482 template <typename BaseElementType>
483 ListContainer<BaseElementType>::ConstIterator::ConstIterator(
484 const typename ListContainer<BaseElementType>::Iterator& other)
485 : PositionInListContainerCharAllocator(other) {
488 template <typename BaseElementType>
489 ListContainer<BaseElementType>::ConstIterator::ConstIterator(
490 ListContainerCharAllocator* container,
493 : PositionInListContainerCharAllocator(container, vector_ind, item_iter) {
496 template <typename BaseElementType>
497 ListContainer<BaseElementType>::ConstIterator::~ConstIterator() {
500 template <typename BaseElementType>
501 const BaseElementType* ListContainer<BaseElementType>::ConstIterator::
503 return reinterpret_cast<const BaseElementType*>(this->item_iterator);
506 template <typename BaseElementType>
507 const BaseElementType& ListContainer<BaseElementType>::ConstIterator::
509 return *(reinterpret_cast<const BaseElementType*>(this->item_iterator));
512 template <typename BaseElementType>
513 typename ListContainer<BaseElementType>::ConstIterator
514 ListContainer<BaseElementType>::ConstIterator::
515 operator++(int unused_post_increment) {
516 ConstIterator tmp = *this;
521 template <typename BaseElementType>
522 typename ListContainer<BaseElementType>::ConstIterator
523 ListContainer<BaseElementType>::ConstIterator::
529 // ListContainer::ReverseIterator
530 /////////////////////////////////////////////////
531 template <typename BaseElementType>
532 ListContainer<BaseElementType>::ReverseIterator::ReverseIterator(
533 ListContainerCharAllocator* container,
536 : PositionInListContainerCharAllocator(container, vector_ind, item_iter) {
539 template <typename BaseElementType>
540 ListContainer<BaseElementType>::ReverseIterator::~ReverseIterator() {
543 template <typename BaseElementType>
544 BaseElementType* ListContainer<BaseElementType>::ReverseIterator::operator->()
546 return reinterpret_cast<BaseElementType*>(this->item_iterator);
549 template <typename BaseElementType>
550 BaseElementType& ListContainer<BaseElementType>::ReverseIterator::operator*()
552 return *(reinterpret_cast<BaseElementType*>(this->item_iterator));
555 template <typename BaseElementType>
556 typename ListContainer<BaseElementType>::ReverseIterator
557 ListContainer<BaseElementType>::ReverseIterator::
558 operator++(int unused_post_increment) {
559 ReverseIterator tmp = *this;
564 template <typename BaseElementType>
565 typename ListContainer<BaseElementType>::ReverseIterator
566 ListContainer<BaseElementType>::ReverseIterator::
568 this->ReverseIncrement();
572 // ListContainer::ConstReverseIterator
573 /////////////////////////////////////////////////
574 template <typename BaseElementType>
575 ListContainer<BaseElementType>::ConstReverseIterator::ConstReverseIterator(
576 const typename ListContainer<BaseElementType>::ReverseIterator& other)
577 : PositionInListContainerCharAllocator(other) {
580 template <typename BaseElementType>
581 ListContainer<BaseElementType>::ConstReverseIterator::ConstReverseIterator(
582 ListContainerCharAllocator* container,
585 : PositionInListContainerCharAllocator(container, vector_ind, item_iter) {
588 template <typename BaseElementType>
589 ListContainer<BaseElementType>::ConstReverseIterator::~ConstReverseIterator() {
592 template <typename BaseElementType>
593 const BaseElementType* ListContainer<BaseElementType>::ConstReverseIterator::
595 return reinterpret_cast<const BaseElementType*>(this->item_iterator);
598 template <typename BaseElementType>
599 const BaseElementType& ListContainer<BaseElementType>::ConstReverseIterator::
601 return *(reinterpret_cast<const BaseElementType*>(this->item_iterator));
604 template <typename BaseElementType>
605 typename ListContainer<BaseElementType>::ConstReverseIterator
606 ListContainer<BaseElementType>::ConstReverseIterator::
607 operator++(int unused_post_increment) {
608 ConstReverseIterator tmp = *this;
613 template <typename BaseElementType>
614 typename ListContainer<BaseElementType>::ConstReverseIterator
615 ListContainer<BaseElementType>::ConstReverseIterator::
617 this->ReverseIncrement();
621 template class ListContainer<SharedQuadState>;
622 template class ListContainer<DrawQuad>;