| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| free_list.h | 68 inline void EnsureNonLoop(void* node, void* next) {
71 if (node != next) return;
72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next);
92 // Returns value of the |next| pointer w/out running a sanity check.
116 void *next = FL_Next_No_Check(t); local
117 if (next) {
118 FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__);
120 return next;
124 // |*list|, and updates |*list| to point to the next element in the
|
| span.h | 47 Span* next; // Used when in link list member in struct:tcmalloc::Span
85 // pointers of adjacent Spans and setting span's next and prev to NULL.
90 return list->next == list;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| span.h | 47 Span* next; // Used when in link list member in struct:tcmalloc::Span
85 // pointers of adjacent Spans and setting span's next and prev to NULL.
90 return list->next == list;
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| insn.c | 175 yasm_insn_operand *cur, *next; local
179 next = STAILQ_NEXT(cur, link);
191 cur = next;
|
| /external/chromium_org/third_party/zlib/ |
| inftrees.c | 27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
203 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = here;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next table *
[all...] |
| /external/chromium_org/ui/app_list/ |
| app_list_item_list.cc | 66 AppListItemModel* next = index <= app_list_items_.size() - 1 ? local
68 CHECK_NE(prev, next);
70 if (prev && next && prev->position().Equals(next->position()))
74 item->set_position(next->position().CreateBefore());
75 else if (!next)
78 item->set_position(prev->position().CreateBetween(next->position()));
132 AppListItemModel* next = to_index < app_list_items_.size() - 1 ? local
134 CHECK_NE(prev, next);
138 // ordinal before |next| (which will place it before both items)
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-liveedit.cc | 68 len1(len1_param), len2(len2_param), next(NULL) {}
73 DiffChunkStruct* next; member in class:__anon15325::DiffChunkStruct
87 next_chunk_pointer_ = ¤t_chunk_->next;
117 chunk = chunk->next) {
|
| /external/clang/test/SemaTemplate/ |
| instantiate-member-expr.cpp | 77 struct List { List *next; }; member in struct:PR14124::List
78 template<typename T, T *(T::*p) = &T::next> struct A {};
81 template<typename T, T *(T::*p) = &T::next> struct B {};
|
| /external/dropbear/ |
| auth.h | 105 struct SignKeyList *next; member in struct:SignKeyList
|
| cli-runopts.c | 75 char ** next = 0; local
78 int nextiskey = 0; /* A flag if the next argument is a keyfile */
139 if (next) {
141 *next = argv[i];
142 if (*next == NULL) {
145 next = NULL;
157 next = &cli_opts.remoteport;
195 next = &cli_opts.username;
219 next = &dummy;
227 if (next && strlen(argv[i]) > 2)
[all...] |
| /external/e2fsprogs/e2fsck/ |
| region.c | 25 struct region_el *next; member in struct:region_el
49 struct region_el *r, *next; local
51 for (r = region->allocated; r; r = next) {
52 next = r->next;
61 struct region_el *r, *new_region, *prev, *next; local
77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
87 if ((next = r->next)) {
88 if (end > next->start
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| devno.c | 74 dp->next = *list;
83 struct dir_list *dp, *next; local
85 for (dp = *list; dp; dp = next) {
86 next = dp->next;
157 list = list->next;
166 * the next level of subdirectories. (breadth-first)
|
| list.h | 19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
45 struct list_head * next)
47 next->prev = add;
48 add->next = next;
50 prev->next = add;
63 __list_add(add, head, head->next);
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| brel.h | 55 errcode_t (*next)(ext2_brel brel, blk_t *old, member in struct:ext2_block_relocation_table
82 #define ext2fs_brel_next(brel, old, ent) ((brel)->next((brel), old, ent))
|
| finddev.c | 39 struct dir_list *next; member in struct:dir_list
58 dp->next = *list;
67 struct dir_list *dp, *next; local
69 for (dp = *list; dp; dp = next) {
70 next = dp->next;
140 list = list->next;
151 * the next level of subdirectories. (breadth-first)
|
| /external/elfutils/libdw/ |
| dwarf_getaranges.c | 63 struct arangelist *next; member in struct:arangelist
169 /* Round the address to the next multiple of 2*address_size. */
215 new_arange->next = arangelist;
249 arangelist = arangelist->next;
|
| /external/elfutils/libdwfl/ |
| dwfl_report_elf.c | 97 const GElf_Addr next = (end + align - 1) & -align; local
102 || (bias == 0 && end > start && end != next))
104 shdr->sh_addr = next;
|
| /external/freetype/src/base/ |
| ftutil.c | 254 cur = cur->next;
270 node->next = 0;
274 before->next = node;
291 node->next = after;
313 after = node->next;
316 before->next = after;
337 after = node->next;
343 before->next = after;
351 node->next = list->head;
370 FT_ListNode next = cur->next local
398 FT_ListNode next = cur->next; local
[all...] |
| /external/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| DiscreteDomains.java | 47 @Override public Integer next(Integer value) { method in class:DiscreteDomains.IntegerDomain
87 @Override public Long next(Long value) { method in class:DiscreteDomains.LongDomain
140 @Override public BigInteger next(BigInteger value) { method in class:DiscreteDomains.BigIntegerDomain
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedBytes.java | 127 int next = toInt(array[i]); local
128 if (next < min) {
129 min = next;
147 int next = toInt(array[i]); local
148 if (next > max) {
149 max = next;
|
| UnsignedInts.java | 86 int next = flip(array[i]); local
87 if (next < min) {
88 min = next;
106 int next = flip(array[i]); local
107 if (next > max) {
108 max = next;
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| Helpers.java | 70 return Collections.singletonMap(key, value).entrySet().iterator().next();
117 public T next() { method in class:Helpers
137 public T next() {
141 return iterator.next();
152 iterator.next();
154 return iterator.next();
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| AbstractIteratorTest.java | 58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
153 assertEquals(0, (int) iter.next());
177 // hasNext/next), but we'll cop out for now, knowing that
178 // next() both start by invoking hasNext() anyway.
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| HashBiMapTest.java | 92 // The next two tests verify that map entries are not accessed after they're
100 iterator.next();
101 iterator.next();
103 iterator.next();
115 iterator.next();
116 iterator.next();
118 iterator.next();
|
