Home
last modified time | relevance | path

Searched refs:step (Results 1 – 25 of 245) sorted by relevance

12345678910

/minix3/external/bsd/kyua-cli/dist/utils/sqlite/
H A Dstatement_test.cpp53 ATF_REQUIRE(!stmt.step()); in ATF_TEST_CASE_BODY()
66 ATF_REQUIRE(stmt.step()); in ATF_TEST_CASE_BODY()
67 ATF_REQUIRE(!stmt.step()); in ATF_TEST_CASE_BODY()
77 ATF_REQUIRE(!stmt.step()); in ATF_TEST_CASE_BODY()
78 REQUIRE_API_ERROR("sqlite3_step", stmt.step()); in ATF_TEST_CASE_BODY()
113 ATF_REQUIRE(stmt.step()); in ATF_TEST_CASE_BODY()
115 ATF_REQUIRE(!stmt.step()); in ATF_TEST_CASE_BODY()
126 ATF_REQUIRE(stmt.step()); in ATF_TEST_CASE_BODY()
129 ATF_REQUIRE(!stmt.step()); in ATF_TEST_CASE_BODY()
140 ATF_REQUIRE(stmt.step()); in ATF_TEST_CASE_BODY()
[all …]
H A Dtransaction_test.cpp60 if (!stmt.step()) in check_in_table()
62 if (stmt.step()) in check_in_table()
/minix3/usr.bin/ctags/
H A Dctags.c93 int step; /* step through args */ in main() local
143 for (exit_val = step = 0; step < argc; ++step) in main()
144 if (!(inf = fopen(argv[step], "r"))) { in main()
145 warn("%s", argv[step]); in main()
149 curfile = argv[step]; in main()
150 find_entries(argv[step]); in main()
159 for (step = 0; step < argc; step++) { in main()
162 outfile, argv[step], in main()
/minix3/usr.bin/jot/
H A Djot.c70 static double step = STEP_DEF; variable
118 srandom((unsigned long) step); in main()
129 for (i = 1; i <= reps || reps == 0; i++, x += step) in main()
187 step = strtod(argv[3], &ep); in getargs()
235 step = time(NULL) * getpid(); in getargs()
252 if (step == 0.0) in getargs()
255 reps = (ender - begin + step) / step; in getargs()
267 begin = ender - reps * step + step; in getargs()
276 step = 0.0; in getargs()
278 step = (ender - begin) / (reps - 1); in getargs()
[all …]
/minix3/minix/commands/netconf/
H A Dnetconf.sh120 step=do_stepM
126 step=do_step2
162 step=do_step1
224 step=do_step3
233 step=do_step3
314 step=do_step3
321 step=do_step3
324 step=do_step1
349 [ $? -eq 1 ] && step=do_step1
395 step=do_step1
[all …]
/minix3/external/bsd/llvm/dist/clang/test/SemaCXX/
H A Dfor-range-examples.cpp30 T it, step; member in value_range_detail::value_range_step_iter
32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {} in value_range_step_iter() argument
35 value_range_step_iter &operator++() { it += step; return *this; } in operator ++()
40 T it, step, end_; member in value_range_detail::value_range_step
42 value_range_step(const T &it, const T &end, const T &step) : in value_range_step() argument
43 it(it), end_(end), step(step) {} in value_range_step()
45 iterator begin() const { return iterator(it, step); } in begin()
46 iterator end() const { return iterator(end_, step); } in end()
54 …p<T> range(const T &a, const T &b, const T &step) { return value_range_detail::value_range_step<T>… in range() argument
/minix3/games/adventure/
H A Dcrc.c114 c->step = 0; in crc_start()
132 x = c->step++; in crc_add()
133 if (c->step >= __arraycount(crctab)) { in crc_add()
134 c->step = 0; in crc_add()
/minix3/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
H A Dbn_mp_prime_next_prime.c28 mp_digit res_tab[PRIME_SIZE], step, kstep; in mp_prime_next_prime() local
111 step = 0; in mp_prime_next_prime()
117 step += kstep; in mp_prime_next_prime()
134 } while (y == 1 && step < ((((mp_digit)1)<<DIGIT_BIT) - kstep)); in mp_prime_next_prime()
137 if ((err = mp_add_d(a, step, a)) != MP_OKAY) { in mp_prime_next_prime()
142 if (y == 1 && step >= ((((mp_digit)1)<<DIGIT_BIT) - kstep)) { in mp_prime_next_prime()
/minix3/usr.bin/last/
H A Dwant.c270 ARG *step; in want() local
286 for (step = arglist; step; step = step->next) in want()
287 switch(step->type) { in want()
289 if (!strncasecmp(step->name, bp->ut_host, HOSTSIZE)) in want()
293 if (!strncmp(step->name, bp->ut_line, LINESIZE)) in want()
297 if (!strncmp(step->name, bp->ut_name, NAMESIZE)) in want()
/minix3/sys/netinet6/
H A Din6_var.h604 in6_next_multi(struct in6_multistep *step) in in6_next_multi() argument
608 if ((in6m = step->i_in6m) != NULL) { in in6_next_multi()
609 step->i_in6m = LIST_NEXT(in6m, in6m_entry); in in6_next_multi()
612 while (step->i_ia != NULL) { in in6_next_multi()
613 in6m = LIST_FIRST(&step->i_ia->ia6_multiaddrs); in in6_next_multi()
614 step->i_ia = step->i_ia->ia_next; in in6_next_multi()
616 step->i_in6m = LIST_NEXT(in6m, in6m_entry); in in6_next_multi()
624 in6_first_multi(struct in6_multistep *step) in in6_first_multi() argument
626 step->i_ia = in6_ifaddr; in in6_first_multi()
627 step->i_in6m = NULL; in in6_first_multi()
[all …]
/minix3/sys/net/
H A Dif_ether.h275 #define ETHER_NEXT_MULTI(step, enm) \ argument
279 if (((enm) = (step).e_enm) != NULL) \
280 (step).e_enm = LIST_NEXT((enm), enm_list); \
283 #define ETHER_FIRST_MULTI(step, ec, enm) \ argument
288 (step).e_enm = LIST_FIRST(&(ec)->ec_multiaddrs); \
289 ETHER_NEXT_MULTI((step), (enm)); \
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/LoopVectorize/
H A D2012-10-20-infloop.ll51 %step.0121 = phi i32 [ 1, %cond.false28 ], [ %step.1, %for.inc50 ]
55 %inc47 = add nsw i32 %step.0121, 1
60 %step.1 = phi i32 [ %step.0121, %for.body40 ], [ %inc47, %if.then46 ]
/minix3/external/bsd/kyua-cli/dist/store/
H A Dtransaction.cpp88 while (stmt.step()) { in get_env_vars()
112 while (stmt.step()) { in get_metadata()
137 if (!stmt.step()) in get_file()
149 stmt.step(); in get_file()
184 while (stmt.step()) { in get_test_cases()
281 stmt.step(); in last_rowid()
382 stmt.step(); in get_test_program()
393 stmt.step(); in get_test_program()
437 _valid = _stmt.step(); in impl()
464 _pimpl->_valid = _pimpl->_stmt.step(); in operator ++()
[all …]
H A Ddbtypes_test.cpp70 ATF_REQUIRE(query.step()); in do_ok_test()
72 ATF_REQUIRE(!query.step()); in do_ok_test()
96 ATF_REQUIRE(query.step()); in do_invalid_test()
99 ATF_REQUIRE(!query.step()); in do_invalid_test()
H A Dmetadata.cpp121 if (!stmt.step()) in fetch_latest()
128 if (stmt.step()) in fetch_latest()
/minix3/common/dist/zlib/contrib/testzlib/
H A Dtestzlib.c198 int step=0; in main() local
214 step++; in main()
222 printf("total compress size = %u, in %u step\n",lSizeCpr,step); in main()
239 int step=0; in main() local
255 step++; in main()
263 printf("total uncompress size = %u, in %u step\n",lSizeUncpr,step); in main()
/minix3/external/bsd/kyua-cli/dist/cli/
H A Dcmd_db_exec_test.cpp68 ATF_REQUIRE(query.step()); in do_format_cell_test()
70 ATF_REQUIRE(!query.step()); in do_format_cell_test()
147 query.step(); in ATF_TEST_CASE_BODY()
/minix3/external/bsd/llvm/dist/llvm/test/CodeGen/X86/
H A Dwin64_eh.ll103 %step = alloca i32, align 4
104 store i32 0, i32* %step
105 %tmp = load i32* %step
111 store i32 1, i32* %step
118 store i32 2, i32* %step
123 %tmp10 = load i32* %step
H A Dblock-placement.ll422 i32 877, label %step
423 i32 876, label %step
424 i32 875, label %step
425 i32 874, label %step
426 i32 873, label %step
427 i32 872, label %step
428 i32 868, label %step
429 i32 867, label %step
430 i32 866, label %step
431 i32 861, label %step
[all …]
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/GVN/
H A Dpre-compare.ll9 ; puts("step 1");
12 ; printf("step 2: %d\n", x);
36 @.str2 = private unnamed_addr constant [7 x i8] c"step 1\00", align 1
37 @.str3 = private unnamed_addr constant [12 x i8] c"step 2: %d\0A\00", align 1
/minix3/external/bsd/dhcp/dist/dst/
H A Dprandom.c192 int digested, block, step, curr; member
225 static prand_hash *get_hmac_key(int step, int block);
553 if (hash->step > 1) { /* if using subset of input data */ in do_hash()
554 tmp_size = size / hash->step + 2; in do_hash()
557 for (cnt = 0, i = hash->curr; i < size; i += hash->step, cnt++) in do_hash()
560 hash->curr = (hash->step - (i - size)) % hash->step; in do_hash()
617 get_hmac_key(int step, int block) in get_hmac_key() argument
678 new->step = step; in get_hmac_key()
/minix3/external/bsd/llvm/dist/llvm/docs/tutorial/
H A Dindex.rst29 A step-by-step tutorial for developing an LLVM backend. Under
/minix3/external/bsd/llvm/dist/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-param-util.h185 RangeGenerator(T begin, T end, IncrementT step) in RangeGenerator() argument
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {} in RangeGenerator()
201 IncrementT step) in Iterator() argument
202 : base_(base), value_(value), index_(index), step_(step) {} in Iterator()
244 const IncrementT& step) { in CalculateEndIndex() argument
246 for (T i = begin; i < end; i = i + step) in CalculateEndIndex()
/minix3/external/bsd/nvi/dist/regex/
H A Dengine.c54 #define step sstep macro
65 #define step lstep macro
99 static states step __P((struct re_guts *g, sopno start, sopno stop, states bef, int flag, RCHAR_T c…
724 st = step(m->g, startst, stopst, st, NOTHING, OUT, st);
750 st = step(m->g, startst, stopst, st, flag, OUT, st);
764 st = step(m->g, startst, stopst, st, flag, OUT, st);
776 st = step(m->g, startst, stopst, tmp, 0, c, st);
778 assert(EQ(step(m->g, startst, stopst, st, NOTHING, OUT, st), st));
817 st = step(m->g, startst, stopst, st, NOTHING, OUT, st);
839 st = step(m->g, startst, stopst, st, flag, OUT, st);
[all …]
/minix3/lib/libc/regex/
H A Dengine.c87 #define step sstep macro
99 #define step lstep macro
134 static states step(struct re_guts *g, sopno start, sopno stop, states bef, int ch, states aft);
795 st = step(m->g, startst, stopst, st, NOTHING, st); in fast()
821 st = step(m->g, startst, stopst, st, flagch, st); in fast()
835 st = step(m->g, startst, stopst, st, flagch, st); in fast()
847 st = step(m->g, startst, stopst, tmp, c, st); in fast()
849 assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st)); in fast()
892 st = step(m->g, startst, stopst, st, NOTHING, st); in slow()
914 st = step(m->g, startst, stopst, st, flagch, st); in slow()
[all …]

12345678910