/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-bind.cpp | 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 142 static RJ get(tuple<Head, Values...>& t) { return Next::get(t.tail()); } 143 static PJ get(const tuple<Head, Values...>& t) { return Next::get(t.tail()); } 172 return t.head() == u.head() && t.tail() == u.tail(); 184 return (t.head() < u.head() || (!(t.head() < u.head()) && t.tail() < [all...] |
/external/f2fs-tools/tools/ |
H A D | f2fstat.c | 87 char *head, *tail; local 136 tail = strchr(head, ':'); 137 if (!tail) 139 *tail = '\0'; 142 *tail = ':'; 143 tail = strchr(head, '\n'); 144 head = tail + 1; 152 head = tail + 1; 156 *(found->val) = strtoul(head, &tail, 10); 159 tail [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 130 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap 133 private transient Map<K, Node<K, V>> keyToKeyTail; // the tail for a given key 193 head = tail = node; 196 } else if (nextSibling == null) { // non-empty list, add to tail 197 tail.next = node; 198 node.previous = tail; 207 tail = node; 243 } else { // node was tail 244 tail [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 126 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap 129 private transient Map<K, Node<K, V>> keyToKeyTail; // the tail for a given key 189 head = tail = node; 192 } else if (nextSibling == null) { // non-empty list, add to tail 193 tail.next = node; 194 node.previous = tail; 203 tail = node; 239 } else { // node was tail 240 tail [all...] |
/external/iproute2/tc/ |
H A D | m_ematch.c | 179 struct rtattr *tail = NLMSG_TAIL(n); local 221 tail->rta_len = (void*) NLMSG_TAIL(n) - (void*) tail; 339 struct rtattr *tail, *tail_list; local 346 tail = NLMSG_TAIL(n); 357 tail->rta_len = (void*) NLMSG_TAIL(n) - (void*) tail;
|
H A D | m_xt_old.c | 212 struct rtattr *tail; local 310 tail = NLMSG_TAIL(n); 332 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
/external/libmtp/src/ |
H A D | playlist-spl.c | 342 text_t* tail = NULL; local 399 tail = head; 402 tail->next = malloc(sizeof(text_t)); 403 tail = tail->next; 407 tail->text = utf16_to_utf8(device, (uint16_t*) w); 410 IF_DEBUG() printf("line: %s\n", tail->text); 437 tail->next = NULL;
|
/external/libvpx/libvpx/vpx_mem/ |
H A D | vpx_mem_tracker.c | 99 * tail; member in struct:memory_tracker 166 memtrack.tail = memtrack.head; 228 memtrack.tail = NULL; 539 p->prev = memtrack.tail; 548 memtrack.tail = p; 590 memtrack.tail = p->prev;
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_build_util.h | 38 // keeps inserting at head/tail of block 39 inline void setPosition(BasicBlock *, bool tail); 178 bool tail; member in class:nv50_ir::BuildUtil 203 tail = atTail; 213 tail = after; 237 tail ? bb->insertTail(i) : bb->insertHead(i); 239 if (tail) {
|
/external/mesa3d/src/gallium/state_trackers/egl/common/ |
H A D | native_helper.c | 62 unsigned int tail; member in struct:resource_surface 303 screen->fence_reference(screen, &fence, rsurf->swap_fences[rsurf->tail]); 304 screen->fence_reference(screen, &rsurf->swap_fences[rsurf->tail++], NULL); 305 rsurf->tail &= EGL_SWAP_FENCES_MASK;
|
/external/mesa3d/src/glx/ |
H A D | dri_common.c | 357 struct glx_config head, *tail, *m; local 359 tail = &head; 362 tail->next = createDriMode(core, m, driConfigs); 363 if (tail->next == NULL) { 369 tail = tail->next;
|
/external/skia/src/core/ |
H A D | SkTLList.h | 106 iterator refers to a NULL location then the new element is added at the tail */ 117 /** Convenience methods for getting an iterator initialized to the head/tail of the list. */ 122 T* tail() { return Iter(*this, Iter::kTail_IterStart).get(); } function in class:SkTLList 124 const T* tail() const { return Iter(*this, Iter::kTail_IterStart).get(); } function in class:SkTLList 196 //!< Start the iterator at the tail of the list.
|
/external/strace/ |
H A D | unwind.c | 84 struct call_t *tail; member in struct:queue_t 114 tcp->queue->tail = NULL; 506 queue->tail = call; 508 queue->tail->next = call; 509 queue->tail = call; 541 queue->tail = NULL;
|
/external/tremolo/Tremolo/ |
H A D | ogg.h | 88 ogg_reference *tail; member in struct:oggpack_buffer 91 long count; /* doesn't count the tail */
|
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | beacon.c | 726 u8 *tail = NULL; local 748 tailpos = tail = os_malloc(tail_len); 749 if (head == NULL || tail == NULL) { 752 os_free(tail); 796 tail + BEACON_TAIL_BUF_SIZE - tailpos); 808 tailpos = hostapd_eid_wpa(hapd, tailpos, tail + BEACON_TAIL_BUF_SIZE - 812 tail + BEACON_TAIL_BUF_SIZE - tailpos); 830 tailpos = hostapd_add_csa_elems(hapd, tailpos, tail, 872 tail_len = tailpos > tail ? tailpos - tail [all...] |
/external/wpa_supplicant_8/src/ap/ |
H A D | beacon.c | 726 u8 *tail = NULL; local 748 tailpos = tail = os_malloc(tail_len); 749 if (head == NULL || tail == NULL) { 752 os_free(tail); 796 tail + BEACON_TAIL_BUF_SIZE - tailpos); 808 tailpos = hostapd_eid_wpa(hapd, tailpos, tail + BEACON_TAIL_BUF_SIZE - 812 tail + BEACON_TAIL_BUF_SIZE - tailpos); 830 tailpos = hostapd_add_csa_elems(hapd, tailpos, tail, 872 tail_len = tailpos > tail ? tailpos - tail [all...] |
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | config_file.c | 358 struct wpa_ssid *ssid, *tail, *head; local 375 tail = head = config->ssid; 376 while (tail && tail->next) 377 tail = tail->next; 401 head = tail = ssid; 403 tail->next = ssid; 404 tail = ssid;
|
H A D | config_winreg.c | 375 struct wpa_ssid *ssid, *tail = NULL, *head = NULL; local 417 head = tail = ssid; 419 tail->next = ssid; 420 tail = ssid;
|
/external/wpa_supplicant_8/wpa_supplicant/src/ap/ |
H A D | beacon.c | 726 u8 *tail = NULL; local 748 tailpos = tail = os_malloc(tail_len); 749 if (head == NULL || tail == NULL) { 752 os_free(tail); 796 tail + BEACON_TAIL_BUF_SIZE - tailpos); 808 tailpos = hostapd_eid_wpa(hapd, tailpos, tail + BEACON_TAIL_BUF_SIZE - 812 tail + BEACON_TAIL_BUF_SIZE - tailpos); 830 tailpos = hostapd_add_csa_elems(hapd, tailpos, tail, 872 tail_len = tailpos > tail ? tailpos - tail [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | WalkerFactory.java | 859 StepPattern tail = step; 935 tail = pat; 942 XNumber score = tail.getStaticScore(); 943 tail.setRelativePathPattern(selfPattern); 944 tail.setStaticScore(score); 967 * @param tail The step that is the first step analyzed, but the last 968 * step in the relative match linked list, i.e. the tail. 980 int analysis, StepPattern tail, StepPattern head) 978 createDefaultStepPattern( Compiler compiler, int opPos, MatchPatternIterator mpi, int analysis, StepPattern tail, StepPattern head) argument
|
/external/blktrace/ |
H A D | 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/chromium_org/third_party/boringssl/src/ssl/ |
H A D | ssl_ciph.c | 390 CIPHER_ORDER **tail) 392 if (curr == *tail) return; 399 (*tail)->next=curr; 400 curr->prev= *tail; 402 *tail=curr; 406 CIPHER_ORDER **tail) 409 if (curr == *tail) 410 *tail=curr->prev; 529 CIPHER_ORDER *head, *tail, *curr, *next, *last; local 542 tail 389 ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument 405 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument 1012 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
/external/chromium_org/third_party/mesa/src/src/glsl/glcpp/ |
H A D | glcpp.h | 45 string_node_t *tail; member in struct:string_list 105 token_node_t *tail; member in struct:token_list 116 argument_node_t *tail; member in struct:argument_list
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | SkAntiEdge.cpp | 503 SkAntiEdge* tail = fEdges.end(); local 507 for (active = prev + 1; active != tail; ++active) { 523 if (++prev == tail) { 527 for (active = prev + 1; active != tail; ++active) { 601 SkAntiEdge tail; local 602 tail.fFirstY = tail.fLastY = kEDGE_TAIL_XY; 603 *list.append() = &tail;
|
/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkAnimator.cpp | 643 const char* tail = strrchr(uri, '/'); local 644 if (tail) { 645 SkString prefix(uri, tail - uri + 1); 649 fMaker->fFileName.set(tail + 1);
|