| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| span.h | 33 // A Span is a contiguous run of pages.
43 // Information kept for a span (a contiguous run of pages).
44 struct Span {
46 Length length; // Number of pages in span
47 Span* next; // Used when in link list
48 Span* prev; // Used when in link list
52 unsigned int location : 2; // Is the span on a freelist, and if so, which?
57 // For debugging, we can keep a log events per span
63 // What freelist the span is on: IN_USE if on none, or normal or returned
68 void Event(Span* span, char op, int v = 0)
[all...] |
| page_heap.h | 46 #include "span.h"
108 // contiguous runs of pages (called a "span").
118 Span* New(Length n);
120 // Delete the span "[p, p+n-1]".
121 // REQUIRES: span was returned by earlier call to New() and
123 void Delete(Span* span);
125 // Mark an allocated span as being used for small objects of the
127 // REQUIRES: span was returned by an earlier call to New()
129 void RegisterSizeClass(Span* span, size_t sc)
[all...] |
| span.cc | 34 #include "span.h"
45 void Event(Span* span, char op, int v = 0) {
46 span->history[span->nexthistory] = op;
47 span->value[span->nexthistory] = v;
48 span->nexthistory++;
49 if (span->nexthistory == sizeof(span->history)) span->nexthistory = 0
[all...] |
| page_heap.cc | 70 Span* PageHeap::SearchFreeAndLargeLists(Length n) {
76 Span* ll = &free_[s].normal;
77 // If we're lucky, ll is non-empty, meaning it has a suitable span.
79 ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST);
82 // Alternatively, maybe there's a usable returned span.
85 ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST);
93 Span* PageHeap::New(Length n) {
97 Span* result = SearchFreeAndLargeLists(n);
110 Span* PageHeap::AllocLarge(Length n) {
111 // find the best span (closest to n in size)
428 Span* span = reinterpret_cast<Span*>(pagemap_.Next(start)); local
504 Span* span = NewSpan(p, ask); local
[all...] |
| static_vars.h | 44 #include "span.h"
70 static PageHeapAllocator<Span>* span_allocator() { return &span_allocator_; }
80 static Span* sampled_objects() { return &sampled_objects_; }
95 static PageHeapAllocator<Span> span_allocator_;
97 static Span sampled_objects_;
|
| static_vars.cc | 45 PageHeapAllocator<Span> Static::span_allocator_;
47 Span Static::sampled_objects_;
|
| central_freelist.h | 44 #include "span.h"
157 Span empty_; // Dummy header for list of empty spans
158 Span nonempty_; // Dummy header for list of non-empty spans
|
| central_freelist.cc | 97 Span* MapObjectToSpan(void* object) {
99 Span* span = Static::pageheap()->GetDescriptor(p); local
100 return span;
104 Span* span = MapObjectToSpan(object); local
105 ASSERT(span != NULL);
106 ASSERT(span->refcount > 0);
108 // If span is empty, move it to non-empty list
109 if (span->objects == NULL)
[all...] |
| tcmalloc.cc | 69 // Page map contains a mapping from page id to Span.
71 // If Span s occupies pages [p..q],
77 // Otherwise it points to a Span. This span may be free
127 #include "span.h" // for Span, DLL_Prepend, etc
165 using tcmalloc::Span;
281 // won't be caught if it's within a valid span or a stale span for which
595 // the page heap releases at the span granularity, and spans are of wildl
805 const Span *span = Static::pageheap()->GetDescriptor(p); local
982 Span *span = Static::pageheap()->New(tcmalloc::pages(size == 0 ? 1 : size)); local
996 tcmalloc::DLL_Prepend(Static::sampled_objects(), span); local
1077 Span* span = Static::pageheap()->New(num_pages); local
1153 Span* span = NULL; local
1223 const Span *span = Static::pageheap()->GetDescriptor(p); local
1344 Span* span = Static::pageheap()->New(tcmalloc::pages(size)); local
1350 Span* span = Static::pageheap()->New(alloc); local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| span.h | 33 // A Span is a contiguous run of pages.
43 // Information kept for a span (a contiguous run of pages).
44 struct Span {
46 Length length; // Number of pages in span
47 Span* next; // Used when in link list
48 Span* prev; // Used when in link list
52 unsigned int location : 2; // Is the span on a freelist, and if so, which?
57 // For debugging, we can keep a log events per span
63 // What freelist the span is on: IN_USE if on none, or normal or returned
68 void Event(Span* span, char op, int v = 0)
[all...] |
| span.cc | 34 #include "span.h"
45 void Event(Span* span, char op, int v = 0) {
46 span->history[span->nexthistory] = op;
47 span->value[span->nexthistory] = v;
48 span->nexthistory++;
49 if (span->nexthistory == sizeof(span->history)) span->nexthistory = 0
[all...] |
| page_heap.h | 46 #include "span.h"
100 // contiguous runs of pages (called a "span").
110 Span* New(Length n);
112 // Delete the span "[p, p+n-1]".
113 // REQUIRES: span was returned by earlier call to New() and
115 void Delete(Span* span);
117 // Mark an allocated span as being used for small objects of the
119 // REQUIRES: span was returned by an earlier call to New()
121 void RegisterSizeClass(Span* span, size_t sc)
[all...] |
| static_vars.h | 44 #include "span.h"
70 static PageHeapAllocator<Span>* span_allocator() { return &span_allocator_; }
80 static Span* sampled_objects() { return &sampled_objects_; }
95 static PageHeapAllocator<Span> span_allocator_;
97 static Span sampled_objects_;
|
| page_heap.cc | 70 Span* PageHeap::SearchFreeAndLargeLists(Length n) {
76 Span* ll = &free_[s].normal;
77 // If we're lucky, ll is non-empty, meaning it has a suitable span.
79 ASSERT(ll->next->location == Span::ON_NORMAL_FREELIST);
82 // Alternatively, maybe there's a usable returned span.
85 ASSERT(ll->next->location == Span::ON_RETURNED_FREELIST);
93 Span* PageHeap::New(Length n) {
97 Span* result = SearchFreeAndLargeLists(n);
109 Span* PageHeap::AllocLarge(Length n) {
110 // find the best span (closest to n in size)
367 Span* span = reinterpret_cast<Span*>(pagemap_.Next(start)); local
442 Span* span = NewSpan(p, ask); local
[all...] |
| static_vars.cc | 45 PageHeapAllocator<Span> Static::span_allocator_;
47 Span Static::sampled_objects_;
|
| central_freelist.h | 44 #include "span.h"
157 Span empty_; // Dummy header for list of empty spans
158 Span nonempty_; // Dummy header for list of non-empty spans
|
| central_freelist.cc | 97 Span* MapObjectToSpan(void* object) {
99 Span* span = Static::pageheap()->GetDescriptor(p); local
100 return span;
104 Span* span = MapObjectToSpan(object); local
105 ASSERT(span != NULL);
106 ASSERT(span->refcount > 0);
108 // If span is empty, move it to non-empty list
109 if (span->objects == NULL)
[all...] |
| tcmalloc.cc | 69 // Page map contains a mapping from page id to Span.
71 // If Span s occupies pages [p..q],
77 // Otherwise it points to a Span. This span may be free
127 #include "span.h" // for Span, DLL_Prepend, etc
175 using tcmalloc::Span;
284 // won't be caught if it's within a valid span or a stale span for which
567 // the page heap releases at the span granularity, and spans are of wildl
798 const Span *span = Static::pageheap()->GetDescriptor(p); local
974 Span *span = Static::pageheap()->New(tcmalloc::pages(size == 0 ? 1 : size)); local
988 tcmalloc::DLL_Prepend(Static::sampled_objects(), span); local
1064 Span* span = Static::pageheap()->New(num_pages); local
1129 Span* span = NULL; local
1188 const Span *span = Static::pageheap()->GetDescriptor(p); local
1302 Span* span = Static::pageheap()->New(tcmalloc::pages(size)); local
1308 Span* span = Static::pageheap()->New(alloc); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| Region.h | 66 struct Span {
67 Span(int y, size_t segmentIndex)
85 typedef const Span* SpanIterator;
126 Vector<Span, 16> m_spans;
136 friend bool operator==(const Span&, const Span&);
173 inline bool operator==(const Region::Span& a, const Region::Span& b)
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| page_heap_test.cc | 28 // Allocate a span 's1'
29 tcmalloc::Span* s1 = ph->New(256);
32 // Split span 's1' into 's1', 's2'. Delete 's2'
33 tcmalloc::Span* s2 = ph->Split(s1, 128);
38 // Unmap deleted span 's2'
42 // Delete span 's1'
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| page_heap_test.cc | 28 // Allocate a span 's1'
29 tcmalloc::Span* s1 = ph->New(256);
32 // Split span 's1' into 's1', 's2'. Delete 's2'
33 tcmalloc::Span* s2 = ph->Split(s1, 128);
38 // Unmap deleted span 's2'
42 // Delete span 's1'
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| dfa.h | 43 typedef struct Span {
46 } Span;
48 unsigned int Span_show(Span*, FILE *, unsigned int);
52 Span *span; member in struct:Go
|
| code.c | 77 /* there must be at least one span in list; all spans must cover
85 if(g->span[j].to != g->span[i].to){
86 ++i; g->span[i].to = g->span[j].to;
88 g->span[i].ub = g->span[j].ub;
94 Span *s = g->span, *b = base->span, *e = &b[base->nSpans]
771 Span *span; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| FastMalloc.cpp | 515 // For all span-lengths < kMaxPages we keep an exact-size list.
953 // Span - a contiguous run of pages
[all...] |
| /frameworks/base/core/java/android/os/ |
| StrictMode.java | 144 // How many Span tags (e.g. animations) to report.
1870 Span span = null; local
[all...] |
