[cycript.git] / sig / parse.cpp

/* Cycript - Optimizing JavaScript Compiler/Runtime
 * Copyright (C) 2009-2010  Jay Freeman (saurik)
*/

/* GNU Lesser General Public License, Version 3 {{{ */
/*
 * Cycript is free software: you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or (at your
 * option) any later version.
 *
 * Cycript is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
 * License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with Cycript.  If not, see <http://www.gnu.org/licenses/>.
**/
/* }}} */

#include <apr_strings.h>
#include "sig/parse.hpp"
#include "Error.hpp"

#include <cstdio>
#include <cstdlib>
#include <cstring>

namespace sig {

void Parse_(apr_pool_t *pool, struct Signature *signature, const char **name, char eos, Callback callback);
struct Type *Parse_(apr_pool_t *pool, const char **name, char eos, bool named, Callback callback);


/* XXX: I really screwed up this time */
void *prealloc_(apr_pool_t *pool, void *odata, size_t osize, size_t nsize) {
    void *ndata = apr_palloc(pool, nsize);
    memcpy(ndata, odata, osize);
    return ndata;
}

void Parse_(apr_pool_t *pool, struct Signature *signature, const char **name, char eos, Callback callback) {
    _assert(*name != NULL);

    // XXX: this is just a stupid check :(
    bool named(**name == '"');

    signature->elements = NULL;
    signature->count = 0;

    for (;;) {
        if (**name == eos) {
            ++*name;
            return;
        }

        signature->elements = (struct Element *) prealloc_(pool, signature->elements, signature->count * sizeof(struct Element), (signature->count + 1) * sizeof(struct Element));
        _assert(signature->elements != NULL);

        struct Element *element = &signature->elements[signature->count++];

        if (**name != '"')
            element->name = NULL;
        else {
            const char *quote = strchr(++*name, '"');
            element->name = apr_pstrmemdup(pool, *name, quote - *name);
            *name = quote + 1;
        }

        element->type = Parse_(pool, name, eos, named, callback);

        if (**name < '0' || **name > '9')
            element->offset = _not(size_t);
        else {
            element->offset = 0;

            do
                element->offset = element->offset * 10 + (*(*name)++ - '0');
            while (**name >= '0' && **name <= '9');
        }
    }
}

struct Type *Parse_(apr_pool_t *pool, const char **name, char eos, bool named, Callback callback) {
    char next = *(*name)++;
    if (next == '?')
        return NULL;

    struct Type *type = (struct Type *) apr_palloc(pool, sizeof(struct Type));
    _assert(type != NULL);
    memset(type, 0, sizeof(struct Type));

