Searched refs:last (Results 126 - 150 of 742) sorted by relevance

1234567891011>>

/external/webrtc/src/modules/audio_processing/aecm/main/matlab/matlab/
H A DgetBspectrum.m8 % bandlast = last band considered
/external/chromium/chrome/browser/resources/shared/js/cr/ui/
H A Dgrid.js175 * @param {number} lastIndex The index of last item, exclusively.
210 * @param {number} lastIndex The index of item past the last in viewport.
217 // We calculate the row of last item, and the row of last shown item.
248 var last = this.getLastIndex();
249 if (index == last) {
253 return Math.min(index, last);
/external/hyphenation/
H A Dsubstrings.c127 char last = '.'; local
131 if ( (last<'0' || last>'9')
137 last = c;
139 if (last<'0' || last>'9') expr[el++] = '0';
156 // to the last substring-length bytes of expr except for the (single byte)
/external/qemu/distrib/zlib-1.2.3/
H A Dinffast.c73 unsigned char FAR *last; /* while in < last, enough input available */ local
100 last = in + (strm->avail_in - 5);
285 } while (in < last && out < end);
296 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
/external/v8/src/
H A Dsafepoint-table.cc95 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/zlib/
H A Dinffast.c73 unsigned char FAR *last; /* while in < last, enough input available */ local
100 last = in + (strm->avail_in - 5);
307 } while (in < last && out < end);
318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
/external/webkit/Source/WebCore/rendering/
H A DRenderObjectChildList.cpp301 RenderObject* last = const_cast<RenderObject*>(owner); local
303 last = last->lastChild();
304 } while (last && last->isAnonymous() && last->style()->styleType() == NOPSEUDO && !last->isListMarker());
305 if (last && last->style()->styleType() != AFTER)
307 return last;
[all...]
/external/libxslt/libxslt/
H A Dtemplates.c517 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
[all...]
/external/zlib/examples/
H A Dgzlog.c18 valid state. The last data to be appended or compressed is saved in an
22 gzlog maintains another auxiliary file with the last 32K of data from the
32 foo.add -- last message to append or last data to compress
33 foo.dict -- dictionary of the last 32K of data for next compression
48 extra field has the necessary information to restore the start of the last
115 - Pointer to the last stored block length. This is the same as above, but
116 for the last stored block of the uncompressed data in the gzip file.
119 stored block as added, at which point the last stored block length pointer
121 different, the first bit of the last store
297 off_t last; /* offset of last stored block first length byte */ member in struct:log
462 log_last(struct log *log, int last) argument
[all...]
/external/bluetooth/glib/gio/
H A Dgthemedicon.c158 char *last; local
168 last = g_strdup (themed->names[0]);
173 themed->names[i++] = last;
175 while ((dashp = strrchr (last, '-')) != NULL)
176 themed->names[i++] = last = g_strndup (last, dashp - last);
/external/valgrind/tsan/
H A Dsuppressions.cc81 bool NextStackTraceTemplate(StackTraceTemplate* trace, bool* last);
153 const char* last = e - 1; local
154 while (last > p && (*last == ' ' || *last == '\t'))
155 --last;
156 return string(p, last - p + 1);
/external/libxml2/
H A Dtree.c123 (n)->last = NULL; \
130 (n)->last = ulccur; \
981 doc->last = (xmlNodePtr) cur;
997 cur->prev = doc->last;
1000 doc->last = (xmlNodePtr) cur;
1246 xmlNodePtr ret = NULL, last = NULL; local
1265 if ((last != NULL) && (last->type == XML_TEXT_NODE)) {
1266 xmlNodeAddContentLen(last, q, cur - q);
1270 if (last
1443 xmlNodePtr ret = NULL, last = NULL; local
5615 xmlNodePtr last, newNode, tmp; local
7601 xmlNsMapItemPtr last; member in struct:xmlNsMap
[all...]
H A Dxinclude.c838 xmlNodePtr cur, res, result = NULL, last = NULL; local
848 result = last = res;
850 last->next = res;
851 res->prev = last;
852 last = res;
904 xmlNodePtr list = NULL, last = NULL, listParent = NULL; local
932 * last is a pointer to the last node added to the output tree
933 * lastLevel is the depth of last (relative to the root)
948 last
1116 xmlNodePtr list = NULL, last = NULL; local
[all...]
/external/openssl/crypto/x509v3/
H A Dpcy_tree.c268 * 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 local
[all...]
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DStringCharacterIteratorTest.java249 * @tests java.text.StringCharacterIterator.last()
253 assertEquals('e', fixture.last());
255 assertEquals('e', fixture.last());
257 assertEquals('e', fixture.last());
260 assertEquals('e', fixture.last());
262 assertEquals('t', fixture.last());
384 assertEquals('x', fixture.last());
451 it1.last();
486 * @tests java.text.StringCharacterIterator#last()
491 assertEquals("Wrong last cha
[all...]
/external/qemu/android/utils/
H A Dpath.c119 const char* last; local
142 /* find last separator */
143 last = end;
144 while (last > path && !ispathsep(last[-1]))
145 last -= 1;
148 if (last == path) {
157 if (last == path+1) {
166 basename = substring_dup(last,end);
180 *pdirname = substring_dup(path,last
[all...]
/external/openssl/crypto/ocsp/
H A Docsp_cl.c235 int OCSP_resp_find(OCSP_BASICRESP *bs, OCSP_CERTID *id, int last) argument
241 if (last < 0) last = 0;
242 else last++;
244 for (i = last; i < sk_OCSP_SINGLERESP_num(sresp); i++)
/external/oprofile/libregex/
H A Dop_regex.cpp117 string last, expanded(input); local
120 last = expanded;
121 expanded = substitute_definition(last);
122 if (expanded == last)
129 return last;
/external/quake/quake/src/QW/qwfwd/
H A Dqwfwd.c68 time_t last; member in struct:peer
220 time(&p->last);
231 time(&p->last);
240 time(&p->last);
251 if (time(NULL) - p->last > 300) {
/external/valgrind/main/coregrind/m_initimg/
H A Dsimple_huffman.c157 last byte in the stream may look partially undefined. */
226 UInt last )
231 if( first == last )
250 for( k = first; k <= last; ++ k )
257 for( k = first; size_a < ((size+1)>>1) && k < last; ++ k )
295 first_b, last );
/external/webkit/Source/WebCore/platform/graphics/
H A DGradient.cpp158 if (value >= 1 || value >= m_stops.last().stop) {
159 *r = m_stops.last().red;
160 *g = m_stops.last().green;
161 *b = m_stops.last().blue;
162 *a = m_stops.last().alpha;
/external/webkit/Source/WebKit2/UIProcess/
H A DWebBackForwardList.cpp75 m_page->backForwardRemovedItem(m_entries.last()->itemID());
76 removedItems.append(m_entries.last().release());
204 unsigned last = m_current + size; local
205 ASSERT(last < m_entries.size());
206 for (unsigned i = m_current + 1; i <= last; ++i)
/external/astl/include/
H A Diterator253 distance(_InputIterator first, _InputIterator last,
257 while (first != last) {
267 distance(_RandomAccessIterator first, _RandomAccessIterator last,
270 return last - first;
276 * @param last An input iterator.
281 distance(_InputIterator first, _InputIterator last)
285 return distance(first, last, android::iterator_category(first));
H A Dstring105 // @param end The end of source C string. Points just pass the last
166 string& append(_InputIterator first, _InputIterator last);
338 __wrapper_iterator<const char *,string> last);
342 __wrapper_iterator<char *,string> last);
346 string& string::append(_InputIterator first, _InputIterator last) {
347 size_type dist = std::distance(first, last);
356 std::copy(first, last, mData + mLength);
/external/blktrace/btt/
H A Dlist.h195 struct list_head *last = list->prev; local
201 last->next = at;
202 at->prev = last;

Completed in 540 milliseconds

1234567891011>>