1
2
3
4
5
6
7
8
9
10
11
12
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
41
42
43
44
45
46
47
48
49
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
// -*- c -*-
//
// %CopyrightBegin%
//
// Copyright Ericsson AB 2017. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// %CopyrightEnd%
//
//
// Use if there is a garbage collection before storing to a
// general destination (either X or Y register).
//
REFRESH_GEN_DEST() {
dst_ptr = REG_TARGET_PTR(dst);
}
SET_I_REL(Offset) {
ASSERT(VALID_INSTR(*(I + ($Offset))));
I += $Offset;
}
SET_CP_I_ABS(Target) {
c_p->i = $Target;
ASSERT(VALID_INSTR(*c_p->i));
}
SET_REL_I(Dst, Offset) {
$Dst = I + ($Offset);
ASSERT(VALID_INSTR(*$Dst));
}
FAIL(Fail) {
//| -no_prefetch
$SET_I_REL($Fail);
Goto(*I);
}
JUMP(Fail) {
//| -no_next
$SET_I_REL($Fail);
Goto(*I);
}
GC_TEST(Ns, Nh, Live) {
Uint need = $Nh + $Ns;
if (ERTS_UNLIKELY(E - HTOP < need)) {
SWAPOUT;
PROCESS_MAIN_CHK_LOCKS(c_p);
FCALLS -= erts_garbage_collect_nobump(c_p, need, reg, $Live, FCALLS);
ERTS_VERIFY_UNUSED_TEMP_ALLOC(c_p);
PROCESS_MAIN_CHK_LOCKS(c_p);
SWAPIN;
}
HEAP_SPACE_VERIFIED($Nh);
}
GC_TEST_PRESERVE(NeedHeap, Live, PreserveTerm) {
Uint need = $NeedHeap;
if (ERTS_UNLIKELY(E - HTOP < need)) {
SWAPOUT;
reg[$Live] = $PreserveTerm;
PROCESS_MAIN_CHK_LOCKS(c_p);
FCALLS -= erts_garbage_collect_nobump(c_p, need, reg, $Live+1, FCALLS);
ERTS_VERIFY_UNUSED_TEMP_ALLOC(c_p);
PROCESS_MAIN_CHK_LOCKS(c_p);
$PreserveTerm = reg[$Live];
SWAPIN;
}
HEAP_SPACE_VERIFIED($Nh);
}
// Make sure that there are NeedStack + NeedHeap + 1 words available
// on the combined heap/stack segment, then allocates NeedHeap + 1
// words on the stack and saves CP.
AH(NeedStack, NeedHeap, Live) {
unsigned needed = $NeedStack + 1;
$GC_TEST(needed, $NeedHeap, $Live);
E -= needed;
*E = make_cp(c_p->cp);
c_p->cp = 0;
}
NEXT0() {
//| -no_next
SET_I((BeamInstr *) $NEXT_INSTRUCTION);
Goto(*I);
}
NEXT(Addr) {
//| -no_next
SET_I((BeamInstr *) $Addr);
Goto(*I);
}
FAIL_BODY() {
//| -no_prefetch
goto find_func_info;
}
FAIL_HEAD_OR_BODY(Fail) {
//| -no_prefetch
/*
* In a correctly working program, we expect failures in
* guards to be more likely than failures in bodies.
*/
if (ERTS_LIKELY($Fail)) {
$FAIL($Fail);
}
goto find_func_info;
}
BADARG(Fail) {
c_p->freason = BADARG;
$FAIL_HEAD_OR_BODY($Fail);
}
BADARITH0() {
c_p->freason = BADARITH;
goto find_func_info;
}
SYSTEM_LIMIT(Fail) {
c_p->freason = SYSTEM_LIMIT;
$FAIL_HEAD_OR_BODY($Fail);
}
BIF_ERROR_ARITY_1(Fail, BIF, Op1) {
//| -no_prefetch
if (ERTS_LIKELY($Fail)) {
$FAIL($Fail);
}
reg[0] = $Op1;
SWAPOUT;
I = handle_error(c_p, I, reg, &bif_export[$BIF]->info.mfa);
goto post_error_handling;
}
BIF_ERROR_ARITY_2(Fail, BIF, Op1, Op2) {
//| -no_prefetch
if (ERTS_LIKELY($Fail)) {
$FAIL($Fail);
}
reg[0] = $Op1;
reg[1] = $Op2;
SWAPOUT;
I = handle_error(c_p, I, reg, &bif_export[$BIF]->info.mfa);
goto post_error_handling;
}
|
