Home
last modified time | relevance | path

Searched refs:steps (Results 226 - 250 of 291) sorted by relevance

12345678910>>...12

/kernel/linux/linux-6.6/drivers/gpu/drm/radeon/
H A Drv770_dpm.c1237 u32 steps = 0; in rv770_construct_vddc_table() local
1245 steps = (max - min) / step + 1; in rv770_construct_vddc_table()
1247 if (steps > MAX_NO_VREG_STEPS) in rv770_construct_vddc_table()
1250 for (i = 0; i < steps; i++) { in rv770_construct_vddc_table()
1271 pi->valid_vddc_entries = (u8)steps; in rv770_construct_vddc_table()
/third_party/backends/backend/
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...]
/kernel/linux/linux-5.10/drivers/mtd/nand/raw/
H A Dnand_micron.c247 for (step = 0; step < chip->ecc.steps; step++) { in micron_nand_on_die_ecc_status_4()
H A Dsh_flctl.c68 if (section >= chip->ecc.steps) in flctl_4secc_ooblayout_lp_ecc()
82 if (section >= chip->ecc.steps) in flctl_4secc_ooblayout_lp_free()
/kernel/linux/linux-6.6/drivers/mtd/nand/raw/
H A Dnand_micron.c247 for (step = 0; step < chip->ecc.steps; step++) { in micron_nand_on_die_ecc_status_4()
H A Dsh_flctl.c67 if (section >= chip->ecc.steps) in flctl_4secc_ooblayout_lp_ecc()
81 if (section >= chip->ecc.steps) in flctl_4secc_ooblayout_lp_free()
/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:
/third_party/skia/third_party/externals/icu/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/pcre2/pcre2/src/sljit/
H A DsljitNativeARM_32.c3243 sljit_s32 flags, steps, tmp_reg; in sljit_emit_mem_unaligned() local
3260 steps = 1; in sljit_emit_mem_unaligned()
3266 steps = 1; in sljit_emit_mem_unaligned()
3281 steps = 3; in sljit_emit_mem_unaligned()
3323 SLJIT_ASSERT(steps > 0); in sljit_emit_mem_unaligned()
3345 if (--steps == 0) in sljit_emit_mem_unaligned()
3370 if (steps > 1) { in sljit_emit_mem_unaligned()
3375 } while (--steps != 0); in sljit_emit_mem_unaligned()
/kernel/linux/linux-5.10/net/ceph/
H A Dosdmap.c573 r = kmalloc(struct_size(r, steps, yes), GFP_NOFS); in crush_decode()
582 r->steps[j].op = ceph_decode_32(p); in crush_decode()
583 r->steps[j].arg1 = ceph_decode_32(p); in crush_decode()
584 r->steps[j].arg2 = ceph_decode_32(p); in crush_decode()
/kernel/linux/linux-6.6/net/ceph/
H A Dosdmap.c589 r = kmalloc(struct_size(r, steps, yes), GFP_NOFS); in crush_decode()
598 r->steps[j].op = ceph_decode_32(p); in crush_decode()
599 r->steps[j].arg1 = ceph_decode_32(p); in crush_decode()
600 r->steps[j].arg2 = ceph_decode_32(p); in crush_decode()
/third_party/ffmpeg/libavfilter/
H A Dvsrc_testsrc.c792 int steps = FFMAX(4, l >> 5); in test2_fill_picture() local
811 for (i = 1; i <= steps; i++) { in test2_fill_picture()
812 int x = av_rescale(xh, i, steps) + xc; in test2_fill_picture()
813 int y = av_rescale(yh, i, steps) + yc; in test2_fill_picture()
/third_party/backends/backend/genesys/
H A Dgl841.cpp646 how many steps we need for slow acceleration and how much steps we are in gl841_init_motor_regs_scan()
650 // At least in LiDE 50, 60 the fast movement table is counted in full steps. in gl841_init_motor_regs_scan()
724 /* steps of table 0*/ in gl841_init_motor_regs_scan()
728 /* steps of table 1*/ in gl841_init_motor_regs_scan()
732 /* steps of table 0*/ in gl841_init_motor_regs_scan()
735 /* steps of table 1*/ in gl841_init_motor_regs_scan()
996 /* steps to move to reach scanning area: in calculate_scan_session()
998 either by a fixed steps amount from the black strip in calculate_scan_session()
1000 minus the steps don in calculate_scan_session()
1299 unsigned int steps; eject_document() local
[all...]
/kernel/linux/linux-6.6/sound/soc/atmel/
H A Dmchp-pdmc.c628 u32 tmp, steps = 16; in mchp_pdmc_noise_filter_workaround() local
642 while (steps--) in mchp_pdmc_noise_filter_workaround()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/str_format/
H A Dfloat_conversion.cc55 // 5 steps is 2560 bytes, which is enough to hold a long double with the
63 template <size_t steps>
65 uint32_t values[steps * kStep]{}; in RunWithCapacityImpl()
202 // While we have more than one chunk available, go in steps of 1e9. in BinaryToDecimal()
/kernel/linux/linux-6.6/drivers/spi/
H A Dspi-mtk-snfi.c667 int step_size = 0, strength = 0, desired_correction = 0, steps; in mtk_snand_ecc_init_ctx() local
694 steps = mtd->writesize / step_size; in mtk_snand_ecc_init_ctx()
695 desired_correction = steps * strength; in mtk_snand_ecc_init_ctx()
/third_party/ffmpeg/libavcodec/
H A Don2avc.c355 int steps; in twiddle() local
359 steps = (src2_len - tab_len) / step + 1; in twiddle()
363 for (i = 0; i < steps; i++) { in twiddle()
/third_party/ffmpeg/libavutil/
H A Dpixdesc.c2631 int steps[4] = {0}; in av_get_padded_bits_per_pixel() local
2636 steps[comp->plane] = comp->step << s; in av_get_padded_bits_per_pixel()
2639 bits += steps[c]; in av_get_padded_bits_per_pixel()
/third_party/mbedtls/library/
H A Dx509_crt.c2756 int steps = 4; in x509_inet_pton_ipv6() local
2759 steps--; in x509_inet_pton_ipv6()
2760 } while (*p != ':' && steps > 0); in x509_inet_pton_ipv6()
/kernel/linux/linux-5.10/arch/arm/kernel/
H A Dhead.S418 ARM_BE8(eor r5, r4, r5) @ it can be done in 3 steps
/kernel/linux/linux-6.6/arch/arm/kernel/
H A Dhead.S414 ARM_BE8(eor r5, r4, r5) @ it can be done in 3 steps
/third_party/mesa3d/src/nouveau/codegen/lib/
H A Dgk104.asm620 // Step 4: convert result $r0 back to double, do newton-raphson steps
717 // steps below. Take 2 as a threshold in exponent field, and multiply
739 // For others, do 4 Newton-Raphson steps with the formula:
/third_party/vk-gl-cts/external/openglcts/modules/common/
H A DglcBlendEquationAdvancedTests.cpp595 int numSteps, const BlendStep* steps)
600 , m_steps(steps)
602 DE_ASSERT(repeatCount > 0 && numSteps > 0 && steps);
700 // Loop blending steps.

Completed in 51 milliseconds

12345678910>>...12