aboutsummaryrefslogtreecommitdiff
path: root/src/lj_buf.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lj_buf.c')
-rw-r--r--src/lj_buf.c106
1 files changed, 53 insertions, 53 deletions
diff --git a/src/lj_buf.c b/src/lj_buf.c
index 731470f4..66a096fb 100644
--- a/src/lj_buf.c
+++ b/src/lj_buf.c
@@ -22,10 +22,10 @@ static void buf_grow(SBuf *sb, MSize sz)
22 char *b; 22 char *b;
23 if (nsz < LJ_MIN_SBUF) nsz = LJ_MIN_SBUF; 23 if (nsz < LJ_MIN_SBUF) nsz = LJ_MIN_SBUF;
24 while (nsz < sz) nsz += nsz; 24 while (nsz < sz) nsz += nsz;
25 b = (char *)lj_mem_realloc(sbufL(sb), sbufB(sb), osz, nsz); 25 b = (char *)lj_mem_realloc(sbufL(sb), sb->b, osz, nsz);
26 setmref(sb->b, b); 26 sb->b = b;
27 setmref(sb->p, b + len); 27 sb->w = b + len;
28 setmref(sb->e, b + nsz); 28 sb->e = b + nsz;
29} 29}
30 30
31LJ_NOINLINE char *LJ_FASTCALL lj_buf_need2(SBuf *sb, MSize sz) 31LJ_NOINLINE char *LJ_FASTCALL lj_buf_need2(SBuf *sb, MSize sz)
@@ -34,7 +34,7 @@ LJ_NOINLINE char *LJ_FASTCALL lj_buf_need2(SBuf *sb, MSize sz)
34 if (LJ_UNLIKELY(sz > LJ_MAX_BUF)) 34 if (LJ_UNLIKELY(sz > LJ_MAX_BUF))
35 lj_err_mem(sbufL(sb)); 35 lj_err_mem(sbufL(sb));
36 buf_grow(sb, sz); 36 buf_grow(sb, sz);
37 return sbufB(sb); 37 return sb->b;
38} 38}
39 39
40LJ_NOINLINE char *LJ_FASTCALL lj_buf_more2(SBuf *sb, MSize sz) 40LJ_NOINLINE char *LJ_FASTCALL lj_buf_more2(SBuf *sb, MSize sz)
@@ -44,19 +44,19 @@ LJ_NOINLINE char *LJ_FASTCALL lj_buf_more2(SBuf *sb, MSize sz)
44 if (LJ_UNLIKELY(sz > LJ_MAX_BUF || len + sz > LJ_MAX_BUF)) 44 if (LJ_UNLIKELY(sz > LJ_MAX_BUF || len + sz > LJ_MAX_BUF))
45 lj_err_mem(sbufL(sb)); 45 lj_err_mem(sbufL(sb));
46 buf_grow(sb, len + sz); 46 buf_grow(sb, len + sz);
47 return sbufP(sb); 47 return sb->w;
48} 48}
49 49
50void LJ_FASTCALL lj_buf_shrink(lua_State *L, SBuf *sb) 50void LJ_FASTCALL lj_buf_shrink(lua_State *L, SBuf *sb)
51{ 51{
52 char *b = sbufB(sb); 52 char *b = sb->b;
53 MSize osz = (MSize)(sbufE(sb) - b); 53 MSize osz = (MSize)(sb->e - b);
54 if (osz > 2*LJ_MIN_SBUF) { 54 if (osz > 2*LJ_MIN_SBUF) {
55 MSize n = (MSize)(sbufP(sb) - b); 55 MSize n = (MSize)(sb->w - b);
56 b = lj_mem_realloc(L, b, osz, (osz >> 1)); 56 b = lj_mem_realloc(L, b, osz, (osz >> 1));
57 setmref(sb->b, b); 57 sb->b = b;
58 setmref(sb->p, b + n); 58 sb->w = b + n;
59 setmref(sb->e, b + (osz >> 1)); 59 sb->e = b + (osz >> 1);
60 } 60 }
61} 61}
62 62
@@ -71,26 +71,26 @@ char * LJ_FASTCALL lj_buf_tmp(lua_State *L, MSize sz)
71 71
72SBuf *lj_buf_putmem(SBuf *sb, const void *q, MSize len) 72SBuf *lj_buf_putmem(SBuf *sb, const void *q, MSize len)
73{ 73{
74 char *p = lj_buf_more(sb, len); 74 char *w = lj_buf_more(sb, len);
75 p = lj_buf_wmem(p, q, len); 75 w = lj_buf_wmem(w, q, len);
76 setsbufP(sb, p); 76 sb->w = w;
77 return sb; 77 return sb;
78} 78}
79 79
80SBuf * LJ_FASTCALL lj_buf_putchar(SBuf *sb, int c) 80SBuf * LJ_FASTCALL lj_buf_putchar(SBuf *sb, int c)
81{ 81{
82 char *p = lj_buf_more(sb, 1); 82 char *w = lj_buf_more(sb, 1);
83 *p++ = (char)c; 83 *w++ = (char)c;
84 setsbufP(sb, p); 84 sb->w = w;
85 return sb; 85 return sb;
86} 86}
87 87
88SBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s) 88SBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s)
89{ 89{
90 MSize len = s->len; 90 MSize len = s->len;
91 char *p = lj_buf_more(sb, len); 91 char *w = lj_buf_more(sb, len);
92 p = lj_buf_wmem(p, strdata(s), len); 92 w = lj_buf_wmem(w, strdata(s), len);
93 setsbufP(sb, p); 93 sb->w = w;
94 return sb; 94 return sb;
95} 95}
96 96
@@ -99,47 +99,47 @@ SBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s)
99SBuf * LJ_FASTCALL lj_buf_putstr_reverse(SBuf *sb, GCstr *s) 99SBuf * LJ_FASTCALL lj_buf_putstr_reverse(SBuf *sb, GCstr *s)
100{ 100{
101 MSize len = s->len; 101 MSize len = s->len;
102 char *p = lj_buf_more(sb, len), *e = p+len; 102 char *w = lj_buf_more(sb, len), *e = w+len;
103 const char *q = strdata(s)+len-1; 103 const char *q = strdata(s)+len-1;
104 while (p < e) 104 while (w < e)
105 *p++ = *q--; 105 *w++ = *q--;
106 setsbufP(sb, p); 106 sb->w = w;
107 return sb; 107 return sb;
108} 108}
109 109
110SBuf * LJ_FASTCALL lj_buf_putstr_lower(SBuf *sb, GCstr *s) 110SBuf * LJ_FASTCALL lj_buf_putstr_lower(SBuf *sb, GCstr *s)
111{ 111{
112 MSize len = s->len; 112 MSize len = s->len;
113 char *p = lj_buf_more(sb, len), *e = p+len; 113 char *w = lj_buf_more(sb, len), *e = w+len;
114 const char *q = strdata(s); 114 const char *q = strdata(s);
115 for (; p < e; p++, q++) { 115 for (; w < e; w++, q++) {
116 uint32_t c = *(unsigned char *)q; 116 uint32_t c = *(unsigned char *)q;
117#if LJ_TARGET_PPC 117#if LJ_TARGET_PPC
118 *p = c + ((c >= 'A' && c <= 'Z') << 5); 118 *w = c + ((c >= 'A' && c <= 'Z') << 5);
119#else 119#else
120 if (c >= 'A' && c <= 'Z') c += 0x20; 120 if (c >= 'A' && c <= 'Z') c += 0x20;
121 *p = c; 121 *w = c;
122#endif 122#endif
123 } 123 }
124 setsbufP(sb, p); 124 sb->w = w;
125 return sb; 125 return sb;
126} 126}
127 127
128SBuf * LJ_FASTCALL lj_buf_putstr_upper(SBuf *sb, GCstr *s) 128SBuf * LJ_FASTCALL lj_buf_putstr_upper(SBuf *sb, GCstr *s)
129{ 129{
130 MSize len = s->len; 130 MSize len = s->len;
131 char *p = lj_buf_more(sb, len), *e = p+len; 131 char *w = lj_buf_more(sb, len), *e = w+len;
132 const char *q = strdata(s); 132 const char *q = strdata(s);
133 for (; p < e; p++, q++) { 133 for (; w < e; w++, q++) {
134 uint32_t c = *(unsigned char *)q; 134 uint32_t c = *(unsigned char *)q;
135#if LJ_TARGET_PPC 135#if LJ_TARGET_PPC
136 *p = c - ((c >= 'a' && c <= 'z') << 5); 136 *w = c - ((c >= 'a' && c <= 'z') << 5);
137#else 137#else
138 if (c >= 'a' && c <= 'z') c -= 0x20; 138 if (c >= 'a' && c <= 'z') c -= 0x20;
139 *p = c; 139 *w = c;
140#endif 140#endif
141 } 141 }
142 setsbufP(sb, p); 142 sb->w = w;
143 return sb; 143 return sb;
144} 144}
145 145
@@ -148,21 +148,21 @@ SBuf *lj_buf_putstr_rep(SBuf *sb, GCstr *s, int32_t rep)
148 MSize len = s->len; 148 MSize len = s->len;
149 if (rep > 0 && len) { 149 if (rep > 0 && len) {
150 uint64_t tlen = (uint64_t)rep * len; 150 uint64_t tlen = (uint64_t)rep * len;
151 char *p; 151 char *w;
152 if (LJ_UNLIKELY(tlen > LJ_MAX_STR)) 152 if (LJ_UNLIKELY(tlen > LJ_MAX_STR))
153 lj_err_mem(sbufL(sb)); 153 lj_err_mem(sbufL(sb));
154 p = lj_buf_more(sb, (MSize)tlen); 154 w = lj_buf_more(sb, (MSize)tlen);
155 if (len == 1) { /* Optimize a common case. */ 155 if (len == 1) { /* Optimize a common case. */
156 uint32_t c = strdata(s)[0]; 156 uint32_t c = strdata(s)[0];
157 do { *p++ = c; } while (--rep > 0); 157 do { *w++ = c; } while (--rep > 0);
158 } else { 158 } else {
159 const char *e = strdata(s) + len; 159 const char *e = strdata(s) + len;
160 do { 160 do {
161 const char *q = strdata(s); 161 const char *q = strdata(s);
162 do { *p++ = *q++; } while (q < e); 162 do { *w++ = *q++; } while (q < e);
163 } while (--rep > 0); 163 } while (--rep > 0);
164 } 164 }
165 setsbufP(sb, p); 165 sb->w = w;
166 } 166 }
167 return sb; 167 return sb;
168} 168}
@@ -173,27 +173,27 @@ SBuf *lj_buf_puttab(SBuf *sb, GCtab *t, GCstr *sep, int32_t i, int32_t e)
173 if (i <= e) { 173 if (i <= e) {
174 for (;;) { 174 for (;;) {
175 cTValue *o = lj_tab_getint(t, i); 175 cTValue *o = lj_tab_getint(t, i);
176 char *p; 176 char *w;
177 if (!o) { 177 if (!o) {
178 badtype: /* Error: bad element type. */ 178 badtype: /* Error: bad element type. */
179 setsbufP(sb, (void *)(intptr_t)i); /* Store failing index. */ 179 sb->w = (char *)(intptr_t)i; /* Store failing index. */
180 return NULL; 180 return NULL;
181 } else if (tvisstr(o)) { 181 } else if (tvisstr(o)) {
182 MSize len = strV(o)->len; 182 MSize len = strV(o)->len;
183 p = lj_buf_wmem(lj_buf_more(sb, len + seplen), strVdata(o), len); 183 w = lj_buf_wmem(lj_buf_more(sb, len + seplen), strVdata(o), len);
184 } else if (tvisint(o)) { 184 } else if (tvisint(o)) {
185 p = lj_strfmt_wint(lj_buf_more(sb, STRFMT_MAXBUF_INT+seplen), intV(o)); 185 w = lj_strfmt_wint(lj_buf_more(sb, STRFMT_MAXBUF_INT+seplen), intV(o));
186 } else if (tvisnum(o)) { 186 } else if (tvisnum(o)) {
187 p = lj_buf_more(lj_strfmt_putfnum(sb, STRFMT_G14, numV(o)), seplen); 187 w = lj_buf_more(lj_strfmt_putfnum(sb, STRFMT_G14, numV(o)), seplen);
188 } else { 188 } else {
189 goto badtype; 189 goto badtype;
190 } 190 }
191 if (i++ == e) { 191 if (i++ == e) {
192 setsbufP(sb, p); 192 sb->w = w;
193 break; 193 break;
194 } 194 }
195 if (seplen) p = lj_buf_wmem(p, strdata(sep), seplen); 195 if (seplen) w = lj_buf_wmem(w, strdata(sep), seplen);
196 setsbufP(sb, p); 196 sb->w = w;
197 } 197 }
198 } 198 }
199 return sb; 199 return sb;
@@ -203,7 +203,7 @@ SBuf *lj_buf_puttab(SBuf *sb, GCtab *t, GCstr *sep, int32_t i, int32_t e)
203 203
204GCstr * LJ_FASTCALL lj_buf_tostr(SBuf *sb) 204GCstr * LJ_FASTCALL lj_buf_tostr(SBuf *sb)
205{ 205{
206 return lj_str_new(sbufL(sb), sbufB(sb), sbuflen(sb)); 206 return lj_str_new(sbufL(sb), sb->b, sbuflen(sb));
207} 207}
208 208
209/* Concatenate two strings. */ 209/* Concatenate two strings. */
@@ -219,14 +219,14 @@ GCstr *lj_buf_cat2str(lua_State *L, GCstr *s1, GCstr *s2)
219/* Read ULEB128 from buffer. */ 219/* Read ULEB128 from buffer. */
220uint32_t LJ_FASTCALL lj_buf_ruleb128(const char **pp) 220uint32_t LJ_FASTCALL lj_buf_ruleb128(const char **pp)
221{ 221{
222 const uint8_t *p = (const uint8_t *)*pp; 222 const uint8_t *w = (const uint8_t *)*pp;
223 uint32_t v = *p++; 223 uint32_t v = *w++;
224 if (LJ_UNLIKELY(v >= 0x80)) { 224 if (LJ_UNLIKELY(v >= 0x80)) {
225 int sh = 0; 225 int sh = 0;
226 v &= 0x7f; 226 v &= 0x7f;
227 do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80); 227 do { v |= ((*w & 0x7f) << (sh += 7)); } while (*w++ >= 0x80);
228 } 228 }
229 *pp = (const char *)p; 229 *pp = (const char *)w;
230 return v; 230 return v;
231} 231}
232 232