Home
last modified time | relevance | path

Searched refs:tab (Results 1 – 25 of 837) sorted by relevance

12345678910>>...34

/freebsd/usr.bin/yacc/tests/
H A DMakefile88 FILEStest_yacc+= calc_code_all.tab.c
89 FILEStest_yacc+= calc_code_all.tab.h
92 FILEStest_yacc+= calc_code_default.tab.c
93 FILEStest_yacc+= calc_code_default.tab.h
96 FILEStest_yacc+= calc_code_imports.tab.c
97 FILEStest_yacc+= calc_code_imports.tab.h
100 FILEStest_yacc+= calc_code_provides.tab.c
101 FILEStest_yacc+= calc_code_provides.tab.h
104 FILEStest_yacc+= calc_code_requires.tab.c
105 FILEStest_yacc+= calc_code_requires.tab.h
[all …]
/freebsd/contrib/byacc/
H A DCHANGES135 * test/yacc/ok_syntax1.tab.h, test/yacc/ok_syntax1.tab.c,
136 test/btyacc/ok_syntax1.tab.h, test/btyacc/ok_syntax1.tab.c:
319 * test/yacc/expr.oxout.tab.c, test/btyacc/expr.oxout.tab.c: regen
323 * test/yacc/expr.oxout.tab.c, test/yacc/expr.oxout.tab.h: regen
329 * test/btyacc/expr.oxout.tab.c: regen
333 * test/yacc/expr.oxout.tab.c: fix syntax error
335 * test/btyacc/expr.oxout.tab.c: regen, s/expr.oxout/expr_oxout/g
337 * test/btyacc/expr.oxout.tab.h: regen
547 * test/btyacc/btyacc_calc1.tab.c, test/btyacc/btyacc_demo.tab.c,
548 test/btyacc/btyacc_destroy1.tab.c, test/btyacc/btyacc_destroy2.tab.c,
[all …]
H A DMANIFEST75 test/btyacc/btyacc_calc1.tab.c reference output for testing
76 test/btyacc/btyacc_calc1.tab.h reference output for testing
79 test/btyacc/btyacc_demo.tab.c reference output for testing
80 test/btyacc/btyacc_demo.tab.h reference output for testing
83 test/btyacc/btyacc_destroy1.tab.c reference output for testing
84 test/btyacc/btyacc_destroy1.tab.h reference output for testing
87 test/btyacc/btyacc_destroy2.tab.c reference output for testing
88 test/btyacc/btyacc_destroy2.tab.h reference output for testing
91 test/btyacc/btyacc_destroy3.tab.c reference output for testing
92 test/btyacc/btyacc_destroy3.tab.h reference output for testing
[all …]
/freebsd/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/contrib/mtree/
H A Dcompare.c77 tab = "\t"; \
81 tab = "\t"; \
84 tab = ""; \
100 printf("%sflags (\"%s\"", tab, sf); \
140 const char *cp, *tab; in compare() local
145 tab = NULL; in compare()
205 tab, (uintmax_t)s->st_rdev, in compare()
222 tab = "\t"; in compare()
229 tab, (u_long)s->st_uid, (u_long)p->fts_statp->st_uid); in compare()
240 tab = "\t"; in compare()
[all …]
/freebsd/sbin/ipf/ipftest/
H A DMakefile27 CLEANFILES+= ipf.tab.c ipf.tab.h
29 CLEANFILES+= ipnat.tab.c ipnat.tab.h
31 CLEANFILES+= ippool.tab.c ippool.tab.h
33 ipnat.tab.c ipnat.tab.h: ipnat_y.y
36 ipnat_y.c: ipnat.tab.c
39 ipnat.tab.c > ${.TARGET}
41 ipnat_y.h: ipnat.tab.h
44 ipnat.tab.h > ${.TARGET}
58 ippool.tab.c ippool.tab.h: ippool_y.y
61 ippool_y.c: ippool.tab.c
[all …]
/freebsd/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[3]=a1^a2
117 stx $a4,[$tab+4*8] ! tab[4]=a4
119 stx $a1,[$tab+5*8] ! tab[5]=a1^a4
121 stx $a2,[$tab+6*8] ! tab[6]=a2^a4
123 stx $a12,[$tab+7*8] ! tab[7]=a1^a2^a4
[all …]
/freebsd/tools/regression/p1003_1b/
H A Dmain.c17 } tab[] = { variable
32 for (i = 0; i < (sizeof(tab) / sizeof(tab[0])); i++) in usage()
33 fprintf(stderr, "%s%s", (i)? " | " : "", tab[i].t); in usage()
50 for (i = 0; i < nitems(tab); i++) in main()
51 if (tab[i].works) in main()
52 fprintf(stderr, "p1003_1b %s\n", tab[i].t); in main()
57 for (i = 0; i < nitems(tab); i++) { in main()
58 if (tab[i].works) { in main()
60 (*tab[i].f)(argc - 1, argv + 1)) ) { in main()
62 "%s failed\n", tab[i].t); in main()
[all …]
/freebsd/contrib/ntp/sntp/libevent/test/
H A Dregress_testutils.c152 struct regress_dns_server_table *tab = data; in regress_dns_server_cb() local
161 while (tab->q && evutil_ascii_strcasecmp(question, tab->q) && in regress_dns_server_cb()
162 strcmp("*", tab->q)) in regress_dns_server_cb()
163 ++tab; in regress_dns_server_cb()
164 if (tab->q == NULL) in regress_dns_server_cb()
167 ++tab->seen; in regress_dns_server_cb()
169 if (tab->lower) in regress_dns_server_cb()
172 if (!strcmp(tab->anstype, "err")) { in regress_dns_server_cb()
173 int err = atoi(tab->ans); in regress_dns_server_cb()
176 } else if (!strcmp(tab->anstype, "errsoa")) { in regress_dns_server_cb()
[all …]
/freebsd/contrib/libevent/test/
H A Dregress_testutils.c152 struct regress_dns_server_table *tab = data; in regress_dns_server_cb() local
161 while (tab->q && evutil_ascii_strcasecmp(question, tab->q) && in regress_dns_server_cb()
162 strcmp("*", tab->q)) in regress_dns_server_cb()
163 ++tab; in regress_dns_server_cb()
164 if (tab->q == NULL) in regress_dns_server_cb()
167 ++tab->seen; in regress_dns_server_cb()
169 if (tab->lower) in regress_dns_server_cb()
172 if (!strcmp(tab->anstype, "err")) { in regress_dns_server_cb()
173 int err = atoi(tab->ans); in regress_dns_server_cb()
176 } else if (!strcmp(tab->anstype, "errsoa")) { in regress_dns_server_cb()
[all …]
/freebsd/contrib/jemalloc/src/
H A Dckh.c68 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_bucket_search()
114 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + in ckh_try_bucket_insert()
155 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_evict_reloc_insert()
259 ckhc_t *tab, *ttab; in ckh_grow() local
283 tab = (ckhc_t *)ipallocztm(tsd_tsdn(tsd), usize, CACHELINE, in ckh_grow()
285 if (tab == NULL) { in ckh_grow()
290 ttab = ckh->tab; in ckh_grow()
291 ckh->tab = tab; in ckh_grow()
292 tab = ttab; in ckh_grow()
295 if (!ckh_rebuild(ckh, tab)) { in ckh_grow()
[all …]
/freebsd/contrib/ntp/ntpd/
H A Dntpd.texi81 @headitem What @tab Default @tab Flag @tab Option
83 @tab @code{/etc/ntp.conf}
84 @tab @code{-c}
85 @tab @code{conffile}
87 @tab none
88 @tab @code{-f}
89 @tab @code{driftfile}
91 @tab none
92 @tab
93 @tab @code{leapfile}
[all …]
/freebsd/contrib/ntp/ntpq/
H A Dntpq.texi78 @headitem What @tab Default @tab Flag @tab Option
80 @tab @code{/etc/ntp.conf}
81 @tab @code{-c}
82 @tab @code{conffile}
84 @tab none
85 @tab @code{-f}
86 @tab @code{driftfile}
88 @tab none
89 @tab
90 @tab @code{leapfile}
[all …]
/freebsd/contrib/arm-optimized-routines/math/aarch64/
H A Dv_math.h66 v_lookup_f32 (const float *tab, uint32x4_t idx) in v_lookup_f32() argument
68 return (float32x4_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]]}; in v_lookup_f32()
71 v_lookup_u32 (const uint32_t *tab, uint32x4_t idx) in v_lookup_u32() argument
73 return (uint32x4_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]]}; in v_lookup_u32()
114 v_lookup_f64 (const double *tab, uint64x2_t idx) in v_lookup_f64() argument
116 return (float64x2_t){tab[idx[0]], tab[idx[1]]}; in v_lookup_f64()
119 v_lookup_u64 (const uint64_t *tab, uint64x2_t idx) in v_lookup_u64() argument
121 return (uint64x2_t){tab[idx[0]], tab[idx[1]]}; in v_lookup_u64()
/freebsd/contrib/one-true-awk/
H A Dmakefile44 SOURCE = awk.h awkgram.tab.c awkgram.tab.h proto.h awkgram.y lex.c b.c main.c \
50 SHIP = README LICENSE FIXES $(SOURCE) awkgram.tab.[ch].bak makefile \
53 a.out: awkgram.tab.o $(OFILES)
54 $(CC) $(CFLAGS) awkgram.tab.o $(OFILES) $(ALLOC) -lm
56 $(OFILES): awk.h awkgram.tab.h proto.h
58 awkgram.tab.c awkgram.tab.h: awk.h proto.h awkgram.y
62 ./maketab awkgram.tab.h >proctab.c
64 maketab: awkgram.tab.h maketab.c
68 @cp awkgram.tab.h awkgram.tab.h.bak
69 @cp awkgram.tab.c awkgram.tab.c.bak
[all …]
/freebsd/contrib/arm-optimized-routines/pl/math/
H A Dv_math.h70 v_lookup_f32 (const float *tab, uint32x4_t idx) in v_lookup_f32() argument
72 return (float32x4_t){ tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]] }; in v_lookup_f32()
75 v_lookup_u32 (const uint32_t *tab, uint32x4_t idx) in v_lookup_u32() argument
77 return (uint32x4_t){ tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]] }; in v_lookup_u32()
131 v_lookup_f64 (const double *tab, uint64x2_t idx) in v_lookup_f64() argument
133 return (float64x2_t){ tab[idx[0]], tab[idx[1]] }; in v_lookup_f64()
136 v_lookup_u64 (const uint64_t *tab, uint64x2_t idx) in v_lookup_u64() argument
138 return (uint64x2_t){ tab[idx[0]], tab[idx[1]] }; in v_lookup_u64()
/freebsd/contrib/netbsd-tests/lib/libc/string/
H A Dt_strcat.c30 struct tab { in ATF_TC_BODY() struct
35 const struct tab tab[] = { in ATF_TC_BODY() local
88 for (t0 = 0; t0 < __arraycount(tab); ++t0) { in ATF_TC_BODY()
89 for (t1 = 0; t1 < __arraycount(tab); ++t1) { in ATF_TC_BODY()
91 memcpy(&buf0[a0], tab[t0].val, in ATF_TC_BODY()
92 tab[t0].len + 1); in ATF_TC_BODY()
93 memcpy(&buf1[a1], tab[t1].val, in ATF_TC_BODY()
94 tab[t1].len + 1); in ATF_TC_BODY()
111 if (memcmp(&buf0[a0] + tab[t0].len, in ATF_TC_BODY()
113 tab[t1].len + 1) != 0) { in ATF_TC_BODY()
H A Dt_strcmp.c30 struct tab { in ATF_TC_BODY() struct
36 const struct tab tab[] = { in ATF_TC_BODY() local
78 for (t = 0; t < __arraycount(tab); ++t) { in ATF_TC_BODY()
79 memcpy(&buf0[a0], tab[t].val0, in ATF_TC_BODY()
80 strlen(tab[t].val0) + 1); in ATF_TC_BODY()
81 memcpy(&buf1[a1], tab[t].val1, in ATF_TC_BODY()
82 strlen(tab[t].val1) + 1); in ATF_TC_BODY()
86 if ((ret == 0 && tab[t].ret != 0) || in ATF_TC_BODY()
87 (ret < 0 && tab[t].ret >= 0) || in ATF_TC_BODY()
88 (ret > 0 && tab[t].ret <= 0)) { in ATF_TC_BODY()
H A Dt_strrchr.c29 struct tab { in ATF_TC_BODY() struct
36 const struct tab tab[] = { in ATF_TC_BODY() local
220 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) { in ATF_TC_BODY()
221 strcpy(&buf[a], tab[t].val); in ATF_TC_BODY()
224 if (tab[t].match == 0) { in ATF_TC_BODY()
230 } else if (tab[t].match == 1) { in ATF_TC_BODY()
231 if (tab[t].l_off != (off - &buf[a])) { in ATF_TC_BODY()
H A Dt_strlen.c51 struct tab { in ATF_TC_BODY() struct
56 const struct tab tab[] = { in ATF_TC_BODY() local
117 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) { in ATF_TC_BODY()
119 memcpy(&buf[a], tab[t].val, tab[t].len + 1); in ATF_TC_BODY()
122 if (len != tab[t].len) { in ATF_TC_BODY()
131 write_num(tab[t].len); in ATF_TC_BODY()
133 write(2, tab[t].val, tab[t].len); in ATF_TC_BODY()
H A Dt_memchr.c29 struct tab { in ATF_TC_BODY() struct
36 const struct tab tab[] = { in ATF_TC_BODY() local
98 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) { in ATF_TC_BODY()
100 strcpy(&buf[a], tab[t].val); in ATF_TC_BODY()
102 off = f(&buf[a], '/', tab[t].len); in ATF_TC_BODY()
103 if (tab[t].match == 0) { in ATF_TC_BODY()
110 } else if (tab[t].match == 1) { in ATF_TC_BODY()
111 if (tab[t].off != ((char*)off - &buf[a])) { in ATF_TC_BODY()
123 off2 = f(&buf[a], 0xffffff00 | '/', tab[t].len); in ATF_TC_BODY()
H A Dt_strcpy.c30 struct tab { in ATF_TC_BODY() struct
35 const struct tab tab[] = { in ATF_TC_BODY() local
88 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) { in ATF_TC_BODY()
90 memcpy(&buf1[a1], tab[t].val, tab[t].len + 1); in ATF_TC_BODY()
108 tab[t].len + 1) != 0) { in ATF_TC_BODY()
/freebsd/contrib/bmake/unit-tests/
H A Descape.exp46 VAR1BSNLt=:first line one tab on second line:
61 second line tab should be elided':
63 second line tab should be elided:
65 only one tab should be elided, second tab remains'
67 only one tab should be elided, second tab remains
91 second line tab should be elided':
93 second line tab should be elided:
95 only one tab should be elided, second tab remains'
97 only one tab should be elided, second tab remains
/freebsd/crypto/openssl/crypto/bn/
H A Dbn_gf2m.c64 BN_ULONG tab[8], top2b = a >> 30; in bn_GF2m_mul_1x1() local
71 tab[0] = 0; in bn_GF2m_mul_1x1()
72 tab[1] = a1; in bn_GF2m_mul_1x1()
73 tab[2] = a2; in bn_GF2m_mul_1x1()
74 tab[3] = a1 ^ a2; in bn_GF2m_mul_1x1()
75 tab[4] = a4; in bn_GF2m_mul_1x1()
76 tab[5] = a1 ^ a4; in bn_GF2m_mul_1x1()
77 tab[6] = a2 ^ a4; in bn_GF2m_mul_1x1()
78 tab[7] = a1 ^ a2 ^ a4; in bn_GF2m_mul_1x1()
80 s = tab[b & 0x7]; in bn_GF2m_mul_1x1()
[all …]
/freebsd/crypto/heimdal/base/
H A Ddict.c47 struct hashentry **tab; member
56 for (h = dict->tab; h < &dict->tab[dict->size]; ++h) { in dict_dealloc()
64 free(dict->tab); in dict_dealloc()
124 dict->tab = calloc(dict->size, sizeof(dict->tab[0])); in heim_dict_create()
125 if (dict->tab == NULL) { in heim_dict_create()
154 for (p = dict->tab[v % dict->size]; p != NULL; p = p->next) in _search()
212 tabptr = &dict->tab[v % dict->size]; in heim_dict_add_value()
260 for (h = dict->tab; h < &dict->tab[dict->size]; ++h) in heim_dict_iterate_f()
278 for (h = dict->tab; h < &dict->tab[dict->size]; ++h)

12345678910>>...34