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
|
/*
* %CopyrightBegin%
*
* Copyright Ericsson AB 1999-2013. 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%
*/
/*
* Operator BIFs.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "sys.h"
#include "erl_vm.h"
#include "global.h"
#include "erl_process.h"
#include "error.h"
#include "erl_driver.h"
#include "bif.h"
#include "big.h"
#include "dist.h"
#include "erl_version.h"
#include "erl_binary.h"
#include "erl_map.h"
BIF_RETTYPE and_2(BIF_ALIST_2)
{
if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_true)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_false)
BIF_RET(am_false);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_true)
BIF_RET(am_false);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_false)
BIF_RET(am_false);
BIF_ERROR(BIF_P, BADARG);
}
BIF_RETTYPE or_2(BIF_ALIST_2)
{
if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_true)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_false)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_true)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_false)
BIF_RET(am_false);
BIF_ERROR(BIF_P, BADARG);
}
BIF_RETTYPE xor_2(BIF_ALIST_2)
{
if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_true)
BIF_RET(am_false);
else if (BIF_ARG_1 == am_true && BIF_ARG_2 == am_false)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_true)
BIF_RET(am_true);
else if (BIF_ARG_1 == am_false && BIF_ARG_2 == am_false)
BIF_RET(am_false);
BIF_ERROR(BIF_P, BADARG);
}
BIF_RETTYPE not_1(BIF_ALIST_1)
{
if (BIF_ARG_1 == am_true)
BIF_RET(am_false);
else if (BIF_ARG_1 == am_false)
BIF_RET(am_true);
BIF_ERROR(BIF_P, BADARG);
}
BIF_RETTYPE sgt_2(BIF_ALIST_2)
{
BIF_RET(cmp_gt(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE sge_2(BIF_ALIST_2)
{
BIF_RET(cmp_ge(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE slt_2(BIF_ALIST_2)
{
BIF_RET(cmp_lt(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE sle_2(BIF_ALIST_2)
{
BIF_RET(cmp_le(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE seq_2(BIF_ALIST_2)
{
BIF_RET(eq(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE seqeq_2(BIF_ALIST_2)
{
BIF_RET(cmp_eq(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE sneq_2(BIF_ALIST_2)
{
BIF_RET(eq(BIF_ARG_1, BIF_ARG_2) ? am_false : am_true);
}
BIF_RETTYPE sneqeq_2(BIF_ALIST_2)
{
BIF_RET(cmp_ne(BIF_ARG_1, BIF_ARG_2) ? am_true : am_false);
}
BIF_RETTYPE is_atom_1(BIF_ALIST_1)
{
if (is_atom(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_float_1(BIF_ALIST_1)
{
if (is_float(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_integer_1(BIF_ALIST_1)
{
if (is_integer(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_list_1(BIF_ALIST_1)
{
if (is_list(BIF_ARG_1) || is_nil(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_number_1(BIF_ALIST_1)
{
if (is_number(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_pid_1(BIF_ALIST_1)
{
if (is_pid(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_port_1(BIF_ALIST_1)
{
if (is_port(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_reference_1(BIF_ALIST_1)
{
if (is_ref(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_tuple_1(BIF_ALIST_1)
{
if (is_tuple(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_binary_1(BIF_ALIST_1)
{
if (is_binary(BIF_ARG_1) && binary_bitsize(BIF_ARG_1) == 0) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_bitstring_1(BIF_ALIST_1)
{
if (is_binary(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_function_1(BIF_ALIST_1)
{
if (is_any_fun(BIF_ARG_1)) {
BIF_RET(am_true);
} else {
BIF_RET(am_false);
}
}
BIF_RETTYPE is_function_2(BIF_ALIST_2)
{
BIF_RET(erl_is_function(BIF_P, BIF_ARG_1, BIF_ARG_2));
}
Eterm erl_is_function(Process* p, Eterm arg1, Eterm arg2)
{
Sint arity;
/*
* Verify argument 2 (arity); arity must be >= 0.
*/
if (is_small(arg2)) {
arity = signed_val(arg2);
if (arity < 0) {
error:
BIF_ERROR(p, BADARG);
}
} else if (is_big(arg2) && !bignum_header_is_neg(*big_val(arg2))) {
/* A positive bignum is OK, but can't possibly match. */
arity = -1;
} else {
/* Everything else (including negative bignum) is an error. */
goto error;
}
if (is_fun(arg1)) {
ErlFunThing* funp = (ErlFunThing *) fun_val(arg1);
if (funp->arity == (Uint) arity) {
BIF_RET(am_true);
}
} else if (is_export(arg1)) {
Export* exp = (Export *) EXPAND_POINTER((export_val(arg1))[1]);
if (exp->code[2] == (Uint) arity) {
BIF_RET(am_true);
}
}
BIF_RET(am_false);
}
BIF_RETTYPE is_boolean_1(BIF_ALIST_1)
{
if (BIF_ARG_1 == am_true || BIF_ARG_1 == am_false) {
BIF_RET(am_true);
} else {
BIF_RET(am_false);
}
}
/*
* The compiler usually translates calls to is_record/2 to more primitive
* operations. In some cases this is not possible. We'll need to implement
* a weak version of is_record/2 as BIF (the size of the record cannot
* be verified).
*/
BIF_RETTYPE is_record_2(BIF_ALIST_2)
{
Eterm *t;
if (is_not_atom(BIF_ARG_2)) {
BIF_ERROR(BIF_P, BADARG);
}
if (is_tuple(BIF_ARG_1) &&
arityval(*(t = tuple_val(BIF_ARG_1))) >= 1 &&
t[1] == BIF_ARG_2) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
/*
* Record test cannot actually be a bif. The epp processor is involved in
* the real guard test, we have to add one more parameter, the
* return value of record_info(size, Rec), which is the arity of the TUPLE.
* his may seem awkward when applied from the shell, where the plain
* tuple test is more understandable, I think...
*/
BIF_RETTYPE is_record_3(BIF_ALIST_3)
{
Eterm *t;
if (is_not_atom(BIF_ARG_2) || is_not_small(BIF_ARG_3)) {
BIF_ERROR(BIF_P, BADARG);
}
if (is_tuple(BIF_ARG_1) &&
arityval(*(t = tuple_val(BIF_ARG_1))) == signed_val(BIF_ARG_3)
&& t[1] == BIF_ARG_2) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
BIF_RETTYPE is_map_1(BIF_ALIST_1)
{
if (is_map(BIF_ARG_1) || is_hashmap(BIF_ARG_1)) {
BIF_RET(am_true);
}
BIF_RET(am_false);
}
|
