/openbsd-current/lib/libc/yp/ |
H A D | ypexclude.c | 60 struct _ypexclude *curr; local 62 for (curr = *headp; curr; curr = curr->next) { 63 if (strcmp(curr->name, name) == 0) 72 struct _ypexclude *curr, *next; local 74 for (curr = *headp; curr; curr [all...] |
/openbsd-current/gnu/lib/libiberty/src/ |
H A D | ternary.c | 40 ternary_tree curr, *pcurr; local 45 while ((curr = *pcurr)) 48 diff = *s - curr->splitchar; 56 curr->eqkid = (ternary_tree) data; 57 return (PTR) curr->eqkid; 59 pcurr = &(curr->eqkid); 64 pcurr = &(curr->lokid); 69 pcurr = &(curr->hikid); 73 the string, into the tree rooted at curr */ 78 curr 113 const ternary_node *curr; local [all...] |
/openbsd-current/bin/cp/ |
H A D | cp.c | 272 FTSENT *curr; local 279 for (rval = 0; (curr = fts_read(ftsp)) != NULL;) { 280 switch (curr->fts_info) { 285 curr->fts_path, strerror(curr->fts_errno)); 289 warnx("%s: directory causes a cycle", curr->fts_path); 318 if (curr->fts_level == FTS_ROOTLEVEL) { 320 p = find_last_component(curr->fts_path); 321 base = p - curr->fts_path; 323 if (!strcmp(&curr [all...] |
/openbsd-current/gnu/usr.bin/perl/t/ |
H A D | thread_it.pl | 35 my $curr = threads->create({ 45 curr_test($curr) if defined $curr;
|
/openbsd-current/usr.bin/less/ |
H A D | line.c | 35 static int curr; /* Total number of bytes in linebuf */ variable 126 curr = 0; 162 linebuf[curr] = ' '; 165 attr[curr] = AT_NORMAL|AT_HILITE; 167 attr[curr] = AT_NORMAL; 168 curr++; 183 snprintf(linebuf+curr, size_linebuf-curr, "%*s ", n, buf); 186 attr[curr+i] = AT_NORMAL; 187 curr [all...] |
/openbsd-current/bin/mv/ |
H A D | cp.c | 213 FTSENT *curr; local 220 for (rval = 0; (curr = fts_read(ftsp)) != NULL;) { 221 switch (curr->fts_info) { 226 curr->fts_path, strerror(curr->fts_errno)); 230 warnx("%s: directory causes a cycle", curr->fts_path); 259 if (curr->fts_level == FTS_ROOTLEVEL) { 261 p = find_last_component(curr->fts_path); 262 base = p - curr->fts_path; 264 if (!strcmp(&curr [all...] |
/openbsd-current/usr.sbin/smtpd/ |
H A D | tree.c | 179 struct treeentry *curr = *hdl; local 181 if (curr == NULL) 182 curr = SPLAY_MIN(_tree, &t->tree); 184 curr = SPLAY_NEXT(_tree, &t->tree, curr); 186 if (curr) { 187 *hdl = curr; 189 *id = curr->id; 191 *data = curr->data; 201 struct treeentry *curr local [all...] |
H A D | dict.c | 192 struct dictentry *curr = *hdl; local 194 if (curr == NULL) 195 curr = SPLAY_MIN(_dict, &d->dict); 197 curr = SPLAY_NEXT(_dict, &d->dict, curr); 199 if (curr) { 200 *hdl = curr; 202 *k = curr->key; 204 *data = curr->data; 215 struct dictentry *curr local [all...] |
/openbsd-current/lib/libssl/ |
H A D | ssl_ciph.c | 552 ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, argument 555 if (curr == *tail) 557 if (curr == *head) 558 *head = curr->next; 559 if (curr->prev != NULL) 560 curr->prev->next = curr->next; 561 if (curr->next != NULL) 562 curr->next->prev = curr 570 ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, CIPHER_ORDER **tail) argument 738 CIPHER_ORDER *head, *tail, *curr, *next, *last; local 839 CIPHER_ORDER *curr; local 1151 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
H A D | pqueue.c | 107 pitem *curr, *next; local 114 for (curr = NULL, next = pq->items; next != NULL; 115 curr = next, next = next->next) { 123 if (curr == NULL) 126 curr->next = item; 134 curr->next = item;
|
/openbsd-current/gnu/llvm/llvm/utils/ |
H A D | pipeline.py | 8 curr = [] 14 curr.append([None, tok]) 17 stack.append([kind, curr]) 19 curr = [] 23 curr.append([None, tok]) 26 oldCurr = curr 27 [kind, curr] = stack.pop() 28 curr.append([oldKind, oldCurr]) 32 curr.append([None, tok]) 33 return curr [all...] |
/openbsd-current/sys/lib/libz/ |
H A D | inftrees.c | 37 unsigned curr; /* number of index bits for current table */ local 144 filled is at next and has curr index bits. The code being used is huff 146 bits off of the bottom. For codes where len is less than drop + curr, 147 those top drop + curr - len bits are incremented through all values to 195 curr = root; /* current table index bits */ 225 fill = 1U << curr; 257 next += min; /* here min is 1 << curr */ 260 curr = len - drop; 261 left = (int)(1 << curr); 262 while (curr [all...] |
/openbsd-current/lib/libz/ |
H A D | inftrees.c | 37 unsigned curr; /* number of index bits for current table */ local 144 filled is at next and has curr index bits. The code being used is huff 146 bits off of the bottom. For codes where len is less than drop + curr, 147 those top drop + curr - len bits are incremented through all values to 195 curr = root; /* current table index bits */ 225 fill = 1U << curr; 257 next += min; /* here min is 1 << curr */ 260 curr = len - drop; 261 left = (int)(1 << curr); 262 while (curr [all...] |
/openbsd-current/gnu/usr.bin/perl/cpan/Compress-Raw-Zlib/zlib-src/ |
H A D | inftrees.c | 44 unsigned curr; /* number of index bits for current table */ local 151 filled is at next and has curr index bits. The code being used is huff 153 bits off of the bottom. For codes where len is less than drop + curr, 154 those top drop + curr - len bits are incremented through all values to 202 curr = root; /* current table index bits */ 232 fill = 1U << curr; 264 next += min; /* here min is 1 << curr */ 267 curr = len - drop; 268 left = (int)(1 << curr); 269 while (curr [all...] |
/openbsd-current/games/backgammon/common_source/ |
H A D | table.c | 75 int curr, curc; local 80 getyx(stdscr, curr, curc); 82 mvprintw(curr, 32, "Move: "); 98 getyx(stdscr, curr, curc); 99 move(curr, curc - 1); 108 getyx(stdscr, curr, curc); 109 move(curr, 39); 113 getyx(stdscr, curr, curc); 114 move(curr, 39);
|
/openbsd-current/gnu/llvm/compiler-rt/lib/profile/ |
H A D | GCDAProfiling.c | 128 struct fn_node* curr = list->head; local 132 while (curr) { 133 next = curr->next; 135 if (curr->id == CURRENT_ID) { 136 if (curr == list->head) { 140 if (curr == list->tail) { 148 free(curr); 150 prev = curr; 153 curr = next; 543 struct fn_node *curr local 577 struct fn_node *curr = reset_fn_list.head; local [all...] |
/openbsd-current/lib/libc/asr/ |
H A D | getrrsetbyname_async.c | 434 struct dns_query *head, *curr, *prev; local 444 for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) { 451 curr = calloc(1, sizeof(struct dns_query)); 452 if (curr == NULL) 455 head = curr; 457 prev->next = curr; 466 curr->name = strdup(name); 467 if (curr->name == NULL) { 476 curr->type = _getshort(*cp); 481 curr 493 struct dns_rr *head, *curr, *prev; local [all...] |
/openbsd-current/sys/dev/pci/drm/i915/ |
H A D | i915_scatterlist.h | 29 unsigned int curr; member in struct:sgt_iter 37 s.max = s.curr = s.sgp->offset; 91 ((__dp) = (__iter).dma + (__iter).curr), (__iter).sgp; \ 92 (((__iter).curr += (__step)) >= (__iter).max) ? \ 104 pfn_to_page((__iter).pfn + ((__iter).curr >> PAGE_SHIFT))); \ 105 (((__iter).curr += PAGE_SIZE) >= (__iter).max) ? \
|
H A D | i915_mm.c | 46 return (r->sgt.dma + r->sgt.curr + r->iobase) >> PAGE_SHIFT; 48 return r->sgt.pfn + (r->sgt.curr >> PAGE_SHIFT); 65 r->sgt.curr += PAGE_SIZE; 66 if (r->sgt.curr >= r->sgt.max)
|
/openbsd-current/gnu/usr.bin/perl/win32/include/ |
H A D | dirent.h | 36 char *curr; /* current position */ member in struct:_dir_struc
|
/openbsd-current/gnu/gcc/gcc/config/ia64/ |
H A D | unwind-ia64.c | 165 struct unw_reg_state curr; /* current state */ member in struct:unw_state_record 373 memcpy (rs, &sr->curr, sizeof (*rs)); 374 sr->curr.next = rs; 380 struct unw_reg_state *rs = sr->curr.next; 384 memcpy (&sr->curr, rs, sizeof(*rs)); 526 reg = sr->curr.reg + save_order[i]; 547 regs[0] = sr->curr.reg + UNW_REG_F2; 548 regs[1] = sr->curr.reg + UNW_REG_R4; 549 regs[2] = sr->curr.reg + UNW_REG_B1; 557 spill_next_when (®s[kind - 1], sr->curr [all...] |
H A D | linux-unwind.h | 112 fs->curr.reg[UNW_REG_RP].where = UNW_WHERE_SPREL; 113 fs->curr.reg[UNW_REG_RP].val 115 fs->curr.reg[UNW_REG_RP].when = -1; 190 fs->curr.reg[UNW_REG_PFS].where = UNW_WHERE_NONE;
|
/openbsd-current/gnu/usr.bin/gcc/gcc/config/ia64/ |
H A D | unwind-ia64.c | 161 struct unw_reg_state curr; /* current state */ member in struct:unw_state_record 368 memcpy (rs, &sr->curr, sizeof (*rs)); 369 sr->curr.next = rs; 375 struct unw_reg_state *rs = sr->curr.next; 379 memcpy (&sr->curr, rs, sizeof(*rs)); 521 reg = sr->curr.reg + save_order[i]; 542 regs[0] = sr->curr.reg + UNW_REG_F2; 543 regs[1] = sr->curr.reg + UNW_REG_R4; 544 regs[2] = sr->curr.reg + UNW_REG_B1; 552 spill_next_when (®s[kind - 1], sr->curr [all...] |
H A D | linux.h | 118 (FS)->curr.reg[UNW_REG_RP].where = UNW_WHERE_SPREL; \ 119 (FS)->curr.reg[UNW_REG_RP].val \ 121 (FS)->curr.reg[UNW_REG_RP].when = -1; \ 176 (FS)->curr.reg[UNW_REG_PFS].where = UNW_WHERE_NONE; \
|
/openbsd-current/usr.sbin/unbound/util/data/ |
H A D | msgencode.c | 864 struct edns_option* curr, *prev = NULL; local 873 curr = *list; 874 while(curr) { 875 if(curr->opt_code == LDNS_EDNS_EDE) { 876 if(curr->opt_len >= 2 && sldns_read_uint16( 877 curr->opt_data) == LDNS_EDE_OTHER) { 882 prev->next = curr->next; 883 curr = curr->next; 884 } else if(curr [all...] |