Home
last modified time | relevance | path

Searched refs:i (Results 1 – 11 of 11) sorted by relevance

/misc/
A Dtst-fdset.c26 int i; in do_test() local
30 for (i=0; i < FD_SETSIZE; ++i) in do_test()
32 printf ("%d => check:", i); in do_test()
33 if (FD_ISSET (i, &set) == 0) in do_test()
41 FD_SET (i, &set); in do_test()
43 if (FD_ISSET (i, &set)) in do_test()
51 FD_CLR (i, &set); in do_test()
53 if (FD_ISSET (i, &set) == 0) in do_test()
A Dtst-hsearch.c9 ENTRY i; in do_test() local
18 i.key = (char *) "one"; in do_test()
19 i.data = &a; in do_test()
20 if (hsearch (i, ENTER) == NULL) in do_test()
23 i.key = (char *) "one"; in do_test()
24 i.data = &b; in do_test()
25 e = hsearch (i, ENTER); in do_test()
A Dtst-mntent-escape.c53 for (int i = 0; i < sizeof (tests) / sizeof (struct const_mntent); i++) in do_test() local
65 curtest.mnt_fsname = strdupa (tests[i].mnt_fsname); in do_test()
66 curtest.mnt_dir = strdupa (tests[i].mnt_dir); in do_test()
67 curtest.mnt_type = strdupa (tests[i].mnt_type); in do_test()
68 curtest.mnt_opts = strdupa (tests[i].mnt_opts); in do_test()
69 curtest.mnt_freq = tests[i].mnt_freq; in do_test()
70 curtest.mnt_passno = tests[i].mnt_passno; in do_test()
78 TEST_COMPARE_STRING (buf, tests[i].expected); in do_test()
89 TEST_COMPARE_STRING(tests[i].mnt_dir, ret->mnt_dir); in do_test()
92 TEST_COMPARE(tests[i].mnt_freq, ret->mnt_freq); in do_test()
[all …]
A Dtst-tsearch.c107 for (i = 0; i < SIZE; ++i) in memfry()
199 for (i = 0; i < expected_count; ++i) in walk_tree_with()
233 for (size_t i = 0; i < first_list_size && i < walk_trace_size (&walk_trace); in walk_tree() local
252 for (i = 0; i < SIZE; ++i) in mangle_tree()
253 y[i] = i; in mangle_tree()
257 for (i = 0; i < SIZE + lag; ++i) in mangle_tree()
348 for (i = 0; i < SIZE; ++i) in do_test()
349 x[i] = i; in do_test()
354 for (i = 0; i < PASSES; ++i) in do_test()
407 for (i = 1; i < SIZE; i *= 2) in do_test()
[all …]
A Dbug18240.c39 for (int i = 0; i < 100; ++i) in test_size() local
41 if (asprintf (keys + i, "%d", i) < 0) in test_size()
46 ENTRY e = { keys[i], (char *) "value" }; in test_size()
49 printf ("error: hsearch (\"%s\"): %m\n", keys[i]); in test_size()
55 for (int i = 0; i < 100; ++i) in test_size() local
56 free (keys[i]); in test_size()
A Dtst-mntent-autofs.c102 for (size_t i = 0; i < array_length (test_cases); ++i) in do_test() local
103 fprintf (fp, "%s\n", test_cases[i].line); in do_test()
112 for (size_t i = 0; i < array_length (test_cases); ++i) in do_test() local
114 if (test_cases[i].expected.mnt_type == NULL) in do_test()
122 TEST_COMPARE_STRING (test_cases[i].expected.mnt_fsname, me.mnt_fsname); in do_test()
123 TEST_COMPARE_STRING (test_cases[i].expected.mnt_dir, me.mnt_dir); in do_test()
124 TEST_COMPARE_STRING (test_cases[i].expected.mnt_type, me.mnt_type); in do_test()
125 TEST_COMPARE_STRING (test_cases[i].expected.mnt_opts, me.mnt_opts); in do_test()
126 TEST_COMPARE (test_cases[i].expected.mnt_freq, me.mnt_freq); in do_test()
127 TEST_COMPARE (test_cases[i].expected.mnt_passno, me.mnt_passno); in do_test()
A Defgcvt_r-template.c41 ssize_t i; in __FCVT_R() local
86 i = 0; in __FCVT_R()
87 while (i < n && isdigit (buf[i])) in __FCVT_R()
88 ++i; in __FCVT_R()
89 *decpt = i; in __FCVT_R()
95 if (i < n) in __FCVT_R()
98 ++i; in __FCVT_R()
99 while (i < n && !isdigit (buf[i])); in __FCVT_R()
106 while (i < n && buf[i] == '0') in __FCVT_R()
109 ++i; in __FCVT_R()
[all …]
A Dtst-error1.c17 for (int i = 0; i < 1000; ++i) in do_test() local
18 memcpy (&buf[i * (sizeof (str) - 1)], str, sizeof (str)); in do_test()
A Dtst-ldbl-error.c116 for (int i = 0; i < sizeof (tests) / sizeof (tests[0]); i++) in do_test() local
118 do_one_test (tests[i].callback, tests[i].expected, (long double) -1); in do_test()
A DVersions49 # i*
/misc/sys/
A Dparam.h83 #define setbit(a,i) ((a)[(i)/NBBY] |= 1<<((i)%NBBY)) argument
84 #define clrbit(a,i) ((a)[(i)/NBBY] &= ~(1<<((i)%NBBY))) argument
85 #define isset(a,i) ((a)[(i)/NBBY] & (1<<((i)%NBBY))) argument
86 #define isclr(a,i) (((a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0) argument

Completed in 47 milliseconds