2013-02-27 16:11:31 +00:00
|
|
|
/*
|
|
|
|
** Buffer handling.
|
|
|
|
** Copyright (C) 2005-2013 Mike Pall. See Copyright Notice in luajit.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#define lj_buf_c
|
|
|
|
#define LUA_CORE
|
|
|
|
|
|
|
|
#include "lj_obj.h"
|
|
|
|
#include "lj_gc.h"
|
|
|
|
#include "lj_err.h"
|
|
|
|
#include "lj_buf.h"
|
2013-04-20 23:01:33 +00:00
|
|
|
#include "lj_str.h"
|
2013-02-27 16:11:31 +00:00
|
|
|
|
2013-02-28 12:37:56 +00:00
|
|
|
LJ_NOINLINE void LJ_FASTCALL lj_buf_grow(SBuf *sb, char *en)
|
2013-02-27 16:11:31 +00:00
|
|
|
{
|
2013-02-28 12:37:56 +00:00
|
|
|
lua_State *L = sbufL(sb);
|
2013-02-27 20:17:27 +00:00
|
|
|
char *b = sbufB(sb);
|
|
|
|
MSize sz = (MSize)(en - b);
|
|
|
|
MSize osz = (MSize)(sbufE(sb) - b), nsz = osz;
|
|
|
|
MSize n = (MSize)(sbufP(sb) - b);
|
2013-02-27 16:11:31 +00:00
|
|
|
if (LJ_UNLIKELY(sz > LJ_MAX_MEM))
|
|
|
|
lj_err_mem(L);
|
2013-02-27 20:17:27 +00:00
|
|
|
if (nsz < LJ_MIN_SBUF) nsz = LJ_MIN_SBUF;
|
|
|
|
while (nsz < sz) nsz += nsz;
|
|
|
|
b = (char *)lj_mem_realloc(L, b, osz, nsz);
|
|
|
|
setmref(sb->b, b);
|
|
|
|
setmref(sb->p, b + n);
|
|
|
|
setmref(sb->e, b + nsz);
|
2013-02-27 16:11:31 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 12:37:56 +00:00
|
|
|
char * LJ_FASTCALL lj_buf_tmp(lua_State *L, MSize sz)
|
2013-02-27 16:11:31 +00:00
|
|
|
{
|
2013-02-28 12:37:56 +00:00
|
|
|
SBuf *sb = &G(L)->tmpbuf;
|
2013-04-25 22:31:10 +00:00
|
|
|
setsbufL(sb, L);
|
2013-02-28 12:37:56 +00:00
|
|
|
return lj_buf_need(sb, sz);
|
2013-02-27 16:11:31 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 12:37:56 +00:00
|
|
|
void LJ_FASTCALL lj_buf_shrink(lua_State *L, SBuf *sb)
|
2013-02-27 16:11:31 +00:00
|
|
|
{
|
2013-02-27 20:17:27 +00:00
|
|
|
char *b = sbufB(sb);
|
|
|
|
MSize osz = (MSize)(sbufE(sb) - b);
|
|
|
|
if (osz > 2*LJ_MIN_SBUF) {
|
|
|
|
MSize n = (MSize)(sbufP(sb) - b);
|
|
|
|
b = lj_mem_realloc(L, b, osz, (osz >> 1));
|
|
|
|
setmref(sb->b, b);
|
|
|
|
setmref(sb->p, b + n);
|
|
|
|
setmref(sb->e, b + (osz >> 1));
|
2013-02-27 16:11:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-27 20:17:27 +00:00
|
|
|
char *lj_buf_wmem(char *p, const void *q, MSize len)
|
|
|
|
{
|
|
|
|
const char *s = (const char *)q, *e = s + len;
|
|
|
|
while (s < e) *p++ = *s++;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2013-04-22 22:56:03 +00:00
|
|
|
SBuf * lj_buf_putmem(SBuf *sb, const void *q, MSize len)
|
2013-02-27 20:17:27 +00:00
|
|
|
{
|
2013-02-28 12:37:56 +00:00
|
|
|
char *p = lj_buf_more(sb, len);
|
2013-02-27 20:17:27 +00:00
|
|
|
p = lj_buf_wmem(p, q, len);
|
|
|
|
setsbufP(sb, p);
|
2013-04-22 22:56:03 +00:00
|
|
|
return sb;
|
2013-02-27 20:17:27 +00:00
|
|
|
}
|
|
|
|
|
2013-04-20 23:01:33 +00:00
|
|
|
#if LJ_HASJIT
|
|
|
|
SBuf * LJ_FASTCALL lj_buf_putstr(SBuf *sb, GCstr *s)
|
|
|
|
{
|
|
|
|
MSize len = s->len;
|
|
|
|
char *p = lj_buf_more(sb, len);
|
|
|
|
p = lj_buf_wmem(p, strdata(s), len);
|
|
|
|
setsbufP(sb, p);
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
2013-04-22 22:56:03 +00:00
|
|
|
SBuf * LJ_FASTCALL lj_buf_putchar(SBuf *sb, int c)
|
|
|
|
{
|
|
|
|
char *p = lj_buf_more(sb, 1);
|
|
|
|
*p++ = (char)c;
|
|
|
|
setsbufP(sb, p);
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
2013-04-20 23:01:33 +00:00
|
|
|
SBuf * LJ_FASTCALL lj_buf_putint(SBuf *sb, int32_t k)
|
|
|
|
{
|
|
|
|
setsbufP(sb, lj_str_bufint(lj_buf_more(sb, LJ_STR_INTBUF), k));
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
|
|
|
SBuf * LJ_FASTCALL lj_buf_putnum(SBuf *sb, cTValue *o)
|
|
|
|
{
|
|
|
|
setsbufP(sb, lj_str_bufnum(lj_buf_more(sb, LJ_STR_NUMBUF), o));
|
|
|
|
return sb;
|
|
|
|
}
|
2013-04-25 22:31:10 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
SBuf * LJ_FASTCALL lj_buf_putstr_reverse(SBuf *sb, GCstr *s)
|
|
|
|
{
|
|
|
|
MSize len = s->len;
|
|
|
|
char *p = lj_buf_more(sb, len), *e = p+len;
|
|
|
|
const char *q = strdata(s)+len-1;
|
|
|
|
while (p < e)
|
|
|
|
*p++ = *q--;
|
|
|
|
setsbufP(sb, p);
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
|
|
|
SBuf * LJ_FASTCALL lj_buf_putstr_lower(SBuf *sb, GCstr *s)
|
|
|
|
{
|
|
|
|
MSize len = s->len;
|
|
|
|
char *p = lj_buf_more(sb, len), *e = p+len;
|
|
|
|
const char *q = strdata(s);
|
|
|
|
for (; p < e; p++, q++) {
|
|
|
|
uint32_t c = *(unsigned char *)q;
|
|
|
|
#if LJ_TARGET_PPC
|
|
|
|
*p = c + ((c >= 'A' && c <= 'Z') << 5);
|
|
|
|
#else
|
|
|
|
if (c >= 'A' && c <= 'Z') c += 0x20;
|
|
|
|
*p = c;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
setsbufP(sb, p);
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
|
|
|
SBuf * LJ_FASTCALL lj_buf_putstr_upper(SBuf *sb, GCstr *s)
|
|
|
|
{
|
|
|
|
MSize len = s->len;
|
|
|
|
char *p = lj_buf_more(sb, len), *e = p+len;
|
|
|
|
const char *q = strdata(s);
|
|
|
|
for (; p < e; p++, q++) {
|
|
|
|
uint32_t c = *(unsigned char *)q;
|
|
|
|
#if LJ_TARGET_PPC
|
|
|
|
*p = c - ((c >= 'a' && c <= 'z') << 5);
|
|
|
|
#else
|
|
|
|
if (c >= 'a' && c <= 'z') c -= 0x20;
|
|
|
|
*p = c;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
setsbufP(sb, p);
|
|
|
|
return sb;
|
|
|
|
}
|
2013-04-20 23:01:33 +00:00
|
|
|
|
2013-04-26 17:57:25 +00:00
|
|
|
SBuf *lj_buf_putstr_rep(SBuf *sb, GCstr *s, int32_t rep)
|
|
|
|
{
|
|
|
|
MSize len = s->len;
|
|
|
|
if (rep > 0 && len) {
|
|
|
|
uint64_t tlen = (uint64_t)rep * len;
|
|
|
|
char *p;
|
|
|
|
if (LJ_UNLIKELY(tlen > LJ_MAX_STR))
|
|
|
|
lj_err_mem(sbufL(sb));
|
|
|
|
p = lj_buf_more(sb, (MSize)tlen);
|
|
|
|
if (len == 1) { /* Optimize a common case. */
|
|
|
|
uint32_t c = strdata(s)[0];
|
|
|
|
do { *p++ = c; } while (--rep > 0);
|
|
|
|
} else {
|
|
|
|
const char *e = strdata(s) + len;
|
|
|
|
do {
|
|
|
|
const char *q = strdata(s);
|
|
|
|
do { *p++ = *q++; } while (q < e);
|
|
|
|
} while (--rep > 0);
|
|
|
|
}
|
|
|
|
setsbufP(sb, p);
|
|
|
|
}
|
|
|
|
return sb;
|
|
|
|
}
|
|
|
|
|
2013-04-20 23:01:33 +00:00
|
|
|
GCstr * LJ_FASTCALL lj_buf_tostr(SBuf *sb)
|
|
|
|
{
|
|
|
|
return lj_str_new(sbufL(sb), sbufB(sb), sbuflen(sb));
|
|
|
|
}
|
|
|
|
|
2013-04-26 17:20:21 +00:00
|
|
|
GCstr *lj_buf_cat2str(lua_State *L, GCstr *s1, GCstr *s2)
|
|
|
|
{
|
|
|
|
MSize len1 = s1->len, len2 = s2->len;
|
|
|
|
char *buf = lj_buf_tmp(L, len1 + len2);
|
|
|
|
memcpy(buf, strdata(s1), len1);
|
|
|
|
memcpy(buf+len1, strdata(s2), len2);
|
|
|
|
return lj_str_new(L, buf, len1 + len2);
|
|
|
|
}
|
|
|
|
|
2013-02-28 12:37:56 +00:00
|
|
|
uint32_t LJ_FASTCALL lj_buf_ruleb128(const char **pp)
|
2013-02-27 20:17:27 +00:00
|
|
|
{
|
|
|
|
const uint8_t *p = (const uint8_t *)*pp;
|
|
|
|
uint32_t v = *p++;
|
|
|
|
if (LJ_UNLIKELY(v >= 0x80)) {
|
|
|
|
int sh = 0;
|
|
|
|
v &= 0x7f;
|
|
|
|
do { v |= ((*p & 0x7f) << (sh += 7)); } while (*p++ >= 0x80);
|
|
|
|
}
|
|
|
|
*pp = (const char *)p;
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
2013-02-28 12:37:56 +00:00
|
|
|
char * LJ_FASTCALL lj_buf_wuleb128(char *p, uint32_t v)
|
2013-02-27 20:17:27 +00:00
|
|
|
{
|
|
|
|
for (; v >= 0x80; v >>= 7)
|
|
|
|
*p++ = (char)((v & 0x7f) | 0x80);
|
|
|
|
*p++ = (char)v;
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|