HomeSort by relevance Sort by last modified time
    Searched defs:curr (Results 51 - 75 of 402) sorted by null

1 23 4 5 6 7 8 91011>>

  /frameworks/base/libs/hwui/utils/
SortedListImpl.cpp 60 const void* const curr = reinterpret_cast<const char *> (a) + (mid * s); local
61 const int c = do_compare(curr, item);
  /frameworks/native/opengl/libagl/
Tokenizer.cpp 112 const run_t* const curr = a + mid; local
114 if (token < curr->first) c = 1;
115 else if (token >= curr->first+curr->length) c = -1;
  /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) {
  /system/core/libpixelflinger/codeflinger/
CodeCache.cpp 205 void* curr = (uint8_t*)base + assembly->size(); local
206 __builtin___clear_cache(base, curr);
  /development/perftests/panorama/feature_mos/src/mosaic/
Pyramid.cpp 38 PyramidShort *curr, *last; local
41 for (last = (curr = img) + levels; curr < last; curr++) {
42 curr->width = width;
43 curr->height = height;
44 curr->border = border;
45 curr->pitch = (real) (width + border2);
46 curr->ptr = y + border;
49 for (int j = height + border2; j--; y++, position += curr->pitch)
    [all...]
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
ColorFilters.java 48 private static void addToTheRight(Drawable curr, Drawable prev) {
52 int h = curr.getIntrinsicHeight();
55 curr.setBounds(x, y, x + curr.getIntrinsicWidth(), y + h);
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XSLStyleSheetLibxslt.cpp 191 xmlNodePtr curr = stylesheetRoot->children; local
192 while (curr) {
193 if (curr->type != XML_ELEMENT_NODE) {
194 curr = curr->next;
197 if (IS_XSLT_ELEM(curr) && IS_XSLT_NAME(curr, "import")) {
198 xmlChar* uriRef = xsltGetNsProp(curr, (const xmlChar*)"href", XSLT_NAMESPACE);
204 curr = curr->next
    [all...]
  /external/chromium_org/third_party/icu/source/common/
ulist.c 25 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 = list->head
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/
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->next
360 struct list_head *curr, *next; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/
svga_screen_cache.c 99 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->next
    [all...]
svga_state_tss.c 41 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.sampler[i] local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
symbol_table.c 129 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->hdr == hdr)
387 struct symbol *curr; local
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/
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,
313 X509_POLICY_LEVEL *last = curr - 1;
322 if (!level_add_node(curr, data, node, NULL))
329 if (!level_add_node(curr, data, last->anyPolicy, NULL)
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/opus/src/src/
opus.c 54 int curr; local
67 curr=0;
75 for (i=curr;i<N;i++)
120 for (i=curr;i<peak_pos;i++)
127 curr = end;
128 if (curr==N)
  /external/chromium_org/third_party/skia/experimental/DrawingBoard/
SkColorPalette.cpp 80 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.fY > fGradientRect.height())
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkTypefaceCache.cpp 19 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->fFace
62 const Rec* curr = fArray.begin(); local
    [all...]
  /external/e2fsprogs/resize/
extent.c 85 __u64 curr; local
97 curr = extent->num;
98 ent = extent->list + curr;
99 if (curr) {
  /external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h 180 const RealScalar curr = m_roots[i].real(); local
181 if( pred( curr, val ) )
183 val = curr;
  /external/icu/icu4c/source/common/
ulist.c 25 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 = list->head
    [all...]
  /external/libopus/src/
opus.c 54 int curr; local
67 curr=0;
75 for (i=curr;i<N;i++)
120 for (i=curr;i<peak_pos;i++)
127 curr = end;
128 if (curr==N)
  /external/mesa3d/src/gallium/auxiliary/pipebuffer/
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->next
360 struct list_head *curr, *next; local
    [all...]
  /external/mesa3d/src/gallium/drivers/svga/
svga_screen_cache.c 99 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->next
    [all...]
svga_state_tss.c 41 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.sampler[i] local
    [all...]
  /external/mesa3d/src/mesa/program/
symbol_table.c 129 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->hdr == hdr)
387 struct symbol *curr; local
    [all...]
  /external/openssl/crypto/x509v3/
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,
313 X509_POLICY_LEVEL *last = curr - 1;
322 if (!level_add_node(curr, data, node, NULL))
329 if (!level_add_node(curr, data, last->anyPolicy, NULL)
589 X509_POLICY_LEVEL *curr; local
699 X509_POLICY_LEVEL *curr = tree->levels + 1; local
730 X509_POLICY_LEVEL *curr; local
    [all...]

Completed in 1558 milliseconds

1 23 4 5 6 7 8 91011>>