  parse:
    switch (next) {
        case '#': type->primitive = typename_P; break;

        case '(':
            if (type->data.signature.count < 2)
                type->primitive = struct_P;
            else
                type->primitive = union_P;
            next = ')';
        goto aggregate;

        case '*': type->primitive = string_P; break;
        case ':': type->primitive = selector_P; break;

        case '@': {
            char next(**name);

            if (next == '?') {
                type->primitive = block_P;
                ++*name;
            } else {
                type->primitive = object_P;

                if (next == '"') {
                    const char *quote = strchr(*name + 1, '"');
                    if (!named || quote[1] == eos || quote[1] == '"') {
                        type->name = apr_pstrmemdup(pool, *name + 1, quote - *name - 1);
                        *name = quote + 1;
                    }
                }
            }

        } break;

        case 'B': type->primitive = boolean_P; break;
        case 'C': type->primitive = uchar_P; break;
        case 'I': type->primitive = uint_P; break;
        case 'L': type->primitive = ulong_P; break;
        case 'Q': type->primitive = ulonglong_P; break;
        case 'S': type->primitive = ushort_P; break;

        case '[':
            type->primitive = array_P;
            type->data.data.size = strtoul(*name, (char **) name, 10);
            type->data.data.type = Parse_(pool, name, eos, false, callback);
            if (**name != ']') {
                printf("']' != \"%s\"\n", *name);
                _assert(false);
            }
            ++*name;
        break;

        case '^':
            type->primitive = pointer_P;
            if (**name == '"') {
                type->data.data.type = NULL;
            } else {
                type->data.data.type = Parse_(pool, name, eos, named, callback);
                sig::Type *&target(type->data.data.type);
                if (target != NULL && target->primitive == void_P)
                    target = NULL;
            }
        break;

        case 'b':
            type->primitive = bit_P;
            type->data.data.size = strtoul(*name, (char **) name, 10);
        break;

        case 'c': type->primitive = char_P; break;
        case 'd': type->primitive = double_P; break;
        case 'f': type->primitive = float_P; break;
        case 'i': type->primitive = int_P; break;
        case 'l': type->primitive = long_P; break;
        case 'q': type->primitive = longlong_P; break;
        case 's': type->primitive = short_P; break;
        case 'v': type->primitive = void_P; break;

        case '{':
            type->primitive = struct_P;
            next = '}';
        goto aggregate;

        aggregate: {
            char end = next;
            const char *begin = *name;
            do next = *(*name)++;
            while (
                next != '=' &&
                next != '}'
            );
            size_t length = *name - begin - 1;
            if (strncmp(begin, "?", length) != 0)
                type->name = (char *) apr_pstrmemdup(pool, begin, length);
            else
                type->name = NULL;

            // XXX: this types thing is a throwback to JocStrap

            if (next == '=')
                Parse_(pool, &type->data.signature, name, end, callback);
        } break;

        case 'N': type->flags |= JOC_TYPE_INOUT; goto next;
        case 'n': type->flags |= JOC_TYPE_IN; goto next;
        case 'O': type->flags |= JOC_TYPE_BYCOPY; goto next;
        case 'o': type->flags |= JOC_TYPE_OUT; goto next;
        case 'R': type->flags |= JOC_TYPE_BYREF; goto next;
        case 'r': type->flags |= JOC_TYPE_CONST; goto next;
        case 'V': type->flags |= JOC_TYPE_ONEWAY; goto next;

        next:
            next = *(*name)++;
            goto parse;
        break;

        default:
            printf("invalid type character: '%c' {%s}\n", next, *name - 10);
            _assert(false);
    }

    if (callback != NULL)
        (*callback)(pool, type);

    return type;
}

void Parse(apr_pool_t *pool, struct Signature *signature, const char *name, Callback callback) {
    const char *temp = name;
    Parse_(pool, signature, &temp, '\0', callback);
    _assert(temp[-1] == '\0');
}

const char *Unparse(apr_pool_t *pool, struct Signature *signature) {
    const char *value = "";
    size_t offset;

    for (offset = 0; offset != signature->count; ++offset) {
        const char *type = Unparse(pool, signature->elements[offset].type);
        value = apr_pstrcat(pool, value, type, NULL);
    }

    return value;
}

const char *Unparse(apr_pool_t *pool, struct Type *type) {
    if (type == NULL)
        return "?";
    else switch (type->primitive) {
        case typename_P: return "#";
        case union_P: return apr_psprintf(pool, "(%s)", Unparse(pool, &type->data.signature));
        case string_P: return "*";
        case selector_P: return ":";
        case block_P: return "@?";
        case object_P: return type->name == NULL ? "@" : apr_psprintf(pool, "@\"%s\"", type->name);
        case boolean_P: return "B";
        case uchar_P: return "C";
        case uint_P: return "I";
        case ulong_P: return "L";
        case ulonglong_P: return "Q";
        case ushort_P: return "S";

        case array_P: {
            const char *value = Unparse(pool, type->data.data.type);
            return apr_psprintf(pool, "[%"APR_SIZE_T_FMT"%s]", type->data.data.size, value);
        } break;

        case pointer_P: return apr_psprintf(pool, "^%s", type->data.data.type == NULL ? "v" : Unparse(pool, type->data.data.type));
        case bit_P: return apr_psprintf(pool, "b%"APR_SIZE_T_FMT"", type->data.data.size);
        case char_P: return "c";
        case double_P: return "d";
        case float_P: return "f";
        case int_P: return "i";
        case long_P: return "l";
        case longlong_P: return "q";
        case short_P: return "s";
        case void_P: return "v";
        case struct_P: return apr_psprintf(pool, "{%s=%s}", type->name == NULL ? "?" : type->name, Unparse(pool, &type->data.signature));
    }

    _assert(false);
    return NULL;
}

}
Commit	Line	Data
b3378a02 JF	1	/* Cycript - Optimizing JavaScript Compiler/Runtime
b3378a02 JF	2	* Copyright (C) 2009-2010 Jay Freeman (saurik)
b4aa79af JF	3	*/
b4aa79af JF	4
b3378a02	5	/* GNU Lesser General Public License, Version 3 {{{ */
b4aa79af	6	/*
b3378a02 JF	7	* Cycript is free software: you can redistribute it and/or modify it under
	8	* the terms of the GNU Lesser General Public License as published by the
	9	* Free Software Foundation, either version 3 of the License, or (at your
	10	* option) any later version.
b4aa79af	11	*
b3378a02 JF	12	* Cycript is distributed in the hope that it will be useful, but WITHOUT
	13	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
	14	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
	15	* License for more details.
b4aa79af	16	*
b3378a02 JF	17	* You should have received a copy of the GNU Lesser General Public License
	18	* along with Cycript. If not, see <http://www.gnu.org/licenses/>.
	19	**/
