/external/webkit/Source/WebCore/css/ |
CSSRule.cpp | 31 StyleBase* curr = parent(); local 32 while (curr && !curr->isCSSStyleSheet()) 33 curr = curr->parent(); 34 return curr ? static_cast<CSSStyleSheet*>(curr) : 0;
|
CSSCanvasValue.cpp | 51 for (RenderObjectSizeCountMap::const_iterator curr = m_clients.begin(); curr != end; ++curr) 52 curr->first->imageChanged(static_cast<WrappedImagePtr>(this), &imageChangeRect); 58 for (RenderObjectSizeCountMap::const_iterator curr = m_clients.begin(); curr != end; ++curr) 59 curr->first->imageChanged(static_cast<WrappedImagePtr>(this));
|
/external/webkit/Source/WebCore/rendering/style/ |
FillLayer.cpp | 131 FillLayer* curr; local 132 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { } 133 if (curr && curr != this) { 135 for (FillLayer* pattern = this; curr; curr = curr->next()) 259 const FillLayer* curr; local [all...] |
/external/bzip2/ |
format.pl | 43 my ($prev, $curr, $str); 44 $prev = ''; $curr = ''; 48 $prev = $curr; 49 $curr = $_; 54 $curr = join( '', $prev, "<![CDATA[", $curr ); 58 elsif ( $curr =~ /<\/programlisting>|<\/screen>/ ) { 60 $curr = join( '', $prev, "]]>", $curr ); 65 print OUTFILE $curr; [all...] |
/external/skia/src/images/ |
SkImageDecoder_Factory.cpp | 35 const DecodeReg* curr = DecodeReg::Head(); local 36 while (curr) { 37 codec = curr->factory()(stream); 44 curr = curr->next(); 61 const MovieReg* curr = MovieReg::Head(); local 62 while (curr) { 63 SkMovie* movie = curr->factory()(stream); 70 curr = curr->next() [all...] |
SkImageEncoder_Factory.cpp | 30 const EncodeReg* curr = EncodeReg::Head(); local 31 while (curr) { 32 if ((codec = curr->factory()(t)) != NULL) { 35 curr = curr->next();
|
SkFDStream.cpp | 32 off_t curr = ::lseek(fFD, 0, SEEK_CUR); local 33 if (curr < 0) { 35 SkDebugf("xxxxxxxxxxxxx lseek failed 0 CURR\n"); 46 if (::lseek(fFD, curr, SEEK_SET) != curr) { 49 SkDebugf("xxxxxxxxxxxxx lseek failed %d SET\n", curr);
|
/external/srec/seti/sltsEngine/src/ |
linklist_impl.c | 137 /* update curr to newly inserted node */ 138 list->curr = list->head; 143 /* curr not specified, insert from the end */ 144 if(list->curr == NULL){ 145 list->curr = list->tail; 149 if(list->curr == list->tail){ 151 newnode->prev = list->curr; 153 (list->curr)->next = newnode; 155 /* update both curr and end */ 156 list->curr = newnode 194 LNode *curr; local [all...] |
/frameworks/base/services/surfaceflinger/ |
GLExtensions.cpp | 52 char const* curr = (char const*)extensions; local 53 char const* head = curr; 55 head = strchr(curr, ' '); 56 String8 s(curr, head ? head-curr : strlen(curr)); 60 curr = head+1; 63 curr = egl_extensions; 64 head = curr; 66 head = strchr(curr, ' '); [all...] |
/frameworks/base/core/jni/android/graphics/ |
AutoDecodeCancel.cpp | 81 AutoDecoderCancel* curr = gAutoDecoderCancel; local 82 SkASSERT(curr); 83 SkASSERT(curr->fPrev == NULL); 86 while (curr) { 89 if (curr->fPrev) { 90 SkASSERT(curr->fPrev->fNext == curr); 92 if (curr->fNext) { 93 SkASSERT(curr->fNext->fPrev == curr); [all...] |
/external/webkit/Source/WebKit/android/plugins/ |
PluginTimer.cpp | 86 PluginTimer* curr = list; local 87 while (curr) { 88 if (curr->m_timerID == timerID) { 91 curr = curr->m_next; 93 return curr; 100 PluginTimer* curr = m_list; local 102 while (curr) { 103 next = curr->next(); 104 curr->deref() [all...] |
/external/webkit/Source/WebCore/rendering/ |
RenderLineBoxList.cpp | 89 for (InlineFlowBox* curr = box; curr; curr = curr->nextLineBox()) 90 curr->setExtracted(); 105 for (InlineFlowBox* curr = box; curr; curr = curr->nextLineBox()) { 106 curr->setExtracted(false) 336 RenderObject* curr = 0; local [all...] |
InlineFlowBox.cpp | 62 for (InlineBox* curr = firstChild(); curr; curr = curr->nextOnLine()) { 63 if (curr->isInlineFlowBox()) 64 totWidth += static_cast<InlineFlowBox*>(curr)->getFlowSpacingLogicalWidth(); 263 RenderObject* curr = child; 264 RenderObject* parent = curr->parent(); 266 if (parent->lastChild() != curr) 271 curr = parent [all...] |
RenderInline.cpp | 216 RenderBoxModelObject* curr = nextContinuation(this); 219 while (curr) { 220 if (beforeChild && beforeChild->parent() == curr) { 221 if (curr->firstChild() == beforeChild) 223 return curr; 227 last = curr; 228 curr = nextContinuation(curr); 305 RenderBoxModelObject* curr = toRenderBoxModelObject(parent()); local 314 while (curr && curr != fromBlock) [all...] |
/external/skia/gpu/include/ |
GrTDArray.h | 127 for (T* curr = this->begin(); curr < stop; curr++) { 128 GrFree(*curr); 139 for (T* curr = this->begin(); curr < stop; curr++) { 140 delete *curr; 151 for (T* curr = this->begin(); curr < stop; curr++) 168 T* curr = this->begin(); local [all...] |
/external/webkit/Source/WebCore/platform/text/ |
BidiRunList.h | 145 Run* curr = m_firstRun; 146 while (curr) { 147 Run* s = curr->next(); 148 curr->destroy(); 149 curr = s; 166 // |beforeStart|. |curr| should point to the first run to reverse. 167 Run* curr = m_firstRun; 172 beforeStart = curr; 173 curr = curr->next() [all...] |
/external/openssl/crypto/x509v3/ |
pcy_tree.c | 97 X509_POLICY_LEVEL *curr) 104 if (!curr) 105 curr = tree->levels + tree->nlevel; 107 curr++; 109 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 110 for (plev = tree->levels; plev != curr; plev++) 310 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, 313 X509_POLICY_LEVEL *last = curr - 1; 322 if (!level_add_node(curr, data, node, NULL)) 329 if (!level_add_node(curr, data, last->anyPolicy, NULL) 589 X509_POLICY_LEVEL *curr; local 699 X509_POLICY_LEVEL *curr = tree->levels + 1; local 730 X509_POLICY_LEVEL *curr; local [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 if (proc(curr->fFace, curr->fRequestedStyle, ctx)) { 51 return curr->fFace [all...] |
/bootable/recovery/applypatch/ |
imgdiff.c | 280 ImageChunk* curr = *chunks; local 283 curr->type = CHUNK_NORMAL; 284 curr->start = 0; 285 curr->len = st.st_size; 286 curr->data = img; 287 curr->filename = NULL; 288 curr->I = NULL; 289 ++curr; 298 curr->type = CHUNK_DEFLATE; 299 curr->start = pos 406 ImageChunk* curr = *chunks + (*num_chunks-3); local 489 ImageChunk* curr = *chunks + (*num_chunks-1); local [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/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/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/srec/seti/sltsEngine/include/ |
linklist.h | 31 struct LNode *curr; member in struct:LList
|
/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...] |