1 #include "src/lib/fmapread.h"
3 int jsoneq(const char huge *json, jsmntok_t huge *tok, const char huge *s) {
4 if (tok->type == JSMN_STRING && (int)_fstrlen(s) == tok->end - tok->start &&
5 _fstrncmp((char const *)json + tok->start, s, tok->end - tok->start) == 0) {
11 //this function is quite messy ^^; sorry! it is a quick and dirty fix~
12 word dump(const char huge *js, jsmntok_t huge *t, size_t count, word indent, char *js_sv, map_t *map, dword q) {
19 fprintf(stdout, "%s\n", js);
20 fprintf(stdout, "\n");
24 fprintf(stdout, "t->size=[%d] ", t->size);
25 fprintf(stdout, "q=[%d] ", q);
26 fprintf(stdout, "indent= [%d] ", indent);
27 fprintf(stdout, "js_sv= [%s]\n", js_sv);
32 /* We may want to do strtol() here to get numeric value */
33 //0000fprintf(stderr, "t->type=%d\n", t->type);
34 if (t->type == JSMN_PRIMITIVE) {
35 if(_fstrstr(js_sv, "data"))
38 here we should recursivly call dump again here to skip over the array until we get the facking width of the map.
39 so we can initiate the map which allocates the facking map->tiles->data->data properly and THEN we can return
40 here to read the data.... That is my design for this... wwww
42 FUCK well i am stuck.... wwww
44 map->data[q] = (byte)atoi((const char *)js+t->start);
46 fprintf(stdout, "%d[%d]", q, map->data[q]);
50 if(_fstrstr(js_sv, "height"))
52 map->height = atoi((const char *)js+t->start);
54 fprintf(stdout, "indent= [%d] ", indent);
55 fprintf(stdout, "h:[%d]\n", map->height);
57 }else if(_fstrstr(js_sv, "width"))
59 map->width = atoi((const char *)js+t->start);
61 fprintf(stdout, "indent= [%d] ", indent);
62 fprintf(stdout, "w:[%d]\n", map->width);
66 /* We may use strndup() to fetch string value */
67 } else if (t->type == JSMN_STRING) {
68 if(jsoneq(js, t, "data") == 0)
70 // fprintf(stdout, "[[[[%d|%d]]]]\n", &(t+1)->size, (t+1)->size);
71 // fprintf(stdout, "\n%.*s[xx[%d|%d]xx]\n", (t+1)->end - (t+1)->start, js+(t+1)->start, &(t+1)->size, (t+1)->size);
72 map->data = halloc(sizeof(byte) * (t+1)->size, sizeof(byte));
73 //map->data = malloc(sizeof(byte) * (t+1)->size);
74 map->tiles = /*_f*/malloc(sizeof(tiles_t));
75 //map->tiles->data = malloc(sizeof(bitmap_t));
77 //++++ bp = bitmapLoadPcx("data/ed.pcx");
78 //++++ map->tiles->data = &bp;
79 //map->tiles->data->data = malloc((16/**2*/)*16);
80 //map->tiles->data->width = (16/**2*/);
\r
81 //map->tiles->data->height= 16;
\r
82 map->tiles->tileHeight = 16;
\r
83 map->tiles->tileWidth = 16;
\r
84 map->tiles->rows = 1;
\r
86 _fstrcpy(js_sv, "data");//strdup(js+t->start);//, t->end - t->start);
89 if (jsoneq(js, t, "height") == 0 && indent<=1)
91 _fstrcpy(js_sv, "height");//strdup(js+t->start);//, t->end - t->start);
93 if(jsoneq(js, t, "width") == 0 && indent<=1)
95 _fstrcpy(js_sv, "width");//strdup(js+t->start);//, t->end - t->start);
96 }else _fstrcpy(js_sv, "\0");
98 } else if (t->type == JSMN_OBJECT) {
99 //fprintf(stdout, "\n");
101 for (i = 0; i < t->size; i++) {
102 //for (k = 0; k < indent; k++) fprintf(stdout, "\t");
103 j += dump(js, t+1+j, count-j, indent+1, js_sv, map, i);
104 //fprintf(stdout, ": ");
105 j += dump(js, t+1+j, count-j, indent+1, js_sv, map, i);
106 //fprintf(stdout, "\n");
109 } else if (t->type == JSMN_ARRAY) {
111 //fprintf(stdout, "==\n");
112 for (i = 0; i < t->size; i++) {
113 //for (k = 0; k < indent-1; k++) fprintf(stdout, "\t");
114 //fprintf(stdout, "\t-");
115 j += dump(js, t+1+j, count-j, indent+1, js_sv, map, i);
116 //fprintf(stdout, "==\n");
123 int loadmap(char *mn, map_t *map)
127 int eof_expected = 0;
128 char huge *js = NULL;
131 char huge *buff = &buf;
132 static char js_ss[16];
138 FILE *fh = fopen(mn, "r");
143 /* Allocate some tokens as a start */
144 //0000fprintf(stderr, "tok malloc\n");
145 tok = _fmalloc(sizeof(*tok) * tokcount);
147 fprintf(stderr, "malloc(): errno=%d\n", errno);
152 /* Read another chunk */
153 //0000fprintf(stderr, "read\n");
154 r = fread(buf, 1, sizeof(buf), fh);
156 fprintf(stderr, "fread(): %d, errno=%d\n", r, errno);
160 if (eof_expected != 0) {
163 fprintf(stderr, "fread(): unexpected EOF\n");
167 //0000fprintf(stdout, "r= [%d] BUFSIZ=%d\n", r, BUFSIZ);
168 //0000fprintf(stderr, "js alloc~\n");
169 js = _frealloc(js, jslen + r + 1);
171 fprintf(stderr, "*js=%Fp\n", *js);
172 fprintf(stderr, "realloc(): errno = %d\n", errno);
175 _fstrncpy(js + jslen, &(*buff), r);
179 //0000fprintf(stdout, " parse~ tok=%zu jslen=%zu r=%d _memavl()=%u BUFSIZ=%d~\n", tokcount, jslen, r, _memavl(), BUFSIZ);
180 //0000fprintf(stdout, "p=[%u] [%u] [%d]\n", p.pos, p.toknext, p.toksuper);
182 I think it crashes on the line below when it tries to parse the data of huge maps... wwww this is a jsmn problem wwww
185 r = jsmn_parse(&p, js, jslen, tok, tokcount);
186 //0000fprintf(stdout, "r= [%d]\n", r);
188 if (r == JSMN_ERROR_NOMEM) {
189 tokcount = tokcount * 2;
190 //0000fprintf(stderr, "tok realloc~ %zu\n", tokcount);
191 tok = _frealloc(tok, sizeof(*tok) * tokcount);
193 fprintf(stderr, "realloc(): errno=%d\n", errno);
199 //printf("js=%Fp\n", (js));
200 //printf("*js=%Fp\n", (*(js)));
201 //printf("&*js=%s\n", &(*(js)));
202 //printf("&buf=[%Fp]\n", &buf);
203 //printf("&buf_seg=[%x]\n", FP_SEG(&buf));
204 //printf("&buf_off=[%x]\n", FP_OFF(&buf));
205 //printf("&buf_fp=[%Fp]\n", MK_FP(FP_SEG(&buf), FP_OFF(&buf)));
206 //printf("buf=[\n%s\n]\n", buf);
207 //printf("buff=[%Fp]\n", buff);
208 //printf("(*buff)=[%Fp]\n", (*buff));
209 //printf("&(*buff)=[\n%s\n]\n", &(*buff));
210 #ifdef DEBUG_DUMPVARS
211 fprintf(stdout, "running dump~\n");
214 dump(js, tok, p.toknext, incr, &js_ss, map, 0);