HomeSort by relevance Sort by last modified time
    Searched full:curr (Results 101 - 125 of 693) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/srec/srec/Vocabulary/src/
VocabularyImpl.c 35 static PINLINE LCHAR* get_first_word(LCHAR* curr, LCHAR* end);
36 static PINLINE LCHAR* get_next_word(LCHAR* curr, LCHAR* end);
383 PINLINE LCHAR* get_first_word(LCHAR* curr, LCHAR* end)
385 while(*curr==L('\0') && curr<end) curr++;
386 return curr;
389 PINLINE LCHAR* get_next_word(LCHAR* curr, LCHAR* end)
391 while(*curr) curr++
433 LCHAR* curr; \/* pointer to current word *\/ local
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkRegionPriv.h 26 const SkRegion::RunType* curr = runs; local
27 while (*curr < SkRegion::kRunTypeSentinel) {
28 SkASSERT(curr[0] < curr[1]);
29 SkASSERT(curr[1] < SkRegion::kRunTypeSentinel);
30 curr += 2;
32 return SkToInt((curr - runs) >> 1);
  /external/skia/src/core/
SkRegionPriv.h 26 const SkRegion::RunType* curr = runs; local
27 while (*curr < SkRegion::kRunTypeSentinel) {
28 SkASSERT(curr[0] < curr[1]);
29 SkASSERT(curr[1] < SkRegion::kRunTypeSentinel);
30 curr += 2;
32 return SkToInt((curr - runs) >> 1);
  /external/srec/srec/crec/
comp_stats.c 140 CS_TIME curr; local
147 curr = kernelCPU.dwLowDateTime + ((__int64)kernelCPU.dwHighDateTime << 32) +
151 curr = tickGet();
153 curr = clock();
154 if (curr == -1) return; /* clock overrun */
156 c->total_time += curr - c->last;
157 c->last = curr;
  /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 +
  /dalvik/dexgen/src/com/android/dexgen/util/
DexJarMaker.java 89 int curr = -1; local
90 while ((curr = in.read()) != -1) {
91 target.write(curr);
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/
pb_buffer_fenced.c 200 struct list_head *curr, *next; local
206 curr = fenced_mgr->unfenced.next;
207 next = curr->next;
208 while(curr != &fenced_mgr->unfenced) {
209 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head);
216 curr = next;
217 next = curr->next;
220 curr = fenced_mgr->fenced.next;
221 next = curr->next;
222 while(curr != &fenced_mgr->fenced)
400 struct list_head *curr, *next; local
459 struct list_head *curr, *next; local
    [all...]
  /external/mesa3d/src/gallium/auxiliary/pipebuffer/
pb_buffer_fenced.c 200 struct list_head *curr, *next; local
206 curr = fenced_mgr->unfenced.next;
207 next = curr->next;
208 while(curr != &fenced_mgr->unfenced) {
209 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head);
216 curr = next;
217 next = curr->next;
220 curr = fenced_mgr->fenced.next;
221 next = curr->next;
222 while(curr != &fenced_mgr->fenced)
400 struct list_head *curr, *next; local
459 struct list_head *curr, *next; local
    [all...]
  /external/chromium_org/third_party/skia/bench/
FontCacheBench.cpp 19 const uint16_t* curr = start; local
20 while (*curr != gUniqueGlyphIDs_Sentinel) {
21 curr += 1;
23 return static_cast<int>(curr - start);
  /external/skia/bench/
FontCacheBench.cpp 19 const uint16_t* curr = start; local
20 while (*curr != gUniqueGlyphIDs_Sentinel) {
21 curr += 1;
23 return static_cast<int>(curr - start);
  /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...]
  /external/chromium_org/native_client_sdk/src/libraries/nacl_io/
path.cc 108 const std::string& curr = paths[index]; local
112 if (curr == "/" && index != 0)
116 if (curr == ".")
120 if (curr == "..") {
123 path_out.push_back(curr);
143 path_out.push_back(curr);
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
prog_parameter_layout.c 79 struct gl_program_parameter *curr = & src->Parameters[i]; local
81 if (curr->Type == PROGRAM_CONSTANT) {
85 if (memcmp(dst->Parameters[j].StateIndexes, curr->StateIndexes,
86 sizeof(curr->StateIndexes)) == 0) {
95 memcpy(& dst->Parameters[j], curr,
103 curr->Name = NULL;
  /external/mesa3d/src/mesa/program/
prog_parameter_layout.c 79 struct gl_program_parameter *curr = & src->Parameters[i]; local
81 if (curr->Type == PROGRAM_CONSTANT) {
85 if (memcmp(dst->Parameters[j].StateIndexes, curr->StateIndexes,
86 sizeof(curr->StateIndexes)) == 0) {
95 memcpy(& dst->Parameters[j], curr,
103 curr->Name = NULL;
  /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/chromium_org/third_party/WebKit/Source/platform/fonts/
GlyphPageTreeNode.cpp 321 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
322 curr->m_customFontCount++;
347 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
348 curr->m_customFontCount -= customFontCount
    [all...]
  /external/chromium_org/third_party/zlib/
inftrees.c 44 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 + drop < max)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderText.cpp 251 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox())
252 curr->setExtracted();
267 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox()) {
268 curr->setExtracted(false)
    [all...]
  /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...]
  /external/chromium_org/tools/gyp/pylib/gyp/
ordered_dict.py 93 curr = root[1]
94 while curr is not root:
95 yield curr[2]
96 curr = curr[1]
101 curr = root[0]
102 while curr is not root:
103 yield curr[2]
104 curr = curr[0
    [all...]
  /external/valgrind/main/callgrind/
context.c 94 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 = next
    [all...]
  /hardware/intel/img/libdrm/tests/
dristat.c 186 drmStatsT prev, curr; local
213 if (drmGetStats(fd, &curr)) return;
215 for (j = 0; j < curr.count; j++) {
216 if (curr.data[j].verbose) continue;
217 if (curr.data[j].isvalue) {
218 printf(" %08lx", curr.data[j].value);
220 rate = (curr.data[j].value - prev.data[j].value) / (double)i;
221 printhuman(rate, curr.data[j].mult_names, curr.data[j].mult);
225 memcpy(&prev, &curr, sizeof(prev))
    [all...]
  /packages/apps/Camera/jni/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...]
  /packages/apps/LegacyCamera/jni/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...]
  /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...]

Completed in 2632 milliseconds

1 2 3 45 6 7 8 91011>>