Пример #1
0
SDB_API int sdb_json_geti (Sdb *s, const char *k, const char *p, ut32 *cas) {
	char *v = sdb_get (s, k, cas);
	if (v) {
		Rangstr rs = json_get (v, p);
		return rangstr_int (&rs);
	}
	return 0;
}
Пример #2
0
SDB_VISIBLE int sdb_json_geti (Sdb *s, const char *k, const char *p) {
	char *v = sdb_get (s, k, 0); // XXX cas
	if (v) {
		Rangstr rs = json_get (v, p);
		return rangstr_int (&rs);
	}
	return 0;
}
Пример #3
0
SDB_IPI Rangstr json_find (const char *s, Rangstr *rs) {
#define RESFIXSZ 1024
	RangstrType resfix[RESFIXSZ] = {0};
	RangstrType *res = resfix;
	int i, j, n, len, ret;
	Rangstr rsn;

	if (!s) {
		return rangstr_null ();
	}

	len = strlen (s);
	if (len > RESFIXSZ) {
		res = calloc (len + 1, sizeof (RangstrType));
		if (!res) {
			eprintf ("Cannot allocate %d byte(s)\n", len + 1);
			return rangstr_null ();
		}
	}

	ret = js0n ((const unsigned char *)s, len, res);
#define PFREE(x) if (x && x != resfix) free (x)
	if (ret > 0) {
		PFREE (res);
		return rangstr_null ();
	}

	if (*s == '[') {
		n = rangstr_int (rs);
		if (n < 0) {
			goto beach;
		}

		for (i = j = 0; res[i] && j < n; i += 2, j++);
		if (!res[i]) {
			goto beach;
		}

		rsn = rangstr_news (s, res, i);

		PFREE (res);
		return rsn;
	} else {
		for (i=0; res[i]; i+=4) {
			Rangstr rsn = rangstr_news (s, res, i);
			if (!rangstr_cmp (rs, &rsn)) {
				rsn = rangstr_news (s, res, i+2);
				PFREE (res);
				return rsn;
			}
		}
	}
beach:
	PFREE (res);
	return rangstr_null ();
}
Пример #4
0
Rangstr json_find (const char *s, Rangstr *rs) {
#define RESFIXSZ 1024
    RangstrType resfix[RESFIXSZ], *res = NULL;
    int i, j, n, len, ret;
    Rangstr rsn;

    if (!s) return rangstr_null ();
    len = strlen (s);
    res = (len<RESFIXSZ)? resfix: malloc (sizeof (RangstrType)* (len+1));
    if (!res) {
        eprintf ("Cannot allocate %d bytes\n", len+1);
        return rangstr_null ();
    }
    for (i=0; i<len; i++)
        res[i] = 0;
    ret = js0n ((const unsigned char *)s, len, res);
#define PFREE(x) if (x&&x!=resfix) free (x)
    if (ret>0) {
        PFREE (res);
        return rangstr_null ();
    }
    if (*s=='[') {
        n = rangstr_int (rs);
        n++;
        if (n<0) goto beach;
        for (i=j=0; res[i] && j<n; i+=2, j++);
        if (j<n) goto beach;
        rsn = rangstr_news (s, res, i-2);
        PFREE (res);
        return rsn;
    } else {
        for (i=0; res[i]; i+=4) {
            Rangstr rsn = rangstr_news (s, res, i);
            if (!rangstr_cmp (rs, &rsn)) {
                rsn = rangstr_news (s, res, i+2);
                PFREE (res);
                return rsn;
            }
        }
    }
beach:
    PFREE (res);
    return rangstr_null ();
}