MCPcopy Create free account

hub / github.com/Tiramisu-Compiler/tiramisu / functions

Functions7,611 in github.com/Tiramisu-Compiler/tiramisu

↓ 6 callersFunctionupdate_state
Set the state of the innermost active YAML element to "state" and * return the updated printer. */
3rdParty/isl/isl_printer.c:520
↓ 5 callersFunctionISL_ARG_DEF
3rdParty/isl/codegen.c:45
↓ 5 callersFunctionaccept_extended_affine
Accept an affine expression that may involve ternary operators. * We first read an affine expression. * If it is not followed by a comparison operat
3rdParty/isl/isl_input.c:780
↓ 5 callersFunctionadd_constraints
3rdParty/isl/isl_map.c:1749
↓ 5 callersFunctionadd_wraps
For each constraint in info->bmap that is not redundant (as determined * by info->tab) and that is not a valid constraint for the other basic map, *
3rdParty/isl/isl_coalesce.c:1323
↓ 5 callersFunctionast_expr_add
Create an expression representing the sum of "expr1" and "expr2", * provided neither of the two expressions is identically zero. */
3rdParty/isl/isl_ast_build_expr.c:271
↓ 5 callersFunctionconstraint_index_free
Free the memory allocated by create_constraint_index. */
3rdParty/isl/isl_map_simplify.c:656
↓ 5 callersFunctiondynamic_dimension_into_loop_level
* Transform a dynamic schedule dimension into the corresponding loop level. * * In the example below, the loop level that corresponds * to the dyna
src/tiramisu_core.cpp:2818
↓ 5 callersFunctionexpand_constraint
Expand the constraint "c" into "v". The initial "dim" dimensions * are the same, but "v" may have more divs than "c" and the divs of "c" * may appe
3rdParty/isl/isl_map_subtract.c:32
↓ 5 callersFunctionforce_zero
Should the distance over "edge" be forced to zero? * That is, is it marked as a local edge? * If "use_coincidence" is set, then coincidence edges ar
3rdParty/isl/isl_scheduler.c:2146
↓ 5 callersFunctionfree_todo
3rdParty/isl/isl_vertices.c:667
↓ 5 callersMethodfuse_after
* Fuse this computation with the computation passed as argument * in the same loop. Run this computation after that computation. * Fuse t
include/tiramisu/core.h:3216
↓ 5 callersFunctionget_filename
3rdParty/isl/isl_test.c:46
↓ 5 callersMethodget_iteration_domain_dimensions_number
* Get the number of dimensions of the iteration * domain of the computation. */
src/tiramisu_core.cpp:7236
↓ 5 callersMethodget_time_processor_domain
src/tiramisu_core.cpp:6336
↓ 5 callersMethodget_xfer_props
src/tiramisu_core.cpp:8142
↓ 5 callersFunctionhalide_expr_from_isl_ast_expr
src/tiramisu_codegen_halide.cpp:1525
↓ 5 callersFunctionhandle_cuda_error
src/tiramisu_cuda_wrappers.cpp:12
↓ 5 callersFunctionhpccg_ddot
benchmarks/linear_algebra/cg/ddot.cpp:56
↓ 5 callersFunctioninit_status
Initialize the "eq" and "ineq" fields of "info". */
3rdParty/isl/isl_coalesce.c:2091
↓ 5 callersMethodis_let_stmt
* Return if this computation represents a let statement. */
src/tiramisu_core.cpp:7170
↓ 5 callersMethodis_library_call
src/tiramisu_core.cpp:7186
↓ 5 callersFunctionis_proximity
Is "edge" marked as a proximity edge? */
3rdParty/isl/isl_scheduler.c:244
↓ 5 callersMethodis_wait
src/tiramisu_core.cpp:7539
↓ 5 callersFunctionisl_aff_alloc_vec
3rdParty/isl/isl_aff.c:52
↓ 5 callersFunctionisl_aff_expand_divs
Apply the expansion computed by isl_merge_divs. * The expansion itself is given by "exp" while the resulting * list of divs is given by "div". */
3rdParty/isl/isl_aff.c:1669
↓ 5 callersFunctionisl_aff_normalize
Normalize the representation of "aff". * * This function should only be called of "new" isl_affs, i.e., * with only a single reference. We therefo
3rdParty/isl/isl_aff.c:1472
↓ 5 callersFunctionisl_aff_set_coefficient_si
Replace the numerator of the coefficient of the variable of type "type" * at position "pos" of "aff" by "v". * * A NaN is unaffected by this operat
3rdParty/isl/isl_aff.c:997
↓ 5 callersFunctionisl_ast_build_aff_is_nonneg
Does "aff" only attain non-negative values over build->domain? * That is, does it not attain any negative values? */
3rdParty/isl/isl_ast_build.c:1891
↓ 5 callersFunctionisl_ast_build_alloc
Create an isl_ast_build with a universe (parametric) context. */
3rdParty/isl/isl_ast_build.c:159
↓ 5 callersFunctionisl_ast_build_dim
Return the number of variables of the given type * in the (internal) schedule space. */
3rdParty/isl/isl_ast_build.c:1148
↓ 5 callersFunctionisl_ast_build_expr_from_pw_aff_internal
Construct an isl_ast_expr that evaluates "pa". * The result is simplified in terms of build->domain. * * The domain of "pa" lives in the internal s
3rdParty/isl/isl_ast_build_expr.c:2172
↓ 5 callersFunctionisl_ast_build_get_schedule_map_multi_aff
Return a mapping from the internal schedule space to the external * schedule space in the form of an isl_multi_aff. * The internal schedule space or
3rdParty/isl/isl_ast_build.c:593
↓ 5 callersFunctionisl_ast_build_get_stride
Given that the dimension at position "pos" takes on values * * f + s a * * with a an integer, return s through *stride. */
3rdParty/isl/isl_ast_build.c:1932
↓ 5 callersFunctionisl_ast_build_map_to_iterator
Construct a map that isolates the current dimension. * * Essentially, the current dimension of "set" is moved to the single output * dimension in t
3rdParty/isl/isl_ast_build.c:31
↓ 5 callersFunctionisl_ast_build_specialize
Include information about what we know about the iterators of * already generated loops to "set". * * We currently only plug in the known affine va
3rdParty/isl/isl_ast_build.c:2063
↓ 5 callersFunctionisl_ast_expr_get_val
Return the integer value represented by "expr". */
3rdParty/isl/isl_ast.c:249
↓ 5 callersFunctionisl_basic_map_div_is_marked_unknown
Is local variable "div" of "bmap" marked as not having an explicit * representation? * Note that even if "div" is not marked in this way and therefo
3rdParty/isl/isl_map.c:7428
↓ 5 callersFunctionisl_basic_map_drop_constraints_involving_dims
Drop all constraints in bmap that involve any of the dimensions * first to first + n - 1 of the given type. */
3rdParty/isl/isl_map.c:2928
↓ 5 callersFunctionisl_basic_map_equate
Add a constraint imposing that the given two dimensions are equal. */
3rdParty/isl/isl_map.c:12352
↓ 5 callersFunctionisl_basic_map_from_constraint
We manually set ISL_BASIC_SET_FINAL instead of calling * isl_basic_map_finalize because we want to keep the position * of the divs and we therefore
3rdParty/isl/isl_constraint.c:725
↓ 5 callersFunctionisl_basic_map_from_range
3rdParty/isl/isl_map.c:5848
↓ 5 callersFunctionisl_basic_map_get_divs
Extract the divs in "bmap" as a matrix. */
3rdParty/isl/isl_map.c:377
↓ 5 callersFunctionisl_basic_map_inequality_to_equality
Turn inequality "pos" of "bmap" into an equality. * * In particular, we move the inequality in front of the equalities * and move the last inequali
3rdParty/isl/isl_map.c:1489
↓ 5 callersFunctionisl_basic_map_mark_div_unknown
Remove the explicit representation of local variable "div", * if there is any. */
3rdParty/isl/isl_map.c:7403
↓ 5 callersFunctionisl_basic_map_mark_final
Mark "bmap" as final, without checking for obviously redundant * integer divisions. This function should be used when "bmap" * is known not to invo
3rdParty/isl/isl_map_simplify.c:1488
↓ 5 callersFunctionisl_basic_map_move_dims
3rdParty/isl/isl_map.c:3996
↓ 5 callersFunctionisl_basic_map_n_equality
Return the number of equality constraints in the description of "bmap". * Return -1 on error. */
3rdParty/isl/isl_map.c:213
↓ 5 callersFunctionisl_basic_map_plain_has_fixed_var
3rdParty/isl/isl_map.c:9220
↓ 5 callersFunctionisl_basic_map_read_from_str
3rdParty/isl/isl_input.c:2874
↓ 5 callersFunctionisl_basic_map_remove_dims
3rdParty/isl/isl_map.c:2461
↓ 5 callersFunctionisl_basic_map_update_from_tab
Update "bmap" based on the results of the tableau "tab". * In particular, implicit equalities are made explicit, redundant constraints * are removed
3rdParty/isl/isl_tab.c:2628
↓ 5 callersFunctionisl_basic_set_align_params
Align the parameters of "bset" to those of "model", introducing * additional parameters if needed. */
3rdParty/isl/isl_map.c:11753
↓ 5 callersFunctionisl_basic_set_alloc
3rdParty/isl/isl_map.c:1159
↓ 5 callersFunctionisl_basic_set_detect_equalities
3rdParty/isl/isl_affine_hull.c:920
↓ 5 callersFunctionisl_basic_set_drop
3rdParty/isl/isl_map.c:2265
↓ 5 callersFunctionisl_basic_set_dup
3rdParty/isl/isl_map.c:1260
↓ 5 callersFunctionisl_basic_set_factorizer
Determine if the set variables of the basic set can be factorized and * return the results in an isl_factorizer. * * The algorithm works by first c
3rdParty/isl/isl_factorization.c:256
↓ 5 callersFunctionisl_basic_set_lift
3rdParty/isl/isl_map.c:10449
↓ 5 callersFunctionisl_basic_set_preimage_multi_aff
Compute the preimage of "bset" under the function represented by "ma". * In other words, plug in "ma" in "bset". The result is a basic set * that l
3rdParty/isl/isl_map.c:13048
↓ 5 callersFunctionisl_basic_set_remove_equalities
3rdParty/isl/isl_equalities.c:705
↓ 5 callersFunctionisl_basic_set_reset_space
3rdParty/isl/isl_map.c:5499
↓ 5 callersFunctionisl_basic_set_scan
Look for all integer points in "bset", which is assumed to be bounded, * and call callback->add on each of them. * * We first compute a reduced bas
3rdParty/isl/isl_scan.c:102
↓ 5 callersFunctionisl_basic_set_solve_lp
3rdParty/isl/isl_lp.c:77
↓ 5 callersFunctionisl_hash_id
3rdParty/isl/isl_id.c:172
↓ 5 callersFunctionisl_id_get_user
3rdParty/isl/isl_id.c:35
↓ 5 callersFunctionisl_map_detect_equalities
3rdParty/isl/isl_affine_hull.c:927
↓ 5 callersFunctionisl_map_domain_product
3rdParty/isl/isl_map.c:10129
↓ 5 callersFunctionisl_map_fix_si
3rdParty/isl/isl_map.c:6247
↓ 5 callersFunctionisl_map_from_range
Create a relation with the given set as range. * The domain of the created relation is a zero-dimensional * flat anonymous space. */
3rdParty/isl/isl_map.c:5862
↓ 5 callersFunctionisl_map_get_static_dim
* Return the value of the static dimension. * * For example, if we have a map M = {S0[i,j]->[0,0,i,1,j,2]; S0[i,j]->[1,0,i,1,j,3]} * and call isl_m
src/tiramisu_core.cpp:2608
↓ 5 callersFunctionisl_map_get_tuple_id
3rdParty/isl/isl_map.c:649
↓ 5 callersFunctionisl_map_gist
3rdParty/isl/isl_map_simplify.c:3498
↓ 5 callersFunctionisl_map_insert_dims
3rdParty/isl/isl_map.c:3942
↓ 5 callersFunctionisl_map_lex_ge
3rdParty/isl/isl_map.c:5087
↓ 5 callersFunctionisl_map_order_gt
Add a constraint imposing that the value of the first dimension is * greater than that of the second. */
3rdParty/isl/isl_map.c:12550
↓ 5 callersFunctionisl_map_product
3rdParty/isl/isl_map.c:10080
↓ 5 callersFunctionisl_map_space_has_equal_params
Do "map" and "space" have the same parameters? */
3rdParty/isl/isl_map.c:11733
↓ 5 callersFunctionisl_mat_extend
3rdParty/isl/isl_mat.c:89
↓ 5 callersFunctionisl_mat_is_equal
3rdParty/isl/isl_mat.c:1791
↓ 5 callersFunctionisl_mat_print_internal
3rdParty/isl/isl_mat.c:1464
↓ 5 callersFunctionisl_morph_cow
3rdParty/isl/isl_morph.c:76
↓ 5 callersFunctionisl_multi_union_pw_aff_domain
Return the shared domain of the elements of "mupa". */
3rdParty/isl/isl_aff.c:8652
↓ 5 callersFunctionisl_printer_print_union_map
3rdParty/isl/isl_output.c:1613
↓ 5 callersFunctionisl_printer_print_union_set
3rdParty/isl/isl_output.c:1631
↓ 5 callersFunctionisl_pw_qpolynomial_fold_from_pw_qpolynomial
3rdParty/isl/isl_fold.c:1004
↓ 5 callersFunctionisl_qpolynomial_dim
Externally, an isl_qpolynomial has a map space, but internally, the * ls field corresponds to the domain of that space. */
3rdParty/isl/isl_polynomial.c:469
↓ 5 callersFunctionisl_qpolynomial_fold_alloc
3rdParty/isl/isl_fold.c:707
↓ 5 callersFunctionisl_qpolynomial_is_zero
3rdParty/isl/isl_polynomial.c:502
↓ 5 callersFunctionisl_qpolynomial_zero_on_domain
3rdParty/isl/isl_polynomial.c:1758
↓ 5 callersFunctionisl_schedule_copy
Return a new reference to "sched". */
3rdParty/isl/isl_schedule.c:93
↓ 5 callersFunctionisl_schedule_from_domain
Return a pointer to a schedule with as single node * a domain node with the given domain. */
3rdParty/isl/isl_schedule.c:72
↓ 5 callersFunctionisl_schedule_from_schedule_tree
Return a schedule encapsulating the given schedule tree. * * We currently only allow schedule trees with a domain or extension as root. * * The le
3rdParty/isl/isl_schedule.c:38
↓ 5 callersFunctionisl_schedule_get_space
Return the (parameter) space of the schedule, i.e., the space * of the root domain. */
3rdParty/isl/isl_schedule.c:189
↓ 5 callersFunctionisl_schedule_node_band_get_partial_schedule
Return the schedule of the band node in isolation. */
3rdParty/isl/isl_schedule_node.c:1596
↓ 5 callersFunctionisl_schedule_node_extension_get_extension
Return the extension of the extension node "node". */
3rdParty/isl/isl_schedule_node.c:2101
↓ 5 callersFunctionisl_schedule_node_get_leaf
Return a copy of the leaf of the schedule into which "node" points. */
3rdParty/isl/isl_schedule_node.c:116
↓ 5 callersFunctionisl_schedule_node_gist
Compute the gist of the subtree at "node" with respect to * the reaching domain elements in "context". * In particular, compute the gist of all band
3rdParty/isl/isl_schedule_node.c:3547
↓ 5 callersFunctionisl_schedule_node_n_children
Return the number of children of "node"? * * Any node other than the leaf nodes is considered to have at least * one child, even if the correspondi
3rdParty/isl/isl_schedule_node.c:1037
↓ 5 callersFunctionisl_seq_preimage
Compute the preimage of a range of dimensions in the affine expression "src" * under "ma" and put the result in "dst". The number of dimensions in "
3rdParty/isl/isl_aff.c:5509
← previousnext →1,001–1,100 of 7,611, ranked by callers