Searched defs:curr (Results 26 - 50 of 221) sorted by relevance

123456789

/external/srec/seti/sltsEngine/src/
H A Dlinklist_impl.c137 /* update curr to newly inserted node */
138 list->curr = list->head;
143 /* curr not specified, insert from the end */
144 if(list->curr == NULL){
145 list->curr = list->tail;
149 if(list->curr == list->tail){
151 newnode->prev = list->curr;
153 (list->curr)->next = newnode;
155 /* update both curr and end */
156 list->curr
194 LNode *curr; local
[all...]
/external/chromium_org/third_party/boringssl/src/ssl/pqueue/
H A Dpqueue.c111 pitem *curr; local
113 for (curr = pq->items; curr; curr = curr->next) {
114 if (memcmp(curr->priority, prio64be, sizeof(curr->priority)) == 0) {
115 return curr;
149 pitem *curr, *next; local
156 for (curr
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/rbug/
H A Drbug_context.h58 } curr; member in struct:rbug_context
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_parameter_layout.c79 struct gl_program_parameter *curr = & src->Parameters[i]; local
81 if (curr->Type == PROGRAM_CONSTANT) {
85 if (memcmp(dst->Parameters[j].StateIndexes, curr->StateIndexes,
86 sizeof(curr->StateIndexes)) == 0) {
95 memcpy(& dst->Parameters[j], curr,
103 curr->Name = NULL;
/external/chromium_org/third_party/skia/bench/
H A DInterpBench.cpp55 SkFixed curr = SkFloatToFixed(fx); variable
58 dst[i + 0] = TILE(curr, count); curr += step;
59 dst[i + 1] = TILE(curr, count); curr += step;
60 dst[i + 2] = TILE(curr, count); curr += step;
61 dst[i + 3] = TILE(curr, count); curr += step;
74 int64_t curr variable
105 int64_t curr = (int64_t)(fx * 65536 * 655536 * 65536); variable
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkRegionPriv.h26 const SkRegion::RunType* curr = runs; local
27 while (*curr < SkRegion::kRunTypeSentinel) {
28 SkASSERT(curr[0] < curr[1]);
29 SkASSERT(curr[1] < SkRegion::kRunTypeSentinel);
30 curr += 2;
32 return SkToInt((curr - runs) >> 1);
/external/chromium_org/third_party/skia/src/ports/
H A DSkOSFile_stdio.cpp50 long curr = ::ftell((FILE*)f); // remember where we are local
51 if (curr < 0) {
61 ::fseek((FILE*)f, curr, SEEK_SET); // go back to our prev location
74 size_t curr = ::ftell((FILE*)f); local
75 if ((long)curr == -1) {
82 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
112 long curr = ::ftell((FILE*)f); local
113 if (curr < 0) {
116 return curr;
/external/chromium_org/third_party/zlib/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr
[all...]
/external/linux-tools-perf/perf-3.12.0/tools/perf/tests/
H A Dbuiltin-test.c123 static bool perf_test__matches(int curr, int argc, const char *argv[]) argument
135 if (nr == curr + 1)
140 if (strstr(tests[curr].desc, argv[i]))
162 int curr = i++, err; local
164 if (!perf_test__matches(curr, argc, argv))
167 pr_info("%2d: %-*s:", i, width, tests[curr].desc);
175 err = tests[curr].func();
176 pr_debug("---- end ----\n%s:", tests[curr].desc);
200 int curr = i++; local
202 if (argc > 1 && !strstr(tests[curr]
[all...]
/external/mesa3d/src/gallium/drivers/rbug/
H A Drbug_context.h58 } curr; member in struct:rbug_context
/external/mesa3d/src/mesa/program/
H A Dprog_parameter_layout.c79 struct gl_program_parameter *curr = & src->Parameters[i]; local
81 if (curr->Type == PROGRAM_CONSTANT) {
85 if (memcmp(dst->Parameters[j].StateIndexes, curr->StateIndexes,
86 sizeof(curr->StateIndexes)) == 0) {
95 memcpy(& dst->Parameters[j], curr,
103 curr->Name = NULL;
/external/openssl/crypto/pqueue/
H A Dpqueue.c113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
/external/qemu/distrib/zlib-1.2.8/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr
[all...]
/external/skia/bench/
H A DInterpBench.cpp55 SkFixed curr = SkFloatToFixed(fx); variable
58 dst[i + 0] = TILE(curr, count); curr += step;
59 dst[i + 1] = TILE(curr, count); curr += step;
60 dst[i + 2] = TILE(curr, count); curr += step;
61 dst[i + 3] = TILE(curr, count); curr += step;
74 int64_t curr variable
105 int64_t curr = (int64_t)(fx * 65536 * 655536 * 65536); variable
[all...]
/external/skia/src/core/
H A DSkRegionPriv.h26 const SkRegion::RunType* curr = runs; local
27 while (*curr < SkRegion::kRunTypeSentinel) {
28 SkASSERT(curr[0] < curr[1]);
29 SkASSERT(curr[1] < SkRegion::kRunTypeSentinel);
30 curr += 2;
32 return SkToInt((curr - runs) >> 1);
/external/skia/src/ports/
H A DSkOSFile_stdio.cpp52 long curr = ::ftell((FILE*)f); // remember where we are local
53 if (curr < 0) {
63 ::fseek((FILE*)f, curr, SEEK_SET); // go back to our prev location
76 size_t curr = ::ftell((FILE*)f); local
77 if ((long)curr == -1) {
84 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
114 long curr = ::ftell((FILE*)f); local
115 if (curr < 0) {
118 return curr;
/external/srec/srec/crec/
H A Dcomp_stats.c140 CS_TIME curr; local
147 curr = kernelCPU.dwLowDateTime + ((__int64)kernelCPU.dwHighDateTime << 32) +
151 curr = tickGet();
153 curr = clock();
154 if (curr == -1) return; /* clock overrun */
156 c->total_time += curr - c->last;
157 c->last = curr;
/external/zlib/src/contrib/infback9/
H A Dinftree9.c44 unsigned curr; /* number of index bits for current table */ local
145 filled is at next and has curr index bits. The code being used is huff
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
198 curr = root; /* current table index bits */
228 fill = 1U << curr;
259 next += 1U << curr;
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr
[all...]
/external/zlib/src/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr
[all...]
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/
H A Dpath.cc108 const std::string& curr = paths[index]; local
112 if (curr == "/" && index != 0)
116 if (curr == ".")
120 if (curr == "..") {
123 path_out.push_back(curr);
143 path_out.push_back(curr);
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/
H A DFillLayer.cpp175 FillLayer* curr; local
176 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
177 if (curr && curr != this) {
179 for (FillLayer* pattern = this; curr; curr
349 const FillLayer* curr; local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dulist.c25 UListNode *curr; member in struct:UList
48 newList->curr = NULL;
147 UListNode *curr = NULL; local
149 if (list == NULL || list->curr == NULL) {
153 curr = list->curr;
154 list->curr = curr->next;
157 return curr->data;
170 list->curr
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
H A Dsvga_screen_cache.c99 struct list_head *curr, *next; local
109 curr = cache->bucket[bucket].next;
110 next = curr->next;
111 while (curr != &cache->bucket[bucket]) {
114 entry = LIST_ENTRY(struct svga_host_surface_cache_entry, curr, bucket_head);
144 curr = next;
145 next = curr->next;
303 struct list_head *curr, *next; local
308 curr = cache->validated.next;
309 next = curr
[all...]
H A Dsvga_state_rss.c89 const struct svga_blend_state *curr = svga->curr.blend; local
91 EMIT_RS( svga, curr->rt[0].writemask, COLORWRITEENABLE, fail );
92 EMIT_RS( svga, curr->rt[0].blend_enable, BLENDENABLE, fail );
94 if (curr->rt[0].blend_enable) {
95 EMIT_RS( svga, curr->rt[0].srcblend, SRCBLEND, fail );
96 EMIT_RS( svga, curr->rt[0].dstblend, DSTBLEND, fail );
97 EMIT_RS( svga, curr->rt[0].blendeq, BLENDEQUATION, fail );
99 EMIT_RS( svga, curr->rt[0].separate_alpha_blend_enable,
102 if (curr
123 const struct svga_depth_stencil_state *curr = svga->curr.depth; local
203 const struct svga_rasterizer_state *curr = svga->curr.rast; local
233 const struct svga_rasterizer_state *curr = svga->curr.rast; local
[all...]
H A Dsvga_state_tss.c41 unsigned count = MAX2( svga->curr.num_sampler_views,
48 pipe_sampler_view_reference( &svga->curr.sampler_views[i], NULL );
72 unsigned count = MAX2( svga->curr.num_sampler_views,
82 const struct svga_sampler_state *s = svga->curr.sampler[i];
85 struct pipe_sampler_view *sv = svga->curr.sampler_views[i];
132 svga->state.hw_draw.num_views = svga->curr.num_sampler_views;
297 for (i = 0; i < svga->curr.num_samplers; i++) {
298 if (svga->curr.sampler[i]) {
299 const struct svga_sampler_state *curr = svga->curr local
[all...]

Completed in 1106 milliseconds

123456789