HomeSort by relevance Sort by last modified time
    Searched full:curr (Results 26 - 50 of 355) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/icu4c/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/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/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/webkit/Source/WebCore/rendering/
RenderText.cpp 213 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox())
214 curr->setExtracted();
229 for (InlineTextBox* curr = box; curr; curr = curr->nextTextBox()) {
230 curr->setExtracted(false)
    [all...]
RenderLayer.cpp 523 for (RenderLayer* curr = parent(); curr; curr = curr->parent()) {
524 if (curr->renderer()->hasColumns()) {
525 m_isPaginated = checkContainingBlockChainForPagination(renderer(), curr->renderBox());
528 if (curr == ancestorStackingContext)
632 RenderLayer* curr = stackingContext(); local
633 if (curr)
634 curr->m_3DTransformedDescendantStatusDirty = true
697 RenderObject* curr = renderer()->parent(); local
822 RenderLayer* curr = parent(); local
831 RenderLayer* curr = parent(); local
    [all...]
RenderObject.cpp 452 for (RenderObject* curr = obj->firstChild(); curr; curr = curr->nextSibling())
453 addLayers(curr, parentLayer, newObject, beforeChild);
476 for (RenderObject* curr = firstChild(); curr; curr = curr->nextSibling())
477 curr->removeLayers(parentLayer)
536 const RenderObject* curr = this; local
548 RenderObject* curr = const_cast<RenderObject*>(this); local
561 RenderObject* curr = const_cast<RenderObject*>(this); local
2309 RenderObject* curr = this; local
2500 RenderObject* curr = parent(); local
    [all...]
  /external/openssl/ssl/
ssl_ciph.c 596 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr,
599 if (curr == *tail) return;
600 if (curr == *head)
601 *head=curr->next;
602 if (curr->prev != NULL)
603 curr->prev->next=curr->next;
604 if (curr->next != NULL)
605 curr->next->prev=curr->prev
850 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local
978 CIPHER_ORDER *curr; local
1284 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
    [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/kernel-headers/original/linux/
futex.h 100 handle_futex_death(u32 __user *uaddr, struct task_struct *curr, int pi);
103 extern void exit_robust_list(struct task_struct *curr);
104 extern void exit_pi_state_list(struct task_struct *curr);
106 static inline void exit_robust_list(struct task_struct *curr)
109 static inline void exit_pi_state_list(struct task_struct *curr)
  /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/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/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;
  /external/webkit/Source/WebCore/css/
CSSImportRule.cpp 130 for (StyleBase* curr = parent(); curr; curr = curr->parent()) {
132 if (curr->isCSSStyleSheet() && absHref == static_cast<CSSStyleSheet*>(curr)->finalURL().string())
134 root = curr;
  /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/skia/src/ports/
SkFontHost_linux.cpp 117 FamilyRec* curr = gFamilyHead; local
118 while (curr != NULL) {
120 if (curr->fFaces[i] == member) {
121 return curr;
124 curr = curr->fNext;
130 FamilyRec* curr = gFamilyHead; local
131 while (curr != NULL) {
133 SkTypeface* face = curr->fFaces[i];
138 curr = curr->fNext
165 FamilyRec* curr = gFamilyHead; local
    [all...]
SkFontHost_simple.cpp 115 FamilyRec* curr = gFamilyHead; local
116 while (curr != NULL) {
118 if (curr->fFaces[i] == member) {
119 return curr;
122 curr = curr->fNext;
131 FamilyRec* curr = gFamilyHead; local
132 while (curr != NULL) {
134 SkTypeface* face = curr->fFaces[i];
139 curr = curr->fNext
162 FamilyRec* curr = gFamilyHead; local
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/drivers/
radiotap_iter.h 18 * @bitmap_shifter: internal shifter for curr u32 bitmap, b0 set == arg present
  /external/zlib/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/emailcommon/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/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/webkit/Source/WebCore/platform/graphics/
GlyphPageTreeNode.cpp 329 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
330 curr->m_customFontCount++;
359 for (GlyphPageTreeNode* curr = this; curr; curr = curr->m_parent)
360 curr->m_customFontCount -= fontCount
    [all...]
  /external/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/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...]

Completed in 1113 milliseconds

12 3 4 5 6 7 8 91011>>