| /external/skia/tests/ |
| ChecksumTest.cpp | 86 checksum_result curr = ComputeChecksum(ptr, checksum_size); local
87 REPORTER_ASSERT(fReporter, prev != curr);
89 REPORTER_ASSERT(fReporter, again == curr);
90 prev = curr;
|
| /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 | 101 const std::string &curr = paths[index]; local
105 if (curr == "/" && index != 0) continue;
108 if (curr == ".") continue;
111 if (curr == "..") {
114 path_out.push_back(curr);
134 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) {
|
| MimeStreamParser.java | 235 int curr = 0;
local
237 while ((curr = is.read()) != -1) {
238 if (curr == '\n' && (prev == '\n' || prev == 0)) {
245 sb.append((char) curr);
246 prev = curr == '\r' ? prev : curr;
249 // if (curr == -1 && log.isWarnEnabled()) {
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| GlyphPageTreeNode.cpp | 327 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
328 curr->m_customFontCount++;
353 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
354 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/qemu/distrib/zlib-1.2.3/ |
| 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
205 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 | 256 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox())
257 curr->setExtracted();
272 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox()) {
273 curr->setExtracted(false)
[all...] |
| RenderBlock.cpp | 377 for (RenderObject* curr = parent(); curr && !curr->isRenderView(); curr = curr->parent()) {
378 if (curr->isRenderBlock()) {
379 RenderBlock* currBlock = toRenderBlock(curr);
407 RenderBlock* curr = toRenderBlock(continuation());
410 while (curr) {
411 if (beforeChild && beforeChild->parent() == curr) {
479 RenderObject* curr = beforeChild; local
610 RenderBoxModelObject* curr = toRenderBoxModelObject(parent()); local
773 RenderObject* curr = this; local
948 RenderObject * curr = start; local
3529 RootInlineBox* curr; local
3571 RenderBox* curr; local
3973 FloatingObject* curr = floatingObjectSet.last(); local
7321 RenderBlock* curr = child->containingBlock(); local
[all...] |
| RenderObject.cpp | 491 for (RenderObject* curr = obj->firstChild(); curr; curr = curr->nextSibling())
492 addLayers(curr, parentLayer, newObject, beforeChild);
515 for (RenderObject* curr = firstChild(); curr; curr = curr->nextSibling())
516 curr->removeLayers(parentLayer)
575 const RenderObject* curr = this; local
597 RenderObject* curr = const_cast<RenderObject*>(this); local
610 RenderObject* curr = const_cast<RenderObject*>(this); local
2930 RenderObject* curr = this; local
[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...] |
| /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/Camera2/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...] |
| /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...] |
| /external/zlib/src/ |
| 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/skia/src/core/ |
| SkRegion_rects.cpp | 160 const Row* curr = fRows.begin();
162 while (curr < stop) {
163 *dst++ = curr->fBottom;
164 memcpy(dst, curr->fPtr, curr->fCount * sizeof(SkRegion::RunType));
165 dst += curr->fCount;
167 curr += 1;
|
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 160 const Row* curr = fRows.begin();
162 while (curr < stop) {
163 *dst++ = curr->fBottom;
164 memcpy(dst, curr->fPtr, curr->fCount * sizeof(SkRegion::RunType));
165 dst += curr->fCount;
167 curr += 1;
|
| /packages/apps/Camera2/src/com/android/camera/ui/ |
| FilmStripView.java | 748 ViewItem curr = mViewItem[mCurrentItem]; local
749 if (curr == null) {
752 return mDataAdapter.getImageData(curr.getId()).getViewType();
972 ViewItem curr = mViewItem[mCurrentItem]; local
1035 ViewItem curr = mViewItem[mCurrentItem]; local
1182 final ViewItem curr = mViewItem[currItem]; local
1218 final ViewItem curr = mViewItem[currItem]; local
1279 final ViewItem curr = mViewItem[itemID]; local
1291 final ViewItem curr = mViewItem[itemID]; local
1360 final ViewItem curr = mViewItem[itemID]; local
1369 final ViewItem curr = mViewItem[itemID]; local
1512 int curr = BUFFER_SIZE - 1; local
1556 int curr = 0; local
1843 ViewItem curr = mViewItem[mCurrentItem]; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| dict.c | 893 dnode_t *dict_next(dict_t *dict, dnode_t *curr)
897 if (curr->right != nil) {
898 curr = curr->right;
899 while ((left = curr->left) != nil)
900 curr = left;
901 return curr;
904 parent = curr->parent;
906 while (parent != nil && curr == parent->right) {
907 curr = parent
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next; local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| extent.c | 47 void *curr; member in struct:extent_path
259 handle->path[0].curr = 0;
377 ix = path->curr;
384 path->curr = 0;
388 if (path->curr) {
389 ix = path->curr;
396 path->curr = ix;
400 if (!path->curr ||
403 ix = path->curr;
405 path->curr = ix
[all...] |
