aboutsummaryrefslogtreecommitdiffstats
path: root/lib/compiler/src/genop.tab
blob: ebc9b1c85b7381574c1b110f5e9e3123a957f4aa (plain) (blame)
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
#
# %CopyrightBegin%
#
# Copyright Ericsson AB 1998-2011. All Rights Reserved.
#
# The contents of this file are subject to the Erlang Public License,
# Version 1.1, (the "License"); you may not use this file except in
# compliance with the License. You should have received a copy of the
# Erlang Public License along with this software. If not, it can be
# retrieved online at http://www.erlang.org/.
#
# Software distributed under the License is distributed on an "AS IS"
# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
# the License for the specific language governing rights and limitations
# under the License.
#
# %CopyrightEnd%
#
BEAM_FORMAT_NUMBER=0

#
# Generic instructions, generated by the compiler.  If any of them change number,
# arity or semantics, the format number above must be bumped.
#

## @spec label Lbl
## @doc Specify a module local label.
##      Label gives this code address a name (Lbl) and marks the start of
##      a basic block.
1: label/1

## @spec func_info M F A
## @doc Define a function M:F/A
2: func_info/3

3: int_code_end/0

#
# Function and BIF calls.
#

## @spec call Arity Label
## @doc Call the function at Label.
##      Save the next instruction as the return address in the CP register.
4: call/2

## @spec call_last Arity Label Dellocate
## @doc Deallocate and do a tail recursive call to the function at Label.
##      Do not update the CP register.
##      Before the call deallocate Deallocate words of stack.
5: call_last/3

## @spec call_only Arity Label
## @doc Do a tail recursive call to the function at Label.
##      Do not update the CP register.
6: call_only/2

## @spec call_ext Arity Destination
## @doc Call the function of arity Arity pointed to by Destination.
##      Save the next instruction as the return address in the CP register.
7: call_ext/2

## @spec call_ext_last Arity Destination Deallocate
## @doc Deallocate and do a tail call to function of arity Arity
##      pointed to by Destination.
##      Do not update the CP register.
##      Deallocate Deallocate words from the stack before the call.
8: call_ext_last/3

## @spec bif0 Bif Reg
## @doc Call the bif Bif and store the result in Reg.
9: bif0/2

## @spec bif1 Lbl Bif Arg Reg
## @doc Call the bif Bif with the argument Arg, and store the result in Reg.
##      On failure jump to Lbl.
10: bif1/4

## @spec bif2 Lbl Bif Arg1 Arg2 Reg
## @doc Call the bif Bif with the arguments Arg1 and Arg2,
##      and store the result in Reg.
##      On failure jump to Lbl.
11: bif2/5

#
# Allocating, deallocating and returning.
#

## @spec allocate StackNeed Live
## @doc Allocate space for StackNeed words on the stack. If a GC is needed
##      during allocation there are Live number of live X registers.
##      Also save the continuation pointer (CP) on the stack.
12: allocate/2

## @spec allocate_heap StackNeed HeapNeed Live
## @doc Allocate space for StackNeed words on the stack and ensure there is
##      space for HeapNeed words on the heap. If a GC is needed
##      save Live number of X registers.
##      Also save the continuation pointer (CP) on the stack.
13: allocate_heap/3

## @spec allocate_zero StackNeed Live
## @doc Allocate space for StackNeed words on the stack. If a GC is needed
##      during allocation there are Live number of live X registers.
##      Clear the new stack words. (By writing NIL.)
##      Also save the continuation pointer (CP) on the stack.
14: allocate_zero/2

## @spec allocate_heap_zero StackNeed HeapNeed Live
## @doc Allocate space for StackNeed words on the stack and HeapNeed words
##      on the heap. If a GC is needed
##      during allocation there are Live number of live X registers.
##      Clear the new stack words. (By writing NIL.)
##      Also save the continuation pointer (CP) on the stack.
15: allocate_heap_zero/3

## @spec test_heap HeapNeed Live
## @doc Ensure there is space for HeapNeed words on the heap. If a GC is needed
##      save Live number of X registers.
16: test_heap/2

## @spec init N
## @doc  Clear the Nth stack word. (By writing NIL.)
17: init/1

## @spec deallocate N
## @doc  Restore the continuation pointer (CP) from the stack and deallocate
##       N+1 words from the stack (the + 1 is for the CP).
18: deallocate/1

## @spec return
## @doc  Return to the address in the continuation pointer (CP).
19: return/0

#
# Sending & receiving.
#
## @spec send
## @doc  Send argument in x(0) as a message to the destination process in x(0).
##       The message in x(1) ends up as the result of the send in x(0).
20: send/0

