| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.h | 91 virtual void next() = 0;
106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
112 (__item)->next = (__item); \
118 (__item)->next = (__list); \
120 (__list)->prev->next = (__item); \
127 (__item)->next = (__list)->next; \
155 Item *next; member in class:nv50_ir::DLList::Item
194 virtual void next() { if (!end()) pos = rev ? pos->prev : pos->next; } function in class:nv50_ir::DLList::Iterator
391 void next() { if (pos < size) { ++pos; nextValid(); } } function in class:nv50_ir::ArrayList
[all...] |
| /external/zlib/src/test/ |
| infcover.c | 51 allocation routines on the next zlib initialization
59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item
99 item->next = zone->first;
114 struct mem_item *item, *next; local
123 /* point next to the item that matches ptr, or NULL if not found -- remove
125 next = zone->first;
126 if (next) {
127 if (next->ptr == ptr)
128 zone->first = next->next; /* first one is it, remove from list *
203 struct mem_item *item, *next; local
248 unsigned next, val; local
449 static unsigned int next = 0; local
622 code *next, table[ENOUGH_DISTS]; local
[all...] |
| /build/tools/droiddoc/templates-pdk/ |
| docpage.cs | 26 <?cs if:next.link ?>
28 <div class="training-nav-button-next">
29 <a href="<?cs var:next.link ?>">
32 <span class="training-nav-button-title"><?cs var:next.title ?></span>
38 <div class="training-nav-button-next">
39 <a href="<?cs var:next.link ?>">
40 Next lesson
42 <span class="training-nav-button-title"><?cs var:next.title ?></span>
47 <?cs /if ?><?cs # end if next.link ?>
68 <?cs if:!startpage && (previous.link || next.link) ?
[all...] |
| /external/libsepol/src/ |
| ebitmap.c | 37 n1 = n1->next;
38 n2 = n2->next;
42 n1 = n1->next;
46 n2 = n2->next;
49 new->next = 0;
51 prev->next = new;
161 n1 = n1->next;
162 n2 = n2->next;
187 new->next = 0;
189 prev->next = new
[all...] |
| /dalvik/vm/compiler/codegen/ |
| RallocUtil.cpp | 199 int next = *nextTemp; local
201 if (next >= numTemps)
202 next = 0;
203 if (!p[next].inUse && !p[next].live) {
204 dvmCompilerClobber(cUnit, p[next].reg);
205 p[next].inUse = true;
206 p[next].pair = false;
207 *nextTemp = next + 1;
208 return p[next].reg
237 int next = cUnit->regPool->nextFPTemp; local
[all...] |
| /external/okhttp/src/test/java/com/squareup/okhttp/internal/http/ |
| RouteSelectorTest.java | 91 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
97 routeSelector.next("GET");
110 Connection connection = routeSelector.next("GET");
114 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
118 routeSelector.next("GET");
131 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[0], proxyAPort,
133 assertConnection(routeSelector.next("GET"), address, proxyA, dns.inetAddresses[1], proxyAPort,
149 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort,
151 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[1], uriPort,
169 assertConnection(routeSelector.next("GET"), address, NO_PROXY, dns.inetAddresses[0], uriPort
[all...] |
| /external/qemu/proxy/ |
| proxy_common.c | 71 conn->next = NULL;
233 conn->next = after->next;
234 after->next->prev = conn;
235 after->next = conn;
242 conn->prev->next = conn->next;
243 conn->next->prev = conn->prev;
245 conn->next = conn->prev = conn;
263 s_connections->next = s_connections
291 ProxyConnection* next = conn->next; local
435 ProxyConnection* next = conn->next; local
454 ProxyConnection* next = conn->next; local
[all...] |
| /frameworks/native/libs/binder/ |
| MemoryDealer.cpp | 64 newNode->next = node->next;
65 if (node->next == 0) mLast = newNode;
66 else node->next->prev = newNode;
67 node->next = newNode;
72 newNode->next = node;
74 else node->prev->next = newNode;
81 newNode->prev = newNode->next = 0;
84 newNode->next = mFirst;
95 newNode->next = 0
148 mutable chunk_t* next; member in struct:android::SimpleBestFitAllocator::chunk_t
[all...] |
| /packages/experimental/procstatlog/ |
| procstatlog.c | 286 struct data *next = stats; local
290 read_data(next++, filename);
292 read_data(next++, filename);
296 next += read_proc_yaffs(next, stats + stats_count - next);
297 next += read_lines("/proc/net/dev", ':', NULL, 0, next, end - next);
298 next += read_lines("/proc/stat", ' ', NULL, 0, next, end - next)
[all...] |
| /system/core/adb/ |
| jdwp_service.c | 106 JdwpProcess* next; member in struct:JdwpProcess
126 JdwpProcess* proc = _jdwp_list.next;
128 for ( ; proc != &_jdwp_list; proc = proc->next ) {
164 proc->prev->next = proc->next;
165 proc->next->prev = proc->prev;
206 proc->next = proc;
221 proc->next = &_jdwp_list;
222 proc->prev = proc->next->prev;
224 proc->prev->next = proc
627 JdwpTracker* next; member in struct:JdwpTracker
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 40 T* next() const;
54 template<typename T> inline void DoublyLinkedListNode<T>::setNext(T* next)
56 static_cast<T*>(this)->m_next = next;
64 template<typename T> inline T* DoublyLinkedListNode<T>::next() const function in class:WTF::DoublyLinkedListNode
105 for (T* node = m_head; node; node = node->next())
166 node->prev()->setNext(node->next());
169 m_head = node->next();
172 if (node->next()) {
174 node->next()->setPrev(node->prev());
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| link.c | 40 struct ext2_dir_entry *next; local
54 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
56 (next->inode == 0) &&
57 (offset + curr_rec_len + next->rec_len <= blocksize)) {
58 curr_rec_len += next->rec_len;
78 next = (struct ext2_dir_entry *) (buf + offset +
80 next->inode = 0;
81 next->name_len = 0;
82 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
|
| /external/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_twoside.c | 15 * next paragraph) shall be included in all copies or substantial portions
93 stage->next->tri( stage->next, &tmp );
96 stage->next->tri( stage->next, header );
145 stage->next->flush( stage->next, flags );
151 stage->next->reset_stipple_counter( stage->next );
173 twoside->stage.next = NULL
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_fence.c | 96 screen->fence.tail->next = fence;
117 screen->fence.head = fence->next;
121 for (it = screen->fence.head; it && it->next != fence; it = it->next);
122 it->next = fence->next;
140 struct nouveau_fence *next = NULL; local
147 for (fence = screen->fence.head; fence; fence = next) {
148 next = fence->next;
[all...] |
| /external/openfst/src/include/fst/ |
| partition.h | 46 Element() : value(0), next(0), prev(0) {}
47 Element(T v) : value(v), next(0), prev(0) {}
50 Element* next; member in struct:fst::Partition::Element
70 // it current class and placing it at the head of the next class.
112 element->next = classes_[class_id];
126 if (element->next) element->next->prev = element->prev;
127 if (element->prev) element->prev->next = element->next;
128 else classes_[old_class_id] = element->next;
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/timer/ |
| SDL_timer.c | 46 struct _SDL_TimerID *next; member in struct:_SDL_TimerID
107 SDL_TimerID t, prev, next; local
113 for ( prev = NULL, t = SDL_timers; t; t = next ) {
116 next = t->next;
147 prev->next = next;
149 SDL_timers = next;
174 t->next = SDL_timers;
214 for (t = SDL_timers; t; prev=t, t = t->next ) {
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| partition.h | 41 Element() : value(0), next(0), prev(0) {}
42 Element(T v) : value(v), next(0), prev(0) {}
45 Element* next; member in struct:fst::Partition::Element
65 // it current class and placing it at the head of the next class.
107 element->next = classes_[class_id];
121 if (element->next) element->next->prev = element->prev;
122 if (element->prev) element->prev->next = element->next;
123 else classes_[old_class_id] = element->next;
[all...] |
| /external/wpa_supplicant_8/src/eap_peer/ |
| eap_methods.c | 31 for (m = eap_methods; m; m = m->next) {
51 for (m = eap_methods; m; m = m->next) {
76 for (m = eap_methods; m; m = m->next) {
103 for (m = eap_methods; m; m = m->next) {
133 for (m = eap_methods; m; m = m->next)
140 for (m = eap_methods; m; m = m->next) {
168 for (m = eap_methods; m; m = m->next)
242 m = m->next;
249 prev->next = m->next;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| emplace.pass.cpp | 40 assert(r == next(m.begin()));
42 assert(next(m.begin())->first == 1);
43 assert(next(m.begin())->second == DefaultOnly());
47 assert(r == next(m.begin(), 2));
49 assert(next(m.begin(), 2)->first == 1);
50 assert(next(m.begin(), 2)->second == DefaultOnly());
72 assert(r == next(m.begin()));
101 assert(r == next(m.begin()));
103 assert(next(m.begin())->first == 1);
104 assert(next(m.begin())->second == DefaultOnly())
[all...] |
| /system/core/sh/ |
| nodes.c | 162 calcsize(n->nclist.next);
168 calcsize(n->narg.next);
176 calcsize(n->nfile.next);
181 calcsize(n->ndup.next);
186 calcsize(n->nhere.next);
203 lp = lp->next;
260 new->nclist.next = copynode(n->nclist.next);
266 new->narg.next = copynode(n->narg.next);
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Iterators.java | 70 public Object next() {
93 @Override public Object next() {
127 public T next() { method in class:Iterators
128 return iterator.next();
152 iterator.next();
165 if (iterator.next() == null) {
171 if (element.equals(iterator.next())) {
193 if (elementsToRemove.contains(removeFrom.next())) {
217 if (predicate.apply(removeFrom.next())) {
239 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Iterators.java | 68 public Object next() {
91 @Override public Object next() {
125 public T next() { method in class:Iterators
126 return iterator.next();
150 iterator.next();
163 if (iterator.next() == null) {
169 if (element.equals(iterator.next())) {
191 if (elementsToRemove.contains(removeFrom.next())) {
215 if (predicate.apply(removeFrom.next())) {
237 if (!elementsToRetain.contains(removeFrom.next())) {
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 83 /* retrieves next point of the chain curve and updates reader */
131 struct _CvContourInfo *next; /* next contour with the same mark value */ member in struct:_CvContourInfo
247 scanner->frame_info.next = 0;
637 writer.seq->first->next == writer.seq->first) );
826 writer.seq->first->next == writer.seq->first) );
932 cur = cur->next;
997 l_cinfo->next = scanner->cinfo_table[nbd - 2];
1128 struct CvLinkedRunPoint* next; member in struct:CvLinkedRunPoint
[all...] |
