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

1 2 3 4 5 6 78 91011>>

  /libcore/ojluni/src/main/java/java/lang/ref/
ReferenceQueue.java 47 private Reference<? extends T> tail = null; field in class:ReferenceQueue
83 if (tail == null) {
86 tail.queueNext = r;
88 tail = r;
89 tail.queueNext = r;
124 if (head == tail) {
125 tail = null;
  /prebuilts/go/darwin-x86/src/runtime/
asm_ppc64x.s 268 // On other arches we do a tail call here, but it appears to be
269 // impossible to tail call a function pointer in shared mode on
1146 BLE tail
1179 BLE tail // If len <= 64, don't use the vectorized loop
1212 tail: label
    [all...]
  /prebuilts/go/linux-x86/src/runtime/
asm_ppc64x.s 268 // On other arches we do a tail call here, but it appears to be
269 // impossible to tail call a function pointer in shared mode on
1146 BLE tail
1179 BLE tail // If len <= 64, don't use the vectorized loop
1212 tail: label
    [all...]
  /system/bt/osi/src/
list.cc 14 list_node_t* tail; member in struct:list_t
79 return list->tail->data;
86 return list->tail;
100 if (list->tail == prev_node) list->tail = node;
114 if (list->tail == NULL) list->tail = list->head;
127 if (list->tail == NULL) {
129 list->tail = node;
131 list->tail->next = node
    [all...]
  /system/core/logd/
LogReader.cpp 60 unsigned long tail = 0; local
61 static const char _tail[] = " tail=";
64 tail = atol(cp + sizeof(_tail) - 1);
197 "logdr: UID=%d GID=%d PID=%d %c tail=%lu logMask=%x pid=%d "
199 cli->getUid(), cli->getGid(), cli->getPid(), nonBlock ? 'n' : 'b', tail,
202 FlushCommand command(*this, nonBlock, tail, logMask, pid, sequence, timeout);
  /system/libvintf/test/
AssembleVintfTest.cpp 142 std::string tail = local
158 std::string xmlEmpty = "<compatibility-matrix version=\"1.0\" type=\"framework\">\n" + tail;
243 tail,
260 tail,
276 tail,
  /art/compiler/driver/
compiled_method_storage.cc 112 const uint8_t *tail = reinterpret_cast<const uint8_t*>(data + nblocks * 4); local
117 k1 ^= tail[2] << 16;
120 k1 ^= tail[1] << 8;
123 k1 ^= tail[0];
  /developers/build/prebuilts/gradle/NfcProvisioning/Application/src/main/java/com/example/android/nfcprovisioning/
ProvisioningValuesLoader.java 185 int tail = wifiSsid.endsWith("\"") ? 1 : 0; local
186 return wifiSsid.substring(head, wifiSsid.length() - tail);
  /developers/samples/android/admin/NfcProvisioning/Application/src/main/java/com/example/android/nfcprovisioning/
ProvisioningValuesLoader.java 185 int tail = wifiSsid.endsWith("\"") ? 1 : 0; local
186 return wifiSsid.substring(head, wifiSsid.length() - tail);
  /development/samples/browseable/NfcProvisioning/src/com.example.android.nfcprovisioning/
ProvisioningValuesLoader.java 183 int tail = wifiSsid.endsWith("\"") ? 1 : 0; local
184 return wifiSsid.substring(head, wifiSsid.length() - tail);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/
statement.c 32 static int pysqlite_check_remaining_sql(const char* tail);
55 const char* tail; local
87 &tail);
92 if (rc == SQLITE_OK && pysqlite_check_remaining_sql(tail)) {
326 const char* tail; local
338 &tail);
435 static int pysqlite_check_remaining_sql(const char* tail)
437 const char* pos = tail;
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
PCCTSAST.cpp 98 register PCCTS_AST *child, *sibling=NULL, *tail, *w; local
111 if ( sibling == NULL ) {sibling = child; tail = w;}
112 else {tail->setRight(child); tail = w;}
297 tail() function in class:PCCTS_AST
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3commontreenodestream.h 255 /// Add new lookahead at lookahead[tail]. tail wraps around at the
256 /// end of the lookahead buffer so tail could be less than head.
258 ANTLR3_UINT32 tail; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
327 ANTLR3_UINT32 tail; member in struct:ANTLR3_TREE_WALK_STATE_struct
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
RubyTarget.java 298 String tail = value.substring( 1 ); local
299 return head.toString().concat( tail );
  /external/boringssl/src/crypto/fipsmodule/bn/
ctx.c 81 BN_POOL_ITEM *head, *current, *tail; member in struct:bignum_pool
237 p->head = p->current = p->tail = NULL;
265 item->prev = p->tail;
269 p->head = p->current = p->tail = item;
271 p->tail->next = item;
272 p->tail = item;
  /external/clang/test/CXX/temp/temp.decls/temp.variadic/
example-bind.cpp 59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail)
74 : m_head(other.head()), inherited(other.tail()) { }
79 tail() = other.tail();
85 inherited& tail() { return *this; } function in class:tuple
86 const inherited& tail() const { return *this; function in class:tuple
    [all...]
example-tuple.cpp 59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail)
74 : m_head(other.head()), inherited(other.tail()) { }
79 tail() = other.tail();
85 inherited& tail() { return *this; } function in class:tuple
86 const inherited& tail() const { return *this; function in class:tuple
    [all...]
  /external/e2fsprogs/debugfs/
htree.c 141 struct ext2_dx_tail *tail; local
160 tail = (struct ext2_dx_tail *)(ent + limit);
162 ext2fs_le32_to_cpu(tail->dt_checksum));
revoke.c 646 struct journal_revoke_tail *tail; local
652 tail = (struct journal_revoke_tail *)(bh->b_data + j->j_blocksize -
654 tail->r_checksum = 0;
656 tail->r_checksum = ext2fs_cpu_to_be32(csum);
  /external/e2fsprogs/e2fsck/
revoke.c 646 struct journal_revoke_tail *tail; local
652 tail = (struct journal_revoke_tail *)(bh->b_data + j->j_blocksize -
654 tail->r_checksum = 0;
656 tail->r_checksum = ext2fs_cpu_to_be32(csum);
  /external/e2fsprogs/util/
symlinks.c 169 char *p, *np, *lp, *tail, *msg; local
233 /* point tail at first part of lpath that differs from path */
236 tail = lp = lpath;
240 tail = lp;
245 /* now create new, with "../"s followed by tail */
255 strcpy (np, tail);
  /external/eigen/unsupported/Eigen/CXX11/src/util/
EmulateCXX11Meta.h 27 template<typename T, typename Tail=empty_list> struct type_list {
29 typedef Tail TailType;
31 static const Tail tail; member in struct:Eigen::internal::type_list
32 static const std::size_t count = 1 + Tail::count;
53 template <class Head, class Tail>
54 struct get_type<0, type_list<Head, Tail> >
59 template <std::size_t i, class Head, class Tail>
60 struct get_type<i, type_list<Head, Tail> >
62 typedef typename get_type<i-1, Tail>::type type
    [all...]
  /external/fio/engines/
libaio.c 28 * 'tail' is incremented in _commit(). We keep 'queued' so
30 * 'head' == 'tail'. 'entries' is the ring size, and
38 unsigned int tail; member in struct:libaio_data
108 unsigned tail; member in struct:aio_ring
130 if (head == ring->tail) {
253 nr = min((unsigned int) nr, ld->entries - ld->tail);
254 io_us = ld->io_us + ld->tail;
255 iocbs = ld->iocbs + ld->tail;
263 ring_inc(ld, &ld->tail, ret);
  /external/freetype/include/freetype/
fttypes.h 570 FT_ListNode tail; member in struct:FT_ListRec_
    [all...]
  /external/guava/guava-gwt/test-super/com/google/common/collect/testing/super/com/google/common/collect/testing/testers/
ListSubListTester.java 224 List<E> tail = list.subList(1, size); local
227 assertEquals(list.get(1), tail.get(0));
228 assertEquals(list.get(size - 1), tail.get(size - 2));
231 for (List<E> subList : Arrays.asList(copy, head, tail)) {
248 List<E> tail = list.subList(1, size); local
251 assertTrue(tail.contains(list.get(1)));
255 assertTrue(tail.contains(list.get(size - 1)));
257 assertFalse(tail.contains(list.get(0)));
266 List<E> tail = list.subList(1, size); local
271 assertEquals(tail.indexOf(list.get(1))
292 List<E> tail = list.subList(1, size); local
    [all...]

Completed in 756 milliseconds

1 2 3 4 5 6 78 91011>>