/freebsd-11-stable/sys/dev/acpi_support/ |
H A D | acpi_ibm.c | 1074 int val, step; local 1100 step = (arg > val) ? 1 : -1; 1101 for (int i = val; i != arg; i += step) { 1108 IBM_EC_BRIGHTNESS, i - step, 1); 1166 int val, step; local 1192 step = (arg > val) ? 1 : -1; 1193 for (int i = val; i != arg; i += step) { 1199 val_ec = i - step +
|
/freebsd-11-stable/crypto/openssl/crypto/camellia/asm/ |
H A D | cmll-x86.pl | 548 { my $step=0; 603 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[0] 608 &Camellia_Feistel($step++); 609 &Camellia_Feistel($step++); 619 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[4] 624 &Camellia_Feistel($step++); 625 &Camellia_Feistel($step++); 670 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[8] 675 &Camellia_Feistel($step++); 676 &Camellia_Feistel($step [all...] |
H A D | cmll-x86_64.pl | 398 { my $step=0; 462 &Camellia_Feistel($step++); 463 &Camellia_Feistel($step++); 470 &Camellia_Feistel($step++); 471 &Camellia_Feistel($step++); 521 &Camellia_Feistel($step++); 522 &Camellia_Feistel($step++);
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-data-ref.c | 910 tree init, step; 913 step = evolution_part_in_loop_num (access_fn, loop->num); 926 && step != NULL_TREE 928 && TREE_CODE (step) == INTEGER_CST) 930 tree i_plus_s = fold_build2 (PLUS_EXPR, integer_type_node, init, step); 936 data_size, init), step); 938 /* When the step is negative, as in PR23386: (init = 3, step = 940 estimation as ceil_div (init, 0 - step) + 1. */ 947 integer_zero_node, step)), 908 tree init, step; local 1062 tree base_address = NULL_TREE, evolution, step = NULL_TREE; local 1122 init_data_ref(tree stmt, tree ref, tree base, tree access_fn, bool is_read, tree base_address, tree init_offset, tree step, tree misalign, tree memtag, struct ptr_info_def *ptr_info, enum data_ref_type type) argument 1228 analyze_offset_expr(tree expr, struct loop *loop, tree *initial_offset, tree *misalign, tree *aligned_to, tree *step) argument 1436 address_analysis(tree expr, tree stmt, bool is_read, struct data_reference *dr, tree *offset, tree *misalign, tree *aligned_to, tree *step) argument 1595 object_analysis(tree memref, tree stmt, bool is_read, struct data_reference **dr, tree *offset, tree *misalign, tree *aligned_to, tree *step, tree *memtag, struct ptr_info_def **ptr_info, subvar_t *subvars) argument 1958 tree base_address, offset, step, misalign, memtag; local [all...] |
H A D | cfgloop.h | 269 delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)). 275 subreg_{mode} (base + i * step) 285 /* Its base and step (mode of base and step is supposed to be extend_mode, 287 rtx base, step; member in struct:rtx_iv
|
H A D | lambda.h | 116 int step; member in struct:lambda_loop_s 122 #define LL_STEP(T) ((T)->step)
|
H A D | ipa-reference.c | 825 tree step; 826 for (step = DECL_STRUCT_FUNCTION (decl)->unexpanded_var_list; 827 step; 828 step = TREE_CHAIN (step)) 830 tree var = TREE_VALUE (step); 824 tree step; local
|
H A D | modulo-sched.c | 1310 6. start = Early_start; end = Early_start + II - 1; step = 1 1313 13. start = Late_start; end = Late_start - II + 1; step = -1 1319 19. step = 1 1321 21. start = ASAP(u); end = start + II - 1; step = 1 1325 24. for (c = start ; c != end ; c += step) 1365 int start, step, end; 1376 /* 1. compute sched window for u (start, end, step). */ 1403 step = 1; 1425 step = -1; 1463 step 1362 int start, step, end; local 1491 int start, end, step; /* Place together into one struct? */ local [all...] |
/freebsd-11-stable/sys/dev/ath/ath_hal/ |
H A D | ah_regdomain.c | 463 int maxchans, int *nchans, uint16_t freq_lo, uint16_t freq_hi, int step, 473 for (freq += step; freq <= freq_hi && error == 0; freq += step) 530 int step; local 554 step = fband->channelSep; 556 step = roundup(channelSep, fband->channelSep); 559 bfreq_lo, bfreq_hi, step, cm->flags, fband, rd); 462 add_chanlist_band(struct ath_hal *ah, struct ieee80211_channel chans[], int maxchans, int *nchans, uint16_t freq_lo, uint16_t freq_hi, int step, uint32_t flags, REG_DMN_FREQ_BAND *fband, REG_DOMAIN *rd) argument
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | lynx-nat.c | 524 If STEP is nonzero, single-step it. 528 child_resume (ptid_t ptid, int step, enum target_signal signal) argument 535 /* If pid == -1, then we want to step/continue all threads, else 536 we only want to step/continue a single thread. */ 540 func = step ? PTRACE_SINGLESTEP : PTRACE_CONT; 543 func = step ? PTRACE_SINGLESTEP_ONE : PTRACE_CONT_ONE; 551 have called single_step() to transmute the step request into a
|
H A D | ppcbug-rom.c | 140 OPS->step = "t\r"; /* single step */
|
H A D | remote-rdi.c | 66 static void arm_rdi_resume (ptid_t pid, int step, 435 arm_rdi_resume (ptid_t ptid, int step, enum target_signal siggnal) 451 if (step) 462 if (step) 640 printf_filtered ("Target can%s single-step.\n", (arg1 & 0x4 ? "" : "not")); 433 arm_rdi_resume(ptid_t ptid, int step, enum target_signal siggnal) argument
|
H A D | rom68k-rom.c | 198 rom68k_cmds.step = "st\r";
|
H A D | infptrace.c | 164 /* On HPUX, PT_SINGLE1 is a form of step that preserves pending 239 If STEP is nonzero, single-step it. 243 child_resume (ptid_t ptid, int step, enum target_signal signal) 260 have called single_step() to transmute the step request into a 264 if (step) 242 child_resume(ptid_t ptid, int step, enum target_signal signal) argument
|
H A D | remote-st.c | 349 st2000_resume (ptid_t ptid, int step, enum target_signal sig) argument 351 if (step)
|
/freebsd-11-stable/sys/dev/fdc/ |
H A D | fdc.c | 274 /* is cleared by any step pulse to drive */ 344 "Specification byte one (step-rate + head unload)"); 486 int i, j, step; local 488 step = 1; 489 for (j = 0; j < FDSTS_TIMEOUT; j += step) { 499 step += step; 500 DELAY(step); 508 int i, j, step; local 510 step [all...] |
/freebsd-11-stable/crypto/openssl/apps/ |
H A D | engine.c | 100 static int append_buf(char **buf, const char *s, int *size, int step) argument 103 *size = step; 113 *size += step;
|
/freebsd-11-stable/contrib/ncurses/form/ |
H A D | fty_regex.c | 309 match = (step(field_buffer(field, 0), ap->compiled_expression)
|
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | refclock_irig.c | 319 double step; /* codec adjustment */ local 366 step = 2.; 368 up->comp[i] = up->comp[i - 1] + step; 371 step *= 2.;
|
/freebsd-11-stable/contrib/gcc/config/sparc/ |
H A D | lb1spc.asm | 168 ! as our usual N-at-a-shot divide step will cause overflow and havoc. 202 ! %o5 > %o3: went too far: back up 1 step 208 ! first divide step without thinking. BUT, the others are conditional, 210 ! order bit set in the first step, just falling into the regular 515 ! as our usual N-at-a-shot divide step will cause overflow and havoc. 549 ! %o5 > %o3: went too far: back up 1 step 555 ! first divide step without thinking. BUT, the others are conditional, 557 ! order bit set in the first step, just falling into the regular
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
H A D | lz4.c | 510 int step = findMatchAttempts++ >> skipStrength; local 512 forwardIp = ip + step; 703 int step = findMatchAttempts++ >> skipStrength; local 705 forwardIp = ip + step;
|
/freebsd-11-stable/contrib/llvm-project/lld/COFF/ |
H A D | ICF.cpp | 225 size_t step = chunks.size() / numShards; local 230 boundaries[i] = findBoundary((i - 1) * step, chunks.size());
|
/freebsd-11-stable/contrib/lua/src/ |
H A D | lvm.c | 123 ** (The following explanation assumes a non-negative step; it is valid 135 static int forlimit (const TValue *obj, lua_Integer *p, lua_Integer step, argument 138 if (!luaV_tointeger(obj, p, (step < 0 ? 2 : 1))) { /* not fit in integer? */ 144 if (step < 0) *stopnow = 1; 148 if (step >= 0) *stopnow = 1; 1192 lua_Integer step = ivalue(ra + 2); local 1193 lua_Integer idx = intop(+, ivalue(ra), step); /* increment index */ 1195 if ((0 < step) ? (idx <= limit) : (limit <= idx)) { 1202 lua_Number step = fltvalue(ra + 2); local 1203 lua_Number idx = luai_numadd(L, fltvalue(ra), step); /* in [all...] |
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_gsupport.cpp | 1652 T step) { 1670 "priority:%%d start:%%%s end:%%%s step:%%%s\n", 1673 gomp_flags, num_tasks, priority, start, end, step)); 1687 // Negative step flag 1689 // If step is flagged as negative, but isn't properly sign extended 1692 if (step > 0) { 1695 if (step & ((T)1 << i)) 1697 step |= ((T)1 << i); 1734 (kmp_uint64 *)&(loop_bounds[1]), (kmp_int64)step, nogroup, 1791 int priority, long start, long end, long step) { 1648 __GOMP_taskloop(void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, T start, T end, T step) argument 1788 KMP_API_NAME_GOMP_TASKLOOP( void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, long start, long end, long step) argument 1796 KMP_API_NAME_GOMP_TASKLOOP_ULL( void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, unsigned long long start, unsigned long long end, unsigned long long step) argument [all...] |
/freebsd-11-stable/crypto/heimdal/appl/gssmask/ |
H A D | gssmaestro.c | 321 int step = 0; local 339 step++; 349 warnx("iPeer %s failed with %d (step %d)", 350 ipeer->name, (int)val, step); 362 step++; 372 warnx("aPeer %s failed with %d (step %d)", 373 apeer->name, (int)val, step); 883 * step from the last entry to the first, ie treat the list as a
|