| /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/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/WebKit/Source/core/rendering/style/ |
| FillLayer.cpp | 163 FillLayer* curr; local
164 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
165 if (curr && curr != this) {
167 for (FillLayer* pattern = this; curr; curr = curr->next())
337 const FillLayer* curr; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/rbug/ |
| rbug_context.h | 58 } curr; member in struct:rbug_context
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/ |
| svga_state_rss.c | 89 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->rt[0].separate_alpha_blend_enable)
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...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/pqueue/ |
| pqueue.c | 113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTypefaceCache.cpp | 35 const Rec* curr = fArray.begin(); local
37 while (curr < stop) {
38 if (curr->fFace->uniqueID() == fontID) {
39 return curr->fFace;
41 curr += 1;
47 const Rec* curr = fArray.begin(); local
49 while (curr < stop) {
50 SkTypeface* currFace = curr->fFace;
51 if (proc(currFace, curr->fRequestedStyle, ctx)) {
52 if (curr->fStrong)
[all...] |
| /external/chromium_org/third_party/skia/src/ports/ |
| SkOSFile_stdio.cpp | 52 long curr = ::ftell((FILE*)f); // remember where we are local
53 if (curr < 0) {
63 ::fseek((FILE*)f, curr, SEEK_SET); // go back to our prev location
76 size_t curr = ::ftell((FILE*)f); local
77 if ((long)curr == -1) {
84 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
114 long curr = ::ftell((FILE*)f); local
115 if (curr < 0) {
118 return curr;
|
| /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/mesa3d/src/gallium/drivers/rbug/ |
| rbug_context.h | 58 } curr; member in struct:rbug_context
|
| /external/mesa3d/src/gallium/drivers/svga/ |
| svga_state_rss.c | 89 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->rt[0].separate_alpha_blend_enable)
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...] |
| /external/opencv/cvaux/src/ |
| cvlines.cpp | 207 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...] |
| cvmorphing.cpp | 61 int curr; /* current index in run's array */ local
88 curr = 0;
93 begCorr = (float) first_corr[curr];
94 curr++;
95 endCorr = (float) first_corr[curr];
96 curr++;
97 endLineIndex = first[curr];
175 curr = 0;
178 curr = 0;;
182 begCorr = (float) second_corr[curr];
[all...] |
| /external/openssl/crypto/pqueue/ |
| pqueue.c | 113 pitem *curr, *next; local
121 for(curr = NULL, next = pq->items;
123 curr = next, next = next->next)
132 if (curr == NULL)
135 curr->next = item;
145 curr->next = item;
|
| /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/skia/bench/ |
| FontCacheBench.cpp | 19 const uint16_t* curr = start; local
20 while (*curr != gUniqueGlyphIDs_Sentinel) {
21 curr += 1;
23 return curr - start;
|
| InterpBench.cpp | 52 SkFixed curr = SkFloatToFixed(fx); variable
55 dst[i + 0] = TILE(curr, count); curr += step;
56 dst[i + 1] = TILE(curr, count); curr += step;
57 dst[i + 2] = TILE(curr, count); curr += step;
58 dst[i + 3] = TILE(curr, count); curr += step;
71 int64_t curr = (int64_t)(fx * 65536 * 655536) variable
102 int64_t curr = (int64_t)(fx * 65536 * 655536 * 65536); variable
[all...] |
| /external/skia/src/core/ |
| SkTypefaceCache.cpp | 35 const Rec* curr = fArray.begin(); local
37 while (curr < stop) {
38 if (curr->fFace->uniqueID() == fontID) {
39 return curr->fFace;
41 curr += 1;
47 const Rec* curr = fArray.begin(); local
49 while (curr < stop) {
50 SkTypeface* currFace = curr->fFace;
51 if (proc(currFace, curr->fRequestedStyle, ctx)) {
52 if (curr->fStrong)
[all...] |
| /external/skia/src/ports/ |
| SkOSFile_stdio.cpp | 52 long curr = ::ftell((FILE*)f); // remember where we are local
53 if (curr < 0) {
63 ::fseek((FILE*)f, curr, SEEK_SET); // go back to our prev location
76 size_t curr = ::ftell((FILE*)f); local
77 if ((long)curr == -1) {
84 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
114 long curr = ::ftell((FILE*)f); local
115 if (curr < 0) {
118 return curr;
|
| /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/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...] |
| /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) {
|
