Searched defs:curr (Results 51 - 75 of 221) sorted by relevance

123456789

/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dsymbol_table.c129 struct symbol *curr; member in struct:_mesa_symbol_table_iterator
220 iter->curr = sym;
240 return (iter->curr == NULL) ? NULL : iter->curr->data;
249 if (iter->curr == NULL) {
253 hdr = iter->curr->hdr;
254 iter->curr = iter->curr->next_with_same_name;
256 while (iter->curr != NULL) {
257 assert(iter->curr
387 struct symbol *curr; local
[all...]
/external/chromium_org/third_party/skia/bench/
H A DFontCacheBench.cpp20 const uint16_t* curr = start; local
21 while (*curr != gUniqueGlyphIDs_Sentinel) {
22 curr += 1;
24 return static_cast<int>(curr - start);
/external/chromium_org/third_party/skia/experimental/DrawingBoard/
H A DSkColorPalette.cpp80 SkPoint curr = click->fCurr; local
81 //SkDebugf("click %f %f \n", curr.fX, curr.fY);
82 int selected = selectSlot(curr);
98 curr.fX -= PalettePadding;
99 curr.fY -= 2 * PalettePadding + (fSlotRect.height() + PalettePadding) * PaletteSlots;
100 if (curr.fX < 0 || curr.fX > fGradientRect.width() ||
101 curr.fY < 0 || curr
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkTypefaceCache.cpp19 const Rec* curr = fArray.begin(); local
21 while (curr < stop) {
22 if (curr->fStrong) {
23 curr->fFace->unref();
25 curr->fFace->weak_unref();
27 curr += 1;
50 const Rec* curr = fArray.begin(); local
52 while (curr < stop) {
53 if (curr->fFace->uniqueID() == fontID) {
54 return curr
62 const Rec* curr = fArray.begin(); 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...]
/external/libunwind/src/ia64/
H A DGrbs.c88 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/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...]
/external/mesa3d/src/mesa/program/
H A Dsymbol_table.c129 struct symbol *curr; member in struct:_mesa_symbol_table_iterator
220 iter->curr = sym;
240 return (iter->curr == NULL) ? NULL : iter->curr->data;
249 if (iter->curr == NULL) {
253 hdr = iter->curr->hdr;
254 iter->curr = iter->curr->next_with_same_name;
256 while (iter->curr != NULL) {
257 assert(iter->curr
387 struct symbol *curr; local
[all...]
/external/opencv/cvaux/src/
H A Dcvlines.cpp207 int curr; local
211 curr = 0;
218 start.x = scanlines[curr++];
219 start.y = scanlines[curr++];
221 end.x = scanlines[curr++];
222 end.y = scanlines[curr++];
253 int curr; local
259 curr = 0;
266 start.x = scanlines[curr++];
267 start.y = scanlines[curr
[all...]
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dfx_zlib_inftrees.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 DFontCacheBench.cpp19 const uint16_t* curr = start; local
20 while (*curr != gUniqueGlyphIDs_Sentinel) {
21 curr += 1;
23 return static_cast<int>(curr - start);
/external/skia/experimental/DrawingBoard/
H A DSkColorPalette.cpp80 SkPoint curr = click->fCurr; local
81 //SkDebugf("click %f %f \n", curr.fX, curr.fY);
82 int selected = selectSlot(curr);
98 curr.fX -= PalettePadding;
99 curr.fY -= 2 * PalettePadding + (fSlotRect.height() + PalettePadding) * PaletteSlots;
100 if (curr.fX < 0 || curr.fX > fGradientRect.width() ||
101 curr.fY < 0 || curr
[all...]
/external/skia/src/core/
H A DSkTypefaceCache.cpp19 const Rec* curr = fArray.begin(); local
21 while (curr < stop) {
22 if (curr->fStrong) {
23 curr->fFace->unref();
25 curr->fFace->weak_unref();
27 curr += 1;
50 const Rec* curr = fArray.begin(); local
52 while (curr < stop) {
53 if (curr->fFace->uniqueID() == fontID) {
54 return curr
62 const Rec* curr = fArray.begin(); local
[all...]
/external/valgrind/main/callgrind/
H A Dbb.c70 BB **new_table, *curr, *next; local
85 curr = bbs.table[i];
86 while (NULL != curr) {
87 next = curr->next;
89 new_idx = bb_hash_idx(curr->obj, curr->offset, new_size);
91 curr->next = new_table[new_idx];
92 new_table[new_idx] = curr;
93 if (curr->next) {
95 if (curr
[all...]
H A Dcontext.c94 Context **new_table, *curr, *next; local
109 curr = cxts.table[i];
110 while (NULL != curr) {
111 next = curr->next;
113 new_idx = (UInt) (curr->hash % new_size);
115 curr->next = new_table[new_idx];
116 new_table[new_idx] = curr;
117 if (curr->next) {
119 if (curr->next->next)
123 curr
[all...]
/external/valgrind/main/coregrind/
H A Dm_hashtable.c160 VgHashNode* curr = table->chains[ CHAIN_NO(key, table) ]; local
162 while (curr) {
163 if (key == curr->key) {
164 return curr;
166 curr = curr->next;
175 VgHashNode* curr = table->chains[chain]; local
181 while (curr) {
182 if (key == curr->key) {
183 *prev_next_ptr = curr
[all...]
/external/bzip2/
H A Dcompress.c532 Int32 curr = s->len[t][0]; local
533 bsW ( s, 5, curr );
535 while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
536 while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
H A Ddecompress.c128 Int32 curr; local
182 curr = s->save_curr;
318 GET_BITS(BZ_X_CODING_1, curr, 5);
321 if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR);
325 if (uc == 0) curr++; else curr--;
327 s->len[t][i] = curr;
629 s->save_curr = curr;
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderLineBoxList.cpp87 for (InlineFlowBox* curr = box; curr; curr = curr->nextLineBox())
88 curr->setExtracted();
103 for (InlineFlowBox* curr = box; curr; curr = curr->nextLineBox()) {
104 curr
254 RenderObject* curr = 0; local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXSLStyleSheetLibxslt.cpp208 xmlNodePtr curr = stylesheetRoot->children; local
209 while (curr) {
210 if (curr->type != XML_ELEMENT_NODE) {
211 curr = curr->next;
214 if (IS_XSLT_ELEM(curr) && IS_XSLT_NAME(curr, "import")) {
215 xmlChar* uriRef = xsltGetNsProp(curr, (const xmlChar*)"href", XSLT_NAMESPACE);
221 curr = curr
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/
H A Dpcy_tree.c100 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...]

Completed in 746 milliseconds

123456789