/freebsd-10.0-release/contrib/libarchive/libarchive/ |
H A D | archive_entry_sparse.c | 45 sp = entry->sparse_head->next; 86 sp->next = NULL; 93 entry->sparse_tail->next = sp; 108 for (sp = entry->sparse_head; sp != NULL; sp = sp->next) 144 entry->sparse_p = entry->sparse_p->next;
|
/freebsd-10.0-release/libexec/mknetid/ |
H A D | hash.c | 121 cur = cur->next; 144 tmp->next = NULL; 150 tmp->next = cur->groups; 154 cur = cur->next; 164 new->next = table[i];
|
/freebsd-10.0-release/contrib/groff/src/devices/grohtml/ |
H A D | html-table.cpp | 65 p = p->next; 115 last = last->next; 156 last->next = new tab_position; 157 last = last->next; 161 last->next = NULL; 184 for (p = tab; p != NULL; p = p->next) { 201 for (p = tab; (p != NULL) && (n>0); p = p->next) { 214 for (p = tab; (p != NULL) && (n>0); p = p->next) { 231 for (p = tab; p != NULL; p = p->next) { 255 columns = columns->next; [all...] |
/freebsd-10.0-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder.c | 32 lzma_next_coder next; member in struct:lzma_coder_s 73 /// Otherwise we call the next filter in the chain to process in[] and 93 if (coder->next.code == NULL) { 102 ret = coder->next.code(coder->next.coder, allocator, 297 // Round dictionary size up to the next 2^n - 1 so it can 466 lzma_next_end(&coder->next, allocator); 493 &coder->next, allocator, reversed_filters + 1); 498 lzma_lz_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 510 if (next [all...] |
/freebsd-10.0-release/sys/mips/cavium/cryptocteon/ |
H A D | cavium_crypto.c | 100 #define CVM_LOAD_SHA_UNIT(dat, next) { \ 101 if (next == 0) { \ 102 next = 1; \ 104 } else if (next == 1) { \ 105 next = 2; \ 107 } else if (next == 2) { \ 108 next = 3; \ 110 } else if (next == 3) { \ 111 next = 4; \ 113 } else if (next 590 register int next = 0; local 692 register int next = 0; local 797 register int next = 0; local 945 register int next = 0; local 1096 register int next = 0; local 1247 register int next = 0; local 1400 register int next = 0; local 1577 register int next = 0; local 1753 register int next = 0; local 1949 register int next = 0; local [all...] |
/freebsd-10.0-release/contrib/binutils/ld/ |
H A D | mri.c | 38 struct section_name_struct *next; member in struct:section_name_struct 66 *ptr = (*ptr)->next; 68 ptr = &((*ptr)->next); 87 (*ptr)->next = NULL; 137 alist = alist->next) 141 for (olist = order; done == 0 && olist != NULL; olist = olist->next) 169 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next) 170 for (ptr2 = order; ptr2; ptr2 = ptr2->next) 179 for (ptr = order; ptr; ptr = ptr->next) 197 for (aptr = alignment; aptr; aptr = aptr->next) [all...] |
/freebsd-10.0-release/contrib/gcc/ |
H A D | gengtype-yacc.y | 131 for (p = $3; p->next != NULL; p = p->next) 138 p->next = $1; 147 for (p = $6; p->next != NULL; p = p->next) 153 p->next = $1; 164 p->next = $1; 168 p->opt->next = NULL; 175 p->next = $1; 179 p->opt->next [all...] |
H A D | et-forest.c | 47 struct et_occ *next; /* Right son in the splay-tree. */ member in struct:et_occ 99 /* Sets next field of OCC to P. */ 108 occ->next = t; 121 || (occ->next 122 && mson->min > occ->next->min)) 123 mson = occ->next; 148 gcc_assert (occ->next != occ); 149 gcc_assert (!occ->next || occ->next != occ->prev); 151 if (occ->next) [all...] |
H A D | lists.c | 116 alloc_INSN_LIST (rtx val, rtx next) argument 125 XEXP (r, 1) = next; 131 r = gen_rtx_INSN_LIST (VOIDmode, val, next); 140 alloc_EXPR_LIST (int kind, rtx val, rtx next) argument 149 XEXP (r, 1) = next; 153 r = gen_rtx_EXPR_LIST (kind, val, next); 162 alloc_DEPS_LIST (rtx val, rtx next, int ds) argument 171 XEXP (r, 1) = next; 178 r = gen_rtx_DEPS_LIST (VOIDmode, val, next, ds);
|
H A D | tree-ssa-math-opts.c | 122 /* Pointer to the next "struct occurrence"s in the list of blocks 124 struct occurrence *next; member in struct:occurrence 185 *p_occ = occ->next; 186 occ->next = new_occ->children; 189 /* Try the next block (it may as well be dominated by BB). */ 206 *p_occ = occ->next; 207 new_occ->next = occ; 208 occ->next = NULL; 218 /* Nothing special, go on with the next element. */ 219 p_occ = &occ->next; 369 struct occurrence *child, *next; local [all...] |
/freebsd-10.0-release/lib/libz/test/ |
H A D | infcover.c | 51 allocation routines on the next zlib initialization 59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item 99 item->next = zone->first; 114 struct mem_item *item, *next; local 123 /* point next to the item that matches ptr, or NULL if not found -- remove 125 next = zone->first; 126 if (next) { 127 if (next->ptr == ptr) 128 zone->first = next 203 struct mem_item *item, *next; local 248 unsigned next, val; local 449 static unsigned int next = 0; local 622 code *next, table[ENOUGH_DISTS]; local [all...] |
/freebsd-10.0-release/contrib/groff/src/roff/troff/ |
H A D | number.cpp | 205 tok.next(); 209 tok.next(); 221 tok.next(); 260 tok.next(); 263 tok.next(); 265 tok.next(); 269 tok.next(); 274 tok.next(); 276 tok.next(); 280 tok.next(); [all...] |
/freebsd-10.0-release/crypto/heimdal/lib/krb5/ |
H A D | transited.c | 46 struct tr_realm *next; member in struct:tr_realm 55 r = r->next; 89 tmp->next = r->next; 90 r->next = tmp; 93 r->next = tmp->next; 110 tmp->next = r->next; 111 r->next [all...] |
H A D | acl.c | 43 struct acl_field *next, **last; member in struct:acl_field 55 acl = acl->next; 62 struct acl_field *next; local 66 next = acl->next; 68 acl = next; 107 tmp->next = NULL; 112 acl->last = &tmp->next; 148 acl = acl->next;
|
/freebsd-10.0-release/contrib/xz/src/liblzma/common/ |
H A D | stream_decoder.c | 355 // Prepare to decode the next Stream. 404 lzma_stream_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 407 lzma_next_coder_init(&lzma_stream_decoder_init, next, allocator); 415 if (next->coder == NULL) { 416 next->coder = lzma_alloc(sizeof(lzma_coder), allocator); 417 if (next->coder == NULL) 420 next->code = &stream_decode; 421 next->end = &stream_decoder_end; 422 next->get_check = &stream_decoder_get_check; 423 next [all...] |
/freebsd-10.0-release/contrib/libreadline/ |
H A D | undo.c | 85 temp->next = (UNDO_LIST *)NULL; 100 temp->next = rl_undo_list; 114 rl_undo_list = rl_undo_list->next; 151 roving->next = c; 152 roving = roving->next; 154 list = list->next; 157 roving->next = 0; 161 /* Undo the next thing in the list. Return 0 if there 221 rl_undo_list = rl_undo_list->next; 238 for (rl = rl_undo_list; rl; rl = rl->next) [all...] |
/freebsd-10.0-release/lib/libc/net/ |
H A D | getifmaddrs.c | 63 char *next; local 91 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { 92 rtm = (struct rt_msghdr *)(void *)next; 127 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { 128 rtm = (struct rt_msghdr *)(void *)next;
|
/freebsd-10.0-release/sys/boot/i386/libi386/ |
H A D | biossmap.c | 62 struct smap_buf *cur, *next; local 82 next = malloc(sizeof(*next)); 83 if (next == NULL) 85 next->smap = buf.smap; 87 next->xattr = buf.xattr; 90 STAILQ_INSERT_TAIL(&head, next, bufs); 114 next = STAILQ_NEXT(cur, bufs); 116 cur = next;
|
/freebsd-10.0-release/contrib/wpa/src/eap_peer/ |
H A D | eap_methods.c | 31 for (m = eap_methods; m; m = m->next) { 51 for (m = eap_methods; m; m = m->next) { 76 for (m = eap_methods; m; m = m->next) { 103 for (m = eap_methods; m; m = m->next) { 133 for (m = eap_methods; m; m = m->next) 140 for (m = eap_methods; m; m = m->next) { 168 for (m = eap_methods; m; m = m->next) 242 m = m->next; 249 prev->next = m->next; [all...] |
/freebsd-10.0-release/sys/dev/drm/ |
H A D | sis_ds.c | 14 * The above copyright notice and this permission notice (including the next 191 p = p->next; 212 newblock->next = p->next; 214 p->next = newblock; 225 newblock->next = p->next; 227 p->next = newblock; 258 p = p->next; 269 if (p->free && p->next [all...] |
/freebsd-10.0-release/contrib/gdb/gdb/ |
H A D | solib-osf.c | 72 CORE_ADDR next; member in struct:__anon1327 139 ldr_module_t next; member in struct:read_map_ctxt 141 CORE_ADDR next; /* next element in module list */ 372 ctxt->next = LDR_NULL_MODULE; 374 CORE_ADDR ldr_context_addr, prev, next; 385 ctxt->next = ldr_context.head; 437 store the next element in SO, advance CTXT to the next element, and return 450 /* Retrieve the next elemen [all...] |
/freebsd-10.0-release/contrib/com_err/ |
H A D | error.c | 50 for (p = list; p; p = p->next) 60 for (p = list; p; p = p->next) { 87 for (end = list, et = *list; et; end = &et->next, et = et->next) 98 et->next = NULL; 108 et = et->next;
|
/freebsd-10.0-release/contrib/diff/src/ |
H A D | util.c | 36 struct msg *next; member in struct:msg 117 new->next = 0; 118 msg_chain_end = &new->next; 139 struct msg *next = m->next; 145 m = next; 489 struct change *next = script; 491 while (next) 496 this = next; 497 end = (*hunkfun) (next); 137 struct msg *next = m->next; local 483 struct change *next = script; local 657 struct change *next; local [all...] |
/freebsd-10.0-release/contrib/tcpdump/ |
H A D | print-igrp.c | 84 u_int nint, nsys, next; local 94 next = EXTRACT_16BITS(&hdr->ig_nx); 103 next); 115 } else if (next > 0) { 118 --next; 126 if (nint == 0 && nsys == 0 && next == 0)
|
/freebsd-10.0-release/crypto/heimdal/lib/com_err/ |
H A D | error.c | 53 for (p = list; p; p = p->next) 63 for (p = list; p; p = p->next) { 90 for (end = list, et = *list; et; end = &et->next, et = et->next) 101 et->next = NULL; 111 et = et->next;
|