HomeSort by relevance Sort by last modified time
    Searched defs:last (Results 376 - 400 of 1933) sorted by null

<<11121314151617181920>>

  /external/wpa_supplicant_8/src/tls/
tlsv1_client_read.c 352 struct x509_certificate *chain = NULL, *last = NULL, *cert; local
491 if (last == NULL)
494 last->next = cert;
495 last = cert;
    [all...]
tlsv1_server_read.c 374 struct x509_certificate *chain = NULL, *last = NULL, *cert; local
508 if (last == NULL)
511 last->next = cert;
512 last = cert;
    [all...]
  /external/zlib/src/contrib/infback9/
infback9.c 230 int lastblock; /* true if processing last block */
245 code last; /* parent table entry */ local
272 /* Inflate until end of block marked as last */
288 lastblock ? " (last)" : ""));
297 lastblock ? " (last)" : ""));
302 lastblock ? " (last)" : ""));
475 last = here;
477 here = lencode[last.val +
478 (BITS(last.bits + last.op) >> last.bits)]
    [all...]
  /external/zlib/src/contrib/inflate86/
inffast.S 42 * have less latency than MMX ops. Added code to buffer the last 11 bytes of
51 * structure offsets which are hard coded in this file. This was last tested
181 #define last 20 /* unsigned char* */ define
244 * last = in + strm->avail_in - 11;
255 movl %edx, last(%esp)
320 movl last(%esp), %ecx
322 ja .L_align_long /* if in < last */
334 movl in_r, last(%esp) /* last = in, do just one iteration */
426 /* while (in < last && out < end
    [all...]
  /external/zlib/src/contrib/puff/
puff.c 154 * bits in the byte that has the last bit of the type, as many as seven, are
229 * code, the last code of the longest length will be all ones.
428 * simply copies the last byte 258 times. A distance of four and a length of
429 * twelve copies the last four bytes three times. A simple forward copy
628 * the run. 16 copies the last length 3 to 6 times. 17 represents 3 to 10
705 int len; /* last length to repeat */
714 if (symbol == 16) { /* repeat last length 3..6 times */
716 return -5; /* no last length! */
717 len = lengths[index - 1]; /* last length */
799 int last, type; \/* block information *\/ local
    [all...]
  /external/zlib/src/examples/
gun.c 47 encountered in an input file, it is the last stream in that file.
156 last = have ? (have--, (int)(*next++)) : -1)
203 int last; /* last byte read by NEXT(), or -1 if EOF */ local
212 unsigned end; /* last valid entry in prefix/suffix tables */
215 unsigned final; /* last character written for previous code */
227 if (last == -1)
251 final = prev = (unsigned)last; /* low 8 bits of code */
254 if (last & 1) { /* code must be < 256 */
258 rem = (unsigned)last >> 1; /* remaining 7 bits *
385 int ret, first, last; local
    [all...]
gzappend.c 54 block boundary to facilitate locating and modifying the last block bit at
57 number of unusued bits in the last input byte used. gzappend will not work
61 the last 32K of uncompressed data, and noting the location of the last block
62 bit and the number of unused bits in the last byte of the compressed data.
66 Then the last block bit is cleared by seeking back in the file and rewriting
67 the byte that contains it. Seeking forward, the last byte of the compressed
70 A deflate process is initialized, using the last 32K of the uncompressed
74 last bits from the original deflate stream. From here on, the data to
127 unsigned char *start, *last, *to, *from local
    [all...]
  /external/zlib/src/
inflate.c 46 * - Unroll last copy for window match in inflate_fast()
116 state->last = 0;
366 Update the window with the last wsize (normally 32K) bytes written before
374 advantage, since only the last 32K of output is copied to the sliding window
589 When there is a window, goto inf_leave will update the window with the last
619 code last; /* parent table entry */ local
829 if (state->last) {
835 state->last = BITS(1);
840 state->last ? " (last)" : ""))
    [all...]
  /frameworks/av/media/img_utils/src/
TiffIfd.cpp 134 size_t last = out->getCurrentOffset(); local
140 size_t diff = (next - last);
TiffWriter.cpp 228 sp<TiffIfd> last = findLastIfd(); local
229 last->setNextIfd(newIfd);
  /frameworks/base/core/java/android/text/method/
LinkMovementMethod.java 108 int last = layout.getLineEnd(linebot); local
110 ClickableSpan[] candidates = buffer.getSpans(first, last, ClickableSpan.class);
124 if (selStart > last)
  /frameworks/base/tools/aapt2/
ResourceTable.cpp 43 const auto last = packages.end(); local
44 auto iter = std::lower_bound(packages.begin(), last, name,
46 if (iter != last && name == (*iter)->name) {
75 const auto last = packages.end(); local
76 auto iter = std::lower_bound(packages.begin(), last, name,
78 if (iter != last && name == (*iter)->name) {
88 const auto last = types.end(); local
89 auto iter = std::lower_bound(types.begin(), last, type, lessThanType);
90 if (iter != last && (*iter)->type == type) {
97 const auto last = types.end() local
106 const auto last = entries.end(); local
116 auto last = entries.end(); local
    [all...]
  /frameworks/rs/api/
GenerateHeaderFiles.cpp 154 const size_t last = values.size() - 1; local
155 for (size_t i = 0; i <= last; i++) {
157 if (i != last) {
  /frameworks/rs/java/tests/VrDemo/src/com/example/android/rs/vr/engine/
Material.java 228 int last = mOpacity.length - 1; local
229 for (int i = mOpacity[last].mPos; i <= Short.MAX_VALUE; i++) {
231 mOpacityTable[p] = (byte) (mOpacity[last].mValue * 255);
285 int last = m.length - 1; local
286 MaterialProp mp = m[last];
  /frameworks/volley/src/main/java/com/android/volley/
VolleyLog.java 111 /** Minimum duration from first marker to last in an marker log to warrant logging. */
140 * the first and last markers is greater than {@link #MIN_DURATION_FOR_LOGGING_MS}.
170 /** Returns the time difference between the first and last events in this log. */
177 long last = mMarkers.get(mMarkers.size() - 1).time; local
178 return last - first;
  /hardware/bsp/intel/peripheral/libupm/src/lcd/
eboled.cxx 355 int16_t a, b, y, last; local
395 if(y1 == y2) last = y1; // Include y1 scanline
396 else last = y1-1; // Skip it
398 for(y=y0; y<=last; y++) {
  /hardware/qcom/display/msm8909/libhwcomposer/
hwc.cpp 612 size_t last = list->numHwLayers - 1; local
613 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
637 //always. Last layer is always FB
695 size_t last = list->numHwLayers - 1; local
696 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
    [all...]
  /hardware/qcom/display/msm8960/libhwcomposer/
hwc.cpp 145 uint32_t last = list->numHwLayers - 1; local
146 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
173 uint32_t last = list->numHwLayers - 1; local
174 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
357 uint32_t last = list->numHwLayers - 1; local
358 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
372 //always. Last layer is always FB
405 uint32_t last = list->numHwLayers - 1; local
406 hwc_layer_1_t *fbLayer = &list->hwLayers[last];
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/
AttributedStringTest.java 111 public char last() { method in class:AttributedStringTest.testAttributedCharacterIterator
StringCharacterIteratorTest.java 249 * @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 char", 'n', it1.last())
    [all...]
  /libcore/jsr166-tests/src/test/java/jsr166/
ConcurrentSkipListSubMapTest.java 150 * lastKey returns last key
178 Integer last = (Integer)i.next(); local
179 assertEquals(last, one);
182 assertTrue(last.compareTo(k) < 0);
183 last = k;
824 * lastKey returns last key
852 Integer last = (Integer)i.next();
853 assertEquals(last, m1);
856 assertTrue(last.compareTo(k) > 0);
857 last = k
    [all...]
TreeSubMapTest.java 149 * lastKey returns last key
177 Integer last = (Integer)i.next(); local
178 assertEquals(last, one);
181 assertTrue(last.compareTo(k) < 0);
182 last = k;
659 * lastKey returns last key
687 Integer last = (Integer)i.next();
688 assertEquals(last, m1);
691 assertTrue(last.compareTo(k) > 0);
692 last = k
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentSkipListSet.java 375 public E last() { method in class:ConcurrentSkipListSet
  /libcore/luni/src/test/java/libcore/java/util/
OldTreeSetTest.java 166 // Test for method java.lang.Object java.util.TreeSet.last()
167 assertTrue("Returned incorrect last element",
168 ts.last() == objArray[objArray.length - 1]);
172 ts.last();
  /libcore/ojluni/src/main/java/java/text/
MergeCollation.java 101 PatternEntry last = findLastWithNoExtension(i-1); local
104 tmp.addToBuffer(result, false, withWhiteSpace, last);
112 PatternEntry last = findLastWithNoExtension(i-1); local
115 tmp.addToBuffer(result, false, withWhiteSpace, last);
310 // most likely entry is last one
323 throw new ParseException("couldn't find last entry: "

Completed in 1395 milliseconds

<<11121314151617181920>>