/external/skia/src/core/ |
SkDistanceFieldGen.cpp | 198 static void F1(DFData* curr, int width) { 200 DFData* check = curr - width-1; 203 if (distSq < curr->fDistSq) { 206 curr->fDistSq = distSq; 207 curr->fDistVector = distVec; 211 check = curr - width; 214 if (distSq < curr->fDistSq) { 216 curr->fDistSq = distSq; 217 curr->fDistVector = distVec; 221 check = curr - width+1 [all...] |
SkTLS.cpp | 113 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;
|
/external/skqp/src/core/ |
SkDistanceFieldGen.cpp | 198 static void F1(DFData* curr, int width) { 200 DFData* check = curr - width-1; 203 if (distSq < curr->fDistSq) { 206 curr->fDistSq = distSq; 207 curr->fDistVector = distVec; 211 check = curr - width; 214 if (distSq < curr->fDistSq) { 216 curr->fDistSq = distSq; 217 curr->fDistVector = distVec; 221 check = curr - width+1 [all...] |
SkTLS.cpp | 113 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;
|
/external/syslinux/com32/sysdump/ |
memmap.c | 21 struct e820_info *curr; local 25 curr = lmalloc(sizeof *curr); 30 memset(&curr, 0, sizeof curr); 34 ireg.ecx.l = sizeof curr->data; 35 ireg.es = SEG(curr->data); 36 ireg.edi.w[0] = OFFS(curr->data); 50 memcpy(buf[nentry].data, curr->data, sizeof curr->data) [all...] |
/external/curl/lib/ |
pipeline.c | 135 struct curl_llist_element *curr; local 137 curr = conn->send_pipe.head; 138 while(curr) { 139 if(curr->ptr == handle) { 140 Curl_llist_move(&conn->send_pipe, curr, 160 curr = curr->next; 172 struct curl_llist_element *curr; local 174 curr = blacklist->head; 175 while(curr) { 296 struct curl_llist_element *curr = pipeline->head; local [all...] |
conncache.c | 113 struct curl_llist_element *curr; local 115 curr = cb_ptr->conn_list.head; 116 while(curr) { 117 if(curr->ptr == conn) { 118 Curl_llist_remove(&cb_ptr->conn_list, curr, NULL); 123 curr = curr->next; 359 struct curl_llist_element *curr; local 375 curr = bundle->conn_list.head; 376 while(curr) { 409 struct curl_llist_element *curr; local 474 struct curl_llist_element *curr; local 523 struct curl_llist_element *curr; local [all...] |
/external/libunwind/src/ia64/ |
Grbs.c | 88 Debug (10, "(left=%u, curr=%u)\n", c->rbs_left_edge, c->rbs_curr); 128 unw_word_t nregs, bsp = c->bsp, curr = c->rbs_curr, n; local 134 while (!rbs_contains (&c->rbs_area[curr], bsp)) 136 if (curr == left_edge) 142 n = rse_num_regs (c->rbs_area[curr].end, bsp); 143 curr = (curr + ARRAY_SIZE (c->rbs_area) - 1) % ARRAY_SIZE (c->rbs_area); 144 bsp = rse_skip_regs (c->rbs_area[curr].end - c->rbs_area[curr].size, n); 149 nregs = rse_num_regs (bsp, c->rbs_area[curr].end) 204 unw_word_t curr = c->rbs_curr, left_edge = c->rbs_left_edge; local [all...] |
/frameworks/native/services/surfaceflinger/RenderEngine/ |
GLExtensions.cpp | 31 char const* curr = extensions; local 32 char const* head = curr; 34 head = strchr(curr, ' '); 35 String8 s(curr, head ? head - curr : strlen(curr)); 39 curr = head + 1;
|
/external/libxml2/ |
timsort.h | 271 size_t curr; local 285 curr = start + 2; 290 if (curr == size - 1) { 294 if (SORT_CMP(dst[curr - 1], dst[curr]) > 0) { 298 curr++; 301 return curr - start; 305 if (curr == size - 1) { 309 if (SORT_CMP(dst[curr - 1], dst[curr]) <= 0) 375 const size_t curr = stack[stack_curr - 2].start; local 535 size_t curr = 0; local [all...] |
/external/boringssl/src/ssl/ |
ssl_cipher.cc | 774 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, 776 if (curr == *tail) { 779 if (curr == *head) { 780 *head = curr->next; 782 if (curr->prev != NULL) { 783 curr->prev->next = curr->next; 785 if (curr->next != NULL) { 786 curr->next->prev = curr->prev 866 CIPHER_ORDER *head, *tail, *curr, *next, *last; local 988 CIPHER_ORDER *curr = *head_p; local 1208 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
/external/mesa3d/src/gallium/drivers/svga/ |
svga_state_fs.c | 193 if (svga->curr.gs) { 194 key->fs.gs_generic_outputs = svga->curr.gs->generic_outputs; 196 key->fs.vs_generic_outputs = svga->curr.vs->generic_outputs; 207 key->fs.light_twoside = svga->curr.rast->templ.light_twoside; 208 key->fs.front_ccw = svga->curr.rast->templ.front_ccw; 209 key->fs.pstipple = (svga->curr.rast->templ.poly_stipple_enable && 210 svga->curr.reduced_prim == PIPE_PRIM_TRIANGLES); 211 key->fs.aa_point = (svga->curr.rast->templ.point_smooth && 212 svga->curr.reduced_prim == PIPE_PRIM_POINTS && 213 (svga->curr.rast->pointsize > 1.0 | [all...] |
svga_pipe_constants.c | 67 assert(index < ARRAY_SIZE(svga->curr.constbufs[shader])); 71 pipe_resource_reference(&svga->curr.constbufs[shader][index].buffer, buf); 76 svga->curr.constbufs[shader][index].buffer_size = 79 svga->curr.constbufs[shader][index].buffer_offset = cb ? cb->buffer_offset : 0; 80 svga->curr.constbufs[shader][index].user_buffer = NULL; /* not used */
|
svga_pipe_draw.c | 65 svga_hwtnl_set_fillmode(svga->hwtnl, svga->curr.rast->hw_fillmode); 75 svga->curr.rast->templ.flatshade || 77 svga->curr.rast->templ.flatshade_first); 117 svga_hwtnl_set_fillmode(svga->hwtnl, svga->curr.rast->hw_fillmode); 127 svga->curr.rast->templ.flatshade || 129 svga->curr.rast->templ.flatshade_first); 167 if (svga->curr.ib.index_size == 1) 169 else if (svga->curr.ib.index_size == 2) 194 svga->curr.rast->templ.cull_face == PIPE_FACE_FRONT_AND_BACK) 206 if (svga->curr.reduced_prim != reduced_prim) [all...] |
svga_swtnl_draw.c | 72 for (i = 0; i < svga->curr.num_vertex_buffers; i++) { 73 if (svga->curr.vb[i].buffer) { 75 svga->curr.vb[i].buffer, 82 old_num_vertex_buffers = svga->curr.num_vertex_buffers; 86 if (info->indexed && svga->curr.ib.buffer) { 87 map = pipe_buffer_map(&svga->pipe, svga->curr.ib.buffer, 91 (const ubyte *) map + svga->curr.ib.offset, 92 svga->curr.ib.index_size, ~0); 96 for (i = 0; i < ARRAY_SIZE(svga->curr.constbufs[PIPE_SHADER_VERTEX]); ++i) { 97 if (svga->curr.constbufs[PIPE_SHADER_VERTEX][i].buffer == NULL) [all...] |
svga_pipe_misc.c | 45 memcpy(&svga->curr.scissor, scissors, sizeof(*scissors)); 88 struct pipe_framebuffer_state *curr = &svga->curr.framebuffer; local 93 pipe_surface_reference(&curr->cbufs[i], NULL); 97 pipe_surface_reference(&curr->zsbuf, NULL); 112 struct pipe_framebuffer_state *dst = &svga->curr.framebuffer; 174 if (svga->curr.framebuffer.zsbuf) { 175 switch (svga->curr.framebuffer.zsbuf->format) { 177 svga->curr.depthscale = 1.0f / DEPTH_BIAS_SCALE_FACTOR_D16; 183 svga->curr.depthscale = 1.0f / DEPTH_BIAS_SCALE_FACTOR_D24S8 [all...] |
/system/chre/core/tests/ |
memory_manager_test.cc | 79 node *curr = nullptr, *prev = head; local 81 curr = static_cast<node*>(manager.nanoappAlloc(&app, sizeof(node))); 82 EXPECT_NE(curr, nullptr); 83 prev->next = curr; 84 prev = curr; 90 curr = head; 92 node *temp = curr->next; 93 manager.nanoappFree(&app, curr); 94 curr = temp;
|
/cts/tests/tests/widget/src/android/widget/cts/util/ |
TestUtilsMatchers.java | 44 int curr = item.get(i); local 47 if (curr > next) { 49 ":" + curr + " and #" + (i + 1) + ":" + next;
|
/external/syslinux/core/thread/ |
timeout.c | 16 struct thread *curr = current(); local 24 for (tp = curr->list.next; tp != &curr->list; tp = tp->next) {
|
/external/zlib/src/contrib/infback9/ |
inftree9.c | 44 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 + drop < max) [all...] |
/toolchain/binutils/binutils-2.27/zlib/contrib/infback9/ |
inftree9.c | 44 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 + drop < max) [all...] |
/packages/apps/UnifiedEmail/src/org/apache/james/mime4j/ |
MimeBoundaryInputStream.java | 166 int curr = s.read(); local 167 moreParts = !(prev == '-' && curr == '-'); 169 if (curr == '\n' && prev == '\r') { 172 prev = curr; 173 } while ((curr = s.read()) != -1); 175 if (curr == -1) {
|
/external/valgrind/coregrind/ |
m_hashtable.c | 162 VgHashNode* curr = table->chains[ CHAIN_NO(key, table) ]; local 164 while (curr) { 165 if (key == curr->key) { 166 return curr; 168 curr = curr->next; 179 VgHashNode* curr = table->chains[ CHAIN_NO(hnode->key, table) ]; // GEN!!! local 181 while (curr) { 182 if (hnode->key == curr->key && cmp (hnode, curr) == 0) { // GEN!! 194 VgHashNode* curr = table->chains[chain]; local 218 VgHashNode* curr = table->chains[chain]; local [all...] |
/external/nos/host/android/manual_tests/ |
test_citadel.c | 578 uint32_t prev, curr; local 596 if (0 != read32(GPIO_DATA, &curr)) { 600 debug(1, "citadel 0x%08x\n", curr); 601 if (curr & cit_bit) 603 prev = curr; 608 if (0 != read32(GPIO_DATA, &curr)) { 612 debug(1, "citadel 0x%08x\n", curr); 613 if (!(curr & cit_bit)) 615 if (prev != curr && (prev ^ curr) != cit_bit 643 uint32_t prev, curr; local 697 uint32_t curr; local [all...] |
/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/jni/ |
sobeloperator.cpp | 47 const int curr = (i * width + j) * 4; local 48 const int above = (i > 0) ? curr - 4 * width : curr; 49 const int below = (i < height - 1) ? curr + 4 * width : curr; 53 (*(dataPtr + curr + c + right) - *(dataPtr + curr + c + left)) * 2 +
|