/freebsd-11-stable/contrib/diff/src/ |
H A D | context.c | 206 struct change *next = hunk; 213 while (next && next->line0 + next->deleted <= i) 214 next = next->link; 219 if (next && next->line0 <= i) 223 prefix = (next->inserted > 0 ? "!" : "-"); 235 struct change *next 203 struct change *next = hunk; local 232 struct change *next = hunk; local 291 struct change *next; local 428 struct change *next = script->link; local [all...] |
/freebsd-11-stable/contrib/less/ |
H A D | linenum.c | 43 struct linenum_info *next; /* Link to next in the list */ member in struct:linenum_info 46 POSITION gap; /* Gap between prev and next */ 51 * is the distance between the previous one and the next one in the list. 85 p->next = p+1; 86 pool[NPOOL-2].next = NULL; 94 anchor.next = anchor.prev = &anchor; 113 if (p == &anchor || p->next == &anchor) 115 p->gap = p->next->pos - p->prev->pos; 138 for (p = anchor.next; [all...] |
/freebsd-11-stable/contrib/xz/src/liblzma/common/ |
H A D | block_encoder.c | 20 lzma_next_coder next; member in struct:__anon4431 64 const lzma_ret ret = coder->next.code(coder->next.coder, 142 lzma_next_end(&coder->next, allocator); 159 &coder->next, allocator, reversed_filters); 164 lzma_block_encoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument 167 lzma_next_coder_init(&lzma_block_encoder_init, next, allocator); 185 // Allocate and initialize *next->coder if needed. 186 lzma_block_coder *coder = next->coder; 192 next [all...] |
H A D | alone_decoder.c | 19 lzma_next_coder next; member in struct:__anon22 142 const lzma_ret ret = lzma_next_filter_init(&coder->next, 148 lzma_lz_decoder_uncompressed(coder->next.coder, 156 return coder->next.code(coder->next.coder, 173 lzma_next_end(&coder->next, allocator); 200 lzma_alone_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument 203 lzma_next_coder_init(&lzma_alone_decoder_init, next, allocator); 205 lzma_alone_coder *coder = next->coder; 212 next [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_list.h | 41 x->next = nullptr; 45 x->next = nullptr; 46 last_->next = x; 54 x->next = nullptr; 58 x->next = first_; 66 first_ = first_->next; 76 CHECK_EQ(prev->next, x); 77 prev->next = x->next; 95 l->last_->next [all...] |
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | observer.c | 73 struct observer_list *next; member in struct:observer_list 109 observer_list->next = *subject; 132 previous_node->next = current_node->next; 134 *subject = current_node->next; 139 current_node = current_node->next; 158 current_node = current_node->next;
|
/freebsd-11-stable/contrib/gcc/config/ |
H A D | sol2.c | 43 tree *x, next; local 59 next = TREE_CHAIN (*x); 61 *x = next; 76 next = TREE_CHAIN (*x); 78 *x = next; 93 next = TREE_CHAIN (*x); 95 *x = next;
|
/freebsd-11-stable/contrib/groff/src/libs/libbib/ |
H A D | search.cpp | 48 search_item *tem = list->next; 68 for (pp = &list; *pp; pp = &(*pp)->next) 78 for (search_item *ptr = list; ptr; ptr = ptr->next) 97 int search_list_iterator::next(const char **pp, int *lenp, reference_id *ridp) function in class:search_list_iterator 102 if (iter->next(searcher, pp, lenp, ridp)) 106 ptr = ptr->next; 112 : name(strsave(nm)), filename_id(fid), next(0)
|
/freebsd-11-stable/contrib/wpa/wpa_supplicant/ |
H A D | blacklist.c | 33 e = e->next; 77 e->next = wpa_s->blacklist; 103 wpa_s->blacklist = e->next; 105 prev->next = e->next; 113 e = e->next; 134 e = e->next;
|
/freebsd-11-stable/gnu/usr.bin/rcs/lib/ |
H A D | rcskeys.c | 99 /* try next keyword */ 124 char *copy, *next; local 128 next = copy; 129 switch (*next++) { 143 key = strtok(next, ","); 163 char *copy, *next, *key; local 167 next = copy; 168 key = strtok(next, "=");
|
/freebsd-11-stable/contrib/netbsd-tests/lib/libbluetooth/ |
H A D | t_sdp_put.c | 58 test.end = test.next; 59 test.next = buf; 67 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); 68 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); 90 value.next += 1; // skip "nil" 92 test.end = test.next; 93 test.next = buf; 100 ATF_REQUIRE_EQ(test.end - test.next, sizeof(expect)); 101 ATF_CHECK(memcmp(expect, test.next, sizeof(expect)) == 0); 144 test.end = test.next; [all...] |
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/ |
H A D | list.h | 35 #define ISC_LINK(type) struct { type *prev, *next; } 39 (elt)->link.next = (type *)(-1); \ 56 (elt)->link.next = (list).head; \ 72 (list).tail->link.next = (elt); \ 76 (elt)->link.next = NULL; \ 91 if ((elt)->link.next != NULL) \ 92 (elt)->link.next->link.prev = (elt)->link.prev; \ 98 (elt)->link.prev->link.next = (elt)->link.next; \ 101 (list).head = (elt)->link.next; \ [all...] |
/freebsd-11-stable/contrib/gdb/gdb/gdbserver/ |
H A D | inferiors.c | 45 new_inferior->next = NULL; 47 list->tail->next = new_inferior; 57 struct inferior_list_entry *cur = list->head, *next; local 61 next = cur->next; 63 cur = next; 85 list->head = entry->next; 92 while (*cur && (*cur)->next != entry) 93 cur = &(*cur)->next; 98 (*cur)->next [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
H A D | zfs_rlock.c | 273 rl_t *next; local 299 next = prev; 301 next = (rl_t *)avl_nearest(tree, where, AVL_AFTER); 303 if (next == NULL || off + len <= next->r_off) { 309 if (off < next->r_off) { 311 zfs_range_new_proxy(tree, off, next->r_off - off); 321 for (prev = NULL; next; prev = next, next 359 rl_t *prev, *next; local 466 rl_t *rl, *next = NULL; local [all...] |
/freebsd-11-stable/contrib/tcsh/ |
H A D | sh.parse.c | 67 } while (asyntax(lexp->next, lexp) != 0); 76 p1 = p1->next; 87 for (p = p1; p != p2; p = p->next) 101 if (p->next != p2 && eq(p->next->word, STRand)) 102 p = p->next; 113 return asyntax(p->next, p2); 145 if (p2 == p1->next) 147 return asyn0(p1->next, p2); 162 if (p1->word[0] && eq(p1->word, alout.next [all...] |
/freebsd-11-stable/lib/libc/stdlib/ |
H A D | rand.c | 88 static u_long next = 1; variable 93 return (do_rand(&next)); 99 next = seed; 116 len = sizeof(next); 120 sysctl(mib, 2, (void *)&next, &len, NULL, 0); 137 printf("next random number = %d\n", rand()); 144 printf("next random number = %d\n", rand_r(&myseed));
|
/freebsd-11-stable/lib/libpam/modules/pam_guest/ |
H A D | pam_guest.c | 51 const char *next; local 58 if ((next = strchr(list, ',')) == NULL) 59 next = strchr(list, '\0'); 60 if (next - list == (ptrdiff_t)len && 63 list = next;
|
/freebsd-11-stable/usr.bin/gprof/ |
H A D | printlist.c | 71 slp -> next = listp -> next; 73 listp -> next = slp; 81 for ( slp = listp -> next ; slp ; slp = slp -> next ) {
|
/freebsd-11-stable/usr.sbin/cron/cron/ |
H A D | job.c | 28 struct _job *next; member in struct:_job 45 for (j=jhead; j; j=j->next) 51 j->next = (job*) NULL; 57 else { jtail->next=j; } 70 jn = j->next;
|
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_stack.h | 36 struct ck_stack_entry *next; member in struct:ck_stack_entry 59 entry->next = stack; 63 entry->next = stack; 83 entry->next = stack; 98 struct ck_stack_entry *entry, *next; local 105 next = entry->next; 106 while (ck_pr_cas_ptr_value(&target->head, entry, next, &entry) == false) { 111 next = entry->next; [all...] |
/freebsd-11-stable/sbin/nandfs/ |
H A D | lssnap.c | 76 uint64_t next; local 97 for (next = 1; next != 0; next = cpinfos[nsnap - 1].nci_next) { 98 nsnap = nandfs_get_snap(&fs, next, cpinfos, NCPINFO);
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/ |
H A D | diff3.c | 66 start_position[0] = start_position[0]->next; 69 start_position[1] = start_position[1]->next; 80 position[0] = position[0]->next; 81 position[1] = position[1]->next; 130 lcs->next = NULL; 135 lcs_ref = &lcs->next; 159 position[0] = position[0]->next; 161 *position_list1 = position[0]->next; 162 position[0]->next = start_position[0]; 173 position[1] = position[1]->next; [all...] |
/freebsd-11-stable/usr.sbin/pmcstudy/ |
H A D | eval_expr.c | 58 at->next = ex; 111 if (exp->next == NULL) { 115 if ((exp->next->type == TYPE_OP_PLUS) || 116 (exp->next->type == TYPE_OP_MINUS) || 117 (exp->next->type == TYPE_OP_DIVIDE) || 118 (exp->next->type == TYPE_OP_MULT)) { 133 if (validate_expr(exp->next, 0, 0, 0, op_cnt) == 0) { 139 return(validate_expr(exp->next, 0, 0, 0, op_cnt)); 168 return(validate_expr(exp->next, val1, op, val2, op_cnt)); 207 print_exp(exp->next); [all...] |
/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | cpu-arc.c | 26 #define ARC(mach, print_name, default_p, next) \ 39 next, \ 67 for (p = &bfd_arc_arch; p != NULL; p = p->next)
|
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | xatexit.c | 51 struct xatexit *next; /* next in list */ member in struct:xatexit 52 int ind; /* next index in this table */ 81 p->next = xatexit_head; 96 for (p = xatexit_head; p; p = p->next)
|