A compound assignment like, for example:
x /= a;
should have the same effect as the operation followed by the
assignment except that the left side should only be evaluated
once. So the statement above (assuming 'x' free of side-effects)
should have the same effect as:
x = x / a;
In particular, the usual conversions should applied. So, if the
type of 'x' and 'a' is, respectively, 'unsigned int' (32 bit) and
'long' (64 bit), the statement above should be equivalent to:
x = (unsigned int) ((long) x / a);
But what is really done currently is something like:
x = x / (unsigned int) a;
In other words, the right-hand side is casted to the same type as the
lhs and the operation is always done with this type, neglecting the
usual conversions and thus forcing the operation to always be done
with the lhs type, here 'unsigned int' instead of 'long'.
For example, with the values:
unsigned int x = 1;
long a = -1;
We have:
x = 1 / (unsigned int) (-1L);
x = 1 / 0xffffffff;
x = 0;
instead of the expected:
x = (unsigned int) ((long)1 / -1L);
x = (unsigned int) (-1L);
x = 0xffffffff;
The patch fix this by first calculating the type corresponding to
the usual conversion and then casting the right-hand side to this
type, which is fine since it's a rvalue anyway.
Later steps will then use the rhs type when doing the operation.
On the example above, the cast will be a no-op and the operation will
be done with the correct type:
x = x / (long) a;
which, at linearization, will become:
x = (unsigned int) ((long) x / (long) a);
and with unneeded casts optimized away:
x = (unsigned int) ((long) x / a);
Which will give us the expected result.
If the types where in the other order, the result will also be done
with the correct type:
long x;
unsigned int a;
...
x /= a;
will become:
x = x / (long) a;
and, at linearization:
x = (long) ((long) x / (long) a);
and with unneeded casts optimized away:
x = (x / (long) a);
Cc: Al Viro <viro@xxxxxxxxxxxxxxxxxx>
Cc: Ramsay Jones <ramsay@xxxxxxxxxxxxxxxxxxxx>
Signed-off-by: Luc Van Oostenryck <luc.vanoostenryck@xxxxxxxxx>
---
Changes since v2:
- no change in the patch itself
- fix left-right mixup in the description, thanks to Ramsay Jones.
- fix the test case which passed on sparse-next which doesn't yet
have the contains/excludes patch *sigh*
Changes since v1:
- no change in the patch itself
- change the description with a more interesting example, thanks
to Alexander Viro (a division instead of an addition where
2-complement arithmetic which gave the same end result anyway).
- adapt the test case to match the patch description.
evaluate.c | 5 ++++-
linearize.c | 10 ++++++----
validation/compound-assign-type.c | 15 +++++++++++++++
3 files changed, 25 insertions(+), 5 deletions(-)
create mode 100644 validation/compound-assign-type.c
diff --git a/evaluate.c b/evaluate.c
index e350c0c0..0ea3e866 100644
--- a/evaluate.c
+++ b/evaluate.c
@@ -1258,7 +1258,7 @@ static int evaluate_assign_op(struct expression *expr)
if (!restricted_value(expr->right, t))
return 1;
} else if (!(sclass & TYPE_RESTRICT))
- goto Cast;
+ goto usual;
/* source and target would better be identical restricted */
if (t == s)
return 1;
@@ -1281,6 +1281,9 @@ static int evaluate_assign_op(struct expression *expr)
expression_error(expr, "invalid assignment");
return 0;
+usual:
+ target = usual_conversions(op, expr->left, expr->right,
+ tclass, sclass, target, source);
Cast:
expr->right = cast_to(expr->right, target);
return 1;
diff --git a/linearize.c b/linearize.c
index cb252282..3f1b0d3c 100644
--- a/linearize.c
+++ b/linearize.c
@@ -1156,6 +1156,7 @@ static pseudo_t linearize_assignment(struct entrypoint *ep, struct expression *e
struct access_data ad = { NULL, };
struct expression *target = expr->left;
struct expression *src = expr->right;
+ struct symbol *ctype;
pseudo_t value;
value = linearize_expression(ep, src);
@@ -1181,10 +1182,11 @@ static pseudo_t linearize_assignment(struct entrypoint *ep, struct expression *e
if (!src)
return VOID;
- oldvalue = cast_pseudo(ep, oldvalue, src->ctype, expr->ctype);
- opcode = opcode_sign(op_trans[expr->op - SPECIAL_BASE], src->ctype);
- dst = add_binary_op(ep, src->ctype, opcode, oldvalue, value);
- value = cast_pseudo(ep, dst, expr->ctype, src->ctype);
+ ctype = src->ctype;
+ oldvalue = cast_pseudo(ep, oldvalue, target->ctype, ctype);
+ opcode = opcode_sign(op_trans[expr->op - SPECIAL_BASE], ctype);
+ dst = add_binary_op(ep, ctype, opcode, oldvalue, value);
+ value = cast_pseudo(ep, dst, ctype, expr->ctype);
}
value = linearize_store_gen(ep, value, &ad);
finish_address_gen(ep, &ad);
diff --git a/validation/compound-assign-type.c b/validation/compound-assign-type.c
new file mode 100644
index 00000000..450fa26d
--- /dev/null
+++ b/validation/compound-assign-type.c
@@ -0,0 +1,15 @@
+static unsigned int foo(unsigned int x, long a)
+{
+ x /= a;
+ return x;
+}
+
+/*
+ * check-name: compound-assign-type
+ * check-command: test-linearize -m64 $file
+ * check-output-ignore
+ *
+ * check-output-excludes: divu\\.32
+ * check-output-contains: divs\\.64
+ * check-output-contains: scast\\.32
+ */
--
2.10.2
--
To unsubscribe from this list: send the line "unsubscribe linux-sparse" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
