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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2012-2020. 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%
%%
%% Purpose: Run right before beam_asm to do any final fix-ups or clean-ups.
%% (Mandatory.)
-module(beam_z).
-export([module/2]).
-import(lists, [dropwhile/2,sort/1]).
-spec module(beam_utils:module_code(), [compile:option()]) ->
{'ok',beam_asm:module_code()}.
module({Mod,Exp,Attr,Fs0,Lc}, Opts) ->
NoInitYregs = proplists:get_bool(no_init_yregs, Opts),
Fs = [function(F, NoInitYregs) || F <- Fs0],
{ok,{Mod,Exp,Attr,Fs,Lc}}.
function({function,Name,Arity,CLabel,Is0}, NoInitYregs) ->
try
Is1 = undo_renames(Is0),
Is2 = maybe_eliminate_init_yregs(Is1, NoInitYregs),
Is = remove_redundant_lines(Is2),
{function,Name,Arity,CLabel,Is}
catch
Class:Error:Stack ->
io:fwrite("Function: ~w/~w\n", [Name,Arity]),
erlang:raise(Class, Error, Stack)
end.
undo_renames([{call_ext,2,send}|Is]) ->
[send|undo_renames(Is)];
undo_renames([{apply,A},{deallocate,N},return|Is]) ->
[{apply_last,A,N}|undo_renames(Is)];
undo_renames([{call,A,F},{'%',{var_info,{x,0},_}},{deallocate,N},return|Is]) ->
%% We've removed a redundant move of a literal to {x,0}.
[{call_last,A,F,N} | undo_renames(Is)];
undo_renames([{call,A,F},{deallocate,N},return|Is]) ->
[{call_last,A,F,N} | undo_renames(Is)];
undo_renames([{call_ext,A,F},{'%',{var_info,{x,0},_}},{deallocate,N},return|Is]) ->
[{call_ext_last,A,F,N} | undo_renames(Is)];
undo_renames([{call_ext,A,F},{deallocate,N},return|Is]) ->
[{call_ext_last,A,F,N} | undo_renames(Is)];
undo_renames([{call,A,F},{'%',{var_info,{x,0},_}},return|Is]) ->
[{call_only,A,F} | undo_renames(Is)];
undo_renames([{call,A,F},return|Is]) ->
[{call_only,A,F}|undo_renames(Is)];
undo_renames([{call_ext,A,F},{'%',{var_info,{x,0},_}},return|Is]) ->
[{call_ext_only,A,F} | undo_renames(Is)];
undo_renames([{call_ext,A,F},return|Is]) ->
[{call_ext_only,A,F}|undo_renames(Is)];
undo_renames([{bif,raise,_,_,_}=I|Is0]) ->
%% A minor optimization. Done here because:
%% (1) beam_jump may move or share 'raise' instructions, and that
%% may confuse beam_validator.
%% (2) beam_trim cannot do its optimization if the 'deallocate'
%% instruction after 'raise' has been removed.
Is = dropwhile(fun({label,_}) -> false;
(_) -> true
end, Is0),
[I|undo_renames(Is)];
undo_renames([{get_hd,Src,Hd},{get_tl,Src,Tl}|Is]) ->
get_list(Src, Hd, Tl, Is);
undo_renames([{get_tl,Src,Tl},{get_hd,Src,Hd}|Is]) ->
get_list(Src, Hd, Tl, Is);
undo_renames([{bs_put,_,{bs_put_binary,1,_},
[{atom,all},{literal,<<>>}]}|Is]) ->
undo_renames(Is);
undo_renames([{bs_put,Fail,{bs_put_binary,1,_Flags},
[{atom,all},{literal,BinString}]}|Is0])
when is_bitstring(BinString)->
Bits = bit_size(BinString),
Bytes = Bits div 8,
case Bits rem 8 of
0 ->
I = {bs_put_string,byte_size(BinString),
{string,BinString}},
[undo_rename(I)|undo_renames(Is0)];
Rem ->
<<Binary:Bytes/bytes,Int:Rem>> = BinString,
PutInt = {bs_put_integer,Fail,{integer,Rem},1,
{field_flags,[unsigned,big]},{integer,Int}},
Is = [PutInt|undo_renames(Is0)],
case Binary of
<<>> ->
Is;
_ ->
[{bs_put_string,byte_size(Binary),
{string,Binary}}|Is]
end
end;
undo_renames([I|Is]) ->
[undo_rename(I)|undo_renames(Is)];
undo_renames([]) -> [].
get_list(Src, Hd, Tl, [{swap,R1,R2}|Is]=Is0) ->
case sort([Hd,Tl]) =:= sort([R1,R2]) of
true ->
[{get_list,Src,Tl,Hd}|undo_renames(Is)];
false ->
[{get_list,Src,Hd,Tl}|undo_renames(Is0)]
end;
get_list(Src, Hd, Tl, Is) ->
[{get_list,Src,Hd,Tl}|undo_renames(Is)].
undo_rename({bs_put,F,{I,U,Fl},[Sz,Src]}) ->
{I,F,Sz,U,Fl,Src};
undo_rename({bs_put,F,{I,Fl},[Src]}) ->
{I,F,Fl,Src};
undo_rename({bif,bs_add=I,F,[Src1,Src2,{integer,U}],Dst}) ->
{I,F,[Src1,Src2,U],Dst};
undo_rename({bif,bs_utf8_size=I,F,[Src],Dst}) ->
{I,F,Src,Dst};
undo_rename({bif,bs_utf16_size=I,F,[Src],Dst}) ->
{I,F,Src,Dst};
undo_rename({bs_init,F,{I,U,Flags},none,[Sz,Src],Dst}) ->
{I,F,Sz,U,Src,Flags,Dst};
undo_rename({bs_init,F,{I,Extra,Flags},Live,[Sz],Dst}) ->
{I,F,Sz,Extra,Live,Flags,Dst};
undo_rename({bs_init,F,{I,Extra,U,Flags},Live,[Sz,Src],Dst}) ->
{I,F,Sz,Extra,Live,U,Src,Flags,Dst};
undo_rename({bs_init,_,bs_init_writable=I,_,_,_}) ->
I;
undo_rename({put_map,Fail,assoc,S,D,R,L}) ->
{put_map_assoc,Fail,S,D,R,L};
undo_rename({put_map,Fail,exact,S,D,R,L}) ->
{put_map_exact,Fail,S,D,R,L};
undo_rename({test,has_map_fields,Fail,[Src|List]}) ->
{test,has_map_fields,Fail,Src,{list,List}};
undo_rename({get_map_elements,Fail,Src,{list,List}}) ->
{get_map_elements,Fail,Src,{list,List}};
undo_rename({test,is_eq_exact,Fail,[Src,nil]}) ->
{test,is_nil,Fail,[Src]};
undo_rename({select,I,Reg,Fail,List}) ->
{I,Reg,Fail,{list,List}};
undo_rename(I) -> I.
%%%
%%% Eliminate the init_yreg/1 instruction if requested by
%%% the no_init_yregs option.
%%%
maybe_eliminate_init_yregs(Is, true) ->
eliminate_init_yregs(Is);
maybe_eliminate_init_yregs(Is, false) -> Is.
eliminate_init_yregs([{allocate,Ns,Live},{init_yregs,_}|Is]) ->
[{allocate_zero,Ns,Live}|eliminate_init_yregs(Is)];
eliminate_init_yregs([{allocate_heap,Ns,Nh,Live},{init_yregs,_}|Is]) ->
[{allocate_heap_zero,Ns,Nh,Live}|eliminate_init_yregs(Is)];
eliminate_init_yregs([{init_yregs,{list,Yregs}}|Is]) ->
Inits = [{init,Y} || Y <- Yregs],
Inits ++ eliminate_init_yregs(Is);
eliminate_init_yregs([I|Is]) ->
[I|eliminate_init_yregs(Is)];
eliminate_init_yregs([]) -> [].
%% Remove all `line` instructions having the same location as the
%% previous `line` instruction. It turns out that such redundant
%% `line` instructions are quite common. Removing them decreases the
%% size of the BEAM files, but not size of the loaded code since the
%% loader already removes such redundant `line` instructions.
remove_redundant_lines(Is) ->
remove_redundant_lines_1(Is, none).
remove_redundant_lines_1([{line,Loc}=I|Is], PrevLoc) ->
if
Loc =:= PrevLoc ->
remove_redundant_lines_1(Is, Loc);
true ->
[I|remove_redundant_lines_1(Is, Loc)]
end;
remove_redundant_lines_1([I|Is], PrevLoc) ->
[I|remove_redundant_lines_1(Is, PrevLoc)];
remove_redundant_lines_1([], _) -> [].
|
