2 * abcremoval.c: Array bounds check removal
5 * Massimiliano Mantione (massi@ximian.com)
7 * (C) 2004 Ximian, Inc. http://www.ximian.com
12 #include <mono/metadata/debug-helpers.h>
13 #include <mono/metadata/mempool.h>
14 #include <mono/metadata/opcodes.h>
22 #include "abcremoval.h"
24 #if SIZEOF_VOID_P == 8
25 #define OP_PCONST OP_I8CONST
27 #define OP_PCONST OP_ICONST
31 #define TRACE_ABC_REMOVAL (verbose_level > 2)
32 #define REPORT_ABC_REMOVAL (verbose_level > 0)
35 * A little hack for the verbosity level.
36 * The verbosity level is stored in the cfg, but not all functions that must
37 * print something see the cfg, so we store the verbosity level here at the
38 * beginning of the algorithm.
39 * This is not thread safe (does not handle correctly different verbosity
40 * levels in different threads), and is not exact in case of dynamic changes
41 * of the verbosity level...
42 * Anyway, this is not needed, all that can happen is that something more
43 * (or less) is logged, the result is in any case correct.
45 static int verbose_level;
48 #define RELATION_BETWEEN_VALUES(value,related_value) (\
49 ((value) > (related_value))? MONO_GT_RELATION :\
50 (((value) < (related_value))? MONO_LT_RELATION : MONO_EQ_RELATION))
52 #define MAKE_VALUE_ANY(v) do{\
53 (v).type = MONO_ANY_SUMMARIZED_VALUE;\
56 #define MAKE_VALUE_RELATION_ANY(r) do{\
57 (r)->relation = MONO_ANY_RELATION;\
58 MAKE_VALUE_ANY((r)->related_value);\
61 #define INITIALIZE_VALUE_RELATION(r) do{\
62 MAKE_VALUE_RELATION_ANY((r));\
66 #define MONO_NEGATED_RELATION(r) ((~(r))&MONO_ANY_RELATION)
67 #define MONO_SYMMETRIC_RELATION(r) (((r)&MONO_EQ_RELATION)|(((r)&MONO_LT_RELATION)<<1)|((r&MONO_GT_RELATION)>>1))
72 print_relation (int relation) {
75 if (relation & MONO_LT_RELATION) {
79 if (relation & MONO_EQ_RELATION) {
86 if (relation & MONO_GT_RELATION) {
97 print_summarized_value (MonoSummarizedValue *value) {
98 switch (value->type) {
99 case MONO_ANY_SUMMARIZED_VALUE:
102 case MONO_CONSTANT_SUMMARIZED_VALUE:
103 printf ("CONSTANT %d", value->value.constant.value);
105 case MONO_VARIABLE_SUMMARIZED_VALUE:
106 printf ("VARIABLE %d, delta %d", value->value.variable.variable, value->value.variable.delta);
108 case MONO_PHI_SUMMARIZED_VALUE: {
111 for (phi = 0; phi < value->value.phi.number_of_alternatives; phi++) {
112 if (phi) printf (",");
113 printf ("%d", value->value.phi.phi_alternatives [phi]);
119 g_assert_not_reached ();
124 print_summarized_value_relation (MonoSummarizedValueRelation *relation) {
125 printf ("Relation ");
126 print_relation (relation->relation);
127 printf (" with value ");
128 print_summarized_value (&(relation->related_value));
133 print_summarized_value_relation_chain (MonoSummarizedValueRelation *relation) {
134 printf ("Relations:\n");
136 print_summarized_value_relation (relation);
138 relation = relation->next;
144 print_evaluation_context_status (MonoRelationsEvaluationStatus status) {
145 if (status == MONO_RELATIONS_EVALUATION_NOT_STARTED) {
146 printf ("EVALUATION_NOT_STARTED");
148 gboolean print_or = FALSE;
151 if (status & MONO_RELATIONS_EVALUATION_IN_PROGRESS) {
152 if (print_or) printf ("|");
153 printf ("EVALUATION_IN_PROGRESS");
156 if (status & MONO_RELATIONS_EVALUATION_COMPLETED) {
157 if (print_or) printf ("|");
158 printf ("EVALUATION_COMPLETED");
161 if (status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_ASCENDING) {
162 if (print_or) printf ("|");
163 printf ("RECURSIVELY_ASCENDING");
166 if (status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_DESCENDING) {
167 if (print_or) printf ("|");
168 printf ("RECURSIVELY_DESCENDING");
171 if (status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_INDEFINITE) {
172 if (print_or) printf ("|");
173 printf ("RECURSIVELY_INDEFINITE");
182 print_evaluation_context_ranges (MonoRelationsEvaluationRanges *ranges) {
183 printf ("(ranges: zero [%d,%d], variable [%d,%d])", ranges->zero.lower, ranges->zero.upper, ranges->variable.lower, ranges->variable.upper);
187 print_evaluation_context (MonoRelationsEvaluationContext *context) {
188 printf ("Context status: ");
189 print_evaluation_context_status (context->status);
190 if (context->status & (MONO_RELATIONS_EVALUATION_IN_PROGRESS|MONO_RELATIONS_EVALUATION_COMPLETED)) {
191 print_evaluation_context_ranges (&(context->ranges));
198 print_evaluation_area (MonoVariableRelationsEvaluationArea *area) {
200 printf ("Dump of evaluation area (%d variables):\n", area->cfg->num_varinfo);
201 for (i = 0; i < area->cfg->num_varinfo; i++) {
202 printf ("Variable %d: ", i);
203 print_evaluation_context (&(area->contexts [i]));
204 print_summarized_value_relation_chain (&(area->relations [i]));
209 print_evaluation_area_contexts (MonoVariableRelationsEvaluationArea *area) {
211 printf ("Dump of evaluation area contexts (%d variables):\n", area->cfg->num_varinfo);
212 for (i = 0; i < area->cfg->num_varinfo; i++) {
213 printf ("Variable %d: ", i);
214 print_evaluation_context (&(area->contexts [i]));
220 * Given a MonoInst, if it is a store to a variable return the MonoInst that
221 * represents the stored value.
222 * If anything goes wrong, return NULL.
223 * store: the MonoInst that should be a store
224 * expected_variable_index: the variable where the value should be stored
225 * return: either the stored value, or NULL
228 get_variable_value_from_store_instruction (MonoInst *store, int expected_variable_index) {
229 switch (store->opcode) {
238 if (TRACE_ABC_REMOVAL) {
239 printf ("[store instruction found]");
241 if ((store->inst_left->opcode == OP_LOCAL) || (store->inst_left->opcode == OP_ARG)) {
242 int variable_index = store->inst_left->inst_c0;
243 if (TRACE_ABC_REMOVAL) {
244 printf ("[value put in local %d (expected %d)]", variable_index, expected_variable_index);
246 if (variable_index == expected_variable_index) {
247 return store->inst_right;
263 * Check if the delta of an integer variable value is safe with respect
264 * to the variable size in bytes and its kind (signed or unsigned).
265 * If the delta is not safe, make the value an "any".
268 check_delta_safety (MonoVariableRelationsEvaluationArea *area, MonoSummarizedValue *value) {
269 if (value->type == MONO_VARIABLE_SUMMARIZED_VALUE) {
270 int variable = value->value.variable.variable;
271 int delta = value->value.variable.delta;
272 if ((area->variable_value_kind [variable]) & MONO_UNSIGNED_VALUE_FLAG) {
274 MAKE_VALUE_ANY (*value);
277 if (((area->variable_value_kind [variable]) & MONO_INTEGER_VALUE_SIZE_BITMASK) < 4) {
278 MAKE_VALUE_ANY (*value);
279 } else if (delta > 16) {
280 MAKE_VALUE_ANY (*value);
286 /* Prototype, definition comes later */
288 summarize_array_value (MonoVariableRelationsEvaluationArea *area, MonoInst *value, MonoSummarizedValue *result, gboolean is_array_type);
291 * Given a MonoInst representing an integer value, store it in "summarized" form.
292 * result_value_kind: the "expected" kind of result;
293 * result: the "summarized" value
294 * returns the "actual" kind of result, if guessable (otherwise MONO_UNKNOWN_INTEGER_VALUE)
296 static MonoIntegerValueKind
297 summarize_integer_value (MonoVariableRelationsEvaluationArea *area, MonoInst *value, MonoSummarizedValue *result, MonoIntegerValueKind result_value_kind) {
298 MonoIntegerValueKind value_kind;
300 if (value->type == STACK_I8) {
301 value_kind = MONO_INTEGER_VALUE_SIZE_8;
302 } else if (value->type == STACK_I4) {
303 value_kind = MONO_INTEGER_VALUE_SIZE_4;
305 value_kind = MONO_UNKNOWN_INTEGER_VALUE;
308 switch (value->opcode) {
310 result->type = MONO_CONSTANT_SUMMARIZED_VALUE;
311 result->value.constant.value = value->inst_c0;
315 result->type = MONO_VARIABLE_SUMMARIZED_VALUE;
316 result->value.variable.variable = value->inst_c0;
317 result->value.variable.delta = 0;
318 value_kind = area->variable_value_kind [value->inst_c0];
321 value_kind = MONO_INTEGER_VALUE_SIZE_1;
324 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_1;
327 value_kind = MONO_INTEGER_VALUE_SIZE_2;
330 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_2;
333 value_kind = MONO_INTEGER_VALUE_SIZE_4;
336 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_4;
339 value_kind = MONO_INTEGER_VALUE_SIZE_8;
342 value_kind = SIZEOF_VOID_P;
344 if ((value->inst_left->opcode == OP_LOCAL) || (value->inst_left->opcode == OP_ARG)) {
345 value_kind = summarize_integer_value (area, value->inst_left, result, result_value_kind);
347 MAKE_VALUE_ANY (*result);
351 MonoSummarizedValue left_value;
352 MonoSummarizedValue right_value;
353 summarize_integer_value (area, value->inst_left, &left_value, result_value_kind);
354 summarize_integer_value (area, value->inst_right, &right_value, result_value_kind);
356 if (left_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
357 if (right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
358 result->type = MONO_VARIABLE_SUMMARIZED_VALUE;
359 result->value.variable.variable = left_value.value.variable.variable;
360 result->value.variable.delta = left_value.value.variable.delta + right_value.value.constant.value;
362 MAKE_VALUE_ANY (*result);
364 } else if (right_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
365 if (left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
366 result->type = MONO_VARIABLE_SUMMARIZED_VALUE;
367 result->value.variable.variable = right_value.value.variable.variable;
368 result->value.variable.delta = left_value.value.constant.value + right_value.value.variable.delta;
370 MAKE_VALUE_ANY (*result);
372 } else if ((right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) && (left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE)) {
373 /* This should not happen if constant folding has been done */
374 result->type = MONO_CONSTANT_SUMMARIZED_VALUE;
375 result->value.constant.value = left_value.value.constant.value + right_value.value.constant.value;
377 MAKE_VALUE_ANY (*result);
379 if (result->type == MONO_VARIABLE_SUMMARIZED_VALUE) {
380 check_delta_safety (area, result);
385 MonoSummarizedValue left_value;
386 MonoSummarizedValue right_value;
387 summarize_integer_value (area, value->inst_left, &left_value, result_value_kind);
388 summarize_integer_value (area, value->inst_right, &right_value, result_value_kind);
390 if (left_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
391 if (right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
392 result->type = MONO_VARIABLE_SUMMARIZED_VALUE;
393 result->value.variable.variable = left_value.value.variable.variable;
394 result->value.variable.delta = left_value.value.variable.delta - right_value.value.constant.value;
396 MAKE_VALUE_ANY (*result);
398 } else if ((right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) && (left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE)) {
399 /* This should not happen if constant folding has been done */
400 result->type = MONO_CONSTANT_SUMMARIZED_VALUE;
401 result->value.constant.value = left_value.value.constant.value - right_value.value.constant.value;
403 MAKE_VALUE_ANY (*result);
405 if (result->type == MONO_VARIABLE_SUMMARIZED_VALUE) {
406 check_delta_safety (area, result);
411 MonoSummarizedValue left_value;
412 MonoSummarizedValue right_value;
413 int constant_operand_value;
415 summarize_integer_value (area, value->inst_left, &left_value, result_value_kind);
416 summarize_integer_value (area, value->inst_right, &right_value, result_value_kind);
418 if (left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
419 constant_operand_value = left_value.value.constant.value;
420 } else if (right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
421 constant_operand_value = right_value.value.constant.value;
423 constant_operand_value = 0;
426 if (constant_operand_value > 0) {
427 if (constant_operand_value <= 0xff) {
428 if ((result_value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) > 1) {
429 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_1;
431 } else if (constant_operand_value <= 0xffff) {
432 if ((result_value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) > 2) {
433 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_2;
438 MAKE_VALUE_ANY (*result);
442 case CEE_CONV_OVF_I1:
443 case CEE_CONV_OVF_I1_UN:
444 value_kind = MONO_INTEGER_VALUE_SIZE_1;
445 MAKE_VALUE_ANY (*result);
448 case CEE_CONV_OVF_U1:
449 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_1;
450 MAKE_VALUE_ANY (*result);
453 case CEE_CONV_OVF_I2:
454 case CEE_CONV_OVF_I2_UN:
455 value_kind = MONO_INTEGER_VALUE_SIZE_2;
456 MAKE_VALUE_ANY (*result);
459 case CEE_CONV_OVF_U2:
460 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_2;
461 MAKE_VALUE_ANY (*result);
464 summarize_array_value (area, value->inst_left, result, TRUE);
465 value_kind = MONO_UNSIGNED_INTEGER_VALUE_SIZE_4;
468 value_kind = summarize_integer_value (area, value->inst_left, result, result_value_kind);
471 result->type = MONO_PHI_SUMMARIZED_VALUE;
472 result->value.phi.number_of_alternatives = *(value->inst_phi_args);
473 result->value.phi.phi_alternatives = value->inst_phi_args + 1;
476 MAKE_VALUE_ANY (*result);
482 * Given a MonoInst representing an array value, store it in "summarized" form.
483 * result: the "summarized" value
484 * is_array_type: TRUE of we are *sure* that an eventual OP_PCONST will point
485 * to a MonoArray (this can happen for already initialized readonly static fields,
486 * in which case we will get the array length directly from the MonoArray)
489 summarize_array_value (MonoVariableRelationsEvaluationArea *area, MonoInst *value, MonoSummarizedValue *result, gboolean is_array_type) {
490 switch (value->opcode) {
493 result->type = MONO_VARIABLE_SUMMARIZED_VALUE;
494 result->value.variable.variable = value->inst_c0;
495 result->value.variable.delta = 0;
498 summarize_array_value (area, value->inst_left, result, FALSE);
501 summarize_integer_value (area, value->inst_newa_len, result, MONO_UNKNOWN_INTEGER_VALUE);
504 if ((is_array_type) && (value->inst_p0 != NULL)) {
505 MonoArray *array = (MonoArray *) (value->inst_p0);
506 result->type = MONO_CONSTANT_SUMMARIZED_VALUE;
507 result->value.constant.value = array->max_length;
509 MAKE_VALUE_ANY (*result);
513 result->type = MONO_PHI_SUMMARIZED_VALUE;
514 result->value.phi.number_of_alternatives = *(value->inst_phi_args);
515 result->value.phi.phi_alternatives = value->inst_phi_args + 1;
518 MAKE_VALUE_ANY (*result);
522 static MonoValueRelation
523 get_relation_from_branch_instruction (int opcode) {
526 return MONO_EQ_RELATION;
529 return MONO_LT_RELATION;
532 return MONO_LE_RELATION;
535 return MONO_GT_RELATION;
538 return MONO_GE_RELATION;
540 return MONO_NE_RELATION;
542 return MONO_ANY_RELATION;
547 * Given a BB, find its entry condition and put its relations in a
548 * "MonoAdditionalVariableRelationsForBB" structure.
550 * relations: the resulting relations (entry condition of the given BB)
553 get_relations_from_previous_bb (MonoVariableRelationsEvaluationArea *area, MonoBasicBlock *bb, MonoAdditionalVariableRelationsForBB *relations) {
554 MonoBasicBlock *in_bb;
556 MonoValueRelation branch_relation;
557 MonoValueRelation symmetric_relation;
559 INITIALIZE_VALUE_RELATION (&(relations->relation1.relation));
560 relations->relation1.relation.relation_is_static_definition = FALSE;
561 relations->relation1.insertion_point = NULL;
562 relations->relation1.variable = -1;
563 INITIALIZE_VALUE_RELATION (&(relations->relation2.relation));
564 relations->relation2.relation.relation_is_static_definition = FALSE;
565 relations->relation2.insertion_point = NULL;
566 relations->relation2.variable = -1;
569 if (bb->in_count == 1) { /* Should write the code to "sum" conditions... */
570 in_bb = bb->in_bb [0];
571 branch = in_bb->last_ins;
572 if (branch == NULL) return;
573 branch_relation = get_relation_from_branch_instruction (branch->opcode);
574 if ((branch_relation != MONO_ANY_RELATION) && (branch->inst_left->opcode == OP_COMPARE)) {
575 MonoSummarizedValue left_value;
576 MonoSummarizedValue right_value;
579 if (branch->inst_true_bb == bb) {
581 } else if (branch->inst_false_bb == bb) {
585 g_assert_not_reached ();
589 branch_relation = MONO_NEGATED_RELATION (branch_relation);
591 symmetric_relation = MONO_SYMMETRIC_RELATION (branch_relation);
593 summarize_integer_value (area, branch->inst_left->inst_left, &left_value, MONO_UNKNOWN_INTEGER_VALUE);
594 summarize_integer_value (area, branch->inst_left->inst_right, &right_value, MONO_UNKNOWN_INTEGER_VALUE);
596 if ((left_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) && ((right_value.type == MONO_VARIABLE_SUMMARIZED_VALUE)||(right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE))) {
597 relations->relation1.variable = left_value.value.variable.variable;
598 relations->relation1.relation.relation = branch_relation;
599 relations->relation1.relation.related_value = right_value;
600 if (right_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
601 relations->relation1.relation.related_value.value.constant.value -= left_value.value.variable.delta;
603 relations->relation1.relation.related_value.value.variable.delta -= left_value.value.variable.delta;
606 if ((right_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) && ((left_value.type == MONO_VARIABLE_SUMMARIZED_VALUE)||(left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE))) {
607 relations->relation2.variable = right_value.value.variable.variable;
608 relations->relation2.relation.relation = symmetric_relation;
609 relations->relation2.relation.related_value = left_value;
610 if (left_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
611 relations->relation2.relation.related_value.value.constant.value -= right_value.value.variable.delta;
613 relations->relation2.relation.related_value.value.variable.delta -= right_value.value.variable.delta;
622 * Add the given relations to the evaluation area.
623 * area: the evaluation area
624 * change: the relations that must be added
627 apply_change_to_evaluation_area (MonoVariableRelationsEvaluationArea *area, MonoAdditionalVariableRelation *change) {
628 MonoSummarizedValueRelation *base_relation;
630 if (change->relation.relation != MONO_ANY_RELATION) {
631 base_relation = &(area->relations [change->variable]);
632 while ((base_relation->next != NULL) && (base_relation->next->relation_is_static_definition)) {
633 base_relation = base_relation->next;
635 change->insertion_point = base_relation;
636 change->relation.next = base_relation->next;
637 base_relation->next = &(change->relation);
642 * Remove the given relation from the evaluation area.
643 * change: the relation that must be removed
646 remove_change_from_evaluation_area (MonoAdditionalVariableRelation *change) {
647 if (change->insertion_point != NULL) {
648 change->insertion_point->next = change->relation.next;
649 change->relation.next = NULL;
655 clean_contexts (MonoRelationsEvaluationContext *contexts, int number) {
657 for (i = 0; i < number; i++) {
658 contexts [i].status = MONO_RELATIONS_EVALUATION_NOT_STARTED;
664 * Perform the intersection of a range and a constant value (taking into
665 * account the relation that the value has with the range).
666 * range: the range that will be intersected with the value
667 * value: the value that will be intersected with the range
668 * relation: the relation between the range and the value
671 intersect_value( MonoRelationsEvaluationRange *range, int value, MonoValueRelation relation ) {
673 case MONO_NO_RELATION:
674 MONO_MAKE_RELATIONS_EVALUATION_RANGE_IMPOSSIBLE (*range);
676 case MONO_ANY_RELATION:
678 case MONO_EQ_RELATION:
679 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (range->upper, value);
680 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (range->lower, value);
682 case MONO_NE_RELATION: {
683 /* IMPROVEMENT Figure this out! (ignoring it is safe anyway) */
686 case MONO_LT_RELATION:
687 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (range->upper, MONO_UPPER_EVALUATION_RANGE_NOT_EQUAL (value));
689 case MONO_LE_RELATION:
690 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (range->upper, value);
692 case MONO_GT_RELATION:
693 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (range->lower, MONO_LOWER_EVALUATION_RANGE_NOT_EQUAL (value));
695 case MONO_GE_RELATION:
696 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (range->lower, value);
699 g_assert_not_reached();
705 * Perform the intersection of two pairs of ranges (taking into account the
706 * relation between the ranges and a given delta).
707 * ranges: the ranges that will be intersected
708 * other_ranges the other ranges that will be intersected
709 * delta: the delta between the pairs of ranges
710 * relation: the relation between the pairs of ranges
713 intersect_ranges( MonoRelationsEvaluationRanges *ranges, MonoRelationsEvaluationRanges *other_ranges, int delta, MonoValueRelation relation ) {
716 case MONO_NO_RELATION:
717 MONO_MAKE_RELATIONS_EVALUATION_RANGES_IMPOSSIBLE (*ranges);
719 case MONO_ANY_RELATION:
721 case MONO_EQ_RELATION:
722 MONO_RELATIONS_EVALUATION_RANGES_INTERSECTION (*ranges, *other_ranges);
724 case MONO_NE_RELATION: {
725 /* FIXME Figure this out! (ignoring it is safe anyway) */
728 case MONO_LT_RELATION:
729 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (ranges->zero.upper, MONO_UPPER_EVALUATION_RANGE_NOT_EQUAL (other_ranges->zero.upper));
730 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (ranges->variable.upper, MONO_UPPER_EVALUATION_RANGE_NOT_EQUAL (other_ranges->variable.upper));
732 case MONO_LE_RELATION:
733 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (ranges->zero.upper, other_ranges->zero.upper);
734 MONO_UPPER_EVALUATION_RANGE_INTERSECTION (ranges->variable.upper, other_ranges->variable.upper);
736 case MONO_GT_RELATION:
737 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (ranges->zero.lower, MONO_LOWER_EVALUATION_RANGE_NOT_EQUAL (other_ranges->zero.lower));
738 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (ranges->variable.lower, MONO_LOWER_EVALUATION_RANGE_NOT_EQUAL (other_ranges->variable.lower));
740 case MONO_GE_RELATION:
741 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (ranges->zero.lower, other_ranges->zero.lower);
742 MONO_LOWER_EVALUATION_RANGE_INTERSECTION (ranges->variable.lower, other_ranges->variable.lower);
745 g_assert_not_reached();
748 MonoRelationsEvaluationRanges translated_ranges = *other_ranges;
749 MONO_ADD_DELTA_SAFELY_TO_RANGES (translated_ranges, delta);
750 intersect_ranges( ranges, &translated_ranges, FALSE, relation );
755 * Recursive method that traverses the relation graph to evaluate the
756 * relation between two variables.
757 * At the end of the execution, the resulting ranges are in the context of
758 * the "starting" variable.
759 * area: the current evaluation area (it contains the relation graph and
760 * memory for all the evaluation contexts is already allocated)
761 * variable: starting variable (the value ranges in its context are the result
762 * of the execution of this procedure)
763 * target_variable: the variable with respect to which the starting variable
764 * is evaluated (tipically the starting variable is the index
765 * and the target one is the array (which means its length))
766 * father_context: the previous evaluation context in recursive invocations
767 * (or NULL for the first invocation)
770 evaluate_relation_with_target_variable (MonoVariableRelationsEvaluationArea *area, int variable, int target_variable, MonoRelationsEvaluationContext *father_context) {
771 MonoRelationsEvaluationContext *context = &(area->contexts [variable]);
773 // First of all, we check the evaluation status
774 // (what must be done is *very* different in each case)
775 switch (context->status) {
776 case MONO_RELATIONS_EVALUATION_NOT_STARTED: {
777 MonoSummarizedValueRelation *relation = &(area->relations [variable]);
779 if (TRACE_ABC_REMOVAL) {
780 printf ("Evaluating varible %d (target variable %d)\n", variable, target_variable);
781 print_summarized_value_relation (relation);
785 // We properly inizialize the context
786 context->status = MONO_RELATIONS_EVALUATION_IN_PROGRESS;
787 context->father = father_context;
788 MONO_MAKE_RELATIONS_EVALUATION_RANGES_WEAK (context->ranges);
790 // If we have found the target variable, we can set the range
791 // related to it in the context to "equal" (which is [0,0])
792 if (variable == target_variable) {
793 if (TRACE_ABC_REMOVAL) {
794 printf ("Target variable reached (%d), continuing to evaluate relations with constants\n", variable);
796 context->ranges.variable.lower = 0;
797 context->ranges.variable.upper = 0;
800 // Examine all relations for this variable (scan the list)
801 // The contribute of each relation will be intersected (logical and)
802 while (relation != NULL) {
803 context->current_relation = relation;
805 if (TRACE_ABC_REMOVAL) {
806 printf ("Processing (%d): ", variable);
807 print_summarized_value_relation (relation);
811 // We decie what to do according the the type of the related value
812 switch (relation->related_value.type) {
813 case MONO_ANY_SUMMARIZED_VALUE:
814 // No added information, skip it
816 case MONO_CONSTANT_SUMMARIZED_VALUE:
817 // Intersect range with constant (taking into account the relation)
818 intersect_value (&(context->ranges.zero), relation->related_value.value.constant.value, relation->relation);
820 case MONO_VARIABLE_SUMMARIZED_VALUE:
821 // Generally, evaluate related variable and intersect ranges.
822 // However, some check is necessary...
824 // If the relation is "ANY", nothing to do (no added information)
825 if (relation->relation != MONO_ANY_RELATION) {
826 int related_variable = relation->related_value.value.variable.variable;
827 MonoRelationsEvaluationContext *related_context = &(area->contexts [related_variable]);
829 // The second condition in the "or" avoids messing with "back edges" in the graph traversal
830 // (they are simply ignored instead of triggering the handling of recursion)
831 if ( (related_context->status == MONO_RELATIONS_EVALUATION_NOT_STARTED) || !
832 ((related_context->current_relation->related_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) &&
833 (related_context->current_relation->related_value.value.variable.variable == variable))) {
834 // Evaluate the related variable
835 evaluate_relation_with_target_variable (area, related_variable, target_variable, context);
837 // Check if we are part of a recursive loop
838 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVE) {
839 if (TRACE_ABC_REMOVAL) {
840 printf ("Recursivity detected for varible %d (target variable %d), status ", variable, target_variable);
841 print_evaluation_context_status (context->status);
844 // If we are, check if the evaluation of the related variable is complete
845 if (related_context->status == MONO_RELATIONS_EVALUATION_COMPLETED) {
846 // If it is complete, we are part of a recursive definition.
847 // Since it is a *definition* (and definitions are evaluated *before*
848 // conditions because they are first in the list), intersection is not
849 // strictly necessary, we simply copy the ranges and apply the delta
850 context->ranges = related_context->ranges;
851 /* Delta has already been checked for over/under-flow when evaluating values */
852 MONO_ADD_DELTA_SAFELY_TO_RANGES (context->ranges, relation->related_value.value.variable.delta);
853 context->status = MONO_RELATIONS_EVALUATION_COMPLETED;
854 if (TRACE_ABC_REMOVAL) {
855 printf (", ranges already computed, result: \n");
856 print_evaluation_context_ranges (&(context->ranges));
857 printf (" (delta is %d)\n", relation->related_value.value.variable.delta);
860 // If it is not complete, do nothing (we do not have enough information)
861 if (TRACE_ABC_REMOVAL) {
862 printf (", ranges not computed\n");
866 // If we are not (the common case) intersect the result
867 intersect_ranges( &(context->ranges), &(related_context->ranges), relation->related_value.value.variable.delta, relation->relation );
870 if (TRACE_ABC_REMOVAL) {
871 printf ("Relation is a back-edge in this traversal, skipping\n");
876 case MONO_PHI_SUMMARIZED_VALUE: {
877 // We must compute all PHI alternatives, combining the results (with a union, which is a logical "or"),
878 // and intersect this result with the ranges in the context; we must also take into account recursions
879 // (with loops that can be ascending, descending, or indefinite)
880 MonoRelationsEvaluationRanges phi_ranges;
882 gboolean is_ascending = FALSE;
883 gboolean is_descending = FALSE;
885 MONO_MAKE_RELATIONS_EVALUATION_RANGES_IMPOSSIBLE (phi_ranges);
886 for (phi = 0; phi < relation->related_value.value.phi.number_of_alternatives; phi++) {
887 int phi_alternative = relation->related_value.value.phi.phi_alternatives [phi];
888 evaluate_relation_with_target_variable (area, phi_alternative, target_variable, context);
890 // This means we are part of a recursive loop
891 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVE) {
892 if (TRACE_ABC_REMOVAL) {
893 printf ("Recursivity detected for varible %d (target variable %d), status ", variable, target_variable);
894 print_evaluation_context_status (context->status);
897 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_ASCENDING) {
900 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_DESCENDING) {
901 is_descending = TRUE;
903 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_INDEFINITE) {
905 is_descending = TRUE;
908 // Clear "recursivity" bits in the status (recursion has been handled)
909 context->status = MONO_RELATIONS_EVALUATION_IN_PROGRESS;
911 MONO_RELATIONS_EVALUATION_RANGES_UNION (phi_ranges, area->contexts [phi_alternative].ranges);
915 // Apply the effects of all recursive loops
917 phi_ranges.zero.upper = INT_MAX;
918 phi_ranges.variable.upper = INT_MAX;
921 phi_ranges.zero.lower = INT_MIN;
922 phi_ranges.variable.lower = INT_MIN;
925 // Intersect final result
926 MONO_RELATIONS_EVALUATION_RANGES_INTERSECTION (context->ranges, phi_ranges);
930 g_assert_not_reached();
933 // Pass to next relation
934 relation = relation->next;
937 // Check if any recursivity bits are still in the status, and in any case clear them
938 if (context->status & MONO_RELATIONS_EVALUATION_IS_RECURSIVE) {
939 if (TRACE_ABC_REMOVAL) {
940 printf ("Recursivity for varible %d (target variable %d) discards computation, status ", variable, target_variable);
941 print_evaluation_context_status (context->status);
944 // If yes, we did not have enough information (most likely we were evaluated inside a PHI, but we also
945 // depended on the same PHI, which was still in evaluation...), so clear the status to "NOT_STARTED"
946 // (if we will be evaluated again, the PHI will be already done, so our evaluation will succeed)
947 context->status = MONO_RELATIONS_EVALUATION_NOT_STARTED;
949 if (TRACE_ABC_REMOVAL) {
950 printf ("Ranges for varible %d (target variable %d) computed: ", variable, target_variable);
951 print_evaluation_context_ranges (&(context->ranges));
954 // If not (the common case) the evaluation is complete, and the result is in the context
955 context->status = MONO_RELATIONS_EVALUATION_COMPLETED;
959 case MONO_RELATIONS_EVALUATION_IN_PROGRESS: {
960 // This means we are in a recursive loop
961 MonoRelationsEvaluationContext *current_context = father_context;
962 MonoRelationsEvaluationContext *last_context = context->father;
963 gboolean evaluation_can_be_recursive = TRUE;
964 gboolean evaluation_is_definition = TRUE;
967 if (TRACE_ABC_REMOVAL) {
968 printf ("Evaluation of varible %d (target variable %d) already in progress\n", variable, target_variable);
969 print_evaluation_context (context);
970 print_summarized_value_relation (context->current_relation);
974 // We must check if the loop can be a recursive definition (we scan the whole loop)
975 while (current_context != last_context) {
976 if (current_context == NULL) {
977 printf ("Broken recursive ring in ABC removal\n");
978 g_assert_not_reached ();
981 if (current_context->current_relation->relation_is_static_definition) {
982 if (current_context->current_relation->related_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
983 /* No need to check path_value for over/under-flow, since delta should be safe */
984 path_value += current_context->current_relation->related_value.value.variable.delta;
985 } else if (current_context->current_relation->related_value.type != MONO_PHI_SUMMARIZED_VALUE) {
986 evaluation_can_be_recursive = FALSE;
989 evaluation_is_definition = FALSE;
990 evaluation_can_be_recursive = FALSE;
993 current_context = current_context->father;
996 // If this is a recursive definition, we properly flag the status in all the involved contexts
997 if (evaluation_is_definition) {
998 MonoRelationsEvaluationStatus recursive_status;
999 if (evaluation_can_be_recursive) {
1000 if (path_value > 0) {
1001 recursive_status = MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_ASCENDING;
1002 } else if (path_value < 0) {
1003 recursive_status = MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_DESCENDING;
1005 recursive_status = MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_INDEFINITE;
1008 recursive_status = MONO_RELATIONS_EVALUATION_IS_RECURSIVELY_INDEFINITE;
1011 if (TRACE_ABC_REMOVAL) {
1012 printf ("Recursivity accepted (");
1013 print_evaluation_context_status (recursive_status);
1017 current_context = father_context;
1018 while (current_context != last_context) {
1019 current_context->status |= recursive_status;
1020 current_context = current_context->father;
1023 if (TRACE_ABC_REMOVAL) {
1024 printf ("Recursivity rejected (some relation in the cycle is not a defintion)\n");
1029 case MONO_RELATIONS_EVALUATION_COMPLETED: {
1033 if (TRACE_ABC_REMOVAL) {
1034 printf ("Varible %d (target variable %d) already in a recursive ring, skipping\n", variable, target_variable);
1035 print_evaluation_context (context);
1036 print_summarized_value_relation (context->current_relation);
1045 * Apply the given value kind to the given range
1047 static void apply_value_kind_to_range (MonoRelationsEvaluationRange *range, MonoIntegerValueKind value_kind) {
1048 if (value_kind != MONO_UNKNOWN_INTEGER_VALUE) {
1049 if (value_kind & MONO_UNSIGNED_VALUE_FLAG) {
1050 if (range->lower < 0) {
1053 if ((value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) == 1) {
1054 if (range->upper > 0xff) {
1055 range->upper = 0xff;
1057 } else if ((value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) == 2) {
1058 if (range->upper > 0xffff) {
1059 range->upper = 0xffff;
1063 if ((value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) == 1) {
1064 if (range->lower < -0x80) {
1065 range->lower = -0x80;
1067 if (range->upper > 0x7f) {
1068 range->upper = 0x7f;
1070 } else if ((value_kind & MONO_INTEGER_VALUE_SIZE_BITMASK) == 2) {
1071 if (range->lower < -0x8000) {
1072 range->lower = -0x8000;
1074 if (range->upper > 0x7fff) {
1075 range->upper = 0x7fff;
1083 * Attempt the removal of bounds checks from a MonoInst.
1084 * inst: the MonoInst
1085 * area: the current evaluation area (it contains the relation graph and
1086 * memory for all the evaluation contexts is already allocated)
1089 remove_abc_from_inst (MonoInst *inst, MonoVariableRelationsEvaluationArea *area) {
1090 if (inst->opcode == CEE_LDELEMA) {
1091 MonoInst *array_inst = inst->inst_left;
1092 MonoInst *index_inst = inst->inst_right;
1093 MonoSummarizedValue array_value;
1094 MonoSummarizedValue index_value;
1095 MonoIntegerValueKind index_value_kind;
1097 /* First of all, examine the CEE_LDELEMA operands */
1098 summarize_array_value (area, array_inst, &array_value, TRUE);
1099 index_value_kind = summarize_integer_value (area, index_inst, &index_value, MONO_UNKNOWN_INTEGER_VALUE);
1101 /* If the array is a local variable... */
1102 if (array_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
1103 int array_variable = array_value.value.variable.variable;
1104 MonoRelationsEvaluationContext *array_context = &(area->contexts [array_variable]);
1106 if (index_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
1107 // The easiest case: we just evaluate the array length, to see if it has some relation
1108 // with the index constant, and act accordingly
1110 clean_contexts (area->contexts, area->cfg->num_varinfo);
1111 evaluate_relation_with_target_variable (area, array_variable, array_variable, NULL);
1113 if ((index_value.value.constant.value >= 0) && (index_value.value.constant.value < array_context->ranges.zero.lower)) {
1114 if (REPORT_ABC_REMOVAL) {
1115 printf ("ARRAY-ACCESS: removed bounds check on array %d with constant index %d in method %s\n",
1116 array_variable, index_value.value.constant.value, mono_method_full_name (area->cfg->method, TRUE));
1118 inst->flags |= (MONO_INST_NORANGECHECK);
1120 } else if (index_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
1121 // The common case: we must evaluate both the index and the array length, and check for relevant
1122 // relations both through variable definitions and as constant definitions
1124 int index_variable = index_value.value.variable.variable;
1125 MonoRelationsEvaluationContext *index_context = &(area->contexts [index_variable]);
1127 clean_contexts (area->contexts, area->cfg->num_varinfo);
1129 evaluate_relation_with_target_variable (area, index_variable, array_variable, NULL);
1130 evaluate_relation_with_target_variable (area, array_variable, array_variable, NULL);
1132 MONO_SUB_DELTA_SAFELY_FROM_RANGES (index_context->ranges, index_value.value.variable.delta);
1133 /* Apply index value kind */
1134 apply_value_kind_to_range (&(index_context->ranges.zero), index_value_kind);
1136 if (index_context->ranges.zero.lower >= 0) {
1137 if (TRACE_ABC_REMOVAL) {
1138 printf ("ARRAY-ACCESS: Removed lower bound check on array %d with index %d\n", array_variable, index_variable);
1140 if ((index_context->ranges.variable.upper < 0)||(index_context->ranges.zero.upper < array_context->ranges.zero.lower)) {
1141 if (REPORT_ABC_REMOVAL) {
1142 printf ("ARRAY-ACCESS: removed bounds check on array %d with index %d in method %s\n",
1143 array_variable, index_variable, mono_method_full_name (area->cfg->method, TRUE));
1145 inst->flags |= (MONO_INST_NORANGECHECK);
1148 if (TRACE_ABC_REMOVAL) {
1149 if (index_context->ranges.variable.upper < 0) {
1150 printf ("ARRAY-ACCESS: Removed upper bound check (through variable) on array %d with index %d\n", array_variable, index_variable);
1152 if (index_context->ranges.zero.upper < array_context->ranges.zero.lower) {
1153 printf ("ARRAY-ACCESS: Removed upper bound check (through constant) on array %d with index %d\n", array_variable, index_variable);
1157 } else if (array_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
1158 if (index_value.type == MONO_CONSTANT_SUMMARIZED_VALUE) {
1159 /* The easiest possible case: constant with constant */
1160 if ((index_value.value.constant.value >= 0) && (index_value.value.constant.value < array_value.value.constant.value)) {
1161 if (REPORT_ABC_REMOVAL) {
1162 printf ("ARRAY-ACCESS: removed bounds check on array of constant length %d with constant index %d in method %s\n",
1163 array_value.value.constant.value, index_value.value.constant.value, mono_method_full_name (area->cfg->method, TRUE));
1165 inst->flags |= (MONO_INST_NORANGECHECK);
1167 } else if (index_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
1168 /* The index has a variable related value, which must be evaluated */
1169 int index_variable = index_value.value.variable.variable;
1170 MonoRelationsEvaluationContext *index_context = &(area->contexts [index_variable]);
1172 clean_contexts (area->contexts, area->cfg->num_varinfo);
1173 evaluate_relation_with_target_variable (area, index_variable, index_variable, NULL);
1174 /* Apply index value kind */
1175 apply_value_kind_to_range (&(index_context->ranges.zero), index_value_kind);
1177 if ((index_context->ranges.zero.lower >= 0) && (index_context->ranges.zero.upper < array_value.value.constant.value)) {
1178 if (REPORT_ABC_REMOVAL) {
1179 printf ("ARRAY-ACCESS: removed bounds check on array of constant length %d with index %d ranging from %d to %d in method %s\n",
1180 array_value.value.constant.value, index_variable, index_context->ranges.zero.lower, index_context->ranges.zero.upper, mono_method_full_name (area->cfg->method, TRUE));
1182 inst->flags |= (MONO_INST_NORANGECHECK);
1184 } else if (index_value_kind != MONO_UNKNOWN_INTEGER_VALUE) {
1185 /* The index has an unknown but bounded value */
1186 MonoRelationsEvaluationRange range;
1187 MONO_MAKE_RELATIONS_EVALUATION_RANGE_WEAK (range);
1188 apply_value_kind_to_range (&range, index_value_kind);
1190 if ((range.lower >= 0) && (range.upper < array_value.value.constant.value)) {
1191 if (REPORT_ABC_REMOVAL) {
1192 printf ("ARRAY-ACCESS: removed bounds check on array of constant length %d with unknown index ranging from %d to %d in method %s\n",
1193 array_value.value.constant.value, range.lower, range.upper, mono_method_full_name (area->cfg->method, TRUE));
1195 inst->flags |= (MONO_INST_NORANGECHECK);
1203 * Recursively scan a tree of MonoInst looking for array accesses.
1204 * inst: the root of the MonoInst tree
1205 * area: the current evaluation area (it contains the relation graph and
1206 * memory for all the evaluation contexts is already allocated)
1209 process_inst (MonoInst *inst, MonoVariableRelationsEvaluationArea *area) {
1210 if (inst->opcode == CEE_LDELEMA) { /* Handle OP_LDELEMA2D, too */
1211 if (TRACE_ABC_REMOVAL) {
1212 printf ("Attempting check removal...\n");
1215 remove_abc_from_inst (inst, area);
1218 if (mono_burg_arity [inst->opcode]) {
1219 process_inst (inst->inst_left, area);
1220 if (mono_burg_arity [inst->opcode] > 1) {
1221 process_inst (inst->inst_right, area);
1230 * Process a BB removing bounds checks from array accesses.
1231 * It does the following (in sequence):
1232 * - Get the BB entry condition
1233 * - Add its relations to the relation graph in the evaluation area
1234 * - Process all the MonoInst trees in the BB
1235 * - Recursively process all the children BBs in the dominator tree
1236 * - Remove the relations previously added to the relation graph
1238 * bb: the BB that must be processed
1239 * area: the current evaluation area (it contains the relation graph and
1240 * memory for all the evaluation contexts is already allocated)
1243 process_block (MonoBasicBlock *bb, MonoVariableRelationsEvaluationArea *area) {
1245 MonoInst *current_inst;
1246 MonoAdditionalVariableRelationsForBB additional_relations;
1247 GSList *dominated_bb;
1249 if (TRACE_ABC_REMOVAL) {
1250 printf ("Processing block %d [dfn %d]...\n", bb->block_num, bb->dfn);
1253 get_relations_from_previous_bb (area, bb, &additional_relations);
1254 if (TRACE_ABC_REMOVAL) {
1255 if (additional_relations.relation1.relation.relation != MONO_ANY_RELATION) {
1256 printf ("Adding relation 1 on variable %d: ", additional_relations.relation1.variable);
1257 print_summarized_value_relation (&(additional_relations.relation1.relation));
1260 if (additional_relations.relation2.relation.relation != MONO_ANY_RELATION) {
1261 printf ("Adding relation 2 on variable %d: ", additional_relations.relation2.variable);
1262 print_summarized_value_relation (&(additional_relations.relation2.relation));
1266 apply_change_to_evaluation_area (area, &(additional_relations.relation1));
1267 apply_change_to_evaluation_area (area, &(additional_relations.relation2));
1270 MONO_BB_FOR_EACH_INS (bb, current_inst) {
1271 if (TRACE_ABC_REMOVAL) {
1272 printf ("Processing instruction %d\n", inst_index);
1276 process_inst (current_inst, area);
1280 if (TRACE_ABC_REMOVAL) {
1281 printf ("Processing block %d [dfn %d] done.\n", bb->block_num, bb->dfn);
1284 for (dominated_bb = bb->dominated; dominated_bb != NULL; dominated_bb = dominated_bb->next) {
1285 process_block ((MonoBasicBlock*) (dominated_bb->data), area);
1288 remove_change_from_evaluation_area (&(additional_relations.relation1));
1289 remove_change_from_evaluation_area (&(additional_relations.relation2));
1295 * mono_perform_abc_removal:
1296 * @cfg: Control Flow Graph
1298 * Performs the ABC removal from a cfg in SSA form.
1299 * It does the following:
1300 * - Prepare the evaluation area
1301 * - Allocate memory for the relation graph in the evaluation area
1302 * (of course, only for variable definitions) and summarize there all
1303 * variable definitions
1304 * - Allocate memory for the evaluation contexts in the evaluation area
1305 * - Recursively process all the BBs in the dominator tree (it is enough
1306 * to invoke the processing on the entry BB)
1308 * cfg: the method code
1311 mono_perform_abc_removal (MonoCompile *cfg)
1313 MonoVariableRelationsEvaluationArea area;
1316 verbose_level = cfg->verbose_level;
1318 if (TRACE_ABC_REMOVAL) {
1319 printf ("Removing array bound checks in %s\n", mono_method_full_name (cfg->method, TRUE));
1323 area.relations = (MonoSummarizedValueRelation *)
1324 mono_mempool_alloc (cfg->mempool, sizeof (MonoSummarizedValueRelation) * (cfg->num_varinfo) * 2);
1325 area.contexts = (MonoRelationsEvaluationContext *)
1326 mono_mempool_alloc (cfg->mempool, sizeof (MonoRelationsEvaluationContext) * (cfg->num_varinfo));
1327 area.variable_value_kind = (MonoIntegerValueKind *)
1328 mono_mempool_alloc (cfg->mempool, sizeof (MonoIntegerValueKind) * (cfg->num_varinfo));
1329 for (i = 0; i < cfg->num_varinfo; i++) {
1330 area.variable_value_kind [i] = MONO_UNKNOWN_INTEGER_VALUE;
1331 area.relations [i].relation = MONO_EQ_RELATION;
1332 area.relations [i].relation_is_static_definition = TRUE;
1333 area.relations [i].next = NULL;
1334 if (MONO_VARINFO (cfg, i)->def != NULL) {
1335 MonoInst *value = get_variable_value_from_store_instruction (MONO_VARINFO (cfg, i)->def, i);
1336 if (value != NULL) {
1337 gboolean is_array_type;
1338 MonoIntegerValueKind effective_value_kind;
1339 MonoRelationsEvaluationRange range;
1340 MonoSummarizedValueRelation *type_relation;
1342 switch (cfg->varinfo [i]->inst_vtype->type) {
1343 case MONO_TYPE_ARRAY:
1344 case MONO_TYPE_SZARRAY:
1345 is_array_type = TRUE;
1346 goto handle_array_value;
1347 case MONO_TYPE_OBJECT:
1348 is_array_type = FALSE;
1350 summarize_array_value (&area, value, &(area.relations [i].related_value), is_array_type);
1351 if (TRACE_ABC_REMOVAL) {
1352 printf ("Summarized variable %d as array (is_array_type = %s): ", i, (is_array_type?"TRUE":"FALSE"));
1353 print_summarized_value (&(area.relations [i].related_value));
1358 area.variable_value_kind [i] = MONO_INTEGER_VALUE_SIZE_1;
1359 goto handle_integer_value;
1361 area.variable_value_kind [i] = MONO_UNSIGNED_INTEGER_VALUE_SIZE_1;
1362 goto handle_integer_value;
1364 area.variable_value_kind [i] = MONO_INTEGER_VALUE_SIZE_2;
1365 goto handle_integer_value;
1367 area.variable_value_kind [i] = MONO_UNSIGNED_INTEGER_VALUE_SIZE_2;
1368 goto handle_integer_value;
1370 area.variable_value_kind [i] = MONO_INTEGER_VALUE_SIZE_4;
1371 goto handle_integer_value;
1373 area.variable_value_kind [i] = MONO_UNSIGNED_INTEGER_VALUE_SIZE_4;
1374 goto handle_integer_value;
1376 area.variable_value_kind [i] = SIZEOF_VOID_P;
1377 goto handle_integer_value;
1379 area.variable_value_kind [i] = (MONO_UNSIGNED_VALUE_FLAG|SIZEOF_VOID_P);
1380 goto handle_integer_value;
1382 area.variable_value_kind [i] = MONO_INTEGER_VALUE_SIZE_8;
1383 goto handle_integer_value;
1385 area.variable_value_kind [i] = MONO_UNSIGNED_INTEGER_VALUE_SIZE_8;
1386 handle_integer_value:
1387 effective_value_kind = summarize_integer_value (&area, value, &(area.relations [i].related_value), area.variable_value_kind [i]);
1388 MONO_MAKE_RELATIONS_EVALUATION_RANGE_WEAK (range);
1389 apply_value_kind_to_range (&range, area.variable_value_kind [i]);
1390 apply_value_kind_to_range (&range, effective_value_kind);
1392 if (range.upper < INT_MAX) {
1393 type_relation = (MonoSummarizedValueRelation *) mono_mempool_alloc (cfg->mempool, sizeof (MonoSummarizedValueRelation));
1394 type_relation->relation = MONO_LE_RELATION;
1395 type_relation->related_value.type = MONO_CONSTANT_SUMMARIZED_VALUE;
1396 type_relation->related_value.value.constant.value = range.upper;
1397 type_relation->relation_is_static_definition = TRUE;
1398 type_relation->next = area.relations [i].next;
1399 area.relations [i].next = type_relation;
1400 if (TRACE_ABC_REMOVAL) {
1401 printf ("[var%d <= %d]", i, range.upper);
1404 if (range.lower > INT_MIN) {
1405 type_relation = (MonoSummarizedValueRelation *) mono_mempool_alloc (cfg->mempool, sizeof (MonoSummarizedValueRelation));
1406 type_relation->relation = MONO_GE_RELATION;
1407 type_relation->related_value.type = MONO_CONSTANT_SUMMARIZED_VALUE;
1408 type_relation->related_value.value.constant.value = range.lower;
1409 type_relation->relation_is_static_definition = TRUE;
1410 type_relation->next = area.relations [i].next;
1411 area.relations [i].next = type_relation;
1412 if (TRACE_ABC_REMOVAL) {
1413 printf ("[var%d >= %d]", i, range.lower);
1416 if (TRACE_ABC_REMOVAL) {
1417 printf ("Summarized variable %d: ", i);
1418 print_summarized_value (&(area.relations [i].related_value));
1423 MAKE_VALUE_ANY (area.relations [i].related_value);
1424 if (TRACE_ABC_REMOVAL) {
1425 printf ("Variable %d not handled (type %d)\n", i, cfg->varinfo [i]->inst_vtype->type);
1429 MAKE_VALUE_ANY (area.relations [i].related_value);
1430 if (TRACE_ABC_REMOVAL) {
1431 printf ("Definition of variable %d is not a proper store\n", i);
1435 MAKE_VALUE_ANY (area.relations [i].related_value);
1436 if (TRACE_ABC_REMOVAL) {
1437 printf ("Variable %d has no definition, probably it is an argument\n", i);
1441 for (i = 0; i < cfg->num_varinfo; i++) {
1442 if (area.relations [i].related_value.type == MONO_VARIABLE_SUMMARIZED_VALUE) {
1443 int related_index = cfg->num_varinfo + i;
1444 int related_variable = area.relations [i].related_value.value.variable.variable;
1446 area.relations [related_index].relation = MONO_EQ_RELATION;
1447 area.relations [related_index].relation_is_static_definition = TRUE;
1448 area.relations [related_index].related_value.type = MONO_VARIABLE_SUMMARIZED_VALUE;
1449 area.relations [related_index].related_value.value.variable.variable = i;
1450 area.relations [related_index].related_value.value.variable.delta = - area.relations [i].related_value.value.variable.delta;
1452 area.relations [related_index].next = area.relations [related_variable].next;
1453 area.relations [related_variable].next = &(area.relations [related_index]);
1455 if (TRACE_ABC_REMOVAL) {
1456 printf ("Added symmetric summarized value for variable variable %d (to %d): ", i, related_variable);
1457 print_summarized_value (&(area.relations [related_index].related_value));
1463 process_block (cfg->bblocks [0], &area);
1466 #endif /* DISABLE_SSA */