13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
// ct_int type against a RTInteger type:
// return the RTInteger type. We don't care if the
// ct_int fits at this point, this will be dealt with by
// the ct_int value unification rule below.
e.unificationRuleSet()->addSymRule(
ValueToIRExpr( rtIntTypePattern ),
GetValueType< APSInt >(),
[]( const Term& lhs, const Term& rhs, UnificationContext& c ) -> UniGen
{
co_yield HalfUnify( lhs, c );
} );
// Reject the ct_int param and rtinteger arg pattern,
// so that it doesn't fall into the rule above which wouls be incorrect
// in that case.
e.unificationRuleSet()->addAsymRule(
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
GetValueType< APSInt >(),
ANYTERM( _ ) ) ),
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
ValueToIRExpr( rtIntTypePattern ),
ANYTERM( _ ) ) ),
|
|
|
|
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
// ct_int type against a RTInteger type:
// return the RTInteger type. We don't care if the
// ct_int fits at this point, this will be dealt with by
// the ct_int value unification rule below.
e.unificationRuleSet()->addSymRule(
ValueToIRExpr( rtIntTypePattern ),
GetValueType< BigInt >(),
[]( const Term& lhs, const Term& rhs, UnificationContext& c ) -> UniGen
{
co_yield HalfUnify( lhs, c );
} );
// Reject the ct_int param and rtinteger arg pattern,
// so that it doesn't fall into the rule above which wouls be incorrect
// in that case.
e.unificationRuleSet()->addAsymRule(
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
GetValueType< BigInt >(),
ANYTERM( _ ) ) ),
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
ValueToIRExpr( rtIntTypePattern ),
ANYTERM( _ ) ) ),
|
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
ValueToIRExpr( rtIntTypePattern ),
ANYTERM( _ ) ) ),
ValueToIRExpr( Value(
GetValueType< APSInt >(),
ANYTERM( _ ) ) ),
[]( const Term& lhs, const Term& rhs, UnificationContext& c ) -> UniGen
{
// Don't bother during the first pass, the rt integer type pattern
// is likely to contain unresolved holes.
if( !c.secondPass() )
{
co_yield { lhs, c };
co_return;
}
auto ct = FromValue< APSInt >( *ValueFromIRExpr( rhs ) );
if( !ct )
co_return;
auto lhsVal = ValuePatternFromIRExpr( lhs );
if( !lhsVal )
co_return;
auto rttypeVal = ValueFromIRExpr( lhsVal->type() );
if( !rttypeVal )
co_return;
auto rttype = FromValue< RTInteger >( *rttypeVal );
if( !rttype )
co_return;
APSInt valToLoad;
if( rttype->m_signed )
{
if( ct->getMinSignedBits() > rttype->m_numBits )
co_return;
if( ct->isNegative() )
valToLoad = ct->sext( rttype->m_numBits );
else
valToLoad = ct->zext( rttype->m_numBits );
|
|
|
|
<
|
<
<
|
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
ValueToIRExpr( ValuePattern(
ANYTERM( _ ),
ValueToIRExpr( rtIntTypePattern ),
ANYTERM( _ ) ) ),
ValueToIRExpr( Value(
GetValueType< BigInt >(),
ANYTERM( _ ) ) ),
[]( const Term& lhs, const Term& rhs, UnificationContext& c ) -> UniGen
{
// Don't bother during the first pass, the rt integer type pattern
// is likely to contain unresolved holes.
if( !c.secondPass() )
{
co_yield { lhs, c };
co_return;
}
auto ct = FromValue< BigInt >( *ValueFromIRExpr( rhs ) );
if( !ct )
co_return;
auto lhsVal = ValuePatternFromIRExpr( lhs );
if( !lhsVal )
co_return;
auto rttypeVal = ValueFromIRExpr( lhsVal->type() );
if( !rttypeVal )
co_return;
auto rttype = FromValue< RTInteger >( *rttypeVal );
if( !rttype )
co_return;
BigInt valToLoad;
if( rttype->m_signed )
{
if( ct->getMinSignedBits() > rttype->m_numBits )
co_return;
valToLoad = ct->sext( rttype->m_numBits );
}
else
{
if( ct->isNegative() )
co_return;
if( ct->getActiveBits() > rttype->m_numBits )
|