HomeSort by: relevance | last modified time | path
    Searched refs:ddrs (Results 1 - 10 of 10) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
gimple-loop-interchange.cc 984 nest. DATAREFS are data references. DDRS are data dependences. */
989 vec<ddr_p> ddrs)
1002 for (unsigned i = 0; ddrs.iterate (i, &ddr); ++i)
1021 vec<ddr_p> ddrs)
1025 for (unsigned i = 0; ddrs.iterate (i, &ddr); ++i)
1606 vec<ddr_p> ddrs)
1618 if (!valid_data_dependences (i_idx, o_idx, ddrs))
1663 update_data_info (i_idx, o_idx, datarefs, ddrs);
1852 dependences for loop interchange and store it in DDRS. Note we compute
1859 vec<ddr_p> *ddrs)
2098 vec<ddr_p> ddrs = vNULL; local
    [all...]
tree-data-ref.cc 490 /* Dump into FILE all the dependence relations from DDRS. */
493 dump_data_dependence_relations (FILE *file, const vec<ddr_p> &ddrs)
495 for (auto ddr : ddrs)
515 /* Dump to STDERR all the dependence relations from DDRS. */
518 debug_data_dependence_relations (vec<ddr_p> ddrs)
520 dump_data_dependence_relations (stderr, ddrs);
523 /* Dumps the distance and direction vectors in FILE. DDRS contains
529 dump_dist_dir_vectors (FILE *file, vec<ddr_p> ddrs)
531 for (data_dependence_relation *ddr : ddrs)
552 /* Dumps the data dependence relations DDRS in FILE. *
    [all...]
tree-vectorizer.h 444 vec<ddr_p> ddrs; member in class:vec_info_shared
1001 #define LOOP_VINFO_DDRS(L) (L)->shared->ddrs
1110 #define BB_VINFO_DDRS(B) (B)->shared->ddrs
tree-vectorizer.cc 485 ddrs (vNULL)
492 free_dependence_relations (ddrs);
tree-loop-distribution.cc 646 ALIAS_DDRS contains ddrs which need runtime alias check. */
2288 dependence relations to the EDGE if DDRS isn't NULL. */
2291 add_partition_graph_edge (struct graph *pg, int i, int j, vec<ddr_p> *ddrs)
2297 if (ddrs != NULL)
2301 gcc_assert (ddrs->length () > 0);
2304 data->alias_ddrs.safe_splice (*ddrs);
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-loop-interchange.cc 982 nest. DATAREFS are data references. DDRS are data dependences. */
987 vec<ddr_p> ddrs)
1000 for (unsigned i = 0; ddrs.iterate (i, &ddr); ++i)
1019 vec<ddr_p> ddrs)
1023 for (unsigned i = 0; ddrs.iterate (i, &ddr); ++i)
1604 vec<ddr_p> ddrs)
1616 if (!valid_data_dependences (i_idx, o_idx, ddrs))
1661 update_data_info (i_idx, o_idx, datarefs, ddrs);
1850 dependences for loop interchange and store it in DDRS. Note we compute
1857 vec<ddr_p> *ddrs)
2096 vec<ddr_p> ddrs = vNULL; local
    [all...]
tree-data-ref.cc 489 /* Dump into FILE all the dependence relations from DDRS. */
492 dump_data_dependence_relations (FILE *file, const vec<ddr_p> &ddrs)
494 for (auto ddr : ddrs)
514 /* Dump to STDERR all the dependence relations from DDRS. */
517 debug_data_dependence_relations (vec<ddr_p> ddrs)
519 dump_data_dependence_relations (stderr, ddrs);
522 /* Dumps the distance and direction vectors in FILE. DDRS contains
528 dump_dist_dir_vectors (FILE *file, vec<ddr_p> ddrs)
530 for (data_dependence_relation *ddr : ddrs)
551 /* Dumps the data dependence relations DDRS in FILE. *
    [all...]
tree-vectorizer.h 412 vec<ddr_p> ddrs; member in class:vec_info_shared
891 #define LOOP_VINFO_DDRS(L) (L)->shared->ddrs
991 #define BB_VINFO_DDRS(B) (B)->shared->ddrs
tree-vectorizer.cc 484 ddrs (vNULL)
491 free_dependence_relations (ddrs);
tree-loop-distribution.cc 645 ALIAS_DDRS contains ddrs which need runtime alias check. */
2232 dependence relations to the EDGE if DDRS isn't NULL. */
2235 add_partition_graph_edge (struct graph *pg, int i, int j, vec<ddr_p> *ddrs)
2241 if (ddrs != NULL)
2245 gcc_assert (ddrs->length () > 0);
2248 data->alias_ddrs.safe_splice (*ddrs);

Completed in 30 milliseconds