/external/bzip2/ |
H A D | format.pl | 43 my ($prev, $curr, $str); 44 $prev = ''; $curr = ''; 48 $prev = $curr; 49 $curr = $_; 54 $curr = join( '', $prev, "<![CDATA[", $curr ); 58 elsif ( $curr =~ /<\/programlisting>|<\/screen>/ ) { 60 $curr = join( '', $prev, "]]>", $curr ); 65 print OUTFILE $curr; [all...] |
/external/skia/src/images/ |
H A D | SkImageEncoder_Factory.cpp | 15 const SkImageEncoder_EncodeReg* curr = SkImageEncoder_EncodeReg::Head(); local 16 while (curr) { 17 if ((codec = curr->factory()(t)) != NULL) { 20 curr = curr->next();
|
H A D | SkImageDecoder_FactoryRegistrar.cpp | 23 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 != NULL) { 51 Format format = curr->factory()(stream); 60 curr = curr [all...] |
H A D | SkImageDecoder_FactoryDefault.cpp | 24 const MovieReg* curr = MovieReg::Head(); local 25 while (curr) { 26 SkMovie* movie = curr->factory()(stream); 33 curr = curr->next();
|
/external/mesa3d/src/gallium/auxiliary/os/ |
H A D | os_time.h | 79 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/mesa3d/src/gallium/drivers/svga/ |
H A D | svga_state_rss.c | 89 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 D | svga_pipe_vertex.c | 47 if (count == svga->curr.num_vertex_buffers && 48 memcmp(svga->curr.vb, buffers, count * sizeof buffers[0]) == 0) 53 pipe_resource_reference(&svga->curr.vb[i].buffer, buffers[i].buffer); 58 for ( ; i < svga->curr.num_vertex_buffers; i++) 59 pipe_resource_reference(&svga->curr.vb[i].buffer, NULL); 62 memcpy(svga->curr.vb, buffers, count * sizeof buffers[0]); 63 svga->curr.num_vertex_buffers = count; 64 svga->curr.any_user_vertex_buffers = any_user_buffer; 76 pipe_resource_reference(&svga->curr.ib.buffer, ib->buffer); 77 memcpy(&svga->curr [all...] |
H A D | svga_pipe_misc.c | 39 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...] |
H A D | svga_state_need_swtnl.c | 81 if (!svga->curr.velems) { 86 for (i = 0; i < svga->curr.velems->count; i++) { 87 svga->state.sw.ve_format[i] = svga_translate_vertex_format(svga->curr.velems->velem[i].src_format); 120 struct svga_vertex_shader *vs = svga->curr.vs; 124 if (svga->curr.rast->need_pipeline & (1 << svga->curr.reduced_prim)) { 127 svga->curr.rast->need_pipeline, 128 (1 << svga->curr.reduced_prim) ); 131 svga->curr.rast->need_pipeline_tris_str, 132 svga->curr [all...] |
H A D | svga_state_fs.c | 181 key->light_twoside = svga->curr.rast->templ.light_twoside; 182 key->front_ccw = svga->curr.rast->templ.front_ccw; 199 if (svga->curr.blend->need_white_fragments) { 208 for (i = 0; i < svga->curr.num_sampler_views; i++) { 209 if (svga->curr.sampler_views[i]) { 210 assert(svga->curr.sampler[i]); 211 assert(svga->curr.sampler_views[i]->texture); 212 key->tex[i].texture_target = svga->curr.sampler_views[i]->texture->target; 213 if (!svga->curr.sampler[i]->normalized_coords) { 219 key->tex[i].swizzle_r = svga->curr [all...] |
H A D | svga_swtnl_draw.c | 68 for (i = 0; i < svga->curr.num_vertex_buffers; i++) { 69 if (svga->curr.vb[i].buffer) { 71 svga->curr.vb[i].buffer, 81 if (info->indexed && svga->curr.ib.buffer) { 82 map = pipe_buffer_map(&svga->pipe, svga->curr.ib.buffer, 86 (const ubyte *) map + svga->curr.ib.offset, 87 svga->curr.ib.index_size); 90 if (svga->curr.cb[PIPE_SHADER_VERTEX]) { 92 svga->curr.cb[PIPE_SHADER_VERTEX], 99 svga->curr [all...] |
H A D | svga_pipe_draw.c | 61 const struct pipe_vertex_element *ve = svga->curr.velems->velem; 69 for (i=0; i < svga->curr.velems->count; i++) { 71 &svga->curr.vb[ve[i].vertex_buffer_index]; 82 for (i=0; i < svga->curr.velems->count; i++) { 84 &svga->curr.vb[ve[i].vertex_buffer_index]; 122 const struct pipe_vertex_element *ve = svga->curr.velems->velem; 128 for (i=0; i < svga->curr.velems->count; i++) { 130 &svga->curr.vb[ve[i].vertex_buffer_index]; 189 nr = svga->curr.num_vertex_buffers; 192 struct pipe_vertex_buffer *vb = &svga->curr [all...] |
H A D | svga_pipe_sampler.c | 169 if (start + num <= svga->curr.num_samplers && 170 !memcmp(svga->curr.sampler + start, samplers, num * sizeof(void *))) { 176 svga->curr.sampler[start + i] = samplers[i]; 180 unsigned j = MAX2(svga->curr.num_samplers, start + num); 181 while (j > 0 && svga->curr.sampler[j - 1] == NULL) 183 svga->curr.num_samplers = j; 245 assert(start + num <= Elements(svga->curr.sampler_views)); 252 if (start + num <= svga->curr.num_sampler_views && 253 !memcmp(svga->curr.sampler_views + start, views, 260 if (svga->curr [all...] |
/external/linux-tools-perf/src/tools/perf/ui/ |
H A D | progress.c | 4 static void nop_progress_update(u64 curr __maybe_unused, 17 void ui_progress__update(u64 curr, u64 total, const char *title) argument 19 return progress_fns->update(curr, total, title);
|
H A D | progress.h | 15 void ui_progress__update(u64 curr, u64 total, const char *title);
|
/external/selinux/libsepol/cil/src/ |
H A D | cil_symtab.c | 172 struct cil_complex_symtab_node *curr = NULL; local 182 for (prev = NULL, curr = symtab->htable[hash]; curr != NULL; 183 prev = curr, curr = curr->next) { 184 if (ckey->key1 == curr->ckey->key1 && 185 ckey->key2 == curr->ckey->key2 && 186 ckey->key3 == curr->ckey->key3 && 187 ckey->key4 == curr 228 struct cil_complex_symtab_node *curr = NULL; local 264 struct cil_complex_symtab_node *curr = NULL; local [all...] |
/external/boringssl/src/ssl/pqueue/ |
H A D | pqueue.c | 116 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/bench/ |
H A D | InterpBench.cpp | 55 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/boringssl/src/crypto/x509v3/ |
H A D | pcy_tree.c | 102 X509_POLICY_LEVEL *curr) 109 if (!curr) 110 curr = tree->levels + tree->nlevel; 112 curr++; 114 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 115 for (plev = tree->levels; plev != curr; plev++) 314 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument 317 X509_POLICY_LEVEL *last = curr - 1; 327 if (!level_add_node(curr, data, node, NULL)) 334 if (!level_add_node(curr, dat 101 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 345 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument 379 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 407 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 447 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 509 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 592 X509_POLICY_LEVEL *curr; local 703 X509_POLICY_LEVEL *curr = tree->levels + 1; local 734 X509_POLICY_LEVEL *curr; local [all...] |
/external/skia/src/core/ |
H A D | SkDistanceFieldGen.cpp | 196 static void F1(DFData* curr, int width) { argument 198 DFData* check = curr - width-1; 201 if (distSq < curr->fDistSq) { 204 curr->fDistSq = distSq; 205 curr->fDistVector = distVec; 209 check = curr - width; 212 if (distSq < curr->fDistSq) { 214 curr->fDistSq = distSq; 215 curr->fDistVector = distVec; 219 check = curr 242 F2(DFData* curr, int width) argument 257 B1(DFData* curr, int width) argument 271 B2(DFData* curr, int width) argument [all...] |
H A D | SkTLS.cpp | 106 SkTLSRec* curr = (SkTLSRec*)ptr; local 108 while (curr) { 109 SkTLSRec* next = curr->fNext; 110 if (curr->fCreateProc == createProc) { 117 SkDELETE(curr); 120 prev = curr; 121 curr = next;
|
H A D | SkTypefaceCache.cpp | 19 const Rec* curr = fArray.begin(); local 21 while (curr < stop) { 22 curr->fFace->unref(); 23 curr += 1; 38 const Rec* curr = fArray.begin(); local 40 while (curr < stop) { 41 SkTypeface* currFace = curr->fFace; 42 if (proc(currFace, curr->fRequestedStyle, ctx)) { 45 curr += 1;
|
/external/libunwind/src/ia64/ |
H A D | 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] 204 unw_word_t curr = c->rbs_curr, left_edge = c->rbs_left_edge; local [all...] |
/external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
H A D | pb_bufmgr_cache.c | 127 struct list_head *curr, *next; local 133 curr = mgr->delayed.next; 134 next = curr->next; 135 while(curr != &mgr->delayed) { 136 buf = LIST_ENTRY(struct pb_cache_buffer, curr, head); 143 curr = next; 144 next = curr->next; 267 struct list_head *curr, *next; local 274 curr = mgr->delayed.next; 275 next = curr 360 struct list_head *curr, *next; local [all...] |
/external/libxml2/ |
H A D | timsort.h | 223 int64_t curr; local 232 curr = start + 2; 239 if (curr == (int64_t) size - 1) break; 240 if (SORT_CMP(dst[curr - 1], dst[curr]) > 0) break; 241 curr++; 243 return curr - start; 250 if (curr == (int64_t) size - 1) break; 251 if (SORT_CMP(dst[curr - 1], dst[curr]) < 338 const int64_t curr = stack[stack_curr - 2].start; local 461 int64_t curr = 0; local [all...] |