## @spec remove_message
## @doc  Unlink the current message from the message queue and store a
##       pointer to the message in x(0). Remove any timeout.
21: remove_message/0

## @spec timeout
## @doc  Reset the save point of the mailbox and clear the timeout flag.
22: timeout/0

## @spec loop_rec Label Source
## @doc  Loop over the message queue, if it is empty jump to Label.
23: loop_rec/2

## @spec loop_rec_end Label
## @doc  Advance the save pointer to the next message and jump back to Label.
24: loop_rec_end/1

## @spec wait Label
## @doc  Suspend the processes and set the entry point to the beginning of the
##       receive loop at Label.
25: wait/1

## @spec wait_timeout Lable Time
## @doc  Sets up a timeout of Time milllisecons and saves the address of the
##       following instruction as the entry point if the timeout triggers.
26: wait_timeout/2

#
# Arithmethic opcodes.
#
27: -m_plus/4
28: -m_minus/4
29: -m_times/4
30: -m_div/4
31: -int_div/4
32: -int_rem/4
33: -int_band/4
34: -int_bor/4
35: -int_bxor/4
36: -int_bsl/4
37: -int_bsr/4
38: -int_bnot/3

#
# Comparision operators.
#

## @spec is_lt Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is not less than Arg2.
39: is_lt/3

## @spec is_ge Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is less than Arg2.
40: is_ge/3

## @spec is_eq Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is not (numerically) equal to Arg2.
41: is_eq/3

## @spec is_ne Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is (numerically) equal to Arg2.
42: is_ne/3

## @spec is_eq_exact Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is not exactly equal to Arg2.
43: is_eq_exact/3

## @spec is_ne_exact Lbl Arg1 Arg2
## @doc Compare two terms and jump to Lbl if Arg1 is exactly equal to Arg2.
44: is_ne_exact/3

#
# Type tests.
#

## @spec is_integer Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not an integer.
45: is_integer/2

## @spec is_float Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a float.
46: is_float/2

## @spec is_number Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a number.
47: is_number/2

## @spec is_atom Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not an atom.
48: is_atom/2

## @spec is_pid Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a pid.
49: is_pid/2

## @spec is_reference Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a reference.
50: is_reference/2

## @spec is_port Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a port.
51: is_port/2

## @spec is_nil Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not nil.
52: is_nil/2

## @spec is_binary Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a binary.
53: is_binary/2

54: -is_constant/2

## @spec is_list Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a cons or nil.
55: is_list/2

## @spec is_nonempty_list Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a cons.
56: is_nonempty_list/2

## @spec is_tuple Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a tuple.
57: is_tuple/2

## @spec test_arity Lbl Arg1 Arity
## @doc Test the arity of (the tuple in) Arg1 and jump
## to Lbl if it is not equal to Arity.
58: test_arity/3

#
# Indexing & jumping.
#

## @spec select_val Arg FailLabel Destinations
## @doc Jump to the destination label corresponding to Arg
##      in the Destinations list, if no arity matches, jump to FailLabel.
59: select_val/3

## @spec select_tuple_arity Tuple FailLabel Destinations
## @doc Check the arity of the tuple Tuple and jump to the corresponding
##      destination label, if no arity matches, jump to FailLabel.
60: select_tuple_arity/3

## @spec jump Label
## @doc Jump to Label.
61: jump/1

#
# Catch.
#
62: catch/2
63: catch_end/1

#
# Moving, extracting, modifying.
#

## @spec move Source Destination
## @doc Move the source Source (a literal or a register) to
##      the destination register Destination.
64: move/2

## @spec get_list  Source Head Tail
## @doc  Get the head and tail (or car and cdr) parts of a list
##       (a cons cell) from Source and put them into the registers
##       Head and Tail.
65: get_list/3

## @spec get_tuple_element Source Element Destination
## @doc  Get element number Element from the tuple in Source and put
##       it in the destination register Destination.
66: get_tuple_element/3

## @spec set_tuple_element NewElement Tuple Position
## @doc  Update the element at postition Position of the tuple Tuple
##       with the new element NewElement.
67: set_tuple_element/3

#
# Building terms.
#
68: -put_string/3
69: put_list/3
70: put_tuple/2
71: put/1

#
# Raising errors.
#
72: badmatch/1
73: if_end/0
74: case_end/1

#
# 'fun' support.
#
## @spec call_fun Arity
## @doc Call a fun of arity Arity. Assume arguments in
##      registers x(0) to x(Arity-1) and that the fun is in x(Arity).
##      Save the next instruction as the return address in the CP register.
75: call_fun/1

76: -make_fun/3

