/freebsd-9.3-release/contrib/libucl/tests/ |
H A D | test_generate.c | 32 ucl_object_t *obj, *cur, *ar; local 57 cur = ucl_object_fromstring_common (" test string ", 0, UCL_STRING_TRIM); 58 obj = ucl_object_insert_key (obj, cur, "key1", 0, false); 59 cur = ucl_object_fromstring_common (" test \nstring\n ", 0, UCL_STRING_TRIM | UCL_STRING_ESCAPE); 60 obj = ucl_object_insert_key (obj, cur, "key2", 0, false); 61 cur = ucl_object_fromstring_common (" test string \n", 0, 0); 62 obj = ucl_object_insert_key (obj, cur, "key3", 0, false); 64 cur = ucl_object_fromint (10); 65 ar = ucl_array_append (NULL, cur); 66 cur [all...] |
/freebsd-9.3-release/sys/gnu/fs/xfs/ |
H A D | xfs_alloc_btree.h | 61 #define XFS_ALLOC_BLOCK_SIZE(lev,cur) (1 << (cur)->bc_blocklog) 62 #define XFS_ALLOC_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_alloc_mxr[lev != 0]) 63 #define XFS_ALLOC_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_alloc_mnr[lev != 0]) 89 #define XFS_ALLOC_REC_ADDR(bb,i,cur) \ 90 XFS_BTREE_REC_ADDR(XFS_ALLOC_BLOCK_SIZE(0,cur), xfs_alloc, \ 91 bb, i, XFS_ALLOC_BLOCK_MAXRECS(0, cur)) 93 #define XFS_ALLOC_KEY_ADDR(bb,i,cur) \ [all...] |
H A D | xfs_alloc_btree.c | 65 * Delete record pointed to by cur/level. 71 xfs_btree_cur_t *cur, /* btree cursor */ 103 ptr = cur->bc_ptrs[level]; 111 bp = cur->bc_bufs[level]; 114 if ((error = xfs_btree_check_sblock(cur, block, level, bp))) 131 lkp = XFS_ALLOC_KEY_ADDR(block, 1, cur); 132 lpp = XFS_ALLOC_PTR_ADDR(block, 1, cur); 135 if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(lpp[i]), level))) 144 xfs_alloc_log_ptrs(cur, bp, ptr, be16_to_cpu(block->bb_numrecs) - 1); 145 xfs_alloc_log_keys(cur, b 70 xfs_alloc_delrec( xfs_btree_cur_t *cur, int level, int *stat) argument 594 xfs_alloc_insrec( xfs_btree_cur_t *cur, int level, xfs_agblock_t *bnop, xfs_alloc_rec_t *recp, xfs_btree_cur_t **curp, int *stat) argument 859 xfs_alloc_log_keys( xfs_btree_cur_t *cur, xfs_buf_t *bp, int kfirst, int klast) argument 881 xfs_alloc_log_ptrs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int pfirst, int plast) argument 903 xfs_alloc_log_recs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int rfirst, int rlast) argument 939 xfs_alloc_lookup( xfs_btree_cur_t *cur, xfs_lookup_t dir, int *stat) argument 1156 xfs_alloc_lshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1296 xfs_alloc_newroot( xfs_btree_cur_t *cur, int *stat) argument 1451 xfs_alloc_rshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1582 xfs_alloc_split( xfs_btree_cur_t *cur, int level, xfs_agblock_t *bnop, xfs_alloc_key_t *keyp, xfs_btree_cur_t **curp, int *stat) argument 1735 xfs_alloc_updkey( xfs_btree_cur_t *cur, xfs_alloc_key_t *keyp, int level) argument 1779 xfs_alloc_decrement( xfs_btree_cur_t *cur, int level, int *stat) argument 1864 xfs_alloc_delete( xfs_btree_cur_t *cur, int *stat) argument 1898 xfs_alloc_get_rec( xfs_btree_cur_t *cur, xfs_agblock_t *bno, xfs_extlen_t *len, int *stat) argument 1942 xfs_alloc_increment( xfs_btree_cur_t *cur, int level, int *stat) argument 2033 xfs_alloc_insert( xfs_btree_cur_t *cur, int *stat) argument 2092 xfs_alloc_lookup_eq( xfs_btree_cur_t *cur, xfs_agblock_t bno, xfs_extlen_t len, int *stat) argument 2108 xfs_alloc_lookup_ge( xfs_btree_cur_t *cur, xfs_agblock_t bno, xfs_extlen_t len, int *stat) argument 2124 xfs_alloc_lookup_le( xfs_btree_cur_t *cur, xfs_agblock_t bno, xfs_extlen_t len, int *stat) argument 2140 xfs_alloc_update( xfs_btree_cur_t *cur, xfs_agblock_t bno, xfs_extlen_t len) argument [all...] |
H A D | xfs_ialloc_btree.c | 57 * Delete record pointed to by cur/level. 63 xfs_btree_cur_t *cur, /* btree cursor */ 97 mp = cur->bc_mp; 102 ptr = cur->bc_ptrs[level]; 111 bp = cur->bc_bufs[level]; 114 if ((error = xfs_btree_check_sblock(cur, block, level, bp))) 132 kp = XFS_INOBT_KEY_ADDR(block, 1, cur); 133 pp = XFS_INOBT_PTR_ADDR(block, 1, cur); 136 if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(pp[i]), level))) 145 xfs_inobt_log_keys(cur, b 62 xfs_inobt_delrec( xfs_btree_cur_t *cur, int level, int *stat) argument 529 xfs_inobt_insrec( xfs_btree_cur_t *cur, int level, xfs_agblock_t *bnop, xfs_inobt_rec_t *recp, xfs_btree_cur_t **curp, int *stat) argument 771 xfs_inobt_log_keys( xfs_btree_cur_t *cur, xfs_buf_t *bp, int kfirst, int klast) argument 793 xfs_inobt_log_ptrs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int pfirst, int plast) argument 815 xfs_inobt_log_recs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int rfirst, int rlast) argument 838 xfs_inobt_lookup( xfs_btree_cur_t *cur, xfs_lookup_t dir, int *stat) argument 1044 xfs_inobt_lshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1185 xfs_inobt_newroot( xfs_btree_cur_t *cur, int *stat) argument 1333 xfs_inobt_rshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1463 xfs_inobt_split( xfs_btree_cur_t *cur, int level, xfs_agblock_t *bnop, xfs_inobt_key_t *keyp, xfs_btree_cur_t **curp, int *stat) argument 1621 xfs_inobt_updkey( xfs_btree_cur_t *cur, xfs_inobt_key_t *keyp, int level) argument 1665 xfs_inobt_decrement( xfs_btree_cur_t *cur, int level, int *stat) argument 1750 xfs_inobt_delete( xfs_btree_cur_t *cur, int *stat) argument 1785 xfs_inobt_get_rec( xfs_btree_cur_t *cur, xfs_agino_t *ino, __int32_t *fcnt, xfs_inofree_t *free, int *stat) argument 1830 xfs_inobt_increment( xfs_btree_cur_t *cur, int level, int *stat) argument 1921 xfs_inobt_insert( xfs_btree_cur_t *cur, int *stat) argument 1981 xfs_inobt_lookup_eq( xfs_btree_cur_t *cur, xfs_agino_t ino, __int32_t fcnt, xfs_inofree_t free, int *stat) argument 1999 xfs_inobt_lookup_ge( xfs_btree_cur_t *cur, xfs_agino_t ino, __int32_t fcnt, xfs_inofree_t free, int *stat) argument 2017 xfs_inobt_lookup_le( xfs_btree_cur_t *cur, xfs_agino_t ino, __int32_t fcnt, xfs_inofree_t free, int *stat) argument 2036 xfs_inobt_update( xfs_btree_cur_t *cur, xfs_agino_t ino, __int32_t fcnt, xfs_inofree_t free) argument [all...] |
H A D | xfs_ialloc_btree.h | 87 #define XFS_INOBT_BLOCK_SIZE(lev,cur) (1 << (cur)->bc_blocklog) 88 #define XFS_INOBT_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_inobt_mxr[lev != 0]) 89 #define XFS_INOBT_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_inobt_mnr[lev != 0]) 90 #define XFS_INOBT_IS_LAST_REC(cur) \ 91 ((cur)->bc_ptrs[0] == be16_to_cpu(XFS_BUF_TO_INOBT_BLOCK((cur)->bc_bufs[0])->bb_numrecs)) 107 #define XFS_INOBT_REC_ADDR(bb,i,cur) \ [all...] |
H A D | xfs_bmap_btree.c | 82 xfs_btree_cur_t *cur, 101 ip = cur->bc_private.b.ip; 102 whichfork = cur->bc_private.b.whichfork; 105 (void *)func, (void *)s, (void *)ip, (void *)cur, 112 (void *)func, (void *)s, (void *)ip, (void *)cur, 123 xfs_btree_cur_t *cur, 128 xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGBI, line, 140 xfs_btree_cur_t *cur, 146 xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGBII, line, 159 xfs_btree_cur_t *cur, 80 xfs_bmbt_trace_enter( char *func, xfs_btree_cur_t *cur, char *s, int type, int line, __psunsigned_t a0, __psunsigned_t a1, __psunsigned_t a2, __psunsigned_t a3, __psunsigned_t a4, __psunsigned_t a5, __psunsigned_t a6, __psunsigned_t a7, __psunsigned_t a8, __psunsigned_t a9, __psunsigned_t a10) argument 121 xfs_bmbt_trace_argbi( char *func, xfs_btree_cur_t *cur, xfs_buf_t *b, int i, int line) argument 138 xfs_bmbt_trace_argbii( char *func, xfs_btree_cur_t *cur, xfs_buf_t *b, int i0, int i1, int line) argument 157 xfs_bmbt_trace_argfffi( char *func, xfs_btree_cur_t *cur, xfs_dfiloff_t o, xfs_dfsbno_t b, xfs_dfilblks_t i, int j, int line) argument 176 xfs_bmbt_trace_argi( char *func, xfs_btree_cur_t *cur, int i, int line) argument 192 xfs_bmbt_trace_argifk( char *func, xfs_btree_cur_t *cur, int i, xfs_fsblock_t f, xfs_bmbt_key_t *k, int line) argument 215 xfs_bmbt_trace_argifr( char *func, xfs_btree_cur_t *cur, int i, xfs_fsblock_t f, xfs_bmbt_rec_t *r, int line) argument 244 xfs_bmbt_trace_argik( char *func, xfs_btree_cur_t *cur, int i, xfs_bmbt_key_t *k, int line) argument 264 xfs_bmbt_trace_cursor( char *func, xfs_btree_cur_t *cur, char *s, int line) argument 319 xfs_bmbt_delrec( xfs_btree_cur_t *cur, int level, int *stat) argument 692 xfs_bmbt_get_rec( xfs_btree_cur_t *cur, xfs_fileoff_t *off, xfs_fsblock_t *bno, xfs_filblks_t *len, xfs_exntst_t *state, int *stat) argument 733 xfs_bmbt_insrec( xfs_btree_cur_t *cur, int level, xfs_fsblock_t *bnop, xfs_bmbt_rec_t *recp, xfs_btree_cur_t **curp, int *stat) argument 923 xfs_bmbt_killroot( xfs_btree_cur_t *cur) argument 1020 xfs_bmbt_log_keys( xfs_btree_cur_t *cur, xfs_buf_t *bp, int kfirst, int klast) argument 1059 xfs_bmbt_log_ptrs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int pfirst, int plast) argument 1098 xfs_bmbt_lookup( xfs_btree_cur_t *cur, xfs_lookup_t dir, int *stat) argument 1242 xfs_bmbt_lshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1379 xfs_bmbt_rshift( xfs_btree_cur_t *cur, int level, int *stat) argument 1537 xfs_bmbt_split( xfs_btree_cur_t *cur, int level, xfs_fsblock_t *bnop, xfs_bmbt_key_t *keyp, xfs_btree_cur_t **curp, int *stat) argument 1687 xfs_bmbt_updkey( xfs_btree_cur_t *cur, xfs_bmbt_key_t *keyp, int level) argument 1760 xfs_bmbt_decrement( xfs_btree_cur_t *cur, int level, int *stat) argument 1836 xfs_bmbt_delete( xfs_btree_cur_t *cur, int *stat) argument 1929 xfs_bmbt_get_block( xfs_btree_cur_t *cur, int level, xfs_buf_t **bpp) argument 2083 xfs_bmbt_increment( xfs_btree_cur_t *cur, int level, int *stat) argument 2166 xfs_bmbt_insert( xfs_btree_cur_t *cur, int *stat) argument 2227 xfs_bmbt_log_block( xfs_btree_cur_t *cur, xfs_buf_t *bp, int fields) argument 2264 xfs_bmbt_log_recs( xfs_btree_cur_t *cur, xfs_buf_t *bp, int rfirst, int rlast) argument 2292 xfs_bmbt_lookup_eq( xfs_btree_cur_t *cur, xfs_fileoff_t off, xfs_fsblock_t bno, xfs_filblks_t len, int *stat) argument 2306 xfs_bmbt_lookup_ge( xfs_btree_cur_t *cur, xfs_fileoff_t off, xfs_fsblock_t bno, xfs_filblks_t len, int *stat) argument 2324 xfs_bmbt_newroot( xfs_btree_cur_t *cur, int *logflags, int *stat) argument 2713 xfs_bmbt_update( xfs_btree_cur_t *cur, xfs_fileoff_t off, xfs_fsblock_t bno, xfs_filblks_t len, xfs_exntst_t state) argument [all...] |
/freebsd-9.3-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder_hash.h | 42 const uint32_t hash_value = *(const uint16_t *)(cur) 46 = (uint32_t)(cur[0]) | ((uint32_t)(cur[1]) << 8) 50 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \ 53 = (temp ^ ((uint32_t)(cur[2]) << 8)) & mf->hash_mask 56 const uint32_t temp = hash_table[cur[0]] ^ cur[1]; \ 59 = (temp ^ ((uint32_t)(cur[2]) << 8)) & HASH_3_MASK; \ 60 const uint32_t hash_value = (temp ^ ((uint32_t)(cur[ [all...] |
/freebsd-9.3-release/lib/libc/string/ |
H A D | memmem.c | 41 register char *cur, *last; local 60 for (cur = (char *)cl; cur <= last; cur++) 61 if (cur[0] == cs[0] && memcmp(cur, cs, s_len) == 0) 62 return cur;
|
/freebsd-9.3-release/contrib/openpam/lib/libpam/ |
H A D | openpam_set_option.c | 64 pam_chain_t *cur; local 72 cur = pamh->current; 76 for (i = 0; i < cur->optc; ++i) { 77 if (strncmp(cur->optv[i], option, len) == 0 && 78 (cur->optv[i][len] == '\0' || cur->optv[i][len] == '=')) 83 if (i == cur->optc) 85 for (free(cur->optv[i]); i < cur->optc; ++i) 86 cur [all...] |
H A D | openpam_get_option.c | 60 pam_chain_t *cur; local 67 cur = pamh->current; 69 for (i = 0; i < cur->optc; ++i) { 70 if (strncmp(cur->optv[i], option, len) == 0) { 71 if (cur->optv[i][len] == '\0') 72 RETURNS(&cur->optv[i][len]); 73 else if (cur->optv[i][len] == '=') 74 RETURNS(&cur->optv[i][len + 1]);
|
/freebsd-9.3-release/usr.sbin/ppp/ |
H A D | iplist.c | 58 list->cur.pos = -1; 67 if (!inet_aton(range, &list->cur.ip)) 69 list->cur.lstart = ntohl(list->cur.ip.s_addr); 70 list->cur.nItems = 1; 72 if (!do_inet_aton(range, ptr, &list->cur.ip)) 75 list->cur.lstart = ntohl(list->cur.ip.s_addr); 76 list->cur.nItems = 1; 87 list->cur 210 struct iplist_cur cur; local [all...] |
/freebsd-9.3-release/usr.sbin/ctm/mkCTM/ |
H A D | ctm_conf.cvs-cur | 3 set CTMname cvs-cur 7 set CTMmail ctm-cvs-cur-fast@freebsd.org 8 set CTMqueuemail ctm-cvs-cur@freebsd.org 9 set CTMqueue /home/ctm/queue/ctm-cvs-cur
|
H A D | ctm_conf.src-cur | 3 set CTMname src-cur 7 set CTMmail ctm-src-cur-fast@freebsd.org 8 set CTMqueue /home/ctm/queue/ctm-src-cur 9 set CTMqueuemail ctm-src-cur@freebsd.org
|
H A D | ctm_conf.ports-cur | 3 set CTMname ports-cur 7 set CTMmail ctm-ports-cur@freebsd.org
|
H A D | ctm_conf.smp-cur | 3 set CTMname smp-cur 7 set CTMmail smp-cvs-cur@freebsd.org
|
/freebsd-9.3-release/libexec/mknetid/ |
H A D | hash.c | 114 struct member_entry *cur; local 116 cur = table[hashkey(key)]; 118 while (cur) { 119 if (!strcmp(cur->key, key)) 120 return(cur->groups); 121 cur = cur->next; 134 struct member_entry *cur, *new; local 139 cur = table[i]; 148 while (cur) { [all...] |
/freebsd-9.3-release/gnu/lib/libodialog/ |
H A D | raw_popen.c | 63 struct pid *cur; local 70 if ((cur = malloc(sizeof(struct pid))) == NULL) 74 (void)free(cur); 82 (void)free(cur); 117 cur->fp = iop; 118 cur->pid = pid; 119 cur->next = pidlist; 120 pidlist = cur; 133 register struct pid *cur, *last; local 140 for (last = NULL, cur [all...] |
/freebsd-9.3-release/usr.sbin/makefs/ |
H A D | walk.c | 75 fsnode *first, *cur, *prev, *last; local 95 first = cur = join; 96 while (cur->next != NULL) 97 cur = cur->next; 98 prev = cur; 135 cur = join->next; 137 if (cur == NULL || strcmp(cur->name, name) == 0) 139 if (cur 221 fsnode *cur; local 243 fsnode *cur, *next; local 550 fsnode *cur; local [all...] |
/freebsd-9.3-release/contrib/gcc/ |
H A D | sched-vis.c | 45 safe_concat (char *buf, char *cur, const char *str) 50 if (cur > end) 56 while (cur < end && (c = *str++) != '\0') 57 *cur++ = c; 59 *cur = '\0'; 60 return cur; 72 char *cur = buf; 366 cur = safe_concat (buf, cur, "unspec"); 368 cur 44 safe_concat(char *buf, char *cur, const char *str) argument 71 char *cur = buf; local 421 char *cur = buf; local [all...] |
/freebsd-9.3-release/libexec/revnetgroup/ |
H A D | hash.c | 116 struct group_entry *cur; local 118 cur = table[hashkey(key)]; 120 while (cur) { 121 if (!strcmp(cur->key, key)) 122 return(cur->data); 123 cur = cur->next; 178 struct member_entry *cur, *new; local 183 cur = table[i]; 190 while (cur) { [all...] |
/freebsd-9.3-release/contrib/groff/contrib/mm/ |
H A D | mmroff.pl | 22 my (%cur, $rfilename, $max_height, $imacro, $max_width, @out, @indi); 53 %cur = ('id', $1); 62 eval "\$cur{'$1'} = '$2'"; 104 my $w = abs($cur{'llx'}-$cur{'urx'}); 105 my $h = abs($cur{'lly'}-$cur{'ury'}); 109 my $id = $cur{'id'}; 112 push(@out, ".nr pict*llx!$id $cur{'llx'}\n"); 113 push(@out, ".nr pict*lly!$id $cur{'ll [all...] |
/freebsd-9.3-release/contrib/mtree/ |
H A D | spec.c | 111 NODE *centry, *last, *pathparent, *cur; local 183 cur = root; 189 while (cur && 190 strcmp(cur->name, p) != 0) { 191 cur = cur->next; 194 if (cur == NULL || cur->type != F_DIR) { 199 pathparent = cur; 200 cur 263 NODE *cur, *next; local 314 NODE *cur; local 471 replacenode(NODE *cur, NODE *new) argument 711 NODE *cur; /* for stepping through the list */ local [all...] |
/freebsd-9.3-release/release/picobsd/mfs_tree/etc/ |
H A D | login.conf | 22 # Note that entries like "cputime" set both "cputime-cur" and "cputime-max" 26 :datasize-cur=22M:\ 27 :stacksize-cur=8M:\ 28 :memorylocked-cur=10M:\ 29 :memoryuse-cur=30M:\ 32 :maxproc-cur=64:\ 33 :openfiles-cur=64:\ 89 :memoryuse-cur=32M:\ 90 :maxproc-cur=64:\ 91 :openfiles-cur [all...] |
/freebsd-9.3-release/usr.bin/csup/ |
H A D | attrstack.c | 40 size_t cur; member in struct:attrstack 52 as->cur = 0; 60 assert(as->cur > 0); 61 return (as->stack[--as->cur]); 68 if (as->cur >= as->size) { 73 as->stack[as->cur++] = fa; 80 return (as->cur); 87 assert(as->cur == 0);
|
/freebsd-9.3-release/contrib/bind9/lib/lwres/ |
H A D | lwinetntop.c | 118 struct { int base, len; } best, cur; local 132 cur.base = -1; 133 cur.len = 0; 136 if (cur.base == -1) 137 cur.base = i, cur.len = 1; 139 cur.len++; 141 if (cur.base != -1) { 142 if (best.base == -1 || cur.len > best.len) 143 best = cur; [all...] |