summaryrefslogtreecommitdiff
path: root/gcc/lambda-code.c
diff options
context:
space:
mode:
authorspop <spop@138bc75d-0d04-0410-961f-82ee72b054a4>2005-08-23 08:24:20 +0000
committerspop <spop@138bc75d-0d04-0410-961f-82ee72b054a4>2005-08-23 08:24:20 +0000
commitffe944fa4d599f56a68cb542a0eb6184f0414c29 (patch)
tree519608c83e01fb34fcdea8849d3554eaca59bf38 /gcc/lambda-code.c
parent1d7c087e8b9c917fc33169a61d7a300432cdf784 (diff)
downloadgcc-ffe944fa4d599f56a68cb542a0eb6184f0414c29.tar.gz
* lambda-code.c (lambda_vector_lexico_pos): Moved...
* lambda.h (lambda_vector_lexico_pos): ... here. * tree-data-ref.c (build_classic_dist_vector): Return false when the distance vector is lexicographically negative. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@103392 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/lambda-code.c')
-rw-r--r--gcc/lambda-code.c21
1 files changed, 0 insertions, 21 deletions
diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c
index 29b3e5ae708..cf995a3f9f4 100644
--- a/gcc/lambda-code.c
+++ b/gcc/lambda-code.c
@@ -2010,27 +2010,6 @@ lambda_loopnest_to_gcc_loopnest (struct loop *old_loopnest,
VEC_free (tree, heap, new_ivs);
}
-/* Returns true when the vector V is lexicographically positive, in
- other words, when the first nonzero element is positive. */
-
-static bool
-lambda_vector_lexico_pos (lambda_vector v,
- unsigned n)
-{
- unsigned i;
- for (i = 0; i < n; i++)
- {
- if (v[i] == 0)
- continue;
- if (v[i] < 0)
- return false;
- if (v[i] > 0)
- return true;
- }
- return true;
-}
-
-
/* Return TRUE if this is not interesting statement from the perspective of
determining if we have a perfect loop nest. */