| /external/llvm-project/polly/lib/External/isl/test_inputs/schedule/ |
| D | niewang.st | 8 coincident: [ 1, 1, 1, 1 ]
13 coincident: [ 1, 1, 1, 1 ]
17 coincident: [ 1 ]
21 coincident: [ 1 ]
25 coincident: [ 1 ]
|
| D | max_coincidence.st | 8 coincident: [ 1, 1, 0 ]
13 coincident: [ 1, 1, 0 ]
|
| D | flat2.st | 5 coincident: [ 1 ]
|
| D | flat1.st | 5 coincident: [ 1 ]
|
| D | flat5.st | 5 coincident: [ 1 ]
|
| D | flat6.st | 5 coincident: [ 1 ]
|
| D | flat3.st | 5 coincident: [ 1 ]
|
| D | flat4.st | 5 coincident: [ 1 ]
|
| D | disjunctive_domain.st | 5 coincident: [ 1, 1, 1 ]
|
| D | bounded_coefficients.st | 5 coincident: [ 1, 1, 1 ]
|
| D | nomax_coincidence.st | 5 coincident: [ 1, 0, 0 ]
|
| D | poliwoda.st | 5 coincident: [ 1, 1, 1 ]
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_schedule_read.c | 478 __isl_take isl_schedule_band *band, __isl_take isl_val_list *coincident) in set_coincident() argument
484 m = isl_val_list_n_val(coincident); in set_coincident()
491 v = isl_val_list_get_val(coincident, i); in set_coincident()
498 isl_val_list_free(coincident); in set_coincident()
508 isl_val_list *coincident = NULL; in read_band() local
544 coincident = read_coincident(s); in read_band()
545 if (!coincident) in read_band()
583 if (coincident) in read_band()
584 band = set_coincident(band, coincident); in read_band()
594 isl_val_list_free(coincident); in read_band()
|
| D | isl_schedule_band.c | 66 band->coincident = isl_calloc_array(ctx, int, band->n); in isl_schedule_band_from_multi_union_pw_aff()
72 if ((band->n && !band->coincident) || !band->ast_build_options) in isl_schedule_band_from_multi_union_pw_aff()
99 dup->coincident = isl_alloc_array(ctx, int, band->n); in isl_schedule_band_dup()
100 if (band->n && !dup->coincident) in isl_schedule_band_dup()
104 dup->coincident[i] = band->coincident[i]; in isl_schedule_band_dup()
174 free(band->coincident); in isl_schedule_band_free()
196 if (band1->coincident[i] != band2->coincident[i]) in isl_schedule_band_plain_is_equal()
244 return isl_bool_ok(band->coincident[pos]); in isl_schedule_band_member_get_coincident()
251 __isl_take isl_schedule_band *band, int pos, int coincident) in isl_schedule_band_member_set_coincident() argument
255 if (isl_schedule_band_member_get_coincident(band, pos) == coincident) in isl_schedule_band_member_set_coincident()
[all …]
|
| D | isl_schedule_band.h | 33 int *coincident; member
93 __isl_take isl_schedule_band *band, int pos, int coincident);
|
| D | isl_schedule_tree.c | 1043 __isl_take isl_schedule_tree *tree, int pos, int coincident) in isl_schedule_tree_band_member_set_coincident() argument
1051 coincident) in isl_schedule_tree_band_member_set_coincident()
1058 coincident); in isl_schedule_tree_band_member_set_coincident()
2663 isl_bool coincident; in any_coincident() local
2665 coincident = isl_schedule_band_member_get_coincident(band, i); in any_coincident()
2666 if (coincident < 0 || coincident) in any_coincident()
2667 return coincident; in any_coincident()
2684 isl_bool coincident; in print_tree_band() local
2697 coincident = any_coincident(band); in print_tree_band()
2698 if (coincident < 0) in print_tree_band()
[all …]
|
| D | isl_scheduler.c | 122 int *coincident; member
727 free(node->coincident); in clear_node()
1202 int *coincident; in add_node() local
1221 coincident = isl_calloc_array(ctx, int, graph->max_row); in add_node()
1222 node->coincident = coincident; in add_node()
1230 if (!space || !sched || (graph->max_row && !coincident)) in add_node()
3177 __isl_take isl_vec *sol, int coincident) in update_schedule() argument
3216 node->coincident[graph->n_total_row] = coincident; in update_schedule()
3710 dst->node[j].coincident = src->node[i].coincident; in copy_nodes()
4040 graph->node[0].coincident[start + i]); in insert_current_band()
[all …]
|
| /external/llvm-project/polly/test/ScheduleOptimizer/ |
| D | focaltech_test_detail_threshold-7bc17e.ll | 70 ; CHECK: coincident: [ 1, 0 ]
76 ; CHECK: coincident: [ 1 ]
89 ; CHECK: coincident: [ 1 ]
94 ; CHECK: coincident: [ 1 ]
|
| D | statistics.ll | 273 ; CHECK-DAG: 4 polly-opt-isl - Number of coincident band members (after scheduler)
274 ; CHECK-DAG: 5 polly-opt-isl - Number of coincident band members (after optimizer)
|
| /external/llvm-project/polly/lib/External/isl/test_inputs/codegen/ |
| D | correlation.st | 7 coincident: [ 1, 1, 1 ]
12 coincident: [ 1, 1, 1 ]
|
| D | gemm.st | 8 coincident: [ 1, 1, 0 ]
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1581 const SkTSpan* coincident = fCoincident; in validate() local
1582 while (coincident) { in validate()
1584 coincident = coincident->fNext; in validate()
1919 SkTSpan* coincident = sect1->fCoincident; in BinarySearch() local
1920 if (coincident) { in BinarySearch()
1922 if (coincident->fNext) { in BinarySearch()
1924 coincident = sect1->fCoincident; in BinarySearch()
1928 if (!coincident) { in BinarySearch()
1931 if (!coincident->fCoinStart.isMatch()) { in BinarySearch()
1934 if (!coincident->fCoinEnd.isMatch()) { in BinarySearch()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 1582 const SkTSpan* coincident = fCoincident; in validate() local
1583 while (coincident) { in validate()
1585 coincident = coincident->fNext; in validate()
1919 SkTSpan* coincident = sect1->fCoincident; in BinarySearch() local
1920 if (coincident) { in BinarySearch()
1922 if (coincident->fNext) { in BinarySearch()
1924 coincident = sect1->fCoincident; in BinarySearch()
1928 if (!coincident) { in BinarySearch()
1931 if (!coincident->fCoinStart.isMatch()) { in BinarySearch()
1934 if (!coincident->fCoinEnd.isMatch()) { in BinarySearch()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTriangulator.cpp | 352 static bool coincident(const SkPoint& a, const SkPoint& b) { in coincident() function
712 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in mergeEdgesAbove()
733 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { in mergeEdgesBelow()
895 if (prevV && coincident(prevV->fPoint, p)) { in makeSortedVertex()
897 } else if (nextV && coincident(nextV->fPoint, p)) { in makeSortedVertex()
982 if (coincident(p, left->fTop->fPoint)) { in checkForIntersection()
984 } else if (coincident(p, left->fBottom->fPoint)) { in checkForIntersection()
986 } else if (coincident(p, right->fTop->fPoint)) { in checkForIntersection()
988 } else if (coincident(p, right->fBottom->fPoint)) { in checkForIntersection()
1024 if (coincident(prev->fPoint, v->fPoint)) { in sanitizeContours()
[all …]
|
| /external/skia/tests/ |
| D | PathOpsDebug.cpp | 775 const SkOpSpan* coincident = fCoincident; in dumpCoin() local
780 coincident->dump(); in dumpCoin()
785 } while ((coincident = coincident->fCoincident) != this); in dumpCoin()
|