Home
last modified time | relevance | path

Searched refs:convex (Results 1 – 9 of 9) sorted by relevance

/llvm-project/llvm/cmake/
H A Dconfig.guess735 C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
736 echo c1-convex-bsd
738 C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
740 then echo c32-convex-bsd
741 else echo c2-convex-bsd
744 C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
745 echo c34-convex-bsd
747 C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
748 echo c38-convex-bsd
750 C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
[all …]
/llvm-project/polly/lib/External/isl/
H A Disl_options.c69 static struct isl_arg_choice convex[] = { variable
133 ISL_ARG_CHOICE(struct isl_options, convex, 0, "convex-hull", \
134 convex, ISL_CONVEX_HULL_WRAP, "convex hull algorithm to use")
H A Disl_options_private.h34 int convex; member
H A Disl_test.c1674 static int test_convex_hull_algo(isl_ctx *ctx, int convex) in test_convex_hull_algo() argument
1677 int orig_convex = ctx->opt->convex; in test_convex_hull_algo()
1678 ctx->opt->convex = convex; in test_convex_hull_algo()
1715 ctx->opt->convex = orig_convex; in test_convex_hull_algo()
H A Disl_convex_hull.c1289 if (bset1->ctx->opt->convex == ISL_CONVEX_HULL_FM) in convex_hull_pair()
1821 if (bounded && set->ctx->opt->convex == ISL_CONVEX_HULL_WRAP) in uset_convex_hull()
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Dsi-annotate-cf.ll216 br i1 %cmp1, label %convex.exit, label %for.cond
218 convex.exit:
/llvm-project/polly/test/ScopInfo/
H A Dranged_parameter_wrap_2.ll4 ; combining a large number of non-convex ranges. Instead, after a certain
/llvm-project/polly/lib/External/isl/doc/
H A Dimplementation.tex110 (rational) convex hull. For integer sets, the obvious choice
114 The convex hull operation is supported, but it is also fairly
1860 they are using the convex hull of $\domain R \cup \range R$
1861 or at least an approximation of this convex hull.
/llvm-project/mlir/docs/Rationale/
H A DRationale.md744 are interleaved. We model domains as non-piece-wise convex integer sets, and