## @spec is_function Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a
##      function (i.e. fun or closure).
77: is_function/2

#
# Late additions to R5.
#

## @spec call_ext_only Arity Label
##      Do a tail recursive call to the function at Label.
##      Do not update the CP register.
78: call_ext_only/2

#
# Binary matching (R7).
#
79: -bs_start_match/2
80: -bs_get_integer/5
81: -bs_get_float/5
82: -bs_get_binary/5
83: -bs_skip_bits/4
84: -bs_test_tail/2
85: -bs_save/1
86: -bs_restore/1

#
# Binary construction (R7A).
#
87: -bs_init/2
88: -bs_final/2
89: bs_put_integer/5
90: bs_put_binary/5
91: bs_put_float/5
92: bs_put_string/2

#
# Binary construction (R7B).
#
93: -bs_need_buf/1

#
# Floating point arithmetic (R8).
#
94: fclearerror/0
95: fcheckerror/1
96: fmove/2
97: fconv/2
98: fadd/4
99: fsub/4
100: fmul/4
101: fdiv/4
102: fnegate/3

# New fun construction (R8).
103: make_fun2/1

# Try/catch/raise (R10B).
104: try/2
105: try_end/1
106: try_case/1
107: try_case_end/1
108: raise/2

# New instructions in R10B.
109: bs_init2/6
110: -bs_bits_to_bytes/3
111: bs_add/5
112: apply/1
113: apply_last/2
## @spec is_boolean Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a Boolean.
114: is_boolean/2

# New instructions in R10B-6.
## @spec is_function2 Lbl Arg1 Arity
## @doc Test the type of Arg1 and jump to Lbl if it is not a
##      function of arity Arity.
115: is_function2/3

# New bit syntax matching in R11B.

116: bs_start_match2/5
117: bs_get_integer2/7
118: bs_get_float2/7
119: bs_get_binary2/7
120: bs_skip_bits2/5
121: bs_test_tail2/3
122: bs_save2/2
123: bs_restore2/2

# New GC bifs introduced in R11B.

## @spec gc_bif1 Lbl Live Bif Arg Reg
## @doc Call the bif Bif with the argument Arg, and store the result in Reg.
##      On failure jump to Lbl.
##      Do a garbage collection if necessary to allocate space on the heap
##      for the result (saving Live number of X registers).
124: gc_bif1/5

## @spec gc_bif2 Lbl Live Bif Arg1 Arg2 Reg
## @doc Call the bif Bif with the arguments Arg1 and Arg2,
##      and store the result in Reg.
##      On failure jump to Lbl.
##      Do a garbage collection if necessary to allocate space on the heap
##      for the result (saving Live number of X registers).
125: gc_bif2/6

# Experimental new bit_level bifs introduced in R11B.
# NOT used in R12B.
126: -bs_final2/2
127: -bs_bits_to_bytes2/2

# R11B-4
128: -put_literal/2

# R11B-5
## @spec is_bitstr Lbl Arg1
## @doc Test the type of Arg1 and jump to Lbl if it is not a bit string.
129: is_bitstr/2

# R12B
130: bs_context_to_binary/1
131: bs_test_unit/3
132: bs_match_string/4
133: bs_init_writable/0
134: bs_append/8
135: bs_private_append/6

## @spec trim N Remaining
## @doc Reduce the stack usage by N words,
##      keeping the CP on the top of the stack.
136: trim/2

137: bs_init_bits/6

# R12B-5
138: bs_get_utf8/5
139: bs_skip_utf8/4

140: bs_get_utf16/5
141: bs_skip_utf16/4

142: bs_get_utf32/5
143: bs_skip_utf32/4

144: bs_utf8_size/3
145: bs_put_utf8/3

146: bs_utf16_size/3
147: bs_put_utf16/3

148: bs_put_utf32/3

# R13B03

149: on_load/0

# R14A

## @spec recv_mark Label
## @doc  Save the end of the message queue and the address of
##       the label Label so that a recv_set instruction can start
##       scanning the inbox from this position.
150: recv_mark/1

## @spec recv_set Label
## @doc Check that the saved mark points to Label and set the
##      save pointer in the message queue to the last position
##      of the message queue saved by the recv_mark instruction.
151: recv_set/1

## @spec gc_bif3 Lbl Live Bif Arg1 Arg2 Arg3 Reg
## @doc Call the bif Bif with the arguments Arg1, Arg2 and Arg3,
##      and store the result in Reg.
##      On failure jump to Lbl.
##      Do a garbage collection if necessary to allocate space on the heap
##      for the result (saving Live number of X registers).
152: gc_bif3/7

# R15A

153: line/1