| /external/webkit/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/WebCore/rendering/style/ |
| FillLayer.cpp | 131 FillLayer* curr; local
132 for (curr = this; curr && curr->isImageSet(); curr = curr->next()) { }
133 if (curr && curr != this) {
135 for (FillLayer* pattern = this; curr; curr = curr->next())
275 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/ |
| SkImageEncoder_Factory.cpp | 25 const EncodeReg* curr = EncodeReg::Head(); local
26 while (curr) {
27 SkImageEncoder* codec = curr->factory()(t);
31 curr = curr->next();
|
| SkImageDecoder_Factory.cpp | 28 const DecodeReg* curr = DecodeReg::Head(); local
29 while (curr) {
30 SkImageDecoder* codec = curr->factory()(stream);
37 curr = curr->next();
47 const MovieReg* curr = MovieReg::Head(); local
48 while (curr) {
49 SkMovie* movie = curr->factory()(stream);
56 curr = curr->next()
[all...] |
| 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/webkit/WebCore/rendering/ |
| RenderSVGInline.cpp | 62 for (InlineRunBox* curr = firstBox; curr; curr = curr->nextLineBox()) {
63 FloatRect rect(xRef + curr->x(), yRef + curr->y(), curr->width(), curr->height());
81 for (InlineRunBox* curr = firstBox; curr; curr = curr->nextLineBox())
[all...] |
| RenderLineBoxList.cpp | 87 for (InlineRunBox* curr = box; curr; curr = curr->nextLineBox())
88 curr->setExtracted();
103 for (InlineFlowBox* curr = box; curr; curr = curr->nextFlowBox()) {
104 curr->setExtracted(false)
270 RenderObject* curr = 0; local
[all...] |
| InlineFlowBox.cpp | 58 for (InlineBox* curr = firstChild(); curr; curr = curr->nextOnLine()) {
59 if (curr->isInlineFlowBox())
60 totWidth += static_cast<InlineFlowBox*>(curr)->getFlowSpacingWidth();
186 RenderObject* curr = endObject;
187 RenderObject* parent = curr->parent();
189 if (parent->lastChild() != curr || parent == renderer())
192 curr = parent
[all...] |
| RenderInline.cpp | 158 RenderBoxModelObject* curr = nextContinuation(this);
161 while (curr) {
162 if (beforeChild && beforeChild->parent() == curr) {
163 if (curr->firstChild() == beforeChild)
165 return curr;
169 last = curr;
170 curr = nextContinuation(curr);
248 RenderBoxModelObject* curr = toRenderBoxModelObject(parent()); local
257 while (curr && curr != fromBlock)
[all...] |
| /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...] |
| /bionic/linker/ |
| ba.c | 64 int buddy, curr = index; local
67 ba->bitmap[curr].allocated = 0;
73 buddy = BA_BUDDY_INDEX(curr);
75 BA_ORDER(buddy) == BA_ORDER(curr)) {
77 BA_ORDER(curr)++;
78 curr = min(buddy, curr);
82 } while (curr < ba->num_entries);
101 int curr = 0; local
113 while (curr < end)
[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/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)
590 X509_POLICY_LEVEL *curr; local
700 X509_POLICY_LEVEL *curr = tree->levels + 1; local
731 X509_POLICY_LEVEL *curr; local
[all...] |
| /external/webkit/WebKit/android/plugins/ |
| PluginTimer.cpp | 76 PluginTimer* curr = list; local
77 while (curr) {
78 if (curr->m_timerID == timerID) {
81 curr = curr->m_next;
83 return curr;
|
| /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/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/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
1285 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
[all...] |
| /external/chromium/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
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...] |
