/openbsd-current/usr.bin/vi/docs/USD.doc/vi.ref/ |
H A D | merge.awk | 6 $1 == prev { 14 prev = $1;
|
/openbsd-current/usr.bin/dig/lib/dns/rdata/generic/ |
H A D | talink_58.c | 23 dns_name_t prev; local 31 dns_name_init(&prev, NULL); 37 dns_name_fromregion(&prev, &dregion); 38 isc_region_consume(&dregion, name_length(&prev)); 43 sub = name_prefix(&prev, tctx->origin, &prefix); 54 dns_name_t prev; local 64 dns_name_init(&prev, NULL); 67 RETERR(dns_name_fromwire(&prev, source, dctx, options, target)); 74 dns_name_t prev; local 84 dns_name_init(&prev, moffset [all...] |
/openbsd-current/usr.sbin/unbound/services/ |
H A D | outbound_list.c | 71 list->first->prev = e; 73 e->prev = NULL; 84 e->next->prev = e->prev; 85 if(e->prev) 86 e->prev->next = e->next;
|
/openbsd-current/sbin/unwind/libunbound/services/ |
H A D | outbound_list.c | 71 list->first->prev = e; 73 e->prev = NULL; 84 e->next->prev = e->prev; 85 if(e->prev) 86 e->prev->next = e->next;
|
/openbsd-current/usr.sbin/rpc.lockd/ |
H A D | handles.c | 58 struct fdinfo *prev; member in struct:fdinfo
|
/openbsd-current/games/atc/ |
H A D | list.c | 65 p->next = p->prev = NULL; 77 p->prev = r; 80 q->prev = p; 83 p->prev = NULL; 84 q->prev = p; 90 p->prev = l->tail; 106 l->head->prev = NULL; 108 l->tail = p->prev; 111 p->prev->next = p->next; 112 p->next->prev [all...] |
/openbsd-current/sys/dev/pci/drm/include/linux/ |
H A D | list.h | 46 (head)->prev = head; 61 return !list_empty(head) && ((head)->next == (head)->prev); 68 return list->prev == head; 79 __list_add(struct list_head *new, struct list_head *prev, argument 82 next->prev = new; 84 new->prev = prev; 85 prev->next = new; 90 (head)->next->prev = new; 92 (new)->prev 252 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument [all...] |
/openbsd-current/sys/dev/usb/dwc2/ |
H A D | list.h | 49 struct list_head *next, *prev; member in struct:list_head 60 (head)->prev = head; 70 (head)->next->prev = new; 72 (new)->prev = head; 78 (entry)->prev = (head)->prev; 80 (head)->prev->next = entry; 81 (head)->prev = entry; 86 (entry)->next->prev = (entry)->prev; [all...] |
/openbsd-current/sys/dev/pci/drm/ |
H A D | linux_list_sort.c | 147 * nodes in `a' first, and setting the `prev' pointers as we go. 155 struct list_head *prev = list; local 164 (*first)->prev = prev; 165 prev = prev->next = *first; 170 * Attach whichever of a and b remains, and fix up the prev 175 prev->next = tail; 176 tail->prev = prev; [all...] |
/openbsd-current/gnu/gcc/gcc/ |
H A D | tree-iterator.c | 94 head->prev = NULL; 107 head->prev = cur->prev; 108 if (head->prev) 109 head->prev->next = head; 113 cur->prev = tail; 117 head->prev = STATEMENT_LIST_TAIL (i->container); 118 if (head->prev) 119 head->prev->next = head; 170 head->prev 221 struct tree_statement_list_node *cur, *next, *prev; local 275 struct tree_statement_list_node *cur, *prev; local [all...] |
/openbsd-current/games/boggle/mkindex/ |
H A D | mkindex.c | 48 int clen, rlen, prev; local 55 prev = '\0'; 58 if (*buf != prev) { 59 if (prev != '\0') 60 printf("%c %6ld %6ld\n", prev, start, off - 1); 61 prev = *buf; 66 printf("%c %6ld %6ld\n", prev, start, off - 1);
|
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | stack.h | 28 struct stack_level *prev; member in struct:stack_level
|
H A D | bb-reorder.c | 107 basic_block prev = NULL; 130 prev = make_reorder_chain_1 (next, prev); 133 RBI (prev)->next = NULL; 187 make_reorder_chain_1 (bb, prev) 189 basic_block prev; 196 if (prev) 199 RBI (prev)->next = bb; 201 if (rtl_dump_file && prev->next_bb != bb) 203 bb->index, prev 106 basic_block prev = NULL; local [all...] |
/openbsd-current/games/boggle/mkdict/ |
H A D | mkdict.c | 60 int current, len, prev, qcount; local 66 prev = 0; 68 buf[prev][0] = '\0'; 108 q = buf[prev]; 115 prev = !prev;
|
/openbsd-current/usr.bin/dig/lib/isc/include/isc/ |
H A D | list.h | 27 #define ISC_LINK(type) struct { type *prev, *next; } 30 (elt)->link.prev = (type *)(-1); \ 35 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1)) 44 (list).head->link.prev = (elt); \ 47 (elt)->link.prev = NULL; \ 66 (elt)->link.prev = (list).tail; \ 82 (elt)->link.next->link.prev = (elt)->link.prev; \ 85 (list).tail = (elt)->link.prev; \ 87 if ((elt)->link.prev ! [all...] |
/openbsd-current/gnu/llvm/compiler-rt/lib/dfsan/ |
H A D | dfsan_origin.h | 73 static Origin CreateChainedOrigin(Origin prev, StackTrace *stack) { argument 74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; 80 return prev; 85 return prev; 90 return prev; 95 GetChainedOriginDepot()->Put(h.id(), prev.raw_id(), &chained_id);
|
/openbsd-current/bin/ksh/ |
H A D | alloc.c | 15 struct link *prev; member in struct:link 54 l->prev = NULL; 56 ap->freelist->prev = l; 95 lprev = l->prev; 106 lnext->prev = l2; 120 if (l->prev) 121 l->prev->next = l->next; 125 l->next->prev = l->prev;
|
/openbsd-current/usr.sbin/mrouted/ |
H A D | callout.c | 90 struct timeout_q *ptr, *node, *prev; local 110 prev = ptr = Q; 128 prev->next = node; 137 prev = ptr; 141 prev->next = node; 153 struct timeout_q *ptr, *prev; local 162 prev = ptr = Q; 178 prev->next = ptr->next; 190 prev = ptr;
|
/openbsd-current/lib/libexpat/tests/ |
H A D | memcheck.c | 45 struct allocation_entry *prev; member in struct:allocation_entry 75 entry->prev = NULL; 78 entry->prev = alloc_tail; 111 if (entry->prev != NULL) 112 entry->prev->next = entry->next; 116 entry->next->prev = entry->prev; 159 entry->prev = NULL; 162 entry->prev = alloc_tail;
|
/openbsd-current/gnu/llvm/lld/MachO/ |
H A D | MarkLive.cpp | 29 const WhyLiveEntry *prev; member in struct:lld::macho::WhyLiveEntry 31 WhyLiveEntry(InputSection *isec, const WhyLiveEntry *prev) argument 32 : isec(isec), prev(prev) {} 61 void enqueue(InputSection *isec, uint64_t off, const WorklistEntry *prev); 62 void addSym(Symbol *s, const WorklistEntry *prev); 64 WorklistEntry *makeEntry(InputSection *, const WorklistEntry *prev) const; 77 const typename MarkLiveImpl<RecordWhyLive>::WorklistEntry *prev) { 83 worklist.push_back(makeEntry(s, prev)); 87 static void printWhyLive(const Symbol *s, const WhyLiveEntry *prev) { argument 75 enqueue( InputSection *isec, uint64_t off, const typename MarkLiveImpl<RecordWhyLive>::WorklistEntry *prev) argument 103 addSym( Symbol *s, const typename MarkLiveImpl<RecordWhyLive>::WorklistEntry *prev) argument [all...] |
/openbsd-current/usr.bin/less/ |
H A D | ifile.c | 63 link_ifile(struct ifile *p, struct ifile *prev) argument 68 if (prev == NULL) 69 prev = &anchor; 70 p->h_next = prev->h_next; 71 p->h_prev = prev; 72 prev->h_next->h_prev = p; 73 prev->h_next = p; 78 p->h_index = prev->h_index + 1; 97 * It should go after "prev" in the list 98 * (or at the beginning of the list if "prev" i 102 new_ifile(char *filename, struct ifile *prev) argument 214 get_ifile(char *filename, IFILE prev) argument [all...] |
/openbsd-current/usr.sbin/cron/ |
H A D | job.c | 72 job *j, *prev = NULL; local 76 if (prev == NULL) 79 SIMPLEQ_REMOVE_AFTER(&jobs, prev, entries); 83 prev = j; 90 job *j, *prev = NULL; local 95 if (prev == NULL) 98 SIMPLEQ_REMOVE_AFTER(&jobs, prev, entries); 102 prev = j;
|
/openbsd-current/gnu/llvm/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_atomic_msvc.h | 176 u8 prev = (u8)_InterlockedCompareExchange8( local 179 u8 prev; local 185 mov prev, al local 188 if (prev == cmpv) 190 *cmp = prev; 199 uptr prev = (uptr)_InterlockedCompareExchangePointer( local 201 if (prev == cmpv) 203 *cmp = prev; 212 u16 prev = (u16)_InterlockedCompareExchange16( local 214 if (prev 225 u32 prev = (u32)_InterlockedCompareExchange( local 238 u64 prev = (u64)_InterlockedCompareExchange64( local [all...] |
/openbsd-current/gnu/gcc/libstdc++-v3/libsupc++/ |
H A D | eh_catch.cc | 50 __cxa_exception *prev = globals->caughtExceptions; local 60 if (prev != 0) 81 if (header != prev) 83 header->nextException = prev;
|
/openbsd-current/gnu/lib/libstdc++/libstdc++/libsupc++/ |
H A D | eh_catch.cc | 43 __cxa_exception *prev = globals->caughtExceptions; local 52 if (prev != 0) 72 if (header != prev) 74 header->nextException = prev;
|