Home
last modified time | relevance | path

Searched refs:steps (Results 76 - 100 of 125) sorted by relevance

12345

/third_party/python/Tools/demo/
H A Dsortvisu.py242 nsteps = steps(self.index, index)
256 nsteps = steps(self.index, other.index)
337 def steps(here, there): function
/third_party/skia/src/gpu/
H A DGrDataUtils.cpp669 SkTLazy<SkColorSpaceXformSteps> steps; in GrConvertPixels() local
672 steps.init(src.colorSpace(), src.alphaType(), dst.colorSpace(), dst.alphaType()); in GrConvertPixels()
714 steps->apply(&pipeline); in GrConvertPixels()
/third_party/jerryscript/jerry-core/ecma/base/
H A Decma-helpers.c629 uint32_t steps = 0; in ecma_find_named_property() local
668 steps++; in ecma_find_named_property()
709 steps++; in ecma_find_named_property()
716 if (steps >= (ECMA_PROPERTY_HASMAP_MINIMUM_SIZE / 2)) in ecma_find_named_property()
/third_party/skia/third_party/externals/abseil-cpp/absl/debugging/internal/
H A Ddemangle.cc170 // constant data, data that's intentionally immune to backtracking (steps), or
180 int steps; // Cap how much work we'll do, regardless of depth. member
191 ++state->steps; in ComplexityGuard()
200 // We're trying to pick a charitable upper-limit on how many parse steps are
211 // Spending one second on 2^17 parse steps would require each step to take
218 state_->steps > kParseStepsLimit; in IsTooComplex()
262 state->steps = 0; in InitState()
587 // the parse-steps counter increases regardless of success or failure).
/third_party/backends/backend/
H A Dplustek-pp_procs.h172 _LOC void MotorP98003PositionYProc ( pScanData ps, ULong steps);
H A Dhp3900_rts8822.c395 static SANE_Byte *Motor_AddStep (SANE_Byte * steps, SANE_Int * bwriten,
2996 Motor_AddStep (SANE_Byte * steps, SANE_Int * bwriten, SANE_Int step) in Motor_AddStep() argument
2998 steps = (SANE_Byte *) realloc (steps, sizeof (SANE_Byte) * (*bwriten + 3)); in Motor_AddStep()
2999 if (steps != NULL) in Motor_AddStep()
3001 data_msb_set (&steps[*bwriten], step, 3); in Motor_AddStep()
3007 return steps; in Motor_AddStep()
3018 SANE_Byte *steps; in Motor_Setup_Steps() local
3026 steps = NULL; in Motor_Setup_Steps()
3032 /* mycurve points to acc normalscan steps tabl in Motor_Setup_Steps()
[all...]
H A Dpieusb_scancmd.h368 void sanei_pieusb_cmd_set_scan_head(SANE_Int device_number, SANE_Int mode, SANE_Int steps, struct Pieusb_Command_Status *status);
H A Dhp3900_config.c3819 SANE_Int steps[] = in bq5550_motor() local
3831 rst = (SANE_Int *)malloc(sizeof(steps)); in bq5550_motor()
3833 memcpy(rst, &steps, sizeof(steps)); in bq5550_motor()
3841 SANE_Int steps[] = in hp4370_motor() local
3932 rst = (SANE_Int *)malloc(sizeof(steps)); in hp4370_motor()
3934 memcpy(rst, &steps, sizeof(steps)); in hp4370_motor()
3942 SANE_Int steps[] = in hp3970_motor() local
4033 rst = (SANE_Int *)malloc(sizeof(steps)); in hp3970_motor()
4043 SANE_Int steps[] = hp3800_motor() local
[all...]
H A Dplustek-pp_motor.c25 * - reduced number of forward steps for MotorToHomePosition
2369 /* Try to find the available step for all rest steps.
2370 * 1) if current step is valid (with data request), fill all steps
2373 * valid entry, then fill all steps after it
2445 * bColors = number of steps should be reserved
2551 static void motorP98003ModuleFreeRun( pScanData ps, ULong steps )
2553 IODataToRegister( ps, ps->RegMotorFreeRunCount1, (_HIBYTE(steps)));
2554 IODataToRegister( ps, ps->RegMotorFreeRunCount0, (_LOBYTE(steps)));
3319 _LOC void MotorP98003PositionYProc( pScanData ps, ULong steps) argument
3333 motorP98003ModuleFreeRun( ps, steps );
[all...]
/third_party/skia/src/utils/
H A DSkPolyUtils.cpp487 // limit the number of steps to at most max uint16_t (that's all we can index) in SkComputeRadialSteps()
492 int steps = SkScalarRoundToInt(floatSteps); in SkComputeRadialSteps() local
494 SkScalar dTheta = steps > 0 ? theta / steps : 0; in SkComputeRadialSteps()
499 if (steps > 0 && (*rotSin == 0 || *rotCos == 1)) { in SkComputeRadialSteps()
502 *n = steps; in SkComputeRadialSteps()
/third_party/icu/icu4c/source/test/cintltst/
H A Dreapits.c200 TestCallbackFn(const void *context, int32_t steps) { in TestCallbackFn() argument
202 if (info->lastSteps+1 != steps) { in TestCallbackFn()
203 log_err("incorrect steps in callback. Expected %d, got %d\n", info->lastSteps+1, steps); in TestCallbackFn()
205 info->lastSteps = steps; in TestCallbackFn()
2270 static UBool U_CALLCONV MatchCallback(const void *context, int32_t steps) { in MatchCallback() argument
2273 (void)steps; in MatchCallback()
/third_party/python/Lib/
H A Dturtle.py1939 def circle(self, radius, extent = None, steps = None):
1945 steps (optional) -- an integer
1956 steps determines the number of steps to use. If not given,
1962 --or: circle(radius, extent, steps)
1963 --or: circle(radius, steps=6) # 6-sided polygon
1975 if steps is None:
1977 steps = 1+int(min(11+abs(radius)/6.0, 59.0)*frac)
1978 w = 1.0 * extent / steps
1990 for i in range(steps)
[all...]
/third_party/gn/src/gn/
H A Dargs.cc63 values. These default values will apply if none of the steps listed in the
/third_party/libunwind/libunwind/doc/
H A Dunw_resume.tex57 and language-specific data area (lsda). These steps are generally
/third_party/node/deps/v8/src/heap/
H A Dgc-tracer.h68 int steps; member
193 // Duration (in ms) of incremental marking steps for
327 // Compute the overall mark compact speed including incremental steps
497 // Size of incremental marking steps (in bytes) accumulated since the end of
501 // Duration (in ms) of incremental marking steps since the end of the last
H A Dgc-tracer.cc683 " (+ %.1f ms in %d steps since start of marking, " in Print()
686 incremental_scope(Scope::MC_INCREMENTAL).steps, in Print()
806 incremental_scope(GCTracer::Scope::MC_INCREMENTAL).steps, in PrintNVP()
1031 incremental_scope(Scope::MC_INCREMENTAL_FINALIZE_BODY).steps, in PrintNVP()
1033 incremental_scope(Scope::MC_INCREMENTAL).steps, in PrintNVP()
1198 // there might not be many incremental marking steps because of concurrent in CombinedMarkCompactSpeedInBytesPerMillisecond()
/third_party/protobuf/objectivec/DevTools/
H A Dfull_mac_build.sh3 # Helper to do build so you don't have to remember all the steps/args.
17 This script does the common build steps needed.
/third_party/skia/experimental/graphite/src/
H A DDrawPass.cpp63 * description is encoded in two steps:
70 * This allows the SortKey to cluster draw steps that have both a compatible pipeline and do not
109 uint32_t fPipeline : 30; // bits >= log2(max steps * DrawList::kMaxDraws)
115 uint32_t fGeometryIndex; // bits >= log2(max steps * max draw count)
200 const RenderStep* const step = draw.fRenderer.steps()[stepIndex]; in Make()
281 // const RenderStep* const step = draw.fRenderer.steps()[key.renderStep()]; in Make()
/third_party/mesa3d/src/nouveau/codegen/lib/
H A Dgm107.asm187 // Step 4: convert result $r0 back to double, do newton-raphson steps
289 // steps below. Take 2 as a threshold in exponent field, and multiply
317 // For others, do 4 Newton-Raphson steps with the formula:
H A Dgk110.asm162 // Step 4: convert result $r0 back to double, do newton-raphson steps
258 // steps below. Take 2 as a threshold in exponent field, and multiply
280 // For others, do 4 Newton-Raphson steps with the formula:
/third_party/backends/backend/genesys/
H A Dgenesys.cpp492 DBG_HELPER_ARGS(dbg, "table_nr = %d, steps = %zu", table_nr, slope_table.size()); in scanner_send_slope_table()
731 void scanner_move(Genesys_Device& dev, ScanMethod scan_method, unsigned steps, Direction direction) in scanner_move() argument
733 DBG_HELPER_ARGS(dbg, "steps=%d direction=%d", steps, static_cast<unsigned>(direction)); in scanner_move()
754 if (direction == Direction::BACKWARD && steps > dev.head_pos(ScanHeadId::PRIMARY)) { in scanner_move()
756 steps, dev.head_pos(ScanHeadId::PRIMARY)); in scanner_move()
759 steps > dev.head_pos(ScanHeadId::SECONDARY)) in scanner_move()
762 steps, dev.head_pos(ScanHeadId::SECONDARY)); in scanner_move()
769 session.params.starty = steps; in scanner_move()
824 dev.advance_head_pos_by_steps(ScanHeadId::PRIMARY, direction, steps); in scanner_move()
3957 unsigned int steps, expected; genesys_start_scan() local
[all...]
/third_party/skia/src/core/
H A DSkRuntimeEffect.cpp739 SkColorSpaceXformSteps steps(sk_srgb_singleton(), kUnpremul_SkAlphaType, in get_xformed_uniforms()
753 if (steps.flags.mask()) { in get_xformed_uniforms()
758 steps.apply(color); in get_xformed_uniforms()
763 // because steps shouldn't include unpremul or premul, and thus shouldn't in get_xformed_uniforms()
769 steps.apply(rgba); in get_xformed_uniforms()
/third_party/icu/icu4c/source/i18n/unicode/
H A Duregex.h1415 * The units of the limit are steps of the match engine.
1439 * @return the maximum allowed time for a match, in units of processing steps.
1495 * @param steps the accumulated processing time, in match steps,
1504 int32_t steps);
/third_party/node/deps/icu-small/source/i18n/unicode/
H A Duregex.h1415 * The units of the limit are steps of the match engine.
1439 * @return the maximum allowed time for a match, in units of processing steps.
1495 * @param steps the accumulated processing time, in match steps,
1504 int32_t steps);
/third_party/skia/third_party/externals/libpng/projects/owatcom/
H A Dpngconfig.mak105 $# please complete the following steps:

Completed in 51 milliseconds

12345