| /external/skia/tests/ |
| D | PathOpsTightBoundsTest.cpp | 134 SkRect tight; in DEF_TEST() local
135 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
136 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
143 SkRect tight; in DEF_TEST() local
144 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
145 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
153 SkRect tight; in DEF_TEST() local
154 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
155 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
163 SkRect tight; in DEF_TEST() local
[all …]
|
| /external/skqp/tests/ |
| D | PathOpsTightBoundsTest.cpp | 135 SkRect tight; in DEF_TEST() local
136 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
137 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
144 SkRect tight; in DEF_TEST() local
145 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
146 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
154 SkRect tight; in DEF_TEST() local
155 REPORTER_ASSERT(reporter, TightBounds(path, &tight)); in DEF_TEST()
156 REPORTER_ASSERT(reporter, bounds == tight); in DEF_TEST()
164 SkRect tight; in DEF_TEST() local
[all …]
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_bound.c | 212 __isl_take isl_pw_qpolynomial_fold *pwf, isl_bool *tight) in isl_pw_qpolynomial_fold_bound() argument
234 if (tight) in isl_pw_qpolynomial_fold_bound()
235 *tight = isl_bool_true; in isl_pw_qpolynomial_fold_bound()
242 if (tight) in isl_pw_qpolynomial_fold_bound()
243 *tight = isl_bool_true; in isl_pw_qpolynomial_fold_bound()
251 bound.check_tight = !!tight; in isl_pw_qpolynomial_fold_bound()
261 if (tight) in isl_pw_qpolynomial_fold_bound()
262 *tight = covers; in isl_pw_qpolynomial_fold_bound()
285 isl_bool *tight) in isl_pw_qpolynomial_bound() argument
290 return isl_pw_qpolynomial_fold_bound(pwf, tight); in isl_pw_qpolynomial_bound()
[all …]
|
| D | isl_bernstein.c | 124 isl_bool tight; in add_fold() local
128 tight = isl_bool_false; in add_fold()
130 tight = is_tight(k, n, d, data->cell); in add_fold()
131 if (tight < 0) in add_fold()
133 if (tight) in add_fold()
359 isl_bool *tight) in bernstein_coefficients_base() argument
376 if (tight) in bernstein_coefficients_base()
377 *tight = isl_bool_true; in bernstein_coefficients_base()
388 if (tight) in bernstein_coefficients_base()
389 *tight = isl_bool_true; in bernstein_coefficients_base()
[all …]
|
| D | isl_range.c | 15 int tight; member
61 data_m.tight = 0; in has_sign()
282 if (data->tight) in add_guarded_poly()
321 data->tight = 0; in plug_in_at_pos()
357 int save_tight = data->tight; in propagate_on_bound_pair()
371 if (data->tight) in propagate_on_bound_pair()
372 data->tight = bound_is_integer(upper, nvar); in propagate_on_bound_pair()
376 if (data->tight) in propagate_on_bound_pair()
377 data->tight = bound_is_integer(lower, nvar); in propagate_on_bound_pair()
390 data->tight = 0; in propagate_on_bound_pair()
[all …]
|
| D | isl_fold.c | 1548 isl_bool *tight) in isl_map_apply_pw_qpolynomial_fold() argument
1582 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight); in isl_map_apply_pw_qpolynomial_fold()
1593 isl_bool *tight) in isl_set_apply_pw_qpolynomial_fold() argument
1595 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight); in isl_set_apply_pw_qpolynomial_fold()
1602 isl_bool tight; member
1623 pwf, data->tight ? &data->tight : NULL); in pw_qpolynomial_fold_apply()
1647 __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_bool *tight) in isl_union_map_apply_union_pw_qpolynomial_fold() argument
1659 data.tight = tight ? isl_bool_true : isl_bool_false; in isl_union_map_apply_union_pw_qpolynomial_fold()
1669 if (tight) in isl_union_map_apply_union_pw_qpolynomial_fold()
1670 *tight = data.tight; in isl_union_map_apply_union_pw_qpolynomial_fold()
[all …]
|
| /external/markdown/MarkdownTest/Tests_2004/ |
| D | Ordered and unordered lists.text | 3 Asterisks tight:
20 Pluses tight:
38 Minuses tight:
|
| /external/markdown/tests/markdown-test/ |
| D | ordered-and-unordered-list.txt | 3 Asterisks tight:
20 Pluses tight:
38 Minuses tight:
|
| /external/markdown/MarkdownTest/Tests_2007/ |
| D | Ordered and unordered lists.text | 3 Asterisks tight:
20 Pluses tight:
38 Minuses tight:
|
| /external/markdown/tests/misc/ |
| D | lists.txt | 7 Simple tight list
13 A singleton tight list:
|
| /external/llvm-project/mlir/test/SDBM/ |
| D | sdbm-api-test.cpp | 154 auto tight = stripe(symb(0), 3) - dim(0) - 2; in TEST_FUNC() local
155 auto sdbm = SDBM::get({tight}, {s - dim(0), s - dim(1) + 42}); in TEST_FUNC()
|
| /external/ltp/tools/genload/ |
| D | README | 24 in a tight loop calculating the sqrt() of a random number acquired with
35 The following forks 4 processes, each of which spins in a tight loop calling
|
| /external/llvm-project/polly/lib/External/isl/include/isl/ |
| D | polynomial.h | 510 isl_bool *tight);
512 __isl_take isl_pw_qpolynomial_fold *pwf, isl_bool *tight);
515 isl_bool *tight);
518 isl_bool *tight);
806 enum isl_fold type, isl_bool *tight);
809 __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_bool *tight);
812 __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_bool *tight);
|
| /external/autotest/client/site_tests/kernel_TPMStress/ |
| D | control | 16 Sends commands to the TPM in a tight loop for some length of time, in
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_RaggedTensorToSparse.pbtxt | 23 `sparse_dense_shape` is a tight bounding box of the input `RaggedTensor`.
|
| /external/dexmaker/ |
| D | README.version | 7 …-metal API. This API mirrors the Dalvik bytecode specification giving you tight control over the b…
|
| D | README.md | 6 …ytecode specification](http://source.android.com/tech/dalvik/dalvik-bytecode.html) giving you tight
|
| /external/llvm/docs/ |
| D | LinkTimeOptimization.rst | 23 achieved through tight integration with the linker. In this model, the linker
26 bitcode files. This tight integration between the linker and LLVM optimizer
106 This example illustrates the advantage of tight integration with the
144 from the optimizer's point of view. Our goal is to take advantage of tight
|
| /external/llvm-project/llvm/docs/ |
| D | LinkTimeOptimization.rst | 23 achieved through tight integration with the linker. In this model, the linker
26 bitcode files. This tight integration between the linker and LLVM optimizer
106 This example illustrates the advantage of tight integration with the
144 from the optimizer's point of view. Our goal is to take advantage of tight
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | functional.shaders.int_op.txt | 62 (vertex or fragment) a single quad or a tight grid of quads is rendered with
|
| /external/llvm/test/CodeGen/X86/ |
| D | fixup-bw-inst.ll | 104 ; movb encodes smaller, we do not want to use movzbl unless in a tight loop.
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | fixup-bw-inst.ll | 104 ; movb encodes smaller, we do not want to use movzbl unless in a tight loop.
|
| /external/boringssl/src/ |
| D | BREAKING-CHANGES.md | 3 …ho our users are. Still, breaking changes require some care. We depend on tight feedback loops wit…
74 While we rely on a tight feedback loop with our consumers, there are a few consumers which update l…
|
| /external/minijail/tools/ |
| D | README.md | 6 This is very useful if the process that is traced has a fairly tight working
|
| /external/dokka/core/testdata/markdown/ |
| D | spec.txt | 58 "tight"? What should we do with a list like this?
1964 is [tight](#tight) or [loose](#loose).
3216 them. Otherwise a list is [tight](#tight). (The difference in HTML output
3218 paragraphs in a tight list are not.)
3444 This is a tight list, because the blank lines are in a code block:
3465 This is a tight list, because the blank line is between two
3467 the other list is tight:
3486 This is a tight list, because the blank line is inside the
3504 This list is tight, because the consecutive block elements
3526 A single-paragraph list is tight:
[all …]
|