Unified · Split
| @@ -8,6 +8,7 @@ enum { · 7 unmodified lines | ||
| 8 | 8 | Abool, |
| 9 | 9 | Astr, |
| 10 | 10 | Aobj, |
| 11 | + Anull = 5, | |
| 11 | 12 | Aarr = 8, |
| 12 | 13 | Aend, |
| 13 | 14 | Alstr = 12, |
| @@ -22,6 +23,12 @@ enum { · 8 unmodified lines | ||
| 22 | 23 | } \ |
| 23 | 24 | }while(0) |
| 24 | 25 | |
| 26 | +u8int * | |
| 27 | +amf0null(u8int *p, u8int *e) | |
| 28 | +{ | |
| 29 | + return amf0byte(p, e, Anull); | |
| 30 | +} | |
| 31 | + | |
| 25 | 32 | u8int * |
| 26 | 33 | amf0bool(u8int *p, u8int *e, int v) |
| 27 | 34 | { |
| @@ -248,6 +255,10 @@ amf0parse(Amf0 **amf0, u8int *p, u8int *e) · 220 unmodified lines | ||
| 248 | 255 | *amf0 = nil; |
| 249 | 256 | |
| 250 | 257 | switch(*p++){ |
| 258 | + case Anull: | |
| 259 | + a->type = Tnull; | |
| 260 | + break; | |
| 261 | + | |
| 251 | 262 | case Anum: |
| 252 | 263 | atleast("num", 8); |
| 253 | 264 | for(n = 0, x.u = 0; n < 8; n++) |
| @@ -1,4 +1,5 @@ | ||
| 1 | 1 | enum { |
| 2 | + Tnull, | |
| 2 | 3 | Tstr, |
| 3 | 4 | Tnum, |
| 4 | 5 | Tbool, |
| @@ -26,6 +27,7 @@ struct Amf0 { · 21 unmodified lines | ||
| 26 | 27 | }; |
| 27 | 28 | }; |
| 28 | 29 | |
| 30 | +u8int *amf0null(u8int *p, u8int *e); | |
| 29 | 31 | u8int *amf0i16(u8int *p, u8int *e, s16int i); |
| 30 | 32 | u8int *amf0bool(u8int *p, u8int *e, int v); |
| 31 | 33 | u8int *amf0byte(u8int *p, u8int *e, u8int byte); |