| /external/libxslt/libxslt/ |
| templates.c | 517 ret->children = ret->last = NULL;
543 ret->last = ret->children = text;
619 xmlAttrPtr attr, copy, last; local
635 last = target->properties;
636 while (last->next != NULL)
637 last = last->next;
639 last = NULL;
695 if (last == NULL) {
697 last = copy
[all...] |
| /external/openssl/crypto/x509v3/ |
| pcy_tree.c | 268 * issued and not the last in the chain.
313 X509_POLICY_LEVEL *last = curr - 1; local
317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
319 node = sk_X509_POLICY_NODE_value(last->nodes, i);
320 if (policy_node_match(last, node, data->valid_policy))
327 if (!matched && last->anyPolicy)
329 if (!level_add_node(curr, data, last->anyPolicy, NULL))
407 const X509_POLICY_LEVEL *last = curr - 1; local
410 if ( (last->flags & X509_V_FLAG_INHIBIT_MAP)
449 X509_POLICY_LEVEL *last = curr - 1 local
[all...] |
| /external/pcre/ |
| pcre_get.c | 111 lastptr where to put the pointer to the last entry
145 uschar *last = entry; local
151 while (last < lastentry)
153 if (strcmp(stringname, (char *)(last + entrysize + 2)) != 0) break;
154 last += entrysize;
157 *lastptr = (char *)last;
181 or the number of the last one if none are set,
190 char *first, *last; local
194 entrysize = pcre_get_stringtable_entries(code, stringname, &first, &last);
196 for (entry = (uschar *)first; entry <= (uschar *)last; entry += entrysize
[all...] |
| /external/proguard/src/proguard/gui/ |
| TabbedPane.java | 185 * Selects the last tab.
187 public void last() method in class:TabbedPane
189 cardLayout.last(cardPanel);
|
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| SDL_stretch.c | 64 } last; local
72 if ( (src_w == last.src_w) &&
73 (dst_w == last.dst_w) && (bpp == last.bpp) ) {
76 last.bpp = bpp;
77 last.src_w = src_w;
78 last.dst_w = dst_w;
|
| /external/qemu/distrib/zlib-1.2.3/ |
| infback.c | 257 code last; /* parent table entry */ local
271 state->last = 0;
280 /* Inflate until end of block marked as last */
285 if (state->last) {
291 state->last = BITS(1);
296 state->last ? " (last)" : ""));
302 state->last ? " (last)" : ""));
307 state->last ? " (last)" : ""))
[all...] |
| /external/quake/quake/src/QW/client/ |
| gl_mesh.c | 62 mtriangle_t *last, *check;
local
67 last = &triangles[starttri];
69 stripverts[0] = last->vertindex[(startv)%3];
70 stripverts[1] = last->vertindex[(startv+1)%3];
71 stripverts[2] = last->vertindex[(startv+2)%3];
76 m1 = last->vertindex[(startv+2)%3];
77 m2 = last->vertindex[(startv+1)%3];
83 if (check->facesfront != last->facesfront)
131 mtriangle_t *last, *check;
local
136 last = &triangles[starttri];
[all...] |
| /external/skia/src/core/ |
| SkDeque.cpp | 148 Head* last = fBack; local
151 if (NULL == last->fBegin) {
153 last->fBegin = last->start();
154 end = last->fBegin + fElemSize;
156 end = last->fEnd + fElemSize;
157 if (end > last->fStop) { // no more room in this chunk
161 last = (Head*)sk_malloc_throw(size);
162 last->init(size);
163 last->fPrev = fBack
204 Head* last = fBack; local
[all...] |
| /external/srec/srec/cfront/ |
| spec_anl.c | 69 the last sample value is stored in lastx.
221 int last; local
232 last = freqobj->cut_off_above;
236 if (last >= num_freq)
237 last = num_freq - 1;
243 ASSERT(density[last] >= 0);
244 peak = density[last];
245 for (i = last - 1; i >= first; i--)
258 for (i = first + 1; i <= last; i++)
|
| /external/srec/srec/include/ |
| comp_stats.h | 66 CS_TIME last; member in struct:CS_CLOCK_t
|
| /external/stlport/test/unit/ |
| find_test.cpp | 130 char *last = find(pstr, pstr + str_size, 'x'); local
131 CPPUNIT_ASSERT( last == pstr + str_size );
|
| /external/v8/src/ |
| liveobjectlist.h | 154 static bool NeedLOLProcessing() { return (last() != NULL); }
172 static LiveObjectList* last() { return last_; } function in class:v8::internal::LiveObjectList
|
| safepoint-table.cc | 95 int last = entry_size_ - 1; local
96 for (int i = first; i < last; i++) PrintBits(bits[i], kBitsPerByte);
97 int last_bits = code_->stack_slots() - ((last - first) * kBitsPerByte);
98 PrintBits(bits[last], last_bits);
140 return Safepoint(indexes_.last(), registers_.last());
|
| /external/valgrind/main/drd/ |
| drd_thread.h | 71 Segment* last; /**< Pointer to last segment. */ member in struct:__anon12636
344 tl_assert(DRD_(g_threadinfo)[tid].last);
346 return DRD_(g_threadinfo)[tid].last;
|
| /external/valgrind/main/memcheck/tests/ |
| unit_oset.c | 340 Addr last; member in struct:__anon12858
350 sprintf(buf, "<(%d) %lu..%lu (%d)>", b->b1, b->first, b->last, b->b2);
359 assert(elem->first <= elem->last);
361 if (key > elem->last) return 1;
392 vs[i]->last = vs[i]->first + 2;
442 prev.last = 0;
446 assert(prev.last < curr.first);
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| ArgList.h | 132 JSValue last() function in class:JSC::MarkedArgumentBuffer
|
| /external/webkit/Source/WebCore/bindings/v8/ |
| IntrusiveDOMWrapperMap.h | 79 Chunk* last = m_chunks; local
81 Chunk* previous = last->m_previous;
84 delete last;
86 last = previous;
89 m_chunks = last;
111 static void clearEntries(T* first, T* last)
113 for (T* entry = first; entry < last; entry++)
117 static void visitEntries(DOMDataStore* store, T* first, T* last, typename Traits::Visitor* visitor)
119 for (T* entry = first; entry < last; entry++)
|
| /external/webkit/Source/WebCore/history/ |
| BackForwardListImpl.cpp | 70 RefPtr<HistoryItem> item = m_entries.last();
172 int last = min(m_current + limit, lastEntry); local
174 for (; limit <= last; ++limit)
187 RefPtr<HistoryItem> item = m_entries.last();
|
| /external/webkit/Source/WebCore/platform/text/wince/ |
| TextBreakIteratorWinCE.cpp | 64 int last() function in class:WebCore::TextBreakIterator
287 return breakIterator->last();
|
| /external/webkit/Source/WebCore/rendering/ |
| CounterNode.cpp | 80 CounterNode* last = m_lastChild; local
81 if (!last)
84 while (CounterNode* lastChild = last->m_lastChild)
85 last = lastChild;
87 return last;
237 CounterNode* last = newChild->m_lastChild; local
246 // counter node being created, it will be inserted as the last child so next is null.
251 last->m_nextSibling = next;
253 next->m_previousSibling = last;
255 m_lastChild = last;
[all...] |
| /external/webkit/Source/WebKit/qt/Api/ |
| qwebelement.h | 208 inline QWebElement last() const { return at(count() - 1); } function in class:QWebElementCollection
|
| /external/webkit/Tools/android/flex-2.5.4a/ |
| nfa.c | 153 int last = lastst[mach]; local
155 for ( i = firstst[mach]; i <= last; ++i )
281 * new = link_machines( first, last );
283 * new - a machine constructed by connecting first to last
284 * first - the machine whose successor is to be last
285 * last - the machine whose predecessor is to be first
288 * last to produce a machine new which will pattern-match first first
289 * and then last, and will fail if either of the sub-patterns fails.
290 * FIRST is set to new by the operation. last is unmolested.
293 int link_machines( first, last )
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| tlsv1_client_read.c | 219 struct x509_certificate *chain = NULL, *last = NULL, *cert; local
356 if (last == NULL)
359 last->next = cert;
360 last = cert;
|
| /external/wpa_supplicant_8/src/tls/ |
| tlsv1_client_read.c | 219 struct x509_certificate *chain = NULL, *last = NULL, *cert; local
356 if (last == NULL)
359 last->next = cert;
360 last = cert;
|
| /external/zlib/contrib/inflate86/ |
| inffas86.c | 82 /* 24 12 */ unsigned char FAR *last; /* r9 while in < last */ member in struct:inffast_ar
111 ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
142 " movq 24(%%rsp), %%r9\n" /* r9 = last */
489 " cmpl %%esi, 12(%%esp)\n" /* in < last */
[all...] |
