/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | remote-sds.c | 340 sds_resume (ptid_t ptid, int step, enum target_signal siggnal) 345 last_sent_step = step; 347 buf[0] = (step ? 21 : 20); 338 sds_resume(ptid_t ptid, int step, enum target_signal siggnal) argument
|
H A D | target.h | 168 'step n' like commands. */ 494 single-step or to run free; SIGGNAL is the signal to be given to 498 #define target_resume(ptid, step, siggnal) \ 501 (*current_target.to_resume) (ptid, step, siggnal); \
|
H A D | remote.c | 84 static void remote_resume (ptid_t ptid, int step, 86 static void remote_async_resume (ptid_t ptid, int step, 779 /* Should we try the 'e' (step over range) request? */ 797 /* Should we try the 'E' (step over range / w signal #) request? */ 2484 remote_vcont_resume (ptid_t ptid, int step, enum target_signal siggnal) 2512 if (step && siggnal != TARGET_SIGNAL_0) 2514 else if (step) 2524 if (step && siggnal != TARGET_SIGNAL_0) 2527 else if (step) 2538 if (step 2477 remote_vcont_resume(ptid_t ptid, int step, enum target_signal siggnal) argument 2558 remote_resume(ptid_t ptid, int step, enum target_signal siggnal) argument 2652 remote_async_resume(ptid_t ptid, int step, enum target_signal siggnal) argument [all...] |
H A D | libunwind-frame.c | 81 static char *step_name = STRINGIFY(UNW_OBJ(step));
|
H A D | ocd.c | 332 ocd_resume (ptid_t ptid, int step, enum target_signal siggnal) 336 if (step) 329 ocd_resume(ptid_t ptid, int step, enum target_signal siggnal) argument
|
H A D | uw-thread.c | 602 uw_thread_resume (ptid_t ptid, int step, enum target_signal signo) argument 611 CALL_BASE (base_ops.to_resume (ptid, step, signo));
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_consume.c | 281 * 3. Subtract the result of the previous step (2 or 4, depending) and 284 * x such that 2 * R * 10 * x + x^2 is less than the result from step 3. 306 * only possible non-zero value for x in step 4 is 1, so step 4 becomes a 870 uint16_t step, levels; local 880 step = DTRACE_LQUANTIZE_STEP(arg); 925 base + (levels * step)); 929 base + (i - 1) * step); 949 uint16_t step, levels; local 960 step 1000 int64_t value = 1, next, step; local [all...] |
H A D | dt_aggregate.c | 149 uint16_t step = DTRACE_LQUANTIZE_STEP(arg); local 153 for (i = 0; i < levels; base += step, i++) 165 uint16_t step = DTRACE_LQUANTIZE_STEP(arg); local 171 for (i = 0; i < levels; base += step, i++) { 233 int64_t value = 1, next, step; local 245 step = next > nsteps ? next / nsteps : 1; 251 if ((value += step) != next) 255 step = next > nsteps ? next / nsteps : 1;
|
/freebsd-11-stable/contrib/gcc/ |
H A D | ipa-type-escape.c | 1385 tree step; local 1386 for (step = DECL_STRUCT_FUNCTION (decl)->unexpanded_var_list; 1387 step; 1388 step = TREE_CHAIN (step)) 1390 tree var = TREE_VALUE (step); 1746 form &X.Y. This step adds all of the fields contained within Y
|
H A D | cgraphunit.c | 589 tree step; local 617 for (step = DECL_STRUCT_FUNCTION (body)->unexpanded_var_list; 618 step; 619 step = TREE_CHAIN (step)) 621 tree decl = TREE_VALUE (step);
|
H A D | tree-ssa-loop-im.c | 794 /* If REF is an array reference, check also that the step and the lower 798 tree step = array_ref_element_size (ref); local 801 max_loop = outermost_invariant_loop_expr (step, loop); 865 tree step = array_ref_element_size (ref); local 868 force_move_till_expr (step, fmt_data->orig_loop, fmt_data->loop);
|
H A D | tree-flow.h | 755 tree base, step; member in struct:__anon1380 794 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is 1000 tree symbol, base, index, step, offset; member in struct:mem_address
|
/freebsd-11-stable/gnu/usr.bin/gdb/libgdb/ |
H A D | fbsd-threads.c | 136 static td_err_e (*td_thr_sstep_p) (td_thrhandle_t *th, int step); 603 fbsd_thread_resume (ptid_t ptid, int step, enum target_signal signo) argument 613 child_ops.to_resume (ptid, step, signo); 617 if (GET_PID(ptid) != -1 && step != 0) 636 /* For M:N thread, we need to tell UTS to set/unset single step 639 machine single step flag in ucontext, so we put the flag in mailbox, 640 when the thread switches back, kse_switchin restores the single step 642 ret = td_thr_sstep_p (&th, step); 654 int req = step ? PT_SETSTEP : PT_CLEARSTEP;
|
/freebsd-11-stable/lib/libthread_db/ |
H A D | thread_db.c | 265 td_thr_sstep(const td_thrhandle_t *th, int step) argument 268 return (ta->ta_ops->to_thr_sstep(th, step));
|
/freebsd-11-stable/contrib/llvm-project/lld/ELF/ |
H A D | ICF.cpp | 37 // relocations. During this step, relocation targets are not taken into 47 // 3. If we split an equivalence class in step 2, two relocations 49 // different equivalence classes. Therefore, we repeat step 2 until a 61 // We parallelize each step so that multiple threads can work on different 416 size_t step = sections.size() / numShards; local 422 boundaries[i] = findBoundary((i - 1) * step, sections.size());
|
/freebsd-11-stable/sys/contrib/v4l/ |
H A D | videodev.h | 137 __u16 step; /* Step actual volume uses */ member in struct:video_audio
|
/freebsd-11-stable/sys/kgssapi/ |
H A D | gsstest.c | 403 * token. Repeat this step until both userland and kernel return 413 gsstest_2(struct thread *td, int step, const gss_buffer_t input_token, argument 429 switch (step) { 1044 int step; /* test step number */ member in struct:gsstest_2_args 1083 gsstest_2(td, args.step, &input_token,
|
/freebsd-11-stable/sys/dev/pci/ |
H A D | pcib_private.h | 84 int step; /* log_2 of window granularity */ member in struct:pcib_window
|
/freebsd-11-stable/sys/dev/bktr/ |
H A D | bktr_tuner.c | 768 * N = (freq RF + freq IF) / step size 769 * The step size must be set to 50 khz (so the data sheet tells me) 892 * The step size is 50kHz for FM radio. 935 int step; local 950 for ( step = 0; step < AFC_MAX_STEP; ++step ) {
|
/freebsd-11-stable/contrib/llvm-project/libunwind/src/ |
H A D | libunwind.cpp | 163 return co->step();
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/ |
H A D | authz.c | 562 const node_segment_pair_t *step 567 if ( !step->node 569 || step->segment->kind != acl->rule.path[i].kind 570 || step->segment->pattern.data != acl->rule.path[i].pattern.data) 577 node = step->node; 558 const node_segment_pair_t *step local
|
/freebsd-11-stable/contrib/expat/lib/ |
H A D | xmlparse.c | 193 /* For probing (after a collision) we need a step size relative prime 198 We limit the maximum step size to table->size / 4 (mask >> 2) and make 3313 unsigned char step = 0; local 3327 if (! step) 3328 step = PROBE_STEP(uriHash, mask, parser->m_nsAttsPower); 3329 j < step ? (j += nsAttsSize - step) : (j -= step); 6404 unsigned char step = 0; local 6409 if (! step) [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/lz4/ |
H A D | lz4.c | 531 unsigned step = 1; local 536 forwardIp += step; 537 step = (searchMatchNb++ >> LZ4_skipTrigger); 774 unsigned step = 1; local 780 forwardIp += step; 781 step = (searchMatchNb++ >> LZ4_skipTrigger);
|
/freebsd-11-stable/contrib/bmake/mk/ |
H A D | warnings.mk | 49 # The two step default makes it easier to test build with different defaults.
|
/freebsd-11-stable/crypto/heimdal/lib/sqlite/ |
H A D | sqlite3ext.h | 129 int (*step)(sqlite3_stmt*); member in struct:sqlite3_api_routines 335 #define sqlite3_step sqlite3_api->step
|