/freebsd-10-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-10-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-10-stable/contrib/openpam/t/ |
H A D | t_file.c | 75 if ((tf->next = tflist) != NULL) 76 tf->next->prev = tf; 139 tflist = tf->next; 141 tf->prev->next = tf->next; 142 if (tf->next) 143 tf->next->prev = tf->prev;
|
/freebsd-10-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-10-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-10-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-10-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-10-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-10-stable/lib/libdwarf/ |
H A D | dwarf_die.c | 87 Dwarf_Die next; local 98 if ((next = STAILQ_NEXT(die, die_next)) == NULL || 99 next->die_level != die->die_level + 1) { 104 *ret_die = next; 130 Dwarf_Die next; local 155 next = die; 156 while ((next = STAILQ_NEXT(next, die_next)) != NULL) { 157 if (next->die_level < die->die_level) { 158 next [all...] |
/freebsd-10-stable/sbin/fsck_msdosfs/ |
H A D | fat.c | 133 checkclnum(struct bootblock *boot, u_int fat, cl_t cl, cl_t *next) argument 135 if (*next >= (CLUST_RSRVD&boot->ClustMask)) 136 *next |= ~boot->ClustMask; 137 if (*next == CLUST_FREE) { 141 if (*next == CLUST_BAD) { 145 if (*next < CLUST_FIRST 146 || (*next >= boot->NumClusters && *next < CLUST_EOFS)) { 149 *next < CLUST_RSRVD ? "out of range" : "reserved", 150 *next [all...] |
/freebsd-10-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-10-stable/contrib/tcsh/ |
H A D | sh.parse.c | 70 } while (asyntax(lexp->next, lexp) != 0); 79 p1 = p1->next; 90 for (p = p1; p != p2; p = p->next) 104 if (p->next != p2 && eq(p->next->word, STRand)) 105 p = p->next; 116 return asyntax(p->next, p2); 148 if (p2 == p1->next) 150 return asyn0(p1->next, p2); 165 if (p1->word[0] && eq(p1->word, alout.next [all...] |
/freebsd-10-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-10-stable/sbin/nandfs/ |
H A D | lssnap.c | 74 uint64_t next; local 95 for (next = 1; next != 0; next = cpinfos[nsnap - 1].nci_next) { 96 nsnap = nandfs_get_snap(&fs, next, cpinfos, NCPINFO);
|
/freebsd-10-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-10-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-10-stable/lib/libc/stdlib/ |
H A D | rand.c | 89 static u_long next = 1; variable 94 return (do_rand(&next)); 100 next = seed; 117 len = sizeof(next); 121 sysctl(mib, 2, (void *)&next, &len, NULL, 0); 138 printf("next random number = %d\n", rand()); 145 printf("next random number = %d\n", rand_r(&myseed));
|
/freebsd-10-stable/sbin/rcorder/ |
H A D | rcorder.c | 99 provnode *next, *last; member in struct:provnode 104 f_provnode *next; member in struct:f_provnode 109 f_reqnode *next; member in struct:f_reqnode 114 strnodelist *next; member in struct:strnodelist 121 filenode *next, *last; member in struct:filenode 217 ent->next = *listp; 248 temp->next = fn_head->next; 249 if (temp->next != NULL) 250 temp->next [all...] |
/freebsd-10-stable/contrib/subversion/subversion/libsvn_diff/ |
H A D | diff3.c | 65 start_position[0] = start_position[0]->next; 68 start_position[1] = start_position[1]->next; 79 position[0] = position[0]->next; 80 position[1] = position[1]->next; 129 lcs->next = NULL; 134 lcs_ref = &lcs->next; 158 position[0] = position[0]->next; 160 *position_list1 = position[0]->next; 161 position[0]->next = start_position[0]; 172 position[1] = position[1]->next; [all...] |
/freebsd-10-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-10-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-10-stable/contrib/binutils/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)
|
/freebsd-10-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)
|
/freebsd-10-stable/contrib/gdb/gdb/config/rs6000/ |
H A D | tm-rs6000.h | 80 (fromleaf ? DEPRECATED_SAVED_PC_AFTER_CALL (prev->next) : \ 81 prev->next ? DEPRECATED_FRAME_SAVED_PC (prev->next) : read_pc ())
|
/freebsd-10-stable/sys/cddl/dev/dtrace/ |
H A D | dtrace_vtime.c | 84 dtrace_vtime_switch(kthread_t *next) argument 97 if (next != NULL) 98 next->t_dtrace_start = ts;
|