| /external/qemu/distrib/sdl-1.2.12/src/events/ |
| SDL_events.c | 46 int tail; member in struct:__anon4295
220 SDL_EventQ.tail = 0;
265 int tail, added; local
267 tail = (SDL_EventQ.tail+1)%MAXEVENTS;
268 if ( tail == SDL_EventQ.head ) {
272 SDL_EventQ.event[SDL_EventQ.tail] = *event;
277 SDL_EventQ.event[SDL_EventQ.tail].syswm.msg =
281 SDL_EventQ.tail = tail;
[all...] |
| /dalvik/vm/compiler/template/armv5te-vfp/ |
| TEMPLATE_SQRT_DOUBLE_VFP.S | 20 bx r2 @ tail call to sqrt library routine
|
| /external/iproute2/tc/ |
| f_cgroup.c | 29 struct rtattr *tail; local
43 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len));
80 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
| q_drr.c | 57 struct rtattr *tail; local
60 tail = NLMSG_TAIL(n);
82 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
|
| m_action.c | 172 struct rtattr *tail, *tail2; local
183 tail = tail2 = NLMSG_TAIL(n);
223 tail = NLMSG_TAIL(n);
233 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
381 struct rtattr *tail; local
405 tail = NLMSG_TAIL(&req.n);
461 tail->rta_len = (void *) NLMSG_TAIL(&req.n) - (void *) tail;
489 struct rtattr *tail; local
527 struct rtattr *tail,*tail2; local
[all...] |
| f_basic.c | 42 struct rtattr *tail; local
59 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len));
105 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
| f_fw.c | 40 struct rtattr *tail; local
66 tail = NLMSG_TAIL(n);
117 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| f_tcindex.c | 35 struct rtattr *tail; local
46 tail = NLMSG_TAIL(n);
120 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_skbedit.c | 54 struct rtattr *tail; local
131 tail = NLMSG_TAIL(n);
140 tail->rta_len = (char *)NLMSG_TAIL(n) - (char *)tail;
|
| /external/webkit/WebKitTools/BuildSlaveSupport/build.webkit.org-config/ |
| Makefile | 19 tail -f twistd.log
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnSentence.java | 117 * @param tail The following sentence
119 public WnnSentence(WnnClause head, WnnSentence tail) {
120 if (tail == null) {
133 this.candidate = head.candidate + tail.candidate;
134 this.stroke = head.stroke + tail.stroke;
135 this.frequency = head.frequency + tail.frequency;
136 this.partOfSpeech = new WnnPOS(head.partOfSpeech.left, tail.partOfSpeech.right);
141 this.elements.addAll(tail.elements);
|
| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 139 list->tail = list->head;
145 list->curr = list->tail;
149 if(list->curr == list->tail){
157 list->tail = newnode;
202 list->curr = list->tail;
219 }else if(curr == list->tail){
221 list->tail = curr->prev;
223 if(list->tail != NULL){
224 (list->tail)->next = NULL;
228 list->curr = list->tail;
[all...] |
| /external/opencore/baselibs/gen_data_structures/src/ |
| sorted_list.h | 92 if (tail == iterator)
114 SortedListElement<LLClass> *tail; member in class:SortedList
126 iterator = head = tail = NULL;
139 head = tail = NULL;
165 if (!tail)
168 head = tail = OSCL_NEW(SortedListElement<LLClass>, (new_element));
201 tail->next = OSCL_NEW(SortedListElement<LLClass>, (new_element));
202 tail = tail->next;
270 if (tmp == tail)
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
| SAX2RTFDTM.java | 45 * 2) A stack of these documents is maintained, allowing us to "tail-prune" the
70 /** Tail-pruning mark: Number of nodes in use */
72 /** Tail-pruning mark: Number of data items in use */
74 /** Tail-pruning mark: Number of size-of-data fields in use */
76 /** Tail-pruning mark: Number of dataOrQName slots in use */
78 /** Tail-pruning mark: Number of namespace declaration sets in use
84 /** Tail-pruning mark: Number of naespace declaration elements in use
92 * Tail-pruning mark: initial number of nodes in use
97 * Tail-pruning mark: initial number of namespace declaration sets
102 * Tail-pruning mark: initial number of namespace declaration element
[all...] |
| /dalvik/vm/compiler/codegen/ |
| Optimizer.h | 39 struct LIR *tail);
|
| /external/dhcpcd/dhcpcd-hooks/ |
| 20-resolv.conf | 40 # Assemble resolv.conf using our head and tail files
49 if [ -f /etc/resolv.conf.tail ]; then
50 cat /etc/resolv.conf.tail >> "${cf}"
52 echo "# /etc/resolv.conf.tail can replace this line" >> "${cf}"
|
| /external/icu4c/common/ |
| ulist.c | 27 UListNode *tail; member in struct:UList
50 newList->tail = NULL;
65 list->tail = newItem;
88 newItem->previous = list->tail;
89 list->tail->next = newItem;
90 list->tail = newItem;
|
| /external/clearsilver/util/ |
| skiplist.c | 46 skipItem tail; /* tail item (has all levels) */ member in struct:skipList_struct
183 while(y != list->tail) {
291 if((y->key == *pkey) && (y != list->tail)) /* skip to next if found y */
294 if(y != list->tail) { /* reset key to next, return value */
406 err = skipAllocItem(&(list->tail), list->maxLevel, (UINT32)-1, NULL);
411 for(i = 0; /* init header and tail */
414 list->tail->next[i] = NULL;
415 list->header->next[i] = list->tail;
418 list->deleted->next[1] = list->tail;
[all...] |
| /frameworks/base/libs/surfaceflinger_client/ |
| SharedBufferStack.cpp | 135 int tail = (mNumBuffers + stack.head - stack.available + 1) % mNumBuffers; local
137 "%s[ head=%2d, available=%2d, queued=%2d, tail=%2d ] "
139 prefix, stack.head, stack.available, stack.queued, tail,
253 : SharedBufferBase(sharedClient, surface, num, identity), tail(0)
255 tail = computeTail();
283 if (stack.head == tail && stack.available == 2) {
284 LOGW("dequeue: tail=%d, head=%d, avail=%d, queued=%d",
285 tail, stack.head, stack.available, stack.queued);
304 int dequeued = tail;
305 tail = ((tail+1 >= mNumBuffers) ? 0 : tail+1)
[all...] |
| /hardware/ti/omap3/dspbridge/inc/ |
| list.h | 160 * The head is removed by making the tail element of the list point its
162 * "prev" pointer of the next element after the head point at the tail
177 * Because the tail of the list points forward (its "next" pointer) to
179 * "prev" pointer) to the tail of the list, this list is circular.
256 * Adds the specified element to the tail of the list
259 * the head element's prev pointer. This is the previous tail member of
262 * Sets next pointer of the previous tail member of the list to point to
278 * Because the tail is always "just before" the head of the list (the
279 * tail's "next" pointer points at the head of the list, and the head's
280 * "prev" pointer points at the tail of the list), the list is circular
[all...] |
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| list.h | 160 * The head is removed by making the tail element of the list point its
162 * "prev" pointer of the next element after the head point at the tail
177 * Because the tail of the list points forward (its "next" pointer) to
179 * "prev" pointer) to the tail of the list, this list is circular.
256 * Adds the specified element to the tail of the list
259 * the head element's prev pointer. This is the previous tail member of
262 * Sets next pointer of the previous tail member of the list to point to
278 * Because the tail is always "just before" the head of the list (the
279 * tail's "next" pointer points at the head of the list, and the head's
280 * "prev" pointer points at the tail of the list), the list is circular
[all...] |
| /external/bluetooth/glib/gio/fen/ |
| fen-data.c | 599 fnode_event_t *tail; local
615 tail = (fnode_event_t*)g_queue_peek_tail (f->eventq);
629 if (tail) {
632 fnode_event_delete (tail);
633 } while ((tail = (fnode_event_t*)g_queue_pop_tail (f->eventq)) != NULL);
655 if (tail) {
657 if (tail->e == ev->e) {
658 if (g_timeval_lt (&ev->t, &tail->t)) {
663 FD_W ("SKIPPED -- %s\n", _event_string (tail->e));
664 fnode_event_delete (tail);
[all...] |
| fen-kernel.c | 133 fnode_event_t *ev, *tail; local
168 tail = (fnode_event_t*) g_queue_peek_tail (g_eventq);
169 if (tail) {
170 if (tail->user_data == f) {
171 if (tail->e == e) {
172 tail->has_twin = (has_twin | (tail->has_twin ^ has_twin));
176 && tail->e == FILE_ATTRIB) {
177 tail->e = FILE_MODIFIED;
178 tail->has_twin = TRUE
[all...] |
| /external/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 45 * singly-linked tail queues, lists and tail queues.
57 * A singly-linked tail queue is headed by a pair of pointers, one to the
58 * head of the list and the other to the tail of the list. The elements are
62 * end of the list. Elements being removed from the head of the tail queue
64 * A singly-linked tail queue may only be traversed in the forward direction.
65 * Singly-linked tail queues are ideal for applications with large datasets
75 * A tail queue is headed by a pair of pointers, one to the head of the
76 * list and the other to the tail of the list. The elements are doubly
80 * the list. A tail queue may be traversed in either direction
[all...] |
| /frameworks/base/include/private/ui/ |
| RegionHelper.h | 111 inline int next(TYPE& head, TYPE& tail,
121 tail = lhs_tail;
125 tail = rhs_head;
131 tail = rhs_tail;
135 tail = lhs_head;
141 tail = rhs_head = lhs_tail;
145 tail = lhs_head = rhs_tail;
|
