/external/chromium_org/third_party/skia/src/core/ |
H A D | SkImageFilter.cpp | 466 Value* tail = fLRU.tail(); local 467 SkASSERT(tail); 468 if (tail == v) { 471 removeInternal(tail);
|
H A D | SkString.cpp | 613 size_t tail = size - (offset + length); local 614 if (tail) { 615 memcpy(dst + offset, src + (offset + length), tail);
|
/external/flac/libFLAC/ |
H A D | bitreader.c | 138 /* any incomplete word at the tail will be left-justified, and bytes from the read callback are added on the right */ 233 * bitstream : 11 22 33 44 55 br->words=1 br->bytes=1 (partial tail word is left-justified) 237 * on LE machines, have to byteswap the odd tail word so nothing is 411 /* CRC any tail bytes in a partially-consumed word */ 413 const brword tail = br->buffer[br->consumed_words]; local 415 br->read_crc16 = FLAC__CRC16_UPDATE((unsigned)((tail >> (FLAC__BITS_PER_WORD-8-br->crc16_align)) & 0xff), br->read_crc16); 456 if(br->consumed_words < br->words) { /* if we've not consumed up to a partial tail word... */ 494 /* in this case we're starting our read at a partial tail word; 631 /* step 3: skip any remainder from partial tail bytes */ 686 /* step 3: read any remainder from partial tail byte [all...] |
/external/iproute2/tc/ |
H A D | f_u32.c | 983 struct rtattr *tail; local 999 tail = NLMSG_TAIL(n); 1169 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | m_ipt.c | 393 struct rtattr *tail; local 493 tail = NLMSG_TAIL(n); 515 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
/external/libnl/lib/route/sch/ |
H A D | netem.c | 296 struct nlattr* tail = (struct nlattr *)(((void *) (msg->nm_nlh)) + local 300 head->nla_len = (void *)tail - (void *)head;
|
/external/libsepol/src/ |
H A D | 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; 622 cond_av_list_t *tail; member in struct:cond_insertf_data 701 data->tail->next = list; 702 data->tail [all...] |
/external/mesa3d/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/opencv/cv/src/ |
H A D | cvfloodfill.cpp | 60 tail->y = (ushort)(Y); \ 61 tail->l = (ushort)(L); \ 62 tail->r = (ushort)(R); \ 63 tail->prevl = (ushort)(PREV_L); \ 64 tail->prevr = (ushort)(PREV_R); \ 65 tail->dir = (short)(DIR); \ 66 if( ++tail >= buffer_end ) \ 67 tail = buffer; \ 106 CvFFillSegment* buffer_end = buffer + buffer_size, *head = buffer, *tail = buffer; local 142 while( head != tail ) 238 CvFFillSegment* buffer_end = buffer + buffer_size, *head = buffer, *tail = buffer; local 391 CvFFillSegment* buffer_end = buffer + buffer_size, *head = buffer, *tail = buffer; local 697 CvFFillSegment* buffer_end = buffer + buffer_size, *head = buffer, *tail = buffer; local [all...] |
H A D | cvinpaint.cpp | 81 CvHeapElem *mem,*empty,*head,*tail; member in class:CvPriorityQueueFloat 109 tail = mem+i; 110 tail->i = tail->j = -1; 111 tail->prev = mem+i-1; 112 tail->next = NULL; 113 tail->T = FLT_MAX; 131 if (empty==tail) return false; 189 mem=empty=head=tail=NULL;
|
/external/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/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);
|
/external/skia/src/core/ |
H A D | SkString.cpp | 605 size_t tail = size - offset - length; local 606 SkASSERT((int32_t)tail >= 0); 607 if (tail) { 609 memcpy(dst + offset, src + offset + length, tail);
|
/external/srec/portable/src/ |
H A D | pstream.c | 943 const char *tail; local 951 tail = PortFile->filename + (lenny - 11); 953 tail = PortFile->filename; 954 /* printf( "8.3 filename is %s.\n", tail ); */ 961 return PortSaveFileToDisk(PortFile, "/CFC", tail);
|
/external/srec/srec/crec/ |
H A D | word_lattice.c | 111 void print_word_token_backtrace(srec* rec, wtokenID wtoken_index, char* tail) argument 147 PLogMessage (tail);
|
/external/tremolo/Tremolo/ |
H A D | framing.c | 227 the buffer preceeding pos and 'head'/'tail' are the buffer past the 229 'head/tail' are NULL */ 230 static ogg_reference *ogg_buffer_split(ogg_reference **tail, argument 236 ogg_reference *ret=*tail; 237 ogg_reference *or=*tail; 255 *tail=or->next; 261 *tail=*head=0; 271 /* make a new reference to tail the second piece */ 272 *tail=_fetch_ref(or->buffer->ptr.owner); 274 (*tail) 344 ogg_buffer_cat(ogg_reference *tail, ogg_reference *head) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/wps/ |
H A D | wps_upnp.c | 628 const char *tail = "</e:propertyset>\n"; local 670 wpabuf_put_str(buf, tail);
|
/external/wpa_supplicant_8/src/wps/ |
H A D | wps_upnp.c | 628 const char *tail = "</e:propertyset>\n"; local 670 wpabuf_put_str(buf, tail);
|
/external/wpa_supplicant_8/wpa_supplicant/src/wps/ |
H A D | wps_upnp.c | 628 const char *tail = "</e:propertyset>\n"; local 670 wpabuf_put_str(buf, tail);
|
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
H A D | xray.c | 75 int tail; member in struct:XRayTraceFrame 496 capture->frame.tail = 0; 523 return capture->frame.tail; 571 if (capture->frame.head == capture->frame.tail) 648 /* If the table is filled, bump the tail. */ 649 if (capture->frame.head == capture->frame.tail) 650 capture->frame.tail = XRayFrameGetNext(capture, capture->frame.tail); 651 capture->frame.tail = XRayFrameFindTail(capture); 738 capture->frame.tail [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | ContainerNode.cpp | 450 Node* tail = 0; local 452 addChildNodesToDeletionQueue(head, tail, container); 464 tail = 0; 467 addChildNodesToDeletionQueue(head, tail, toContainerNode(*n)); 473 void ContainerNode::addChildNodesToDeletionQueue(Node*& head, Node*& tail, ContainerNode& container) argument 493 if (tail) 494 tail->setNextSibling(n); 498 tail = n;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/common/ |
H A D | xmlconfig.c | 175 * returning tail points to the first character that is not part of 176 * the integer number. If no number was found then tail points to the 178 static GLint strToI (const XML_Char *string, const XML_Char **tail, int base) { argument 222 *tail = numberFound ? string : start; 233 * returning tail points to the first character that is not part of 234 * the floating point number. If no number was found then tail points 238 static GLfloat strToF (const XML_Char *string, const XML_Char **tail) { argument 267 *tail = start; 270 *tail = string; 277 *tail 302 const XML_Char *tail = NULL; local [all...] |
/external/javassist/src/main/javassist/ |
H A D | CtClassType.java | 148 CtMember head, CtMember tail) { 150 while (head != tail) { 802 CtMember tail = cache.lastMethod(); 803 while (mth != tail) { 885 CtMember tail = memCache.lastField(); 886 while (field != tail) { 937 CtMember tail = memCache.lastField(); 938 int num = CtMember.Cache.count(field, tail); 941 while (field != tail) { 961 CtMember tail 147 exToString(StringBuffer buffer, String msg, CtMember head, CtMember tail) argument [all...] |
/external/jsoncpp/src/test_lib_json/ |
H A D | jsontest.cpp | 148 PredicateContext *tail = lastNode->next_; local 149 if ( tail != 0 && tail->failure_ != 0 ) 151 messageTarget_ = tail->failure_; 153 // Remove tail from list
|
/external/libpcap/ |
H A D | pcap-dos.c | 1304 struct rx_elem *tail, *head; local 1309 tail = pktq_out_elem (&active_dev->queue); 1313 if (head != tail) 1315 PCAP_ASSERT (tail->size < active_dev->queue.elem_size-4-2); 1317 *buf = &tail->data[0]; 1318 return (tail->size); 1330 struct rx_elem *tail = pktq_out_elem (&active_dev->queue); local 1332 PCAP_ASSERT (&tail->data[0] == buf); 1437 * Increment the queue 'out_index' (tail). 1470 * Return the queue's tail [all...] |