From 53d4d5ccad6817ab0c190f407b57fa14b9ec6db8 Mon Sep 17 00:00:00 2001 From: rakdver Date: Sun, 12 Nov 2006 20:05:49 +0000 Subject: * tree-ssa-loop-prefetch.c (schedule_prefetches): Cleanup and improve comments. (issue_prefetch_ref): Move assignment to write_p out of loop. (determine_unroll_factor): Do not take PARAM_MAX_UNROLL_TIMES and SIMULTANEOUS_PREFETCHES into account. (loop_prefetch_arrays): Do not pass ahead to determine_unroll_factor. * lambda-code.c (lcm): Renamed to ... (least_common_multiple): ... and exported. * tree-flow.h (least_common_multiple): Declare. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@118730 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/lambda-code.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'gcc/lambda-code.c') diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index 2a03fd31cd5..3dfad91720f 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -442,8 +442,8 @@ lambda_lattice_compute_base (lambda_loopnest nest) /* Compute the least common multiple of two numbers A and B . */ -static int -lcm (int a, int b) +int +least_common_multiple (int a, int b) { return (abs (a) * abs (b) / gcd (a, b)); } @@ -577,7 +577,7 @@ compute_nest_using_fourier_motzkin (int size, { if (A[k][i] < 0) { - multiple = lcm (A[j][i], A[k][i]); + multiple = least_common_multiple (A[j][i], A[k][i]); f1 = multiple / A[j][i]; f2 = -1 * multiple / A[k][i]; -- cgit v1.2.1