b4aa79af JF	20	/* }}} */
b4aa79af JF	21
9185d5ef	22	#include <apr_strings.h>
ea2d184c	23	#include "sig/parse.hpp"
37954781 JF	24	#include "Error.hpp"
	25
	26	#include <cstdio>
	27	#include <cstdlib>
	28	#include <cstring>
ea2d184c JF	29
	30	namespace sig {
	31
f33b048a JF	32	void Parse_(apr_pool_t pool, struct Signature signature, const char **name, char eos, Callback callback);
f33b048a JF	33	struct Type Parse_(apr_pool_t pool, const char **name, char eos, bool named, Callback callback);
b21525c7 JF	34
b21525c7 JF	35
ea2d184c JF	36	/* XXX: I really screwed up this time */
	37	void prealloc_(apr_pool_t pool, void *odata, size_t osize, size_t nsize) {
	38	void *ndata = apr_palloc(pool, nsize);
	39	memcpy(ndata, odata, osize);
	40	return ndata;
	41	}
	42
f33b048a	43	void Parse_(apr_pool_t pool, struct Signature signature, const char **name, char eos, Callback callback) {
ea2d184c JF	44	_assert(*name != NULL);
ea2d184c JF	45
f33b048a JF	46	// XXX: this is just a stupid check :(
f33b048a JF	47	bool named(**name == '"');
ea2d184c JF	48
	49	signature->elements = NULL;
	50	signature->count = 0;
	51
	52	for (;;) {
	53	if (**name == eos) {
	54	++*name;
	55	return;
	56	}
	57
	58	signature->elements = (struct Element ) prealloc_(pool, signature->elements, signature->count sizeof(struct Element), (signature->count + 1) * sizeof(struct Element));
	59	_assert(signature->elements != NULL);
	60
	61	struct Element *element = &signature->elements[signature->count++];
	62
	63	if (**name != '"')
	64	element->name = NULL;
	65	else {
a815a4d6	66	const char quote = strchr(++name, '"');
ea2d184c JF	67	element->name = apr_pstrmemdup(pool, name, quote - name);
	68	*name = quote + 1;
	69	}
	70
f33b048a	71	element->type = Parse_(pool, name, eos, named, callback);
ea2d184c JF	72
	73	if (name < '0' \|\| name > '9')
	74	element->offset = _not(size_t);
	75	else {
	76	element->offset = 0;
	77
	78	do
	79	element->offset = element->offset * 10 + ((name)++ - '0');
	80	while (name >= '0' && name <= '9');
	81	}
	82	}
	83	}
	84
f33b048a	85	struct Type Parse_(apr_pool_t pool, const char **name, char eos, bool named, Callback callback) {
ea2d184c JF	86	char next = (name)++;
	87	if (next == '?')
	88	return NULL;
	89
	90	struct Type type = (struct Type ) apr_palloc(pool, sizeof(struct Type));
	91	_assert(type != NULL);
	92	memset(type, 0, sizeof(struct Type));
	93
	94	parse:
	95	switch (next) {
	96	case '#': type->primitive = typename_P; break;
	97
	98	case '(':
d63c39cc JF	99	if (type->data.signature.count < 2)
	100	type->primitive = struct_P;
	101	else
	102	type->primitive = union_P;
ea2d184c JF	103	next = ')';
	104	goto aggregate;
	105
	106	case '*': type->primitive = string_P; break;
	107	case ':': type->primitive = selector_P; break;
	108
ecf94af8 JF	109	case '@': {
	110	char next(**name);
	111
	112	if (next == '?') {
	113	type->primitive = block_P;
	114	++*name;
	115	} else {
	116	type->primitive = object_P;
	117
	118	if (next == '"') {
	119	const char quote = strchr(name + 1, '"');
	120	if (!named \|\| quote[1] == eos \|\| quote[1] == '"') {
	121	type->name = apr_pstrmemdup(pool, name + 1, quote - name - 1);
	122	*name = quote + 1;
	123	}
ea2d184c JF	124	}
	125	}
	126
ecf94af8	127	} break;
ea2d184c JF	128
	129	case 'B': type->primitive = boolean_P; break;
	130	case 'C': type->primitive = uchar_P; break;
	131	case 'I': type->primitive = uint_P; break;
	132	case 'L': type->primitive = ulong_P; break;
	133	case 'Q': type->primitive = ulonglong_P; break;
	134	case 'S': type->primitive = ushort_P; break;
	135
	136	case '[':
	137	type->primitive = array_P;
	138	type->data.data.size = strtoul(name, (char *) name, 10);
f33b048a	139	type->data.data.type = Parse_(pool, name, eos, false, callback);
ea2d184c JF	140	if (**name != ']') {
	141	printf("']' != \"%s\"\n", *name);
	142	_assert(false);
	143	}
	144	++*name;
	145	break;
	146
	147	case '^':
	148	type->primitive = pointer_P;
61933e16	149	if (**name == '"') {
ea2d184c JF	150	type->data.data.type = NULL;
ea2d184c JF	151	} else {
f33b048a	152	type->data.data.type = Parse_(pool, name, eos, named, callback);
3a1b79a7 JF	153	sig::Type *&target(type->data.data.type);
	154	if (target != NULL && target->primitive == void_P)
	155	target = NULL;
ea2d184c JF	156	}
	157	break;
	158
	159	case 'b':
	160	type->primitive = bit_P;
	161	type->data.data.size = strtoul(name, (char *) name, 10);
	162	break;
	163
	164	case 'c': type->primitive = char_P; break;
	165	case 'd': type->primitive = double_P; break;
	166	case 'f': type->primitive = float_P; break;
	167	case 'i': type->primitive = int_P; break;
	168	case 'l': type->primitive = long_P; break;
	169	case 'q': type->primitive = longlong_P; break;
	170	case 's': type->primitive = short_P; break;
	171	case 'v': type->primitive = void_P; break;
	172
	173	case '{':
	174	type->primitive = struct_P;
	175	next = '}';
	176	goto aggregate;
	177
	178	aggregate: {
	179	char end = next;
	180	const char begin = name;
	181	do next = (name)++;
	182	while (
	183	next != '=' &&
	184	next != '}'
	185	);
	186	size_t length = *name - begin - 1;
	187	if (strncmp(begin, "?", length) != 0)
	188	type->name = (char *) apr_pstrmemdup(pool, begin, length);
	189	else
	190	type->name = NULL;
	191
f33b048a JF	192	// XXX: this types thing is a throwback to JocStrap
f33b048a JF	193
9814ec39	194	if (next == '=')
f33b048a	195	Parse_(pool, &type->data.signature, name, end, callback);
ea2d184c JF	196	} break;
	197
	198	case 'N': type->flags \|= JOC_TYPE_INOUT; goto next;
	199	case 'n': type->flags \|= JOC_TYPE_IN; goto next;
	200	case 'O': type->flags \|= JOC_TYPE_BYCOPY; goto next;
	201	case 'o': type->flags \|= JOC_TYPE_OUT; goto next;
	202	case 'R': type->flags \|= JOC_TYPE_BYREF; goto next;
	203	case 'r': type->flags \|= JOC_TYPE_CONST; goto next;
	204	case 'V': type->flags \|= JOC_TYPE_ONEWAY; goto next;
	205
	206	next:
	207	next = (name)++;
	208	goto parse;
	209	break;
	210
	211	default:
	212	printf("invalid type character: '%c' {%s}\n", next, *name - 10);
	213	_assert(false);
	214	}
	215
9814ec39 JF	216	if (callback != NULL)
	217	(*callback)(pool, type);
	218
ea2d184c JF	219	return type;
	220	}
	221
f33b048a	222	void Parse(apr_pool_t pool, struct Signature signature, const char *name, Callback callback) {
ea2d184c	223	const char *temp = name;
f33b048a	224	Parse_(pool, signature, &temp, '\0', callback);
ea2d184c JF	225	_assert(temp[-1] == '\0');
	226	}
	227
b21525c7	228	const char Unparse(apr_pool_t pool, struct Signature *signature) {
ea2d184c JF	229	const char *value = "";
	230	size_t offset;
	231
	232	for (offset = 0; offset != signature->count; ++offset) {
b21525c7	233	const char *type = Unparse(pool, signature->elements[offset].type);
ea2d184c JF	234	value = apr_pstrcat(pool, value, type, NULL);
	235	}
	236
	237	return value;
	238	}
	239
b21525c7	240	const char Unparse(apr_pool_t pool, struct Type *type) {
ea2d184c JF	241	if (type == NULL)
	242	return "?";
	243	else switch (type->primitive) {
	244	case typename_P: return "#";
b21525c7	245	case union_P: return apr_psprintf(pool, "(%s)", Unparse(pool, &type->data.signature));
ea2d184c JF	246	case string_P: return "*";
ea2d184c JF	247	case selector_P: return ":";
ecf94af8	248	case block_P: return "@?";
ea2d184c JF	249	case object_P: return type->name == NULL ? "@" : apr_psprintf(pool, "@\"%s\"", type->name);
	250	case boolean_P: return "B";
	251	case uchar_P: return "C";
	252	case uint_P: return "I";
	253	case ulong_P: return "L";
	254	case ulonglong_P: return "Q";
	255	case ushort_P: return "S";
	256
	257	case array_P: {
b21525c7	258	const char *value = Unparse(pool, type->data.data.type);
0fe90592	259	return apr_psprintf(pool, "[%"APR_SIZE_T_FMT"%s]", type->data.data.size, value);
ea2d184c JF	260	} break;
ea2d184c JF	261
cbaa5f0f	262	case pointer_P: return apr_psprintf(pool, "^%s", type->data.data.type == NULL ? "v" : Unparse(pool, type->data.data.type));
0fe90592	263	case bit_P: return apr_psprintf(pool, "b%"APR_SIZE_T_FMT"", type->data.data.size);
ea2d184c JF	264	case char_P: return "c";
	265	case double_P: return "d";
	266	case float_P: return "f";
	267	case int_P: return "i";
	268	case long_P: return "l";
	269	case longlong_P: return "q";
	270	case short_P: return "s";
	271	case void_P: return "v";
b21525c7	272	case struct_P: return apr_psprintf(pool, "{%s=%s}", type->name == NULL ? "?" : type->name, Unparse(pool, &type->data.signature));
ea2d184c JF	273	}
	274
	275	_assert(false);
	276	return NULL;
	277	}
	278
	279	}