@@ -163,9 +163,7 @@ static exprt unpack_rec(
163
163
164
164
// / rewrite byte extraction from an array to byte extraction from a
165
165
// / concatenation of array index expressions
166
- exprt flatten_byte_extract (
167
- const byte_extract_exprt &src,
168
- const namespacet &ns)
166
+ exprt lower_byte_extract (const byte_extract_exprt &src, const namespacet &ns)
169
167
{
170
168
// General notes about endianness and the bit-vector conversion:
171
169
// A single byte with value 0b10001000 is stored (in irept) as
@@ -258,7 +256,7 @@ exprt flatten_byte_extract(
258
256
tmp.type ()=subtype;
259
257
tmp.offset ()=new_offset;
260
258
261
- array.copy_to_operands (flatten_byte_extract (tmp, ns));
259
+ array.copy_to_operands (lower_byte_extract (tmp, ns));
262
260
}
263
261
264
262
return simplify_expr (array, ns);
@@ -357,7 +355,7 @@ exprt flatten_byte_extract(
357
355
}
358
356
}
359
357
360
- exprt flatten_byte_update (
358
+ static exprt lower_byte_update (
361
359
const byte_update_exprt &src,
362
360
const namespacet &ns,
363
361
bool negative_offset)
@@ -427,7 +425,7 @@ exprt flatten_byte_update(
427
425
byte_extract_expr.op () = src.value ();
428
426
byte_extract_expr.offset ()=i_expr;
429
427
430
- new_value=flatten_byte_extract (byte_extract_expr, ns);
428
+ new_value=lower_byte_extract (byte_extract_expr, ns);
431
429
}
432
430
433
431
const plus_exprt where (src.offset (), i_expr);
@@ -499,7 +497,7 @@ exprt flatten_byte_update(
499
497
byte_extract_expr.op () = src.value ();
500
498
byte_extract_expr.offset ()=stored_value_offset;
501
499
502
- new_value=flatten_byte_extract (byte_extract_expr, ns);
500
+ new_value=lower_byte_extract (byte_extract_expr, ns);
503
501
}
504
502
505
503
// Where does the value we just extracted align in this cell?
@@ -528,7 +526,7 @@ exprt flatten_byte_update(
528
526
// Call recursively, the array is gone!
529
527
// The last parameter indicates that the
530
528
exprt flattened_byte_update_expr=
531
- flatten_byte_update (byte_update_expr, ns, is_last_cell);
529
+ lower_byte_update (byte_update_expr, ns, is_last_cell);
532
530
533
531
with_exprt with_expr (
534
532
result, cell_index, flattened_byte_update_expr);
@@ -622,11 +620,11 @@ exprt flatten_byte_update(
622
620
}
623
621
}
624
622
625
- exprt flatten_byte_update (
623
+ static exprt lower_byte_update (
626
624
const byte_update_exprt &src,
627
625
const namespacet &ns)
628
626
{
629
- return flatten_byte_update (src, ns, false );
627
+ return lower_byte_update (src, ns, false );
630
628
}
631
629
632
630
bool has_byte_operator (const exprt &src)
@@ -644,25 +642,23 @@ bool has_byte_operator(const exprt &src)
644
642
return false ;
645
643
}
646
644
647
- exprt flatten_byte_operators (
648
- const exprt &src,
649
- const namespacet &ns)
645
+ exprt lower_byte_operators (const exprt &src, const namespacet &ns)
650
646
{
651
647
exprt tmp=src;
652
648
653
649
// destroys any sharing, should use hash table
654
650
Forall_operands (it, tmp)
655
651
{
656
- exprt tmp=flatten_byte_operators (*it, ns);
652
+ exprt tmp=lower_byte_operators (*it, ns);
657
653
it->swap (tmp);
658
654
}
659
655
660
656
if (src.id ()==ID_byte_update_little_endian ||
661
657
src.id ()==ID_byte_update_big_endian)
662
- return flatten_byte_update (to_byte_update_expr (tmp), ns);
658
+ return lower_byte_update (to_byte_update_expr (tmp), ns);
663
659
else if (src.id ()==ID_byte_extract_little_endian ||
664
660
src.id ()==ID_byte_extract_big_endian)
665
- return flatten_byte_extract (to_byte_extract_expr (tmp), ns);
661
+ return lower_byte_extract (to_byte_extract_expr (tmp), ns);
666
662
else
667
663
return tmp;
668
664
}
0 commit comments