lmathlib.c « src - teliva - Fork of Lua 5.1 to encourage end-user programming

blob: 441fbf736c2be400f4bf68e71d4c4a2591e71f55 (plain) (tree)

74f8cd1

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
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-26 03:25:59 +0000

class="s">'\n" << end(); break; } } out << line.at(i); } // todo: some way to represent a file without a final newline out << '\n'; } return out.str(); } void construct_resources_object(const map<string, string>& contents) { int resources_data_address = allocate(SIZE(contents)*2 + /*array length*/1); int curr = resources_data_address + /*skip refcount and length*/2; for (map<string, string>::const_iterator p = contents.begin(); p != contents.end(); ++p) { put(Memory, curr, new_mu_text(p->first)); trace(9999, "mem") << "storing file name " << get(Memory, curr) << " in location " << curr << end(); put(Memory, get(Memory, curr), 1); trace(9999, "mem") << "storing refcount 1 in location " << get(Memory, curr) << end(); ++curr; put(Memory, curr, new_mu_text(p->second)); trace(9999, "mem") << "storing file contents " << get(Memory, curr) << " in location " << curr << end(); put(Memory, get(Memory, curr), 1); trace(9999, "mem") << "storing refcount 1 in location " << get(Memory, curr) << end(); ++curr; } curr = resources_data_address+/*skip refcount*/1; put(Memory, curr, SIZE(contents)); // size of array trace(9999, "mem") << "storing resources size " << get(Memory, curr) << " in location " << curr << end(); put(Memory, resources_data_address, 1); // initialize refcount trace(9999, "mem") << "storing refcount 1 in location " << resources_data_address << end(); // wrap the resources data in a 'resources' object int resources_address = allocate(size_of_resources()); curr = resources_address+/*skip refcount*/1; put(Memory, curr, resources_data_address); trace(9999, "mem") << "storing resources data address " << resources_data_address << " in location " << curr << end(); put(Memory, resources_address, 1); // initialize refcount trace(9999, "mem") << "storing refcount 1 in location " << resources_address << end(); // save in product put(Memory, RESOURCES, resources_address); trace(9999, "mem") << "storing resources address " << resources_address << " in location " << RESOURCES << end(); } int size_of_resources() { // memoize result if already computed static int result = 0; if (result) return result; assert(get(Type_ordinal, "resources")); type_tree* type = new type_tree("resources"); result = size_of(type)+/*refcount*/1; delete type; return result; } void skip_whitespace(istream& in) { while (true) { if (!has_data(in)) break; if (isspace(in.peek())) in.get(); else break; } }