Home
last modified time | relevance | path

Searched refs:least_common_multiple (Results 1 – 21 of 21) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dhwint.c187 least_common_multiple (HOST_WIDE_INT a, HOST_WIDE_INT b) in least_common_multiple() function
H A Dvector-builder.h322 = least_common_multiple (Derived::npatterns_of (vec1), in new_binary_operation()
351 = least_common_multiple (Derived::npatterns_of (vec1), in binary_encoded_nelts()
H A Dhwint.h265 extern HOST_WIDE_INT least_common_multiple (HOST_WIDE_INT, HOST_WIDE_INT);
H A Dvec-perm-indices.c143 unsigned int cycle_length = least_common_multiple (out_step, npatterns); in series_p()
H A Dtree-ssa-loop-prefetch.c1428 nfactor = least_common_multiple (mod_constraint, factor); in determine_unroll_factor()
H A Dpoly-int.h1674 return a * (least_common_multiple (xgcd, b) / xgcd);
1710 C lcm = least_common_multiple (NCa (a.coeffs[i]), NCb (b.coeffs[i]));
H A Dtree-vect-loop.c5214 nunits1 = least_common_multiple (nunits1, group_size); in vect_create_epilog_for_reduction()
7581 unsigned nivs = least_common_multiple (group_size, in vectorizable_induction()
7634 = least_common_multiple (group_size, const_nunits) / group_size; in vectorizable_induction()
H A Dsimplify-rtx.c6668 subbit += least_common_multiple (sequence_bits, BITS_PER_UNIT); in simplify_const_vector_byte_offset()
6714 = least_common_multiple (x_sequence_bits, out_elt_bits); in simplify_const_vector_subreg()
H A Dfold-const.c8542 = least_common_multiple (expr_sequence_bits, type_elt_bits); in fold_view_convert_vector_encoding()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dhwint.cc187 least_common_multiple (HOST_WIDE_INT a, HOST_WIDE_INT b) in least_common_multiple() function
H A Dvector-builder.h322 = least_common_multiple (Derived::npatterns_of (vec1), in new_binary_operation()
351 = least_common_multiple (Derived::npatterns_of (vec1), in binary_encoded_nelts()
H A Dhwint.h265 extern HOST_WIDE_INT least_common_multiple (HOST_WIDE_INT, HOST_WIDE_INT);
H A Dvec-perm-indices.cc202 unsigned int cycle_length = least_common_multiple (out_step, npatterns); in series_p()
H A Dtree-ssa-loop-prefetch.cc1427 nfactor = least_common_multiple (mod_constraint, factor); in determine_unroll_factor()
H A Dpoly-int.h1674 return a * (least_common_multiple (xgcd, b) / xgcd);
1710 C lcm = least_common_multiple (NCa (a.coeffs[i]), NCb (b.coeffs[i]));
H A Dtree-vect-loop.cc5862 nunits1 = least_common_multiple (nunits1, group_size); in vect_create_epilog_for_reduction()
8336 nivs = least_common_multiple (group_sizep, in vectorizable_induction()
8445 nivs = least_common_multiple (group_size, in vectorizable_induction()
8461 = least_common_multiple (group_size, const_nunits) / group_size; in vectorizable_induction()
H A Dsimplify-rtx.cc7198 subbit += least_common_multiple (sequence_bits, BITS_PER_UNIT); in simplify_const_vector_byte_offset()
7244 = least_common_multiple (x_sequence_bits, out_elt_bits); in simplify_const_vector_subreg()
H A DChangeLog.graphite145 (least_common_multiple): Same.
179 * tree-flow.h (least_common_multiple): Removed declaration.
H A Dfold-const.cc9155 = least_common_multiple (expr_sequence_bits, type_elt_bits); in fold_view_convert_vector_encoding()
H A DChangeLog-201116090 (least_common_multiple): Moved here...
16092 (least_common_multiple): ... from here.
16099 (least_common_multiple): Declared.
37893 (least_common_multiple): Same.
37927 * tree-flow.h (least_common_multiple): Removed declaration.
H A DChangeLog-20065550 (least_common_multiple): ... and exported.
5551 * tree-flow.h (least_common_multiple): Declare.