/external/chromium_org/third_party/boringssl/src/crypto/x509v3/ |
H A D | pcy_tree.c | 100 X509_POLICY_LEVEL *curr) 107 if (!curr) 108 curr = tree->levels + tree->nlevel; 110 curr++; 112 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 113 for (plev = tree->levels; plev != curr; plev++) 312 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument 315 X509_POLICY_LEVEL *last = curr - 1; 325 if (!level_add_node(curr, data, node, NULL)) 332 if (!level_add_node(curr, dat 99 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 343 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument 377 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 405 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 445 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 507 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/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/ |
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...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/ui/ |
H A D | progress.h | 15 void ui_progress__update(u64 curr, u64 total, const char *title);
|
/external/mesa3d/src/gallium/drivers/svga/ |
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...] |
/external/openssl/crypto/x509v3/ |
H A D | pcy_tree.c | 97 X509_POLICY_LEVEL *curr) 104 if (!curr) 105 curr = tree->levels + tree->nlevel; 107 curr++; 109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 110 for (plev = tree->levels; plev != curr; plev++) 310 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument 313 X509_POLICY_LEVEL *last = curr - 1; 322 if (!level_add_node(curr, data, node, NULL)) 329 if (!level_add_node(curr, dat 96 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 340 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument 374 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 402 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 442 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 504 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 589 X509_POLICY_LEVEL *curr; local 699 X509_POLICY_LEVEL *curr = tree->levels + 1; local 730 X509_POLICY_LEVEL *curr; local [all...] |
/external/chromium_org/third_party/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;
|
/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;
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | CSSCanvasValue.cpp | 55 for (RenderObjectSizeCountMap::const_iterator curr = clients().begin(); curr != end; ++curr) 56 const_cast<RenderObject*>(curr->key)->imageChanged(static_cast<WrappedImagePtr>(this), &imageChangeRect); 62 for (RenderObjectSizeCountMap::const_iterator curr = clients().begin(); curr != end; ++curr) 63 const_cast<RenderObject*>(curr->key)->imageChanged(static_cast<WrappedImagePtr>(this));
|
/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/chromium_org/third_party/boringssl/src/ssl/ |
H A D | ssl_ciph.c | 389 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, argument 392 if (curr == *tail) return; 393 if (curr == *head) 394 *head=curr->next; 395 if (curr->prev != NULL) 396 curr->prev->next=curr->next; 397 if (curr->next != NULL) 398 curr->next->prev=curr 405 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument 529 CIPHER_ORDER *head, *tail, *curr, *next, *last; local 665 CIPHER_ORDER *curr; local 1012 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderInline.cpp | 307 RenderBoxModelObject* curr = nextContinuation(this); 310 while (curr) { 311 if (beforeChild && beforeChild->parent() == curr) { 312 if (curr->slowFirstChild() == beforeChild) 314 return curr; 318 last = curr; 319 curr = nextContinuation(curr); 406 RenderBoxModelObject* curr = toRenderBoxModelObject(parent()); local 415 while (curr [all...] |
/external/chromium_org/third_party/simplejson/ |
H A D | ordered_dict.py | 39 curr = end[1] 40 curr[2] = end[1] = self.__map[key] = [key, curr, end] 51 curr = end[2] 52 while curr is not end: 53 yield curr[0] 54 curr = curr[2] 58 curr = end[1] 59 while curr i [all...] |
/external/qemu/scripts/ |
H A D | ordereddict.py | 45 curr = end[1] 46 curr[2] = end[1] = self.__map[key] = [key, curr, end] 57 curr = end[2] 58 while curr is not end: 59 yield curr[0] 60 curr = curr[2] 64 curr = end[1] 65 while curr i [all...] |
/external/chromium_org/third_party/mesa/src/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/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...] |