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
|
/*
* This file is part of Espruino, a JavaScript interpreter for Microcontrollers
*
* Copyright (C) 2013 Gordon Williams <[email protected]>
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* ----------------------------------------------------------------------------
* Misc utils and cheapskate stdlib implementation
* ----------------------------------------------------------------------------
*/
#include "jsutils.h"
#include "jslex.h"
#include "jshardware.h"
#include "jsinteractive.h"
// needed for isnan / isfinite
#ifdef ARM
#include "mconf.h"
#include "protos.h"
#else
#include <math.h>
#endif
extern double jswrap_math_pow(double x, double y); // for pow
bool isIDString(const char *s) {
if (!isAlpha(*s))
return false;
while (*s) {
if (!(isAlpha(*s) || isNumeric(*s)))
return false;
s++;
}
return true;
}
/** escape a character - if it is required. This may return a reference to a static array,
so you can't store the value it returns in a variable and call it again. */
const char *escapeCharacter(char ch) {
if (ch=='\b') return "\\b";
if (ch=='\f') return "\\f";
if (ch=='\n') return "\\n";
if (ch=='\a') return "\\a";
if (ch=='\r') return "\\r";
if (ch=='\t') return "\\t";
if (ch=='\\') return "\\\\";
if (ch=='"') return "\\\"";
static char buf[5];
if (ch<32) {
/** just encode as hex - it's more understandable
* and doesn't have the issue of "\16"+"1" != "\161" */
buf[0]='\\';
buf[1]='x';
int n = (ch>>4)&15;
buf[2] = (char)((n<10)?('0'+n):('A'+n-10));
n=ch&15;
buf[3] = (char)((n<10)?('0'+n):('A'+n-10));
buf[4] = 0;
return buf;
}
buf[1] = 0;
buf[0] = ch;
return buf;
}
/* convert a number in the given radix to an int. if radix=0, autodetect */
JsVarInt stringToIntWithRadix(const char *s, int forceRadix, bool *hasError) {
bool isNegated = false;
JsVarInt v = 0;
JsVarInt radix = 10;
if (*s == '-') {
isNegated = true;
s++;
}
if (*s == '0') {
radix = 8;
s++;
// OctalIntegerLiteral: 0o01, 0O01
if (*s == 'o' || *s == 'O') {
radix = 8;
s++;
// HexIntegerLiteral: 0x01, 0X01
} else if (*s == 'x' || *s == 'X') {
radix = 16;
s++;
// BinaryIntegerLiteral: 0b01, 0B01
} else if (*s == 'b' || *s == 'B') {
radix = 2;
s++;
}
}
if (forceRadix>0 && forceRadix<=36)
radix = forceRadix;
while (*s) {
int digit = 0;
if (*s >= '0' && *s <= '9')
digit = (*s - '0');
else if (*s >= 'a' && *s <= 'f')
digit = (10 + *s - 'a');
else if (*s >= 'A' && *s <= 'F')
digit = (10 + *s - 'A');
else break;
if (digit>=radix)
break;
v = v*radix + digit;
s++;
}
if (hasError) *hasError = *s!=0; // we're ok if we reached the end of the string
if (isNegated) return -v;
return v;
}
/* convert hex, binary, octal or decimal string into an int */
JsVarInt stringToInt(const char *s) {
return stringToIntWithRadix(s,0,0);
}
void jsError(const char *fmt, ...) {
jsiConsoleRemoveInputLine();
jsiConsolePrint("ERROR: ");
va_list argp;
va_start(argp, fmt);
vcbprintf((vcbprintf_callback)jsiConsolePrint,0, fmt, argp);
va_end(argp);
jsiConsolePrint("\n");
}
void jsErrorInternal(const char *fmt, ...) {
jsiConsoleRemoveInputLine();
jsiConsolePrint("INTERNAL ERROR: ");
va_list argp;
va_start(argp, fmt);
vcbprintf((vcbprintf_callback)jsiConsolePrint,0, fmt, argp);
va_end(argp);
jsiConsolePrint("\n");
}
void jsErrorAt(const char *message, struct JsLex *lex, int tokenPos) {
jsiConsoleRemoveInputLine();
jsiConsolePrint("ERROR: ");
jsiConsolePrint(message);
jsiConsolePrint(" at ");
jsiConsolePrintPosition(lex, tokenPos);
jsiConsolePrintTokenLineMarker(lex, tokenPos);
}
void jsWarn(const char *fmt, ...) {
jsiConsoleRemoveInputLine();
jsiConsolePrint("WARNING: ");
va_list argp;
va_start(argp, fmt);
vcbprintf((vcbprintf_callback)jsiConsolePrint,0, fmt, argp);
va_end(argp);
jsiConsolePrint("\n");
}
void jsWarnAt(const char *message, struct JsLex *lex, int tokenPos) {
jsiConsoleRemoveInputLine();
jsiConsolePrint("WARNING: ");
jsiConsolePrint(message);
jsiConsolePrint(" at ");
jsiConsolePrintPosition(lex, tokenPos);
}
void jsAssertFail(const char *file, int line, const char *expr) {
jsiConsoleRemoveInputLine();
if (expr) {
jsiConsolePrintf("ASSERT(%s) FAILED AT ", expr);
} else
jsiConsolePrint("ASSERT FAILED AT ");
jsiConsolePrintf("%s:%d\n",file,line);
jsvTrace(jsvGetRef(jsvFindOrCreateRoot()), 2);
exit(1);
}
#ifdef SDCC
void exit(int errcode) {dst;
jsiConsolePrint("EXIT CALLED.\n");
}
#endif
#ifdef FAKE_STDLIB
int __errno;
void exit(int errcode) {
NOT_USED(errcode);
jsiConsolePrint("EXIT CALLED.\n");
while (1);
}
char * strncat(char *dst, const char *src, size_t c) {
char *dstx = dst;
while (*(++dstx)) c--;
while (*src && c>1) {
*(dstx++) = *(src++);
c--;
}
if (c>0) *dstx = 0;
return dst;
}
char *strncpy(char *dst, const char *src, size_t c) {
char *dstx = dst;
while (*src && c>1) {
*(dstx++) = *(src++);
c--;
}
if (c>0) *dstx = 0;
return dst;
}
size_t strlen(const char *s) {
size_t l=0;
while (*(s++)) l++;
return l;
}
int strcmp(const char *a, const char *b) {
while (*a && *b) {
if (*a != *b)
return *a - *b; // correct?
a++;b++;
}
return *a - *b;
}
void *memcpy(void *dst, const void *src, size_t size) {
size_t i;
for (i=0;i<size;i++)
((char*)dst)[i] = ((char*)src)[i];
return dst;
}
void *memset(void *dst, int val, size_t size) {
unsigned char *d = (unsigned char*)dst;
unsigned int i;
for (i=0;i<size;i++)
d[i]=(unsigned char)val;
return dst;
}
unsigned int rand() {
static unsigned int m_w = 0xDEADBEEF; /* must not be zero */
static unsigned int m_z = 0xCAFEBABE; /* must not be zero */
m_z = 36969 * (m_z & 65535) + (m_z >> 16);
m_w = 18000 * (m_w & 65535) + (m_w >> 16);
return (m_z << 16) + m_w; /* 32-bit result */
}
#endif
JsVarFloat stringToFloat(const char *s) {
bool isNegated = false;
JsVarFloat v = 0;
JsVarFloat mul = 0.1;
if (*s == '-') {
isNegated = true;
s++;
}
// handle integer part
while (*s) {
if (*s >= '0' && *s <= '9')
v = (v*10) + (*s - '0');
else break;
s++;
}
// handle decimal point
if (*s == '.') {
s++; // skip .
while (*s) {
if (*s >= '0' && *s <= '9')
v += mul*(*s - '0');
else break;
mul /= 10;
s++;
}
}
// handle exponentials
if (*s == 'e' || *s == 'E') {
s++; // skip E
bool isENegated = false;
if (*s == '-' || *s == '+') {
isENegated = *s=='-';
s++;
}
int e = 0;
while (*s) {
if (*s >= '0' && *s <= '9')
e = (e*10) + (*s - '0');
else break;
s++;
}
if (isENegated) e=-e;
v = v * jswrap_math_pow(10, e);
}
// check we have parsed everything
if (*s!=0) return NAN;
if (isNegated) return -v;
return v;
}
char itoch(int val) {
if (val<10) return (char)('0'+val);
return (char)('A'+val-10);
}
#ifndef HAS_STDLIB
void itoa(JsVarInt vals,char *str,unsigned int base) {
JsVarIntUnsigned val;
if (vals<0) {
*(str++)='-';
val = (JsVarIntUnsigned)(-vals);
} else {
val = (JsVarIntUnsigned)vals;
}
JsVarIntUnsigned d = 1;
while (d*base <= val) d*=base;
while (d > 1) {
unsigned int v = (unsigned int)(val / d);
val -= v*d;
*(str++) = itoch((int)v);
d /= base;
}
*(str++)=itoch((int)val);
*(str++)=0;
}
#endif
void ftoa(JsVarFloat val,char *str) {
if (isnan(val)) strncpy(str,"NaN",4);
else if (!isfinite(val)) {
if (val<0) strncpy(str,"-Infinity",10);
else strncpy(str,"Infinity",10);
} else {
const JsVarFloat base = 10;
if (val<0) {
*(str++)='-';
val = -val;
}
JsVarFloat d = 1;
while (d*base <= val) d*=base;
while (d >= 1) {
int v = (int)(val / d);
val -= v*d;
*(str++)=itoch(v);
d /= base;
}
#ifndef USE_NO_FLOATS
if (val>0) {
*(str++)='.';
while (val>0.000001) {
int v = (int)((val / d) + 0.0000005);
val -= v*d;
*(str++)=itoch(v);
d /= base;
}
}
#endif
*(str++)=0;
}
}
/// Wrap a value so it is always between 0 and size (eg. wrapAround(angle, 360))
JsVarFloat wrapAround(JsVarFloat val, JsVarFloat size) {
val = val / size;
val = val - (int)val;
return val * size;
}
/** Espruino-special printf with a callback
* Supported are:
* %d = int
* %x = int as hex
* %L = JsVarInt
* %Lx = JsVarInt as hex
* %f = JsVarFloat
* %s = string (char *)
* %c = char
* %v = JsVar * (prints var as string)
* %t = JsVar * (prints type of var)
* %p = Pin
*
* Anything else will assert
*/
void vcbprintf(vcbprintf_callback user_callback, void *user_data, const char *fmt, va_list argp) {
char buf[32];
while (*fmt) {
if (*fmt == '%') {
fmt++;
switch (*fmt++) {
case 'd': itoa(va_arg(argp, int), buf, 10); user_callback(buf,user_data); break;
case 'x': itoa(va_arg(argp, int), buf, 16); user_callback(buf,user_data); break;
case 'L': {
unsigned int rad = 10;
if (*fmt=='x') { rad=16; fmt++; }
itoa(va_arg(argp, JsVarInt), buf, rad); user_callback(buf,user_data);
} break;
case 'f': ftoa(va_arg(argp, JsVarFloat), buf); user_callback(buf,user_data); break;
case 's': user_callback(va_arg(argp, char *), user_data); break;
case 'c': buf[0]=(char)va_arg(argp, int/*char*/);buf[1]=0; user_callback(buf, user_data); break;
case 'v': {
JsVar *v = jsvAsString(va_arg(argp, JsVar*), false/*no unlock*/);
buf[1] = 0;
JsvStringIterator it;
jsvStringIteratorNew(&it, v, 0);
// OPT: this could be faster than it is (sending whole blocks at once)
while (jsvStringIteratorHasChar(&it)) {
buf[0] = jsvStringIteratorGetChar(&it);
user_callback(buf,user_data);
jsvStringIteratorNext(&it);
}
jsvStringIteratorFree(&it);
jsvUnLock(v);
} break;
case 't': user_callback(jsvGetTypeOf(va_arg(argp, JsVar*)), user_data); break;
case 'p': jshGetPinString(buf, (Pin)va_arg(argp, int/*Pin*/)); user_callback(buf, user_data); break;
default: assert(0); return; // eep
}
} else {
buf[0] = *(fmt++);
buf[1] = 0;
user_callback(&buf[0], user_data);
}
}
}
|