| /external/elfutils/src/ |
| ldscript.y | 186 if ($3 != $3->next)
188 $3->next->group_start = 1;
205 $2->next = $1->next;
206 $$ = $1->next = $2;
221 $$->val.section.input = $3->next;
227 $3->next = NULL;
235 $$->val.section.input->next = NULL;
261 $2->next = $1->next;
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| list.c | 33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)->prev = lkNew
430 xmlLinkPtr next = lk->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_dirty_surfaces.h | 14 * next paragraph) shall be included in all copies or substantial
59 struct list_head *p, *next; local
60 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
63 next = p->next;
72 struct list_head *p, *next; local
75 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
78 next = p->next
[all...] |
| /external/libxml2/ |
| list.c | 33 struct _xmlLink *next; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
206 l->sentinel->next = l->sentinel;
289 lkNew->next = lkPlace->next;
290 (lkPlace->next)->prev = lkNew
430 xmlLinkPtr next = lk->next; local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_dirty_surfaces.h | 14 * next paragraph) shall be included in all copies or substantial
59 struct list_head *p, *next; local
60 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
63 next = p->next;
72 struct list_head *p, *next; local
75 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next)
78 next = p->next
[all...] |
| /external/oprofile/libutil++/ |
| string_manip.cpp | 57 string next; local
64 next += sep;
66 next += '\\';
69 result.push_back(next);
71 next.erase(next.begin(), next.end());
73 next += ch;
77 if (!next.empty())
78 result.push_back(next);
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| SerializationHandleMap.java | 71 * Returns the index where the key is found at, or the index of the next
81 * Found the key, or the next empty spot (which means key is not
126 int index, next, hash; local
129 index = next = findIndex(key, keys);
142 next = (next + 2) % length;
143 object = keys[next];
150 if (next < index) {
151 hashedOk = hashedOk || (hash <= next);
153 hashedOk = hashedOk && (hash <= next);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| BidiRunList.h | 106 Run* next = m_firstRun; local
107 while (next != run) {
108 current = next;
109 next = current->next();
113 m_firstRun = run->next();
130 Run* next = current->next(); local
131 while (next != run) {
132 current = next;
235 Run* next = curr->next(); local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| IntMap.java | 99 for (Entry e = table[i]; e != null; e = e.next){
110 for (Entry e = table[index]; e != null; e = e.next){
120 for (Entry e = table[index]; e != null; e = e.next){
131 for (Entry e = table[index]; e != null; e = e.next){
151 Entry next = e.next; local
153 e.next = newTable[index];
155 e = next;
172 Entry next = e.next; local
236 public Entry next() { method in class:IntMap.IntMapIterator
275 Entry next; field in class:IntMap.Entry
[all...] |
| /external/opencv/cv/src/ |
| cvemd.cpp | 69 struct CvNode1D *next; member in struct:CvNode1D
77 struct CvNode2D *next[2]; /* next row & next column */ member in struct:CvNode2D
595 u0_head.next = u;
598 u[i].next = u + i + 1;
600 u[ssize - 1].next = 0;
601 u1_head.next = 0;
603 v0_head.next = ssize > 1 ? v + 1 : 0;
606 v[i].next = v + i + 1
[all...] |
| /external/fsck_msdos/ |
| fat.c | 138 checkclnum(struct bootblock *boot, int fat, cl_t cl, cl_t *next)
140 if (*next >= (CLUST_RSRVD&boot->ClustMask))
141 *next |= ~boot->ClustMask;
142 if (*next == CLUST_FREE) {
146 if (*next == CLUST_BAD) {
150 if (*next < CLUST_FIRST
151 || (*next >= boot->NumClusters && *next < CLUST_EOFS)) {
154 *next < CLUST_RSRVD ? "out of range" : "reserved",
155 *next&boot->ClustMask)
[all...] |
| /external/qemu/ |
| iohandler.c | 41 QLIST_ENTRY(IOHandlerRecord) next;
59 QLIST_FOREACH(ioh, &io_handlers, next) {
66 QLIST_FOREACH(ioh, &io_handlers, next) {
71 QLIST_INSERT_HEAD(&io_handlers, ioh, next);
95 QLIST_FOREACH(ioh, &io_handlers, next) {
118 QLIST_FOREACH_SAFE(ioh, &io_handlers, next, pioh) {
128 QLIST_REMOVE(ioh, next);
140 QLIST_ENTRY(ChildProcessRecord) next;
155 ChildProcessRecord *rec, *next; local
157 QLIST_FOREACH_SAFE(rec, &child_watches, next, next)
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| NSEC3Record.java | 11 * Next SECure name 3 - this record contains the next hashed name in an
52 private byte [] next; field in class:NSEC3Record
74 * @param next The next hash (may not be null).
78 int flags, int iterations, byte [] salt, byte [] next,
95 if (next.length > 255) {
96 throw new IllegalArgumentException("Invalid next hash");
98 this.next = new byte[next.length]
[all...] |
| /external/chromium/testing/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/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| pthread_mutex_consistent.c | 49 * unlocked. The next owner of this mutex acquires the mutex with an error return of
67 * mutex, the next owner acquires the lock with an EOWNERDEAD return code.
103 * The next two internal support functions depend on only being
128 robust->next = NULL;
134 robust->next = *list;
150 if (robust->next != NULL)
152 robust->next->prev = robust->prev;
156 robust->prev->next = robust->next;
160 *list = robust->next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_util.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 stage->next->point(stage->next, header);
48 stage->next->line(stage->next, header);
54 stage->next->tri(stage->next, header);
122 stage = stage->next;
|
| /external/e2fsprogs/lib/e2p/ |
| mntopts.c | 103 char *cp, *buf, *next; local
116 next = skip_over_word(cp);
117 if (*next == 0)
118 next = 0;
120 *next = 0;
143 cp = next ? next+1 : 0;
|
| /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/mesa3d/src/gallium/auxiliary/draw/ |
| draw_pipe_util.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 stage->next->point(stage->next, header);
48 stage->next->line(stage->next, header);
54 stage->next->tri(stage->next, header);
122 stage = stage->next;
|
| /external/protobuf/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/wpa_supplicant_8/wpa_supplicant/ |
| blacklist.c | 33 e = e->next;
77 e->next = wpa_s->blacklist;
103 wpa_s->blacklist = e->next;
105 prev->next = e->next;
113 e = e->next;
134 e = e->next;
|
| /libcore/luni/src/main/java/java/sql/ |
| SQLException.java | 35 * <li>The next exception in the chain.</li>
48 private SQLException next = null; field in class:SQLException
196 return next;
220 if (next != null) {
221 next.setNextException(ex);
223 next = ex;
247 public Throwable next() { method in class:SQLException.InternalIterator
252 current = current.next;
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkNWayCanvas.cpp | 51 bool next() { function in class:SkNWayCanvas::Iter
68 while (iter.next()) {
77 while (iter.next()) {
85 while (iter.next()) {
93 while (iter.next()) {
101 while (iter.next()) {
109 while (iter.next()) {
117 while (iter.next()) {
125 while (iter.next()) {
133 while (iter.next()) {
[all...] |
| /external/skia/src/utils/ |
| SkNWayCanvas.cpp | 51 bool next() { function in class:SkNWayCanvas::Iter
68 while (iter.next()) {
77 while (iter.next()) {
85 while (iter.next()) {
93 while (iter.next()) {
101 while (iter.next()) {
109 while (iter.next()) {
117 while (iter.next()) {
125 while (iter.next()) {
133 while (iter.next()) {
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| FillLayer.cpp | 174 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
177 for (FillLayer* pattern = this; curr; curr = curr->next()) {
183 pattern = pattern->next();
189 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
192 for (FillLayer* pattern = this; curr; curr = curr->next()) {
198 pattern = pattern->next();
204 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
207 for (FillLayer* pattern = this; curr; curr = curr->next()) {
209 pattern = pattern->next();
215 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
296 FillLayer* next; local
[all...] |
