Searched refs:prev (Results 26 - 50 of 285) sorted by relevance

1234567891011>>

/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/
H A Dnode.h14 struct btnode *prev; member in struct:btnode
/haiku-fatelf/src/apps/glteapot/
H A Dutil.h26 /* Create a node and insert it in a list right after `prev' */
27 inline LispNode(LispNode* prev, contents* value) argument
28 : car(value), cdr(prev->cdr) { prev->cdr = this; }
348 thetype* prev; member in struct:DoubleLinkedNode
352 next = prev = NULL;
359 next->prev = n;
362 n->prev = (thetype*)this;
369 prev->next = n;
371 n->prev
[all...]
/haiku-fatelf/src/bin/less/
H A Difile.c65 link_ifile(p, prev)
67 struct ifile *prev;
72 if (prev == NULL)
73 prev = &anchor;
74 p->h_next = prev->h_next;
75 p->h_prev = prev;
76 prev->h_next->h_prev = p;
77 prev->h_next = p;
82 p->h_index = prev->h_index + 1;
102 * It should go after "prev" i
[all...]
H A Dlinenum.c45 struct linenum_info *prev; /* Line to previous in the list */ member in struct:linenum_info
47 POSITION gap; /* Gap between prev and next */
96 anchor.next = anchor.prev = &anchor;
117 p->gap = p->next->pos - p->prev->pos;
145 prevp = p->prev;
170 new->prev = prevp;
174 nextp->prev = new;
204 spare->next->prev = spare->prev;
205 spare->prev
[all...]
H A Dedit.c103 forw_textlist(tlist, prev)
105 char *prev;
110 * prev == NULL means return the first word in the list.
111 * Otherwise, return the word after "prev".
113 if (prev == NULL)
116 s = prev + strlen(prev);
127 back_textlist(tlist, prev)
129 char *prev;
134 * prev
654 IFILE prev; local
[all...]
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Dmxml-node.c98 parent->child->prev = node;
111 node->prev = child->prev;
113 if (child->prev)
114 child->prev->next = node;
118 child->prev = node;
130 node->prev = parent->last_child;
145 node->prev = child;
149 child->next->prev = node;
437 if (node->prev)
[all...]
H A Dmxml-search.c172 else if (node->prev)
174 if (node->prev->last_child && descend)
180 node = node->prev->last_child;
188 return (node->prev);
H A Dprint-list.c45 struct stp_list_item *prev; /*!< Previous node */ member in struct:stp_list_item
305 node = node->prev;
568 ln->prev = ln->next = NULL;
586 lnn = lnn->prev;
604 lnn = lnn->prev;
619 if (!ln->prev) /* insert at start of list */
622 ln->prev = list->end;
628 /* set prev (already set if at start of list) */
630 if (!ln->prev && ln->next) /* insert at end of list */
631 ln->prev
[all...]
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dlist.c34 struct _xmlLink *prev; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
124 for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev);
207 l->sentinel->prev = l->sentinel;
288 lkPlace = lkPlace->prev;
290 (lkPlace->next)->prev = lkNew;
292 lkNew->prev
[all...]
/haiku-fatelf/src/system/kernel/scheduler/
H A Dscheduler_simple_smp.cpp131 Thread *curr, *prev; local
132 for (curr = sRunQueue, prev = NULL; curr
135 if (prev)
136 prev = prev->queue_next;
138 prev = sRunQueue;
141 T(EnqueueThread(thread, prev, curr));
144 if (prev)
145 prev->queue_next = thread;
208 Thread *item, *prev; local
[all...]
H A Dscheduler_affine.cpp167 Thread *curr, *prev; local
168 for (curr = sRunQueue[targetCPU], prev = NULL; curr
171 if (prev)
172 prev = prev->queue_next;
174 prev = sRunQueue[targetCPU];
177 T(EnqueueThread(thread, prev, curr));
180 if (prev)
181 prev->queue_next = thread;
302 Thread *item = NULL, *prev local
[all...]
/haiku-fatelf/src/bin/bc/dc/
H A Darray.c61 struct dc_array *prev=NULL; variable in typeref:struct:dc_array
66 prev = cur;
82 if (prev)
83 prev->next = newentry;
/haiku-fatelf/src/add-ons/kernel/drivers/graphics/common/
H A Dmemory_manager.c34 struct mem_block *prev, *next; member in struct:mem_block
63 next->next->prev = block;
76 mem_block *prev, *next; local
79 prev = block->prev;
81 if (prev && !prev->allocated) {
82 block = prev;
83 merge(mem, prev);
150 first->prev
[all...]
/haiku-fatelf/src/bin/coreutils/src/
H A Dwheel-gen.pl90 my $prev = 2;
102 #warn $i, ' ', $i - $prev, "\n";
103 push @increments, $i - $prev;
104 $prev = $i;
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/stress/threads/pthread_cond_init/
H A Ds-c.c96 struct _teststruct * prev; member in struct:_teststruct
104 teststruct_t *cur, *prev; local
126 prev = NULL;
138 cur->prev = prev;
139 prev = cur;
238 while (prev != NULL)
240 cur = prev;
241 prev = cur->prev;
[all...]
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/stress/threads/pthread_mutex_init/
H A Ds-c.c100 struct _teststruct * prev; member in struct:_teststruct
113 teststruct_t *cur, *prev; local
126 prev = NULL;
138 cur->prev = prev;
139 prev = cur;
242 while (prev != NULL)
244 cur = prev;
245 prev = cur->prev;
[all...]
/haiku-fatelf/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_ageq.c194 struct mbuf *m, **prev, *ohead; local
199 prev = &aq->aq_head;
201 while ((m = *prev) != NULL) {
203 prev = &m->m_nextpkt;
221 aq->aq_tail = (struct mbuf *)((uintptr_t)prev -
225 *prev = m->m_nextpkt;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-1.2.6/
H A Dsessions.h22 struct btblock *prev; member in struct:btblock
/haiku-fatelf/src/bin/network/wget/src/
H A Dhtml-parse.c280 struct tagstack_item *prev;
291 ts->prev = ts->next = NULL;
296 ts->prev = *tail;
321 ts->prev->next = NULL;
322 *tail = ts->prev;
332 *tail = ts->prev;
334 if (ts->prev)
336 ts->prev->next = NULL;
359 tail = tail->prev;
279 struct tagstack_item *prev; member in struct:tagstack_item
/haiku-fatelf/src/system/libroot/posix/malloc_debug/
H A Dheap.cpp91 heap_area_s * prev; member in struct:heap_area_s
103 heap_page_s * prev; member in struct:heap_page_s
492 if (page->prev != lastPage)
493 panic("free page entry has invalid prev link\n");
534 if (area->prev != lastArea)
535 panic("area list entry has invalid prev link\n");
585 if (page->prev != lastPage) {
586 panic("used page entry has invalid prev link (%p vs %p bin "
587 "%lu)\n", page->prev, lastPage, i);
675 area->page_table[i].prev
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dobstack.c183 chunk->prev = 0;
231 chunk->prev = 0;
265 new_chunk->prev = old_chunk;
300 new_chunk->prev = old_chunk->prev;
333 plp = lp->prev;
357 plp = lp->prev;
388 for (lp = h->chunk; lp != 0; lp = lp->prev)
/haiku-fatelf/src/bin/network/atftpd/
H A Dtftpd_list.c64 new->prev = NULL;
72 new->prev = current;
97 thread_data->prev = NULL;
106 if (current->next && current->prev)
108 current->prev->next = current->next;
109 current->next->prev = current->prev;
112 current->prev->next = NULL;
/haiku-fatelf/src/bin/zip/
H A Ddeflate.c147 Pos prev[WSIZE]; variable
158 Pos far * near prev = NULL; variable
288 prev[(s) & WMASK] = match_head = head[ins_h], \
323 if (prev == NULL) {
324 prev = (Pos far *) zcalloc(WSIZE, sizeof(Pos));
326 if (prev == NULL || head == NULL) {
333 * prev[] will be initialized on the fly.
392 if (prev != NULL) {
393 zcfree(prev);
395 prev
[all...]
/haiku-fatelf/src/libs/fluidsynth/src/
H A Dfluid_seq.c721 fluid_evt_entry* prev; local
740 prev = seq->queueLater;
741 tmp = prev->next;
746 prev->next = evtentry;
749 prev = tmp;
750 tmp = prev->next;
755 prev->next = evtentry;
855 fluid_evt_entry* prev = NULL; local
860 if (prev) {
861 prev
886 fluid_evt_entry* prev = NULL; local
916 fluid_evt_entry* prev = NULL; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache_priv.h50 *prev; /* points toward lru end of list */ member in struct:cache_ent

Completed in 264 milliseconds

1234567891011>>