Searched refs:tab (Results 1 - 25 of 324) sorted by relevance

1234567891011>>

/freebsd-current/tools/regression/p1003_1b/
H A Dmain.c17 } tab[] = { variable in typeref:struct:__anon6334
32 for (i = 0; i < (sizeof(tab) / sizeof(tab[0])); i++)
33 fprintf(stderr, "%s%s", (i)? " | " : "", tab[i].t);
50 for (i = 0; i < nitems(tab); i++)
51 if (tab[i].works)
52 fprintf(stderr, "p1003_1b %s\n", tab[i].t);
57 for (i = 0; i < nitems(tab); i++) {
58 if (tab[i].works) {
60 (*tab[
[all...]
/freebsd-current/contrib/bmake/mk/
H A Dyacc.mk31 .ORDER: ${y:T:R}.c y.tab.h
32 y.tab.h: .NOMETA
33 ${y:T:R}.c y.tab.h: $y
35 [ ! -s y.tab.c ] || mv y.tab.c ${.TARGET}
36 ${RM} -f y.tab.[!h]
42 [ ! -s y.tab.c ] || mv y.tab.c ${.TARGET:T:R}.c
43 [ ! -s y.tab.h ] || cmp -s y.tab
[all...]
/freebsd-current/usr.bin/yacc/tests/
H A DMakefile89 FILEStest_yacc+= calc_code_all.tab.c
90 FILEStest_yacc+= calc_code_all.tab.h
93 FILEStest_yacc+= calc_code_default.tab.c
94 FILEStest_yacc+= calc_code_default.tab.h
97 FILEStest_yacc+= calc_code_imports.tab.c
98 FILEStest_yacc+= calc_code_imports.tab.h
101 FILEStest_yacc+= calc_code_provides.tab.c
102 FILEStest_yacc+= calc_code_provides.tab.h
105 FILEStest_yacc+= calc_code_requires.tab.c
106 FILEStest_yacc+= calc_code_requires.tab
[all...]
/freebsd-current/crypto/openssl/crypto/bn/asm/
H A Dsparcv9-gf2m.pl32 $tab="%l0";
90 add %sp,STACK_BIAS+STACK_FRAME,$tab
109 stx %g0,[$tab+0*8] ! tab[0]=0
111 stx $a1,[$tab+1*8] ! tab[1]=a1
112 stx $a2,[$tab+2*8] ! tab[2]=a2
114 stx $a12,[$tab+3*8] ! tab[
[all...]
/freebsd-current/sbin/ipf/ipftest/
H A DMakefile28 CLEANFILES+= ipf.tab.c ipf.tab.h
30 CLEANFILES+= ipnat.tab.c ipnat.tab.h
32 CLEANFILES+= ippool.tab.c ippool.tab.h
34 ipnat.tab.c ipnat.tab.h: ipnat_y.y
37 ipnat_y.c: ipnat.tab.c
39 -e 's/y.tab
[all...]
/freebsd-current/contrib/netbsd-tests/lib/libc/string/
H A Dt_strrchr.c29 struct tab { struct
36 const struct tab tab[] = { local
220 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
221 strcpy(&buf[a], tab[t].val);
224 if (tab[t].match == 0) {
230 } else if (tab[t].match == 1) {
231 if (tab[t].l_off != (off - &buf[a])) {
H A Dt_strcat.c30 struct tab { struct
35 const struct tab tab[] = { local
88 for (t0 = 0; t0 < __arraycount(tab); ++t0) {
89 for (t1 = 0; t1 < __arraycount(tab); ++t1) {
91 memcpy(&buf0[a0], tab[t0].val,
92 tab[t0].len + 1);
93 memcpy(&buf1[a1], tab[t1].val,
94 tab[t1].len + 1);
111 if (memcmp(&buf0[a0] + tab[t
[all...]
H A Dt_strcmp.c30 struct tab { struct
36 const struct tab tab[] = { local
78 for (t = 0; t < __arraycount(tab); ++t) {
79 memcpy(&buf0[a0], tab[t].val0,
80 strlen(tab[t].val0) + 1);
81 memcpy(&buf1[a1], tab[t].val1,
82 strlen(tab[t].val1) + 1);
86 if ((ret == 0 && tab[t].ret != 0) ||
87 (ret < 0 && tab[
[all...]
H A Dt_strcpy.c30 struct tab { struct
35 const struct tab tab[] = { local
88 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
90 memcpy(&buf1[a1], tab[t].val, tab[t].len + 1);
108 tab[t].len + 1) != 0) {
H A Dt_memchr.c29 struct tab { struct
36 const struct tab tab[] = { local
98 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
100 strcpy(&buf[a], tab[t].val);
102 off = f(&buf[a], '/', tab[t].len);
103 if (tab[t].match == 0) {
110 } else if (tab[t].match == 1) {
111 if (tab[
[all...]
H A Dt_strlen.c51 struct tab { struct
56 const struct tab tab[] = { local
117 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
119 memcpy(&buf[a], tab[t].val, tab[t].len + 1);
122 if (len != tab[t].len) {
131 write_num(tab[t].len);
133 write(2, tab[
[all...]
/freebsd-current/contrib/mtree/
H A Dcompare.c77 tab = "\t"; \
81 tab = "\t"; \
84 tab = ""; \
100 printf("%sflags (\"%s\"", tab, sf); \
140 const char *cp, *tab; local
145 tab = NULL;
205 tab, (uintmax_t)s->st_rdev,
222 tab = "\t";
229 tab, (u_long)s->st_uid, (u_long)p->fts_statp->st_uid);
240 tab
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/test/
H A Dregress_testutils.c152 struct regress_dns_server_table *tab = data; local
161 while (tab->q && evutil_ascii_strcasecmp(question, tab->q) &&
162 strcmp("*", tab->q))
163 ++tab;
164 if (tab->q == NULL)
167 ++tab->seen;
169 if (tab->lower)
172 if (!strcmp(tab->anstype, "err")) {
173 int err = atoi(tab
[all...]
/freebsd-current/contrib/libevent/test/
H A Dregress_testutils.c152 struct regress_dns_server_table *tab = data; local
161 while (tab->q && evutil_ascii_strcasecmp(question, tab->q) &&
162 strcmp("*", tab->q))
163 ++tab;
164 if (tab->q == NULL)
167 ++tab->seen;
169 if (tab->lower)
172 if (!strcmp(tab->anstype, "err")) {
173 int err = atoi(tab
[all...]
/freebsd-current/usr.bin/iscsictl/
H A DMakefile4 SRCS= iscsictl.c periphs.c parse.y token.l y.tab.h
13 CLEANFILES= y.tab.c y.tab.h y.output
/freebsd-current/usr.sbin/rrenumd/
H A DMakefile27 CLEANFILES= y.tab.h
28 SRCS+= y.tab.h
29 y.tab.h: parser.y
/freebsd-current/crypto/heimdal/lib/roken/
H A Dmissing44 bison create \`y.tab.[ch]', if possible, from existing .[ch]
48 yacc create \`y.tab.[ch]', if possible, from existing .[ch]"
115 rm -f y.tab.c y.tab.h
122 cp "$SRCFILE" y.tab.c
126 cp "$SRCFILE" y.tab.h
131 if [ ! -f y.tab.h ]; then
132 echo >y.tab.h
134 if [ ! -f y.tab.c ]; then
135 echo 'main() { return 0; }' >y.tab
[all...]
/freebsd-current/lib/libipsec/
H A DMakefile47 CLEANFILES+= y.tab.c y.tab.h
57 SRCS+= y.tab.h
58 y.tab.h: policy_parse.y
/freebsd-current/contrib/arm-optimized-routines/math/aarch64/
H A Dv_math.h66 v_lookup_f32 (const float *tab, uint32x4_t idx) argument
68 return (float32x4_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]]};
71 v_lookup_u32 (const uint32_t *tab, uint32x4_t idx) argument
73 return (uint32x4_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[id
114 v_lookup_f64(const double *tab, uint64x2_t idx) argument
119 v_lookup_u64(const uint64_t *tab, uint64x2_t idx) argument
[all...]
/freebsd-current/contrib/arm-optimized-routines/pl/math/
H A Dv_math.h70 v_lookup_f32 (const float *tab, uint32x4_t idx) argument
72 return (float32x4_t){ tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]] };
75 v_lookup_u32 (const uint32_t *tab, uint32x4_t idx) argument
77 return (uint32x4_t){ tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[id
131 v_lookup_f64(const double *tab, uint64x2_t idx) argument
136 v_lookup_u64(const uint64_t *tab, uint64x2_t idx) argument
[all...]
/freebsd-current/usr.bin/awk/
H A DMakefile8 SRCS= awkgram.y b.c lex.c lib.c main.c parse.c proctab.c run.c tran.c awkgram.tab.h
19 CLEANFILES= maketab proctab.c awkgram.tab.h
21 awkgram.tab.h: awkgram.h
24 proctab.c: awkgram.tab.h
25 ${BTOOLSPATH:U.}/maketab awkgram.tab.h > proctab.c
31 maketab: awkgram.tab.h ${BUILD_TOOLS_META}
/freebsd-current/contrib/jemalloc/src/
H A Dckh.c68 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
114 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) +
155 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
259 ckhc_t *tab, *ttab; local
283 tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE,
285 if (tab == NULL) {
290 ttab = ckh->tab;
291 ckh->tab = tab;
292 tab
296 idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true); local
313 ckhc_t *tab, *ttab; local
343 idalloctm(tsd_tsdn(tsd), tab, NULL, NULL, true, true); local
[all...]
/freebsd-current/crypto/heimdal/base/
H A Ddict.c47 struct hashentry **tab; member in struct:heim_dict_data
56 for (h = dict->tab; h < &dict->tab[dict->size]; ++h) {
64 free(dict->tab);
124 dict->tab = calloc(dict->size, sizeof(dict->tab[0]));
125 if (dict->tab == NULL) {
154 for (p = dict->tab[v % dict->size]; p != NULL; p = p->next)
212 tabptr = &dict->tab[v % dict->size];
260 for (h = dict->tab;
[all...]
/freebsd-current/sbin/setkey/
H A DMakefile39 CLEANFILES= y.tab.c y.tab.h key_test.o keytest
47 SRCS+= y.tab.h
48 y.tab.h: parse.y
58 CLEANFILES+= scriptdump y.tab.h
/freebsd-current/contrib/one-true-awk/
H A Dmakefile43 SOURCE = awk.h awkgram.tab.c awkgram.tab.h proto.h awkgram.y lex.c b.c main.c \
49 SHIP = README LICENSE FIXES $(SOURCE) awkgram.tab.[ch].bak makefile \
52 a.out: awkgram.tab.o $(OFILES)
53 $(CC) $(CFLAGS) awkgram.tab.o $(OFILES) $(ALLOC) -lm
55 $(OFILES): awk.h awkgram.tab.h proto.h
57 awkgram.tab.c awkgram.tab.h: awk.h proto.h awkgram.y
61 ./maketab awkgram.tab.h >proctab.c
63 maketab: awkgram.tab
[all...]

Completed in 225 milliseconds

1234567891011>>