HomeSort by relevance Sort by last modified time
    Searched defs:tail (Results 251 - 275 of 778) sorted by null

<<11121314151617181920>>

  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_screen.h 40 struct nouveau_fence *tail; member in struct:nouveau_screen::__anon29632
  /external/mesa3d/src/glx/
driwindows_glx.c 460 struct glx_config head, *tail, *m; local
462 tail = &head;
489 tail->next = &config->base;
490 if (tail->next == NULL)
496 tail = tail->next;
  /external/selinux/libsepol/src/
conditional.c 271 cond_expr_t *cur, *head, *tail, *new_expr; local
272 tail = head = NULL;
285 if (tail)
286 tail->next = new_expr;
287 tail = new_expr;
294 tail = head->next;
296 head = tail;
619 cond_av_list_t *tail; member in struct:cond_insertf_data
698 data->tail->next = list;
699 data->tail = list
    [all...]
  /external/skia/src/core/
SkString.cpp 545 size_t tail = size - (offset + length); local
546 if (tail) {
547 memcpy(dst + offset, src + (offset + length), tail);
  /external/skia/src/pathops/
SkOpSegment.h 387 const SkOpSpanBase* tail() const { function in class:SkOpSegment
391 SkOpSpanBase* tail() { function in class:SkOpSegment
430 SkOpSpanBase fTail; // the tail span always has its t set to one
  /external/skqp/src/pathops/
SkOpSegment.h 387 const SkOpSpanBase* tail() const { function in class:SkOpSegment
391 SkOpSpanBase* tail() { function in class:SkOpSegment
430 SkOpSpanBase fTail; // the tail span always has its t set to one
  /external/strace/
unwind.c 93 struct call_t *tail; member in struct:queue_t
126 tcp->queue->tail = NULL;
512 queue->tail = call;
514 queue->tail->next = call;
515 queue->tail = call;
547 queue->tail = NULL;
  /external/tremolo/Tremolo/
ogg.h 88 ogg_reference *tail; member in struct:oggpack_buffer
91 long count; /* doesn't count the tail */
  /external/wpa_supplicant_8/wpa_supplicant/
config_file.c 371 struct wpa_ssid *ssid, *tail, *head; local
388 tail = head = config->ssid;
389 while (tail && tail->next)
390 tail = tail->next;
415 head = tail = ssid;
417 tail->next = ssid;
418 tail = ssid;
    [all...]
config_winreg.c 375 struct wpa_ssid *ssid, *tail = NULL, *head = NULL; local
417 head = tail = ssid;
419 tail->next = ssid;
420 tail = ssid;
  /frameworks/base/cmds/incident_helper/src/
ih_util.cpp 37 const auto tail = s.find_last_not_of(charset); local
38 return s.substr(head, tail - head + 1);
191 const auto tail = line->find_last_not_of(DEFAULT_WHITESPACE); local
192 if (tail == std::string::npos) return false;
195 int j = tail;
  /frameworks/native/libs/binder/
MemoryDealer.cpp 59 NODE const* tail() const { return mLast; } function in class:android::LinkedList
60 NODE* tail() { return mLast; } function in class:android::LinkedList
  /frameworks/native/libs/vr/libbroadcastring/include/libbroadcastring/
broadcast_ring.h 279 return std::atomic_load_explicit(&header_mmap()->tail,
296 // (1) Load-Acquire of |tail|
302 // i.e. the stores for the records with sequence numbers < |tail| have
316 uint32_t tail = std::atomic_load_explicit(&header_mmap()->tail, local
321 if (tail - head > record_count())
324 if (*sequence - head > tail - head)
327 if (*sequence == tail) return false; // No new records available.
330 CalculateGeometry(record_count(), record_size(), *sequence, tail);
347 // 0 <= final_head - head <= sequence - head < tail - head <= record_coun
403 std::atomic<uint32_t> tail; member in struct:android::dvr::BroadcastRing::Header
433 uint32_t tail; member in struct:android::dvr::BroadcastRing::Geometry
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/
OldTreeMapTest.java 454 Map tail = tm.tailMap(objArray[900].toString()); local
455 assertTrue("Returned map of incorrect size : " + tail.size(), tail
458 assertTrue("Map contains incorrect entries", tail
486 assertTrue(tail instanceof Serializable);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
typelist.h 70 typedef Typelist tail; typedef in struct:typelist::chain
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/
typelist.h 70 typedef Typelist tail; typedef in struct:typelist::chain
  /system/core/libutils/
String8.cpp 432 size_t tail = index; local
439 memmove(buf + tail, buf + index + skip, next - index - skip);
440 tail += next - index - skip;
443 unlockBuffer(tail);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/xml/etree/
ElementTree.py 88 # <li>an optional <i>tail</i> string.</li>
172 # <tag attrib>text<child/>...</tag>tail
203 tail = None # text after end tag, if any variable in class:Element
236 elem.tail = self.tail
406 # all attributes, and sets the <b>text</b> and <b>tail</b> attributes
412 self.text = self.tail = None
507 if e.tail:
508 yield e.tail
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/xml/etree/
ElementTree.py 88 # <li>an optional <i>tail</i> string.</li>
172 # <tag attrib>text<child/>...</tag>tail
203 tail = None # text after end tag, if any variable in class:Element
236 elem.tail = self.tail
406 # all attributes, and sets the <b>text</b> and <b>tail</b> attributes
412 self.text = self.tail = None
507 if e.tail:
508 yield e.tail
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
antlr.c 996 Predicate **tail=NULL; local
1004 tail=&predExpr->right;
1016 *tail=predExpr;
1017 tail=&predExpr->right;
1053 Predicate **tail=NULL; local
1061 tail=&predExpr->right;
1073 *tail=predExpr;
1074 tail=&predExpr->right;
    [all...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/
astlib.c 148 register SORAST *child, *sibling=NULL, *tail = NULL, *w; local
166 if ( sibling == NULL ) {sibling = child; tail = w;}
167 else {tail->ast_right = child; tail = w;}
  /external/blktrace/
blkiomon.c 257 struct dstat *dstat, *tail = NULL; local
265 tail = dstat;
267 return tail;
273 struct dstat *head, *tail; local
296 tail = blkiomon_output(head, &wake);
299 tail->next = vacant_dstats_list;
  /external/boringssl/src/ssl/
ssl_cipher.cc 775 CIPHER_ORDER **tail) {
776 if (curr == *tail) {
788 (*tail)->next = curr;
789 curr->prev = *tail;
791 *tail = curr;
795 CIPHER_ORDER **tail) {
799 if (curr == *tail) {
800 *tail = curr->prev;
854 // head and tail of the list to |*head_p| and |*tail_p|, respectively.
866 CIPHER_ORDER *head, *tail, *curr, *next, *last local
1208 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
    [all...]
  /external/brotli/c/enc/
compress_fragment.c 189 const size_t tail = insertlen - 2; local
190 const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
191 const size_t prefix = tail >> nbits;
194 BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);
197 const size_t tail = insertlen - 66; local
198 const uint32_t nbits = Log2FloorNonZero(tail);
201 BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);
238 const size_t tail = copylen - 6; local
239 const uint32_t nbits = Log2FloorNonZero(tail) - 1u;
240 const size_t prefix = tail >> nbits
246 const size_t tail = copylen - 70; local
269 const size_t tail = copylen - 8; local
277 const size_t tail = copylen - 8; local
285 const size_t tail = copylen - 72; local
    [all...]
  /external/curl/src/
tool_metalink.c 769 metalink_resource root, *tail; local
771 tail = &root;
790 tail->next = res;
791 tail = res;
794 tail = root.next;
797 while(tail) {
798 res = tail->next;
799 free(tail->url);
800 free(tail);
801 tail = res
    [all...]

Completed in 1383 milliseconds

<<11121314151617181920>>