chunk *loadChunks(char *FileName) {
int I, L;
uint8_t *D, *P, *E;
chunk *C=0, *T, *N;
FILE *F = fopen(FileName, "r");
fseek(F, 0, SEEK_END);
L = ftell(F);
D = P = (uint8_t *)malloc(L);
E = P+L;
fseek(F, 0, SEEK_SET);
fread(D, 1, L, F);
fclose(F);
while (P < E) {
T = (chunk *)malloc(sizeof(chunk));
memcpy(T->Tag, P, 4);
T->Tag[4] = 0;
P += 4;
T->Len = *(uint32_t *)P;
P += 4;
T->Data = (uint8_t *)malloc(T->Len);
memcpy(T->Data, P, T->Len);
P += T->Len;
T->Next = C;
C = T;
}
for (T = 0; C; C = N) {
N = C->Next;
C->Next = T;
T = C;
}
free(D);
return T;
}
Name:
Anonymous2012-11-30 4:17
Because it makes sense, it's easy, and it doesn't waste CPU cycles. Why use GC?
Name:
Anonymous2012-11-30 4:20
>>13 implying CPU cycles cost more than >>13's time
I agree with you, mental midget: your toilet scrubbing time cost nothing.
Name:
Anonymous2012-11-30 4:23
Real programmers only write deterministic programs with a determined amount of memory to use, besides there is no point in writing something that could stop working at any time when memory runs out.
>>20
XDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD LE E/G/IN POST /G/RO FUCKIN/G/ UPBOATS XDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD +1 +1 +1 LEL LELELELELELELELELELELELEL
>LE MEMEM FACE WHEN LE LEL
>XDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD
>IDSIHSDIFHSDIH DOO XDDDDDDDDDDDDDDDDDDDDDDD
:):) see you at le reddit /g/ro :P xD