/freebsd-10.0-release/contrib/subversion/subversion/libsvn_fs_base/ |
H A D | key-gen.h | 58 #define NEXT_KEY_KEY "next-key" 61 /* Generate the next key after a given alphanumeric key. 79 void svn_fs_base__next_key(const char *this, apr_size_t *len, char *next);
|
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | key-gen.h | 56 /* Generate the next key after a given alphanumeric key. 74 void svn_fs_fs__next_key(const char *this, apr_size_t *len, char *next);
|
/freebsd-10.0-release/contrib/xz/src/liblzma/common/ |
H A D | block_encoder.h | 44 extern lzma_ret lzma_block_encoder_init(lzma_next_coder *next,
|
H A D | block_decoder.c | 26 lzma_next_coder next; member in struct:lzma_coder_s 84 const lzma_ret ret = coder->next.code(coder->next.coder, 175 lzma_next_end(&coder->next, allocator); 182 lzma_block_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 185 lzma_next_coder_init(&lzma_block_decoder_init, next, allocator); 194 // Allocate and initialize *next->coder if needed. 195 if (next->coder == NULL) { 196 next->coder = lzma_alloc(sizeof(lzma_coder), allocator); 197 if (next [all...] |
H A D | stream_encoder.c | 135 // with the next Block. 266 lzma_stream_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 269 lzma_next_coder_init(&lzma_stream_encoder_init, next, allocator); 274 if (next->coder == NULL) { 275 next->coder = lzma_alloc(sizeof(lzma_coder), allocator); 276 if (next->coder == NULL) 279 next->code = &stream_encode; 280 next->end = &stream_encoder_end; 281 next->update = &stream_encoder_update; 283 next [all...] |
/freebsd-10.0-release/contrib/xz/src/liblzma/delta/ |
H A D | delta_decoder.h | 18 extern lzma_ret lzma_delta_decoder_init(lzma_next_coder *next,
|
H A D | delta_encoder.h | 18 extern lzma_ret lzma_delta_encoder_init(lzma_next_coder *next,
|
H A D | delta_decoder.c | 35 assert(coder->next.code != NULL); 39 const lzma_ret ret = coder->next.code(coder->next.coder, allocator, 50 lzma_delta_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 53 next->code = &delta_decode; 54 return lzma_delta_coder_init(next, allocator, filters);
|
/freebsd-10.0-release/games/random/ |
H A D | randomize_fd.h | 46 struct rand_node *next; member in struct:rand_node
|
/freebsd-10.0-release/usr.sbin/pkg/ |
H A D | dns_utils.h | 40 struct dns_srvinfo *next; member in struct:dns_srvinfo
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | genemit.c | 47 struct clobber_pat *next; member in struct:clobber_pat 56 struct clobber_ent *next; member in struct:clobber_ent 355 for (p = clobber_list; p; p = p->next) 388 p->next = clobber_list; 393 link->next = p->insns; 539 rtx next = XVECEXP (expand, 1, i); 540 if ((GET_CODE (next) == SET && GET_CODE (SET_DEST (next)) == PC) 541 || (GET_CODE (next) == PARALLEL 542 && ((GET_CODE (XVECEXP (next, 535 rtx next = XVECEXP (expand, 1, i); local 649 rtx next = XVECEXP (split, 2, i); local [all...] |
H A D | bitmap.c | 55 elt->next = NULL; 74 bitmap_element *next = elt->next; 78 prev->next = next; 80 if (next) 81 next->prev = prev; 84 head->first = next; 87 make current the next entry in preference to the previous. */ 90 head->current = next ! 73 bitmap_element *next = elt->next; local 698 bitmap_element *next; local 811 bitmap_element *next; local 986 bitmap_element *next; local 1325 bitmap_element *next = a_elt->next; local [all...] |
/freebsd-10.0-release/contrib/binutils/ld/ |
H A D | ldctor.h | 36 struct set_info *next; /* Next set. */ member in struct:set_info 44 struct set_element *next; /* Next element. */ member in struct:set_element
|
/freebsd-10.0-release/contrib/wpa/wpa_supplicant/ |
H A D | config_none.c | 42 for (ssid = config->ssid; ssid; ssid = ssid->next) { 46 for (blob = config->blobs; blob; blob = blob->next) {
|
/freebsd-10.0-release/contrib/gdb/gdb/ |
H A D | f-lang.c | 57 struct saved_fcn *next; member in struct:saved_fcn 65 struct saved_bf_symnum *next; member in struct:saved_bf_symnum 700 tmp->next = NULL; 712 tail_common_list->next = tmp; 735 tmp->next = NULL; 749 current_common->end_of_entries->next = tmp; 772 tmp = tmp->next; 795 tmp = tmp->next; 821 entry = entry->next; 857 tmp = tmp->next; [all...] |
/freebsd-10.0-release/contrib/xz/src/liblzma/simple/ |
H A D | arm.c | 48 arm_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 51 return lzma_simple_coder_init(next, allocator, filters, 57 lzma_simple_arm_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 60 return arm_coder_init(next, allocator, filters, true); 65 lzma_simple_arm_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 68 return arm_coder_init(next, allocator, filters, false);
|
H A D | armthumb.c | 53 armthumb_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 56 return lzma_simple_coder_init(next, allocator, filters, 62 lzma_simple_armthumb_encoder_init(lzma_next_coder *next, argument 65 return armthumb_coder_init(next, allocator, filters, true); 70 lzma_simple_armthumb_decoder_init(lzma_next_coder *next, argument 73 return armthumb_coder_init(next, allocator, filters, false);
|
H A D | powerpc.c | 52 powerpc_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 55 return lzma_simple_coder_init(next, allocator, filters, 61 lzma_simple_powerpc_encoder_init(lzma_next_coder *next, argument 64 return powerpc_coder_init(next, allocator, filters, true); 69 lzma_simple_powerpc_decoder_init(lzma_next_coder *next, argument 72 return powerpc_coder_init(next, allocator, filters, false);
|
H A D | sparc.c | 60 sparc_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument 63 return lzma_simple_coder_init(next, allocator, filters, 69 lzma_simple_sparc_encoder_init(lzma_next_coder *next, argument 72 return sparc_coder_init(next, allocator, filters, true); 77 lzma_simple_sparc_decoder_init(lzma_next_coder *next, argument 80 return sparc_coder_init(next, allocator, filters, false);
|
/freebsd-10.0-release/contrib/byacc/ |
H A D | mkpar.c | 83 temp->next = actions; 124 action *temp, *prev, *next; local 127 for (next = actions; next && next->symbol < symbol; next = next->next) 128 prev = next; 130 while (next [all...] |
/freebsd-10.0-release/sys/dev/isci/scil/ |
H A D | sci_fast_list.h | 62 * circular in nature. This means that the next and prev pointers for 65 * a queue will have its next and prev pointer set to the address of 101 (element)->next = (element)->prev = NULL; \ 137 * This method will get the next dListField in the SCI_FAST_LIST. This method 140 #define sci_fast_list_get_next(element) ((element)->next) 202 struct SCI_FAST_LIST_ELEMENT *next; member in struct:SCI_FAST_LIST_ELEMENT 230 element->next = anchor->list_head; 252 element->next = NULL; 256 anchor->list_tail->next = element; 283 anchor->list_head = anchor->list_head->next; [all...] |
/freebsd-10.0-release/contrib/ntp/libntp/ |
H A D | authkeys.c | 23 struct savekey *next; member in struct:savekey 102 sk = sk->next; 126 sk = sk->next; 151 sk = sk->next; 185 sk->next = authfreekeys; 212 sk = sk->next; 238 key_hash[KEYHASH(keyno)] = sk->next; 240 while (skp->next != sk) 241 skp = skp->next; 242 skp->next [all...] |
/freebsd-10.0-release/contrib/groff/src/libs/libxutil/ |
H A D | DviChar.c | 17 struct map_list *next; member in struct:map_list 36 for (m = world; m; m=m->next) 49 for (m = world; m; m = m->next) 54 m->next = world; 66 DviCharNameHash *h, *next; local 71 for (h = buckets[i]; h; h=next) { 72 next = h->next; 106 h->next = buckets[i]; 121 for (h = map->buckets[i]; h; h=h->next) [all...] |
/freebsd-10.0-release/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-10.0-release/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...] |