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
|
/*
* %CopyrightBegin%
*
* Copyright Ericsson AB 2020-2023. 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%
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "sys.h"
#include "beam_load.h"
#include "erl_map.h"
#include "beam_transform_helpers.h"
typedef struct SortBeamOpArg {
Eterm term; /* Term to use for comparing */
BeamOpArg arg; /* Original data */
} SortBeamOpArg;
static int oparg_compare(BeamOpArg* a, BeamOpArg* b);
static int oparg_term_compare(SortBeamOpArg* a, SortBeamOpArg* b);
int
beam_load_safe_mul(UWord a, UWord b, UWord* resp)
{
Uint res = a * b;
*resp = res;
if (b == 0) {
return 1;
} else {
return (res / b) == a;
}
}
int
beam_load_map_key_sort(LoaderState* stp, BeamOpArg Size, BeamOpArg* Rest)
{
SortBeamOpArg* t;
unsigned size = Size.val;
unsigned i;
if (size == 2) {
return 1; /* Already sorted. */
}
t = (SortBeamOpArg *) erts_alloc(ERTS_ALC_T_TMP, size*sizeof(SortBeamOpArg));
/*
* Copy original data and sort keys to a temporary array.
*/
for (i = 0; i < size; i += 2) {
t[i].arg = Rest[i];
switch (Rest[i].type) {
case TAG_a:
t[i].term = Rest[i].val;
ASSERT(is_atom(t[i].term));
break;
case TAG_i:
t[i].term = make_small(Rest[i].val);
break;
case TAG_n:
t[i].term = NIL;
break;
case TAG_q:
t[i].term = beamfile_get_literal(&stp->beam, Rest[i].val);
break;
default:
/*
* Not a literal key. Not allowed. Only a single
* variable key is allowed in each map instruction.
*/
erts_free(ERTS_ALC_T_TMP, (void *) t);
return 0;
}
#ifdef DEBUG
t[i+1].term = THE_NON_VALUE;
#endif
t[i+1].arg = Rest[i+1];
}
/*
* Sort the temporary array.
*/
qsort((void *) t, size / 2, 2 * sizeof(SortBeamOpArg),
(int (*)(const void *, const void *)) oparg_term_compare);
/*
* Copy back the sorted, original data.
*/
for (i = 0; i < size; i++) {
Rest[i] = t[i].arg;
}
erts_free(ERTS_ALC_T_TMP, (void *) t);
return 1;
}
Eterm
beam_load_get_term(LoaderState* stp, BeamOpArg Key)
{
switch (Key.type) {
case TAG_a:
return Key.val;
case TAG_i:
return make_small(Key.val);
case TAG_n:
return NIL;
case TAG_q:
return beamfile_get_literal(&stp->beam, Key.val);
default:
return THE_NON_VALUE;
}
}
void
beam_load_sort_select_vals(BeamOpArg* base, size_t n)
{
qsort(base, n, 2 * sizeof(BeamOpArg),
(int (*)(const void *, const void *)) oparg_compare);
}
static int
oparg_compare(BeamOpArg* a, BeamOpArg* b)
{
if (a->val < b->val)
return -1;
else if (a->val == b->val)
return 0;
else
return 1;
}
static int
oparg_term_compare(SortBeamOpArg* a, SortBeamOpArg* b)
{
Sint res = erts_cmp_flatmap_keys(a->term, b->term);
if (res < 0) {
return -1;
} else if (res > 0) {
return 1;
}
return 0;
}
|
