| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| SimplifyAngle_Test.cpp | 95 int next = index + 1; local
97 lesser.set(segPtr[index].pts, segPtr[index].verb, NULL, index, next, dummy);
98 if (segPtr[next].verb == SkPath::kMove_Verb) {
101 greater.set(segPtr[next].pts, segPtr[next].verb, NULL, index, next, dummy);
104 index = next;
256 int next = index + 1;
258 lesser.set(segPtr[index].pts, segPtr[index].verb, 0, index, next, dummy); // FIXME: segPtr[index].ts[0], segPtr[index].ts[1]);
259 if (segPtr[next].verb == SkPath::kMove_Verb)
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrAllocPool.cpp | 20 static Block* Create(size_t size, Block* next) {
24 block->fNext = next;
71 Block* next = block->fNext; local
73 block = next;
96 Block* next = fBlock->fNext; local
98 fBlock = next;
|
| /external/chromium_org/v8/test/mjsunit/es6/ |
| debug-stepin-generators.js | 36 i.next();
41 i.next();
42 i.next();
|
| /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/libcxx/test/containers/associative/map/map.cons/ |
| iter_iter_comp_alloc.pass.cpp | 49 assert(*next(m.begin()) == V(2, 1));
50 assert(*next(m.begin(), 2) == V(3, 1));
75 assert(*next(m.begin()) == V(2, 1));
76 assert(*next(m.begin(), 2) == V(3, 1));
102 assert(*next(m.begin()) == V(2, 1));
103 assert(*next(m.begin(), 2) == V(3, 1));
|
| /external/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_size_value.pass.cpp | 48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
49 assert(i == next(l1.begin()));
69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
78 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 5, 4);
79 assert(i == next(l1.begin()));
99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| cache.cc | 29 LRUHandle* next; member in struct:leveldb::__anon17091::LRUHandle
40 if (next == this) {
118 LRUHandle* next = h->next_hash; local
123 h = next;
164 // lru.prev is newest entry, lru.next is oldest entry.
173 lru_.next = &lru_;
178 for (LRUHandle* e = lru_.next; e != &lru_; ) {
179 LRUHandle* next = e->next; local
182 e = next;
[all...] |
| /external/libusb/libusb/ |
| libusbi.h | 40 struct list_head *prev, *next; member in struct:list_head
57 for (pos = list_entry((head)->next, typeof(*pos), member); \
59 pos = list_entry(pos->member.next, typeof(*pos), member))
62 for (pos = list_entry((head)->next, typeof(*pos), member), \
63 n = list_entry(pos->member.next, typeof(*pos), member); \
65 pos = n, n = list_entry(n->member.next, typeof(*n), member))
67 #define list_empty(entry) ((entry)->next == (entry))
71 entry->prev = entry->next = entry;
76 entry->next = head->next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /external/elfutils/0.153/libebl/ |
| eblstrtab.c | 76 struct Ebl_Strent *next; member in struct:Ebl_Strent
86 struct memoryblock *next; member in struct:memoryblock
150 newmem->next = st->memory;
167 mb = mb->next;
197 newstr->next = NULL;
265 for (struct Ebl_Strent *subs = (*sep)->next; subs != NULL;
266 subs = subs->next)
282 newstr->next = (*sep)->next;
283 (*sep)->next = newstr
[all...] |
| /external/jarjar/src/main/com/tonicsystems/jarjar/util/ |
| ClassPathIterator.java | 40 private ClassPathEntry next; field in class:ClassPathIterator
84 return next != null;
89 next = null;
99 public ClassPathEntry next() { method in class:ClassPathIterator
102 ClassPathEntry result = next;
114 next = null;
117 File file = files.next();
135 next = entries.next();
136 foundClass = isClass(next.getName())
160 public ClassPathEntry next() { method in class:ClassPathIterator.ZipIterator
[all...] |
| /external/lldb/source/DataFormatters/ |
| LibCxxList.cpp | 37 next () function in class:ListEntry
110 next ();
115 next ();
131 next () function in class:ListIterator
133 m_entry.SetEntry(m_entry.next());
167 while (slow.next() && slow.next()->GetValueAsUnsigned(0) != m_node_address)
170 fast1.SetEntry(fast2.next());
171 fast2.SetEntry(fast1.next());
174 slow.SetEntry(slow.next());
[all...] |
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_flatshade.c | 15 * next paragraph) shall be included in all copies or substantial portions
126 stage->next->tri( stage->next, &tmp );
144 stage->next->tri( stage->next, &tmp );
164 stage->next->line( stage->next, &tmp );
177 stage->next->line( stage->next, &tmp );
234 stage->next->flush( stage->next, flags )
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 struct cache_item *next; member in struct:cache_item
85 struct cache_item *c, *next; local
95 for (c = cache->items[i]; c; c = next) {
96 next = c->next;
97 c->next = items[c->hash % size];
111 struct cache_item *c, *next; local
117 for (c = cache->items[i]; c; c = next) {
118 next = c->next
[all...] |
| /device/asus/flo/camera/QCamera2/util/ |
| QCameraQueue.cpp | 162 struct cam_list *p_next = m_head.list.next;
164 m_head.list.next = &node->list;
166 node->list.next = p_next;
195 pos = head->next;
231 pos = head->next;
235 pos = pos->next;
274 pos = head->next;
278 pos = pos->next;
|
| /device/lge/hammerhead/camera/QCamera2/util/ |
| QCameraQueue.cpp | 189 struct cam_list *p_next = m_head.list.next;
191 m_head.list.next = &node->list;
193 node->list.next = p_next;
228 pos = head->next;
266 pos = head->next;
270 pos = pos->next;
312 pos = head->next;
316 pos = pos->next;
|
| /external/chromium_org/chrome/browser/ui/views/ |
| menu_test_base.h | 42 // Generate a mouse click and run |next| once the event has been processed.
43 virtual void Click(views::View* view, const base::Closure& next);
45 // Generate a keypress and run |next| once the event has been processed.
46 void KeyPress(ui::KeyboardCode keycode, const base::Closure& next);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| ComposedTreeWalker.cpp | 81 for (const Node* next = node; next; next = (direction == TraversalDirectionForward ? insertionPoint->nextTo(next) : insertionPoint->previousTo(next))) {
82 if (Node* found = traverseNode(next, direction))
109 if (Node* next = traverseBackToYoungerShadowRoot(node, direction))
110 return next;
|
| /external/chromium_org/third_party/WebKit/Source/core/html/track/ |
| TrackBase.cpp | 40 static blink::WebMediaPlayer::TrackId next = 0; local
41 return ++next;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| OrderIterator.cpp | 48 return next();
51 RenderBox* OrderIterator::next() function in class:blink::OrderIterator
|
| RenderTableCol.cpp | 151 // If |this| is a column-group, the next column is the colgroup's first child column.
155 // Otherwise it's the next column along.
156 RenderObject* next = nextSibling();
158 // Failing that, the child is the last column in a column-group, so the next column is the next column/column-group after its column-group.
159 if (!next && parent()->isRenderTableCol())
160 next = parent()->nextSibling();
162 for (; next && !next->isRenderTableCol(); next = next->nextSibling()) {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| TextBreakIterator.cpp | 43 while (it.next() != TextBreakDone)
64 if (it.next() == TextBreakDone)
|
| /external/chromium_org/third_party/libxml/src/ |
| hash.c | 40 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
200 xmlHashEntryPtr iter, next; local
238 table->table[key].next = NULL;
242 iter = oldtable[i].next;
244 next = iter->next;
254 table->table[key].next = NULL;
257 iter->next = table->table[key].next;
258 table->table[key].next = iter
291 xmlHashEntryPtr next; local
832 xmlHashEntryPtr next; local
906 xmlHashEntryPtr next; local
946 xmlHashEntryPtr next; local
[all...] |
