forked from svaarala/duktape
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathduk_api_string.c
245 lines (196 loc) · 6.49 KB
/
duk_api_string.c
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
/*
* String manipulation
*/
#include "duk_internal.h"
static void concat_and_join_helper(duk_context *ctx, int count, int is_join) {
duk_hthread *thr = (duk_hthread *) ctx;
unsigned int i;
unsigned int idx;
size_t len;
duk_hstring *h;
duk_uint8_t *buf;
DUK_ASSERT(ctx != NULL);
if (count <= 0) {
duk_push_hstring_stridx(ctx, DUK_STRIDX_EMPTY_STRING);
return;
}
if (is_join) {
size_t t1, t2, limit;
h = duk_to_hstring(ctx, -count-1);
DUK_ASSERT(h != NULL);
/* A bit tricky overflow test, see doc/code-issues.txt. */
t1 = (size_t) DUK_HSTRING_GET_BYTELEN(h);
t2 = (size_t) (count - 1);
limit = (size_t) DUK_HSTRING_MAX_BYTELEN;
if (DUK_UNLIKELY(t2 != 0 && t1 > limit / t2)) {
goto error_overflow;
}
len = (size_t) (t1 * t2);
} else {
len = (size_t) 0;
}
for (i = count; i >= 1; i--) {
size_t new_len;
duk_to_string(ctx, -i);
h = duk_require_hstring(ctx, -i);
new_len = len + (size_t) DUK_HSTRING_GET_BYTELEN(h);
/* Impose a string maximum length; overflow check if size_t is
* 32 bits, straight compare if larger.
*/
#if DUK_SIZE_MAX == 0xffffffffUL
if (new_len < len) {
goto error_overflow;
}
#else
if (new_len > (size_t) DUK_HSTRING_MAX_BYTELEN) {
goto error_overflow;
}
#endif
len = new_len;
}
DUK_DDDPRINT("join/concat %d strings, total length %d bytes", (int) count, (int) len);
/* use stack allocated buffer to ensure reachability in errors (e.g. intern error) */
buf = (duk_uint8_t *) duk_push_fixed_buffer(ctx, len);
DUK_ASSERT(buf != NULL);
/* [... (sep) str1 str2 ... strN buf] */
idx = 0;
for (i = count; i >= 1; i--) {
if (is_join && i != count) {
h = duk_require_hstring(ctx, -count-2); /* extra -1 for buffer */
DUK_MEMCPY(buf + idx, DUK_HSTRING_GET_DATA(h), DUK_HSTRING_GET_BYTELEN(h));
idx += DUK_HSTRING_GET_BYTELEN(h);
}
h = duk_require_hstring(ctx, -i-1); /* extra -1 for buffer */
DUK_MEMCPY(buf + idx, DUK_HSTRING_GET_DATA(h), DUK_HSTRING_GET_BYTELEN(h));
idx += DUK_HSTRING_GET_BYTELEN(h);
}
DUK_ASSERT(idx == len);
/* [... (sep) str1 str2 ... strN buf] */
/* get rid of the strings early to minimize memory use before intern */
if (is_join) {
duk_replace(ctx, -count-2); /* overwrite sep */
duk_pop_n(ctx, count);
} else {
duk_replace(ctx, -count-1); /* overwrite str1 */
duk_pop_n(ctx, count-1);
}
/* [... buf] */
/*
* FIXME: just allow C code to call duk_to_string() on buffers.
* This allows C code to manufacture internal keys, but since we
* trust C code anyway, this is not a big issue.
*/
duk_push_lstring(ctx, (const char *) buf, len);
/* [... buf res] */
duk_remove(ctx, -2);
/* [... res] */
return;
error_overflow:
DUK_ERROR(thr, DUK_ERR_RANGE_ERROR, "concat result too long");
}
void duk_concat(duk_context *ctx, unsigned int count) {
concat_and_join_helper(ctx, count, 0 /*is_join*/);
}
void duk_join(duk_context *ctx, unsigned int count) {
concat_and_join_helper(ctx, count, 1 /*is_join*/);
}
void duk_decode_string(duk_context *ctx, int index, duk_decode_char_function callback, void *udata) {
DUK_ERROR((duk_hthread *) ctx, DUK_ERR_UNIMPLEMENTED_ERROR, "FIXME");
}
void duk_map_string(duk_context *ctx, int index, duk_map_char_function callback, void *udata) {
DUK_ERROR((duk_hthread *) ctx, DUK_ERR_UNIMPLEMENTED_ERROR, "FIXME");
}
void duk_substring(duk_context *ctx, int index, size_t start_offset, size_t end_offset) {
duk_hthread *thr = (duk_hthread *) ctx;
duk_hstring *h;
duk_hstring *res;
size_t start_byte_offset;
size_t end_byte_offset;
DUK_ASSERT(ctx != NULL);
index = duk_require_normalize_index(ctx, index);
h = duk_require_hstring(ctx, index);
DUK_ASSERT(h != NULL);
if (end_offset >= DUK_HSTRING_GET_CHARLEN(h)) {
end_offset = DUK_HSTRING_GET_CHARLEN(h);
}
if (start_offset > end_offset) {
start_offset = end_offset;
}
DUK_ASSERT(start_offset >= 0 && start_offset <= end_offset && start_offset <= DUK_HSTRING_GET_CHARLEN(h));
DUK_ASSERT(end_offset >= 0 && end_offset >= start_offset && end_offset <= DUK_HSTRING_GET_CHARLEN(h));
start_byte_offset = (size_t) duk_heap_strcache_offset_char2byte(thr, h, start_offset);
end_byte_offset = (size_t) duk_heap_strcache_offset_char2byte(thr, h, end_offset);
DUK_ASSERT(end_byte_offset >= start_byte_offset);
res = duk_heap_string_intern_checked(thr,
DUK_HSTRING_GET_DATA(h) + start_byte_offset,
end_byte_offset - start_byte_offset);
duk_push_hstring(ctx, res);
duk_replace(ctx, index);
}
/* FIXME: this is quite clunky. Add Unicode helpers to scan backwards and
* forwards with a callback to process codepoints?
*/
void duk_trim(duk_context *ctx, int index) {
duk_hthread *thr = (duk_hthread *) ctx;
duk_hstring *h;
duk_uint8_t *p, *p_start, *p_end, *p_tmp1, *p_tmp2; /* pointers for scanning */
duk_uint8_t *q_start, *q_end; /* start (incl) and end (excl) of trimmed part */
duk_uint32_t cp;
index = duk_require_normalize_index(ctx, index);
h = duk_require_hstring(ctx, index);
DUK_ASSERT(h != NULL);
p_start = DUK_HSTRING_GET_DATA(h);
p_end = p_start + DUK_HSTRING_GET_BYTELEN(h);
p = p_start;
while (p < p_end) {
p_tmp1 = p;
/* FIXME: duk_codepoint_t */
cp = (duk_uint32_t) duk_unicode_decode_xutf8_checked(thr, &p_tmp1, p_start, p_end);
if (!(duk_unicode_is_whitespace(cp) || duk_unicode_is_line_terminator(cp))) {
break;
}
p = p_tmp1;
}
q_start = p;
if (p == p_end) {
/* entire string is whitespace */
q_end = p;
goto scan_done;
}
p = p_end;
while (p > p_start) {
p_tmp1 = p;
while (p > p_start) {
p--;
if (((*p) & 0xc0) != 0x80) {
break;
}
}
p_tmp2 = p;
/* FIXME: duk_codepoint_t */
cp = (duk_uint32_t) duk_unicode_decode_xutf8_checked(thr, &p_tmp2, p_start, p_end);
if (!(duk_unicode_is_whitespace(cp) || duk_unicode_is_line_terminator(cp))) {
p = p_tmp1;
break;
}
}
q_end = p;
scan_done:
/* This may happen when forward and backward scanning disagree.
* This may happen for non-extended-UTF-8 strings.
*/
if (q_end < q_start) {
q_end = q_start;
}
DUK_ASSERT(q_start >= p_start && q_start <= p_end);
DUK_ASSERT(q_end >= p_start && q_end <= p_end);
DUK_ASSERT(q_end >= q_start);
DUK_DDDPRINT("trim: p_start=%p, p_end=%p, q_start=%p, q_end=%p",
(void *) p_start, (void *) p_end, (void *) q_start, (void *) q_end);
if (q_start == p_start && q_end == p_end) {
DUK_DDDPRINT("nothing was trimmed: avoid interning (hashing etc)");
return;
}
duk_push_lstring(ctx, (const char *) q_start, (size_t) (q_end - q_start));
duk_replace(ctx, index);
}