summaryrefslogtreecommitdiff
path: root/isl_tab_pip.c
diff options
context:
space:
mode:
authorSven Verdoolaege <skimo@kotnet.org>2010-12-18 10:22:32 +0100
committerSven Verdoolaege <skimo@kotnet.org>2010-12-18 16:56:35 +0100
commitfb87359c20272005e8764ad71acd3bd9619f25af (patch)
tree0fed9570fa64e4162f0daec2ecc45872e289247d /isl_tab_pip.c
parentc34923b539e2f5e80a3d61019a5fd5cef5db4f72 (diff)
downloadisl-fb87359c20272005e8764ad71acd3bd9619f25af.tar.gz
isl-fb87359c20272005e8764ad71acd3bd9619f25af.tar.bz2
isl-fb87359c20272005e8764ad71acd3bd9619f25af.zip
isl_tab_pip.c: fix typos in comments
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
Diffstat (limited to 'isl_tab_pip.c')
-rw-r--r--isl_tab_pip.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/isl_tab_pip.c b/isl_tab_pip.c
index 7243fc8a..a2492413 100644
--- a/isl_tab_pip.c
+++ b/isl_tab_pip.c
@@ -39,7 +39,7 @@
* used in the tableau, but instead it its represented by another
* variable x' = M + x, where M is an arbitrarily large (positive)
* value. x' is therefore always non-negative, whatever the value of x.
- * Taking as initial smaple value x' = 0 corresponds to x = -M,
+ * Taking as initial sample value x' = 0 corresponds to x = -M,
* which is always smaller than any possible value of x.
*
* The big parameter trick is used in the main tableau and
@@ -1073,7 +1073,7 @@ error:
}
/* Return the first known violated constraint, i.e., a non-negative
- * contraint that currently has an either obviously negative value
+ * constraint that currently has an either obviously negative value
* or a previously determined to be negative value.
*
* If any constraint has a negative coefficient for the big parameter,
@@ -1111,7 +1111,7 @@ static int first_neg(struct isl_tab *tab)
/* Resolve all known or obviously violated constraints through pivoting.
* In particular, as long as we can find any violated constraint, we
- * look for a pivoting column that would result in the lexicographicallly
+ * look for a pivoting column that would result in the lexicographically
* smallest increment in the sample point. If there is no such column
* then the tableau is infeasible.
*/
@@ -1715,7 +1715,7 @@ static int tab_has_valid_sample(struct isl_tab *tab, isl_int *ineq, int eq)
return i < tab->n_sample;
}
-/* Add a div specifed by "div" to the tableau "tab" and return
+/* Add a div specified by "div" to the tableau "tab" and return
* 1 if the div is obviously non-negative.
*/
static int context_tab_add_div(struct isl_tab *tab, struct isl_vec *div,
@@ -3575,7 +3575,7 @@ error:
* coefficient are integral, then there is nothing that can be done
* and the tableau has no integral solution.
* If, on the other hand, one or more of the other columns have rational
- * coeffcients, but the parameter coefficients are all integral, then
+ * coefficients, but the parameter coefficients are all integral, then
* we can perform a regular (non-parametric) cut.
* Finally, if there is any parameter coefficient that is non-integral,
* then we need to involve the context tableau. There are two cases here.
@@ -3968,7 +3968,7 @@ static void sol_for_free_wrap(struct isl_sol *sol)
*
* Instead of constructing a basic map, this function calls a user
* defined function with the current context as a basic set and
- * an affine matrix reprenting the relation between the input and output.
+ * an affine matrix representing the relation between the input and output.
* The number of rows in this matrix is equal to one plus the number
* of output variables. The number of columns is equal to one plus
* the total dimension of the context, i.e., the number of parameters,