| /external/elfutils/0.153/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...] |
| /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...] |
| /art/runtime/arch/ |
| memcmp16_test.cc | 24 uint32_t next() { function in class:RandGen
53 size_t type = r.next() % range_of_tests;
62 count1 = (r.next() % max_length) + min_length;
63 count2 = (r.next() % max_length) + min_length;
67 count1 = (r.next() % max_length) + min_length;
73 count2 = (r.next() % max_length) + min_length;
102 bool fill_same = r.next() % 1 == 1;
106 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF);
110 s1[i] = static_cast<uint16_t>(r.next() & 0xFFFF);
113 s2[i] = static_cast<uint16_t>(r.next() & 0xFFFF)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.cpp | 46 if (Node* next = current.pseudoAwareFirstChild())
47 return next;
50 if (Node* next = current.pseudoAwareNextSibling())
51 return next;
55 if (Node* next = parent->pseudoAwareNextSibling())
56 return next;
65 if (Node* next = current.pseudoAwareNextSibling())
66 return next;
70 if (Node* next = parent->pseudoAwareNextSibling())
71 return next;
[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/ceres-solver/internal/ceres/ |
| low_rank_inverse_hessian.cc | 101 int next = indices_.size(); local
104 // making it the next position where the LBFGS history is stored.
105 if (next == max_num_corrections_) {
106 next = indices_.front();
110 indices_.push_back(next);
111 delta_x_history_.col(next) = delta_x;
112 delta_gradient_history_.col(next) = delta_gradient;
113 delta_x_dot_delta_gradient_(next) = delta_x_dot_delta_gradient;
|
| /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;
|
| draw_pipe_unfilled.c | 15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next->flush( stage->next, flags )
[all...] |
| /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;
144 cp = next ? next+1 : 0;
|
| /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;
|
| draw_pipe_unfilled.c | 15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next->flush( stage->next, flags )
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsDebug.cpp | 108 const SkOpAngle* next = this; local
110 next->dumpOne(true);
112 next = next->fNext;
113 } while (next && next != first);
134 const SkOpAngle* next = first; local
137 // SK_ALWAYSBREAK(next->fSegment->debugContains(next));
138 angles.push(next);
152 const SkOpAngle* next = first; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| FillLayer.cpp | 176 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
179 for (FillLayer* pattern = this; curr; curr = curr->next()) {
185 pattern = pattern->next();
191 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
194 for (FillLayer* pattern = this; curr; curr = curr->next()) {
200 pattern = pattern->next();
206 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
209 for (FillLayer* pattern = this; curr; curr = curr->next()) {
211 pattern = pattern->next();
217 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
298 FillLayer* next; local
[all...] |
| /external/checkpolicy/ |
| queue.c | 38 newnode->next = NULL;
43 q->tail->next = newnode;
62 newnode->next = NULL;
67 newnode->next = q->head;
86 q->head = q->head->next;
117 p = p->next;
137 p = p->next;
158 last->next = p->next;
159 if (last->next == NULL
[all...] |
| /external/oprofile/libop/ |
| op_alloc_counter.c | 24 struct list_head next; member in struct:counter_arc_head
31 /** the next counter allowed for this event */
32 struct list_head next; member in struct:counter_arc
56 list_init(&ctr_arc[i].next);
69 list_add_tail(&arc->next, &ctr_arc[i].next);
90 list_for_each_safe(pos, pos2, &ctr_arc[i].next) {
91 counter_arc * arc = list_entry(pos, counter_arc, next);
92 list_del(&arc->next);
135 if((&ctr_arc[depth].next)->next == &ctr_arc[depth].next)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/i915/ |
| i915_fpc_optimize.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next)
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], ¤t->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask)
[all...] |
| /external/chromium_org/third_party/skia/src/utils/ |
| SkNWayCanvas.cpp | 45 bool next() { function in class:SkNWayCanvas::Iter
62 while (iter.next()) {
72 while (iter.next()) {
83 while (iter.next()) {
91 while (iter.next()) {
99 while (iter.next()) {
107 while (iter.next()) {
115 while (iter.next()) {
123 while (iter.next()) {
131 while (iter.next()) {
[all...] |
| /external/mesa3d/src/gallium/drivers/i915/ |
| i915_fpc_optimize.c | 15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next)
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], ¤t->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask)
[all...] |
| /bionic/libc/bionic/ |
| pthread_atfork.cpp | 33 atfork_t* next; member in struct:atfork_t
69 for (atfork_t* it = g_atfork_list.first; it != NULL; it = it->next) {
79 for (atfork_t* it = g_atfork_list.first; it != NULL; it = it->next) {
101 entry->next = NULL;
104 entry->prev->next = entry;
|
