Searched refs:cur (Results 1 - 25 of 399) sorted by relevance

1234567891011>>

/freebsd-head/contrib/xz/src/liblzma/lz/
H A Dlz_encoder_hash.h42 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-head/contrib/libucl/tests/
H A Dtest_generate.c44 ucl_object_t *obj, *cur, *ar, *ar1, *ref, *test_obj, *comments; local
74 cur = ucl_object_fromstring_common ("value1", 0, UCL_STRING_TRIM);
75 ucl_object_insert_key (obj, cur, "key0", 0, false);
76 cur = ucl_object_fromdouble (0.1);
77 assert (ucl_object_replace_key (obj, cur, "key0", 0, false));
80 cur = ucl_object_fromstring_common (" test string ", 0, UCL_STRING_TRIM);
81 ucl_object_insert_key (obj, cur, "key1", 0, false);
82 cur = ucl_object_fromstring_common (" test \nstring\n\r\n\b\t\f\\\" ", 0,
84 ucl_object_insert_key (obj, cur, "key2", 0, false);
85 cur
[all...]
H A Dtest_streamline.c32 ucl_object_t *obj, *cur, *ar; local
58 cur = ucl_object_fromstring_common (" test string ", 0, UCL_STRING_TRIM);
59 ucl_object_insert_key (obj, cur, "key1", 0, false);
60 cur = ucl_object_fromstring_common (" test \nstring\n ", 0, UCL_STRING_TRIM | UCL_STRING_ESCAPE);
61 ucl_object_insert_key (obj, cur, "key2", 0, false);
62 cur = ucl_object_fromstring_common (" test string \n", 0, 0);
63 ucl_object_insert_key (obj, cur, "key3", 0, false);
76 cur = ucl_object_fromint (10);
77 ucl_object_emit_streamline_add_object (ctx, cur);
78 cur
[all...]
H A Dtest_msgpack.c208 uint64_t cur; local
215 cur = ((uint64_t)pcg32_random ()) << 32 | pcg32_random ();
216 ucl_array_append (res, ucl_object_fromint (cur % 128));
217 ucl_array_append (res, ucl_object_fromint (-(cur % 128)));
218 cur = ((uint64_t)pcg32_random ()) << 32 | pcg32_random ();
219 ucl_array_append (res, ucl_object_fromint (cur % UINT16_MAX));
220 ucl_array_append (res, ucl_object_fromint (-(cur % INT16_MAX)));
221 cur = ((uint64_t)pcg32_random ()) << 32 | pcg32_random ();
222 ucl_array_append (res, ucl_object_fromint (cur % UINT32_MAX));
223 ucl_array_append (res, ucl_object_fromint (-(cur
321 ucl_object_t *res, *cur; local
367 ucl_object_t *res, *cur; local
393 ucl_object_t *res, *cur; local
428 ucl_object_t *res, *cur; local
[all...]
/freebsd-head/sys/libkern/
H A Dmemmem.c38 char *cur, *last; local
57 for (cur = __DECONST(char *, cl); cur <= last; cur++)
58 if (cur[0] == cs[0] && memcmp(cur, cs, s_len) == 0)
59 return cur;
/freebsd-head/contrib/openpam/lib/libpam/
H A Dopenpam_set_option.c64 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 Dopenpam_get_option.c60 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-head/usr.sbin/ppp/
H A Diplist.c60 list->cur.pos = -1;
69 if (!inet_aton(range, &list->cur.ip))
71 list->cur.lstart = ntohl(list->cur.ip.s_addr);
72 list->cur.nItems = 1;
74 if (!do_inet_aton(range, ptr, &list->cur.ip))
77 list->cur.lstart = ntohl(list->cur.ip.s_addr);
78 list->cur.nItems = 1;
89 list->cur
212 struct iplist_cur cur; local
[all...]
/freebsd-head/libexec/mknetid/
H A Dhash.c116 struct member_entry *cur; local
118 cur = table[hashkey(key)];
120 while (cur) {
121 if (!strcmp(cur->key, key))
122 return(cur->groups);
123 cur = cur->next;
136 struct member_entry *cur, *new; local
141 cur = table[i];
150 while (cur) {
[all...]
/freebsd-head/usr.sbin/makefs/
H A Dwalk.c78 fsnode *first, *cur, *prev, *last; local
99 first = cur = join;
100 while (cur->next != NULL)
101 cur = cur->next;
102 prev = cur;
139 cur = join->next;
141 if (cur == NULL || strcmp(cur->name, name) == 0)
143 if (cur
224 fsnode *cur; local
259 fsnode *cur, *next; local
564 fsnode *cur; local
[all...]
/freebsd-head/contrib/elftoolchain/libelftc/
H A Dlibelftc_dem_gnu3.c102 const char *cur; /* current mangled name ptr */ member in struct:cpp_demangle_data
240 if (*ddata.cur != 0 && ddata.subst.size >= 1) {
262 while (*ddata.cur != '\0') {
266 if (*ddata.cur == '@' && *(ddata.cur + 1) == '@')
339 cpp_demangle_data_init(struct cpp_demangle_data *d, const char *cur) argument
342 if (d == NULL || cur == NULL)
371 d->cur = cur;
401 fp = ddata->cur;
[all...]
/freebsd-head/contrib/gcc/
H A Dsched-vis.c45 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...]
H A Dtree-iterator.c70 struct tree_statement_list_node *head, *tail, *cur; local
102 cur = i->ptr;
105 if (cur)
107 head->prev = cur->prev;
112 tail->next = cur;
113 cur->prev = tail;
146 struct tree_statement_list_node *head, *tail, *cur; local
178 cur = i->ptr;
181 if (cur)
183 tail->next = cur
221 struct tree_statement_list_node *cur, *next, *prev; local
248 struct tree_statement_list_node *cur, *next; local
275 struct tree_statement_list_node *cur, *prev; local
[all...]
/freebsd-head/contrib/libcxxrt/
H A Dlibelftc_dem_gnu3.c94 const char *cur; /* current mangled name ptr */ member in struct:cpp_demangle_data
354 size_t cur, i, len; local
370 cur = 0;
373 memcpy(rtn + cur, v->container[i], len);
374 cur += len;
376 rtn[cur] = '\0';
499 while (*ddata.cur != '\0') {
503 if (*ddata.cur == '@' && *(ddata.cur + 1) == '@')
546 cpp_demangle_data_init(struct cpp_demangle_data *d, const char *cur) argument
[all...]
/freebsd-head/libexec/revnetgroup/
H A Dhash.c118 struct group_entry *cur; local
120 cur = table[hashkey(key)];
122 while (cur) {
123 if (!strcmp(cur->key, key))
124 return(cur->data);
125 cur = cur->next;
180 struct member_entry *cur, *new; local
185 cur = table[i];
192 while (cur) {
[all...]
/freebsd-head/contrib/mtree/
H A Dspec.c112 NODE *centry, *last, *pathparent, *cur; local
184 cur = root;
190 while (cur &&
191 strcmp(cur->name, p) != 0) {
192 cur = cur->next;
195 if (cur == NULL || cur->type != F_DIR) {
200 pathparent = cur;
201 cur
270 NODE *cur, *next; local
321 NODE *cur; local
486 replacenode(NODE *cur, NODE *new) argument
726 NODE *cur; /* for stepping through the list */ local
[all...]
/freebsd-head/release/picobsd/mfs_tree/etc/
H A Dlogin.conf22 # 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-head/usr.sbin/autofs/
H A Dpopen.c80 struct pid *cur, *p; local
93 cur = malloc(sizeof(struct pid));
94 if (cur == NULL)
113 cur->command = checked_strdup(command);
137 cur->outfp = fdopen(outfds[0], "r");
142 cur->pid = pid;
143 SLIST_INSERT_HEAD(&pidlist, cur, next);
145 return (cur->outfp);
151 struct pid *cur, *last = NULL; local
158 SLIST_FOREACH(cur,
[all...]
/freebsd-head/contrib/blacklist/port/
H A Dpopenve.c83 struct pid *cur; local
112 if ((cur = malloc(sizeof(*cur))) != NULL)
113 return cur;
154 pdes_parent(int *pdes, struct pid *cur, pid_t pid, const char *type) argument
162 cur->fd = pdes[0];
168 cur->fd = pdes[1];
174 cur->fp = iop;
175 cur->pid = pid;
176 cur
181 pdes_error(int *pdes, struct pid *cur) argument
191 struct pid *cur; local
235 struct pid *cur, *last; local
[all...]
/freebsd-head/contrib/gcclibs/libcpp/
H A Ddirectives-only.c42 const unsigned char *cur, *base, *next_line, *rlimit; local
52 buffer->cur = buffer->line_base = buffer->next_line;
59 next_line = cur = base = buffer->cur;
65 for (last_c = '\n', c = *cur; cur < rlimit; last_c = c, c = *++cur, ++col)
70 const unsigned char *tmp = cur + 1;
81 cur = tmp;
97 buffer->next_line = cur;
[all...]
H A Dtraditional.c105 if (n > (size_t) (pfile->out.limit - pfile->out.cur))
107 size_t size = pfile->out.cur - pfile->out.base;
112 pfile->out.cur = pfile->out.base + size;
117 Buffer->cur points to the initial asterisk of the comment. */
121 const uchar *cur = pfile->buffer->cur; local
123 cur++;
124 if (*cur == '/')
125 cur++;
129 while(! (*cur
148 copy_comment(cpp_reader *pfile, const uchar *cur, int in_define) argument
212 skip_whitespace(cpp_reader *pfile, const uchar *cur, int skip_comments) argument
244 lex_identifier(cpp_reader *pfile, const uchar *cur) argument
347 const uchar *cur; local
884 const uchar *cur = CUR (pfile->context) + 1; local
977 const uchar *cur; local
[all...]
/freebsd-head/lib/libc/gen/
H A Dnftw.c38 FTSENT *cur; local
61 while ((cur = fts_read(ftsp)) != NULL) {
62 switch (cur->fts_info) {
96 ftw.base = cur->fts_pathlen - cur->fts_namelen;
97 ftw.level = cur->fts_level;
98 error = fn(cur->fts_path, cur->fts_statp, fnflag, &ftw);
H A Dnftw-compat11.c42 FTSENT11 *cur; local
65 while ((cur = freebsd11_fts_read(ftsp)) != NULL) {
66 switch (cur->fts_info) {
100 ftw.base = cur->fts_pathlen - cur->fts_namelen;
101 ftw.level = cur->fts_level;
102 error = fn(cur->fts_path, cur->fts_statp, fnflag, &ftw);
/freebsd-head/tests/sys/cddl/zfs/tests/zvol/zvol_misc/
H A Dzvol_misc_007_pos.ksh110 typeset -i cur=0
113 log_must $ZFS snapshot -r $root@$cur
115 log_must test -c /dev/zvol/$root/$vol@$cur
117 while ((cur < $NUM_RENAMES)); do
118 ((next = cur + 1))
119 log_must $ZFS rename -r $root@$cur $root@$next
122 log_mustnot test -e /dev/zvol/$v@$cur
125 cur=$next
/freebsd-head/contrib/gdb/gdb/gdbserver/
H A Dinferiors.c57 struct inferior_list_entry *cur = list->head, *next; local
59 while (cur != NULL)
61 next = cur->next;
62 (*action) (cur);
63 cur = next;
81 struct inferior_list_entry **cur; local
91 cur = &list->head;
92 while (*cur && (*cur)->next != entry)
93 cur
[all...]

Completed in 344 milliseconds

1234567891011>>