Searched defs:curr (Results 1 - 25 of 184) sorted by relevance

12345678

/external/skia/src/images/
H A DSkImageEncoder_Factory.cpp15 const SkImageEncoder_EncodeReg* curr = SkImageEncoder_EncodeReg::Head(); local
16 while (curr) {
17 if ((codec = curr->factory()(t)) != nullptr) {
20 curr = curr->next();
H A DSkImageDecoder_FactoryDefault.cpp24 const MovieReg* curr = MovieReg::Head(); local
25 while (curr) {
26 SkMovie* movie = curr->factory()(stream);
33 curr = curr->next();
H A DSkImageDecoder_FactoryRegistrar.cpp23 const SkImageDecoder_DecodeReg* curr = SkImageDecoder_DecodeReg::Head(); local
24 while (curr) {
25 codec = curr->factory()(stream);
41 curr = curr->next();
49 const SkImageDecoder_FormatReg* curr = SkImageDecoder_FormatReg::Head(); local
50 while (curr != nullptr) {
51 Format format = curr->factory()(stream);
60 curr = curr
[all...]
/external/mesa3d/src/gallium/auxiliary/os/
H A Dos_time.h79 int64_t curr)
82 return !(start <= curr && curr < end);
84 return !((start <= curr) || (curr < end));
77 os_time_timeout(int64_t start, int64_t end, int64_t curr) argument
/external/compiler-rt/test/tsan/
H A Dbarrier.cc22 int *curr = data[(i + 1) % 2]; local
25 curr[idx] = (left + right) / 2;
/external/boringssl/src/ssl/pqueue/
H A Dpqueue_test.c66 pitem *curr, *item; local
98 curr = pqueue_next(&iter);
99 if (curr == NULL) {
109 curr_data = (int*)curr->data;
114 curr = next;
H A Dpqueue.c116 pitem *curr; local
118 for (curr = pq->items; curr; curr = curr->next) {
119 if (memcmp(curr->priority, prio64be, sizeof(curr->priority)) == 0) {
120 return curr;
154 pitem *curr, *next; local
161 for (curr
[all...]
/external/skia/tests/
H A DTArrayTest.cpp81 int curr = 0; local
85 a->push_back(curr++);
88 b->push_back(curr++);
93 curr = 0;
95 REPORTER_ASSERT(reporter, curr++ == (*b)[i]);
98 REPORTER_ASSERT(reporter, curr++ == (*a)[i]);
103 curr = kSizes[dataSizeA];
105 REPORTER_ASSERT(reporter, curr++ == (*a)[i]);
/external/v8/src/parsing/
H A Dfunc-name-inferrer.cc64 const AstConsString* curr = ast_value_factory_->NewConsString( local
66 curr = ast_value_factory_->NewConsString(prev, curr);
67 return MakeNameFromStackHelper(pos + 1, curr);
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_time.h121 const struct util_time *curr)
123 return os_time_timeout(start->counter, end->counter, curr->counter);
119 util_time_timeout(const struct util_time *start, const struct util_time *end, const struct util_time *curr) argument
/external/mesa3d/src/gallium/drivers/svga/
H A Dsvga_pipe_misc.c39 memcpy( &svga->curr.scissor, scissor, sizeof(*scissor) );
53 struct pipe_framebuffer_state *curr = &svga->curr.framebuffer; local
58 pipe_surface_reference(&curr->cbufs[i], NULL);
62 pipe_surface_reference(&curr->zsbuf, NULL);
76 struct pipe_framebuffer_state *dst = &svga->curr.framebuffer;
117 if (svga->curr.framebuffer.zsbuf)
119 switch (svga->curr.framebuffer.zsbuf->format) {
121 svga->curr.depthscale = 1.0f / DEPTH_BIAS_SCALE_FACTOR_D16;
127 svga->curr
[all...]
/external/skia/src/core/
H A DSkTLS.cpp113 SkTLSRec* curr = (SkTLSRec*)ptr; local
115 while (curr) {
116 SkTLSRec* next = curr->fNext;
117 if (curr->fCreateProc == createProc) {
124 delete curr;
127 prev = curr;
128 curr = next;
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/xml/
H A DSkXMLPullParser.cpp11 static void reset(SkXMLPullParser::Curr* curr) argument
13 curr->fEventType = SkXMLPullParser::ERROR;
14 curr->fName = "";
15 curr->fAttrInfoCount = 0;
16 curr->fIsWhitespace = false;
/external/toybox/toys/other/
H A Dacpi.c63 int cap = 0, curr = 0, max = 0; local
67 curr = read_int_at(dfd, "charge_now");
69 curr = read_int_at(dfd, "energy_now");
70 if (max > 0 && curr >= 0) cap = 100 * curr / max;
/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/skia/bench/
H A DInterpBench.cpp62 SkFixed curr = SkFloatToFixed(fx); variable
65 dst[i + 0] = TILE(curr, count); curr += step;
66 dst[i + 1] = TILE(curr, count); curr += step;
67 dst[i + 2] = TILE(curr, count); curr += step;
68 dst[i + 3] = TILE(curr, count); curr += step;
81 int64_t curr variable
112 int64_t curr = (int64_t)(fx * 65536 * 655536 * 65536); variable
[all...]
/external/valgrind/VEX/priv/
H A Dmain_util.h152 HChar* curr; local
157 curr = private_LibVEX_alloc_curr;
158 next = curr + nbytes;
162 return 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/curl/lib/
H A Dconncache.c97 struct curl_llist_element *curr; local
99 curr = cb_ptr->conn_list->head;
100 while(curr) {
101 if(curr->ptr == conn) {
102 Curl_llist_remove(cb_ptr->conn_list, curr, NULL);
107 curr = curr->next;
279 struct curl_llist_element *curr; local
294 curr = bundle->conn_list->head;
295 while(curr) {
320 struct curl_llist_element *curr; local
[all...]
/external/e2fsprogs/resize/
H A Dextent.c85 __u64 curr; local
97 curr = extent->num;
98 ent = extent->list + curr;
99 if (curr) {
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h180 const RealScalar curr = m_roots[i].real(); local
181 if( pred( curr, val ) )
183 val = curr;
/external/icu/icu4c/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...]

Completed in 2706 milliseconds

12345678