Home
last modified time | relevance | path

Searched refs:factor (Results 1 - 25 of 455) sorted by relevance

12345678910>>...19

/third_party/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_test_blend.c198 const double *factor, in compute_blend_ref_term()
209 term[0] = factor[0]; /* R */ in compute_blend_ref_term()
210 term[1] = factor[1]; /* G */ in compute_blend_ref_term()
211 term[2] = factor[2]; /* B */ in compute_blend_ref_term()
214 term[0] = factor[0] * src[0]; /* R */ in compute_blend_ref_term()
215 term[1] = factor[1] * src[1]; /* G */ in compute_blend_ref_term()
216 term[2] = factor[2] * src[2]; /* B */ in compute_blend_ref_term()
219 term[0] = factor[0] * src[3]; /* R */ in compute_blend_ref_term()
220 term[1] = factor[1] * src[3]; /* G */ in compute_blend_ref_term()
221 term[2] = factor[ in compute_blend_ref_term()
196 compute_blend_ref_term(unsigned rgb_factor, unsigned alpha_factor, const double *factor, const double *src, const double *src1, const double *dst, const double *con, double *term) compute_blend_ref_term() argument
[all...]
/third_party/node/deps/v8/src/heap/
H A Dheap-controller.cc18 const double factor = in GrowingFactor() local
22 "[%s] factor %.1f based on mu=%.3f, speed_ratio=%.f " in GrowingFactor()
24 Trait::kName, factor, Trait::kTargetMutatorUtilization, in GrowingFactor()
27 return factor; in GrowingFactor()
40 // growing factor. in MaxGrowingFactor()
48 // On smaller devices we linearly scale the factor: (X-A)/(B-A)*(D-C)+C in MaxGrowingFactor()
49 double factor = (max_size - Trait::kMinSize) * in MaxGrowingFactor() local
53 return factor; in MaxGrowingFactor()
57 // (mutator speed), this function returns the heap growing factor that will
67 // Based on the MU we can compute the heap growing factor
110 double factor = (a < b * max_factor) ? a / b : max_factor; DynamicGrowingFactor() local
128 CalculateAllocationLimit( Heap* heap, size_t current_size, size_t min_size, size_t max_size, size_t new_space_capacity, double factor, Heap::HeapGrowingMode growing_mode) CalculateAllocationLimit() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Renderer/
H A DPixelProcessor.cpp703 factor.textureFactor4[0][0] = textureFactorR; in setTextureFactor()
704 factor.textureFactor4[0][1] = textureFactorR; in setTextureFactor()
705 factor.textureFactor4[0][2] = textureFactorR; in setTextureFactor()
706 factor.textureFactor4[0][3] = textureFactorR; in setTextureFactor()
708 factor.textureFactor4[1][0] = textureFactorG; in setTextureFactor()
709 factor.textureFactor4[1][1] = textureFactorG; in setTextureFactor()
710 factor.textureFactor4[1][2] = textureFactorG; in setTextureFactor()
711 factor.textureFactor4[1][3] = textureFactorG; in setTextureFactor()
713 factor.textureFactor4[2][0] = textureFactorB; in setTextureFactor()
714 factor in setTextureFactor()
[all...]
/third_party/skia/third_party/externals/dng_sdk/source/
H A Ddng_rational.cpp73 void dng_srational::ReduceByFactor (int32 factor) in ReduceByFactor() argument
76 while (n % factor == 0 && in ReduceByFactor()
77 d % factor == 0 && in ReduceByFactor()
78 d >= factor) in ReduceByFactor()
80 n /= factor; in ReduceByFactor()
81 d /= factor; in ReduceByFactor()
137 void dng_urational::ReduceByFactor (uint32 factor) in ReduceByFactor() argument
140 while (n % factor == 0 && in ReduceByFactor()
141 d % factor == 0 && in ReduceByFactor()
142 d >= factor) in ReduceByFactor()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeFactorizerTest.java23 import static com.google.i18n.phonenumbers.metadata.RangeTreeFactorizer.factor;
35 assertThat(factor(empty(), REQUIRE_EQUAL_EDGES)).isEmpty(); in testEmpty()
36 assertThat(factor(empty(), ALLOW_EDGE_SPLITTING)).isEmpty(); in testEmpty()
42 assertThat(factor(t, REQUIRE_EQUAL_EDGES)).containsExactly(t); in testSimplePrefix()
43 assertThat(factor(t, ALLOW_EDGE_SPLITTING)).containsExactly(t); in testSimplePrefix()
49 assertThat(factor(t, REQUIRE_EQUAL_EDGES)).containsExactly(t); in testDisjointBranchesNotFactored()
50 assertThat(factor(t, ALLOW_EDGE_SPLITTING)).containsExactly(t); in testDisjointBranchesNotFactored()
56 assertThat(factor(t, REQUIRE_EQUAL_EDGES)) in testOverlappingBranchesAreFactored()
59 assertThat(factor(t, ALLOW_EDGE_SPLITTING)) in testOverlappingBranchesAreFactored()
67 // into the longer path of the first factor, sinc in testStrategyDifference()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_blend.h10 * garbage that's there. Return a blend factor that will take that into
14 util_blend_dst_alpha_to_one(int factor) in util_blend_dst_alpha_to_one() argument
16 switch (factor) { in util_blend_dst_alpha_to_one()
22 return factor; in util_blend_dst_alpha_to_one()
50 util_blend_factor_to_shader(enum pipe_blendfactor factor) in util_blend_factor_to_shader() argument
52 switch (factor) { in util_blend_factor_to_shader()
93 unreachable("Invalid factor"); in util_blend_factor_to_shader()
98 util_blend_factor_is_inverted(enum pipe_blendfactor factor) in util_blend_factor_is_inverted() argument
100 switch (factor) { in util_blend_factor_is_inverted()
120 util_blend_factor_uses_dest(enum pipe_blendfactor factor, boo argument
[all...]
H A Du_dual_blend.h6 static inline boolean util_blend_factor_is_dual_src(int factor) in util_blend_factor_is_dual_src() argument
8 return (factor == PIPE_BLENDFACTOR_SRC1_COLOR) || in util_blend_factor_is_dual_src()
9 (factor == PIPE_BLENDFACTOR_SRC1_ALPHA) || in util_blend_factor_is_dual_src()
10 (factor == PIPE_BLENDFACTOR_INV_SRC1_COLOR) || in util_blend_factor_is_dual_src()
11 (factor == PIPE_BLENDFACTOR_INV_SRC1_ALPHA); in util_blend_factor_is_dual_src()
/third_party/ffmpeg/libavutil/
H A Dlls.c49 double (*factor)[MAX_VARS_ALIGN] = (void *) &m->covariance[1][0]; in avpriv_solve_lls()
59 sum -= factor[i][k] * factor[j][k]; in avpriv_solve_lls()
64 factor[i][i] = sqrt(sum); in avpriv_solve_lls()
66 factor[j][i] = sum / factor[i][i]; in avpriv_solve_lls()
75 sum -= factor[i][k] * m->coeff[0][k]; in avpriv_solve_lls()
77 m->coeff[0][i] = sum / factor[i][i]; in avpriv_solve_lls()
85 sum -= factor[k][i] * m->coeff[j][k]; in avpriv_solve_lls()
87 m->coeff[j][i] = sum / factor[ in avpriv_solve_lls()
[all...]
/third_party/node/deps/npm/node_modules/promise-retry/test/
H A Dtest.js22 }, { factor: 1 })
46 }, { factor: 1 })
124 }, { retries: 2, factor: 1 })
146 }, { retries: 1, factor: 1 })
157 }, { factor: 1 })
168 }, { retries: 1, factor: 1 })
179 }, { retries: 1, factor: 1 })
188 }, { retries: 1, factor: 1 });
211 }, { factor: 1 })
233 }, { retries: 1, factor
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/
H A DRangeTreeFactorizer.java37 * Edges are only merged if they accept exactly the same set of digits. If the existing factor
43 * existing factor contains "[0-5]" and the candidate edge is "[0-8]", the candidate edge is
52 * Paths are processed longest-first, and a path belongs in particular "factor" if it can be
53 * added without "causing a split" in the existing factor. For example, given an existing factor
66 public static ImmutableList<RangeTree> factor(RangeTree ranges, MergeStrategy strategy) { in factor() method in RangeTreeFactorizer
77 // In each loop we subsume a candidate factor into previous factors, either in whole or in part. in factor()
80 // Merge (as much as possible) each "naive" factor into earlier factors. in factor()
85 // Calculate the ranges which haven't yet been merged into any earlier factor. in factor()
89 // All ranges merged, so remove the original factor (inde in factor()
101 private RangeTree factor; global() field in RangeTreeFactorizer
104 RangeTreeFactorizer(RangeTree factor, MergeStrategy strategy) RangeTreeFactorizer() argument
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dunits_converter.cpp146 Adds single factor to a `Factor` object. Single factor means "23^2", "23.3333", "ft2m^3" ...etc.
147 However, complex factor are not included, such as "ft2m^3*200/3"
149 void addFactorElement(Factor &factor, StringPiece elementStr, Signum signum, UErrorCode &status) {
174 addSingleFactorConstant(baseStr, power, signum, factor, status);
178 * Extracts `Factor` from a complete string factor. e.g. "ft2m^3*1007/cup2m3*3"
203 // Load factor for a single source
212 Factor result = extractFactorConversions(conversionUnit->factor.toStringPiece(), status);
280 // Represents the conversion factor from the source to the target.
283 // Represents the conversion factor fro
[all...]
/third_party/libinput/src/
H A Dfilter-touchpad-x230.c50 #define DEFAULT_ACCELERATION 2.0 /* unitless factor */
51 #define DEFAULT_INCLINE 1.1 /* unitless factor */
55 #define X230_ACCELERATION 2.0 /* unitless factor */
56 #define X230_INCLINE 1.1 /* unitless factor */
71 double accel; /* unitless factor */
85 * @return A unitless acceleration factor, to be applied to the delta
95 * Calculate the acceleration factor for our current velocity, averaging
104 * @return A unitless acceleration factor, to be applied to the delta
113 double factor; in calculate_acceleration() local
117 factor in calculate_acceleration()
176 const double factor = accelerator_filter_constant_x230() local
259 double factor; /* unitless */ touchpad_lenovo_x230_accel_profile() local
[all...]
H A Dfilter-flat.c40 double factor; member
51 double factor; /* unitless factor */ in accelerator_filter_flat() local
56 factor = accel_filter->factor; in accelerator_filter_flat()
57 accelerated.x = factor * unaccelerated->x; in accelerator_filter_flat()
58 accelerated.y = factor * unaccelerated->y; in accelerator_filter_flat()
71 * apply any acceleration (merely a constant factor) and we can assume in accelerator_filter_noop_flat()
75 * Thus we apply the same factor to our non-accelerated motion - this way in accelerator_filter_noop_flat()
96 accel_filter->factor in accelerator_set_speed_flat()
[all...]
H A Dfilter-touchpad-flat.c42 double factor; member
53 double factor; /* unitless factor */ in accelerator_filter_touchpad_flat() local
58 factor = accel->factor; in accelerator_filter_touchpad_flat()
60 normalized.x = TP_MAGIC_SLOWDOWN_FLAT * factor * normalized.x; in accelerator_filter_touchpad_flat()
61 normalized.y = TP_MAGIC_SLOWDOWN_FLAT * factor * normalized.y; in accelerator_filter_touchpad_flat()
74 * apply any acceleration (merely a constant factor) and we can assume in accelerator_filter_noop_touchpad_flat()
78 * Thus we apply the same factor to our non-accelerated motion - this way in accelerator_filter_noop_touchpad_flat()
94 accel_filter->factor in accelerator_set_speed_touchpad_flat()
[all...]
H A Dfilter-tablet.c40 double factor; member
64 accelerated.x *= filter->factor; in tablet_accelerator_filter_flat_mouse()
65 accelerated.y *= filter->factor; in tablet_accelerator_filter_flat_mouse()
84 const double DPI_CONVERSION = 96.0/25.4 * 2.5; /* unitless factor */ in tablet_accelerator_filter_flat_pen()
89 accelerated.x = mm.x * filter->factor * DPI_CONVERSION; in tablet_accelerator_filter_flat_pen()
90 accelerated.y = mm.y * filter->factor * DPI_CONVERSION; in tablet_accelerator_filter_flat_pen()
132 accel_filter->factor = speed_adjustment + 1.0; in tablet_accelerator_set_speed()
162 filter->factor = 1.0; in create_tablet_filter_flat()
/third_party/skia/src/core/
H A DSkGaussFilter.cpp50 // NB the k = 0 factor is just sum = 1.0. in calculate_bessel_factors()
54 auto factor = 1.0; in calculate_bessel_factors()
58 while(factor > 1.0/1000000.0) { in calculate_bessel_factors()
59 factor *= tSquaredOver4 / (k * k); in calculate_bessel_factors()
60 sum += factor; in calculate_bessel_factors()
69 auto factor = sum; in calculate_bessel_factors()
71 while (factor > 1.0/1000000.0) { in calculate_bessel_factors()
72 factor *= tSquaredOver4 / (k * (k + 1)); in calculate_bessel_factors()
73 sum += factor; in calculate_bessel_factors()
/third_party/ffmpeg/libavcodec/
H A Djpegls.c69 int factor; in ff_jpegls_reset_coding_parameters() local
75 factor = FFMIN(s->maxval, 4095) + 128 >> 8; in ff_jpegls_reset_coding_parameters()
78 s->T1 = iso_clip(factor * (basic_t1 - 2) + 2 + 3 * s->near, in ff_jpegls_reset_coding_parameters()
81 s->T2 = iso_clip(factor * (basic_t2 - 3) + 3 + 5 * s->near, in ff_jpegls_reset_coding_parameters()
84 s->T3 = iso_clip(factor * (basic_t3 - 4) + 4 + 7 * s->near, in ff_jpegls_reset_coding_parameters()
87 factor = 256 / (s->maxval + 1); in ff_jpegls_reset_coding_parameters()
90 s->T1 = iso_clip(FFMAX(2, basic_t1 / factor + 3 * s->near), in ff_jpegls_reset_coding_parameters()
93 s->T2 = iso_clip(FFMAX(3, basic_t2 / factor + 5 * s->near), in ff_jpegls_reset_coding_parameters()
96 s->T3 = iso_clip(FFMAX(4, basic_t3 / factor + 7 * s->near), in ff_jpegls_reset_coding_parameters()
/third_party/ffmpeg/libavfilter/
H A Daf_asoftclip.c85 { "oversample", "set oversample factor", OFFSET(oversample), AV_OPT_TYPE_INT, {.i64=1}, 1, MAX_OVERSAMPLE, A },
97 double factor; in get_lowpass() local
113 factor = (s->da0 + s->da1 + s->da2) / (s->db0 + s->db1 + s->db2); in get_lowpass()
114 s->db0 *= factor; in get_lowpass()
115 s->db1 *= factor; in get_lowpass()
116 s->db2 *= factor; in get_lowpass()
148 float factor = 1.f / threshold; in filter_flt() local
169 dst[n] = av_clipf(dst[n] * factor, -1.f, 1.f); in filter_flt()
175 dst[n] = tanhf(dst[n] * factor * param); in filter_flt()
181 dst[n] = 2.f / M_PI * atanf(dst[n] * factor * para in filter_flt()
273 double factor = 1. / threshold; filter_dbl() local
[all...]
/third_party/rust/crates/nom/tests/
H A Darithmetic.rs25 fn factor(i: &str) -> IResult<&str, i64> { in factor() functions
32 // We read an initial factor and for each time we find
33 // a * or / operator followed by another factor, we do
36 let (i, init) = factor(i)?; in term()
39 pair(alt((char('*'), char('/'))), factor), in term()
69 assert_eq!(factor("3"), Ok(("", 3))); in factor_test()
70 assert_eq!(factor(" 12"), Ok(("", 12))); in factor_test()
71 assert_eq!(factor("537 "), Ok(("", 537))); in factor_test()
72 assert_eq!(factor(" 24 "), Ok(("", 24))); in factor_test()
/third_party/icu/icu4c/source/i18n/
H A Dunits_converter.cpp146 Adds single factor to a `Factor` object. Single factor means "23^2", "23.3333", "ft2m^3" ...etc.
147 However, complex factor are not included, such as "ft2m^3*200/3"
149 void addFactorElement(Factor &factor, StringPiece elementStr, Signum signum, UErrorCode &status) {
174 addSingleFactorConstant(baseStr, power, signum, factor, status);
178 * Extracts `Factor` from a complete string factor. e.g. "ft2m^3*1007/cup2m3*3"
203 // Load factor for a single source
212 Factor result = extractFactorConversions(conversionUnit->factor.toStringPiece(), status);
280 // Represents the conversion factor from the source to the target.
283 // Represents the conversion factor fro
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dunits_converter.cpp145 Adds single factor to a `Factor` object. Single factor means "23^2", "23.3333", "ft2m^3" ...etc.
146 However, complex factor are not included, such as "ft2m^3*200/3"
148 void addFactorElement(Factor &factor, StringPiece elementStr, Signum signum, UErrorCode &status) {
173 addSingleFactorConstant(baseStr, power, signum, factor, status);
177 * Extracts `Factor` from a complete string factor. e.g. "ft2m^3*1007/cup2m3*3"
202 // Load factor for a single source
211 Factor result = extractFactorConversions(conversionUnit->factor.toStringPiece(), status);
279 // Represents the conversion factor from the source to the target.
282 // Represents the conversion factor fro
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/ap/
H A Dacs.c42 * 2. interference factor is calculated for each channel
66 * Survey interference factor implementation details
70 * The survey interference factor is defined as the ratio of the
106 * All this "interference factor" is purely subjective and only time
109 * of the interference factor then is dependent on what the card itself
115 * The above channel interference factor is calculated with no respect to
124 * interference factor is computed by summing up interferences of each channel
127 * Note: This implies base channel interference factor must be non-negative
140 * ACS: * interference factor average: 0.0557166
147 * ACS: * interference factor averag
296 long double factor, busy, total; acs_survey_interference_factor() local
579 long double factor, ideal_factor = 0; acs_find_ideal_chan() local
[all...]
/third_party/mesa3d/src/mesa/main/
H A Dlines.c101 * \param factor pattern scale factor.
111 _mesa_LineStipple( GLint factor, GLushort pattern ) in _mesa_LineStipple() argument
116 _mesa_debug(ctx, "glLineStipple %d %u\n", factor, pattern); in _mesa_LineStipple()
118 factor = CLAMP( factor, 1, 256 ); in _mesa_LineStipple()
120 if (ctx->Line.StippleFactor == factor && in _mesa_LineStipple()
126 ctx->Line.StippleFactor = factor; in _mesa_LineStipple()
/third_party/ltp/tools/genload/
H A Dstress.c149 err(stderr, "invalid backoff factor: %i\n", in main()
344 " --backoff n wait for factor of n us before starting work\n" in usage()
386 long long factor = 1; in atoll_b() local
396 factor = 1024; in atoll_b()
400 factor = 1024 * 1024; in atoll_b()
404 factor = 1024 * 1024 * 1024; in atoll_b()
413 factor = atoll(nptr) * factor; in atoll_b()
415 return factor; in atoll_b()
425 long long factor in atoll_s() local
[all...]
H A Dgenload.c149 err(stderr, "invalid backoff factor: %i\n", in main()
344 " --backoff n wait for factor of n us before starting work\n" in usage()
386 long long factor = 1; in atoll_b() local
396 factor = 1024; in atoll_b()
400 factor = 1024 * 1024; in atoll_b()
404 factor = 1024 * 1024 * 1024; in atoll_b()
413 factor = atoll(nptr) * factor; in atoll_b()
415 return factor; in atoll_b()
425 long long factor in atoll_s() local
[all...]

Completed in 12 milliseconds

12345678910>>...19