| /external/skia/legacy/src/images/ |
| SkFDStream.cpp | 39 off_t curr = ::lseek(fFD, 0, SEEK_CUR); local
40 if (curr < 0) {
42 SkDebugf("xxxxxxxxxxxxx lseek failed 0 CURR\n");
53 if (::lseek(fFD, curr, SEEK_SET) != curr) {
56 SkDebugf("xxxxxxxxxxxxx lseek failed %d SET\n", curr);
|
| /external/skia/src/images/ |
| SkFDStream.cpp | 39 off_t curr = ::lseek(fFD, 0, SEEK_CUR); local
40 if (curr < 0) {
42 SkDebugf("xxxxxxxxxxxxx lseek failed 0 CURR\n");
53 if (::lseek(fFD, curr, SEEK_SET) != curr) {
56 SkDebugf("xxxxxxxxxxxxx lseek failed %d SET\n", 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...] |
| /packages/apps/Email/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/webkit/Source/WebCore/xml/ |
| XSLStyleSheetLibxslt.cpp | 207 xmlNodePtr curr = stylesheetRoot->children; local
208 while (curr) {
209 if (curr->type != XML_ELEMENT_NODE) {
210 curr = curr->next;
213 if (IS_XSLT_ELEM(curr) && IS_XSLT_NAME(curr, "import")) {
214 xmlChar* uriRef = xsltGetNsProp(curr, (const xmlChar*)"href", XSLT_NAMESPACE);
219 curr = curr->next
[all...] |
| /external/openssl/ssl/ |
| ssl_ciph.c | 664 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr,
667 if (curr == *tail) return;
668 if (curr == *head)
669 *head=curr->next;
670 if (curr->prev != NULL)
671 curr->prev->next=curr->next;
672 if (curr->next != NULL)
673 curr->next->prev=curr->prev
928 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local
1056 CIPHER_ORDER *curr; local
1362 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
[all...] |
| /external/srec/seti/sltsEngine/include/ |
| linklist.h | 31 struct LNode *curr; member in struct:LList
|
| /external/openssh/openbsd-compat/ |
| getrrsetbyname.c | 452 struct dns_query *head, *curr, *prev; local
456 for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) {
459 curr = calloc(1, sizeof(struct dns_query));
460 if (curr == NULL) {
465 head = curr;
467 prev->next = curr;
476 curr->name = strdup(name);
477 if (curr->name == NULL) {
484 curr->type = _getshort(*cp);
488 curr->class = _getshort(*cp)
499 struct dns_rr *head, *curr, *prev; local
[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/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/skia/legacy/src/ports/ |
| SkOSFile_stdio.cpp | 39 size_t curr = ::ftell((FILE*)f); // remember where we are local
42 ::fseek((FILE*)f, (long)curr, SEEK_SET); // go back to our prev loc
59 size_t curr = ::ftell((FILE*)f); local
60 if ((long)curr == -1) {
64 // ::fseek((FILE*)f, (long)(curr + byteCount), SEEK_SET);
68 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
|
| /external/skia/legacy/src/xml/ |
| SkXMLPullParser.cpp | 11 static void reset(SkXMLPullParser::Curr* curr)
13 curr->fEventType = SkXMLPullParser::ERROR;
14 curr->fName = "";
15 curr->fAttrInfoCount = 0;
16 curr->fIsWhitespace = false;
|
| /external/skia/src/xml/ |
| SkXMLPullParser.cpp | 11 static void reset(SkXMLPullParser::Curr* curr)
13 curr->fEventType = SkXMLPullParser::ERROR;
14 curr->fName = "";
15 curr->fAttrInfoCount = 0;
16 curr->fIsWhitespace = false;
|
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| DefaultDataContext.java | 188 LocalVariable curr = start; local
190 while (curr != null) {
191 if (curr.name.equals(firstChunk)) {
192 if (curr.isPath) {
194 if (curr.node == null) {
198 curr.node = findVariable(curr.value, create, curr.nextScope);
199 if (curr.node == null) {
207 return curr.node
[all...] |
| /external/opencv/cvaux/src/ |
| 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/valgrind/main/coregrind/ |
| m_hashtable.c | 160 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->next
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/mac/ |
| ComplexTextController.cpp | 190 const UChar* curr = m_run.rtl() ? cp + m_end - 1 : cp; local
196 bool isSurrogate = U16_IS_SURROGATE(*curr);
199 if (!U16_IS_SURROGATE_LEAD(curr[0]) || curr + 1 == end || !U16_IS_TRAIL(curr[1]))
201 nextGlyphData = m_font.glyphDataForCharacter(U16_GET_SUPPLEMENTARY(curr[0], curr[1]), false);
203 if (!U16_IS_TRAIL(curr[0]) || curr -1 == end || !U16_IS_SURROGATE_LEAD(curr[-1])
[all...] |
| /external/skia/src/ports/ |
| SkOSFile_stdio.cpp | 58 long curr = ::ftell((FILE*)f); // remember where we are local
59 if (curr < 0) {
67 ::fseek((FILE*)f, curr, SEEK_SET); // go back to our prev loc
84 size_t curr = ::ftell((FILE*)f); local
85 if ((long)curr == -1) {
89 // ::fseek((FILE*)f, (long)(curr + byteCount), SEEK_SET);
93 byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| DexJarMaker.java | 89 int curr = -1; local
90 while ((curr = in.read()) != -1) {
91 target.write(curr);
|
| /hardware/qcom/display/liboverlay/ |
| overlayMdpRot.cpp | 157 mMem.curr().m = mem;
185 if(opBufSize == mMem.curr().size()) {
193 // ++mMem will make curr to be prev, and prev will be curr
200 mMem.curr().mRotOffset[i] = i * opBufSize;
209 ovutils::memset0(mMem.curr().mRotOffset);
211 mMem.curr().mCurrOffset = 0;
222 OVASSERT(mMem.curr().m.numBufs(),
225 mMem.curr().mRotOffset[mMem.curr().mCurrOffset]
[all...] |
| overlayMdssRot.cpp | 131 OVASSERT(mMem.curr().m.numBufs(), "queueBuffer numbufs is 0");
134 mMem.curr().mRotOffset[mMem.curr().mCurrOffset];
135 mMem.curr().mCurrOffset =
136 (mMem.curr().mCurrOffset + 1) % mMem.curr().m.numBufs();
175 mMem.curr().m = mem;
183 if(opBufSize == mMem.curr().size()) {
191 // ++mMem will make curr to be prev, and prev will be curr
[all...] |
| /external/linux-tools-perf/util/ |
| callchain.h | 77 struct callchain_cursor_node *curr; member in struct:callchain_cursor
123 cursor->curr = cursor->first;
134 return cursor->curr;
139 cursor->curr = cursor->curr->next;
|
| /external/webkit/Source/WebCore/html/ |
| HTMLMapElement.cpp | 86 for (Node* curr = coll->firstItem(); curr; curr = coll->nextItem()) {
87 if (!curr->hasTagName(imgTag))
92 HTMLImageElement* imageElement = static_cast<HTMLImageElement*>(curr);
|
| /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 (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;
|
