Lines Matching full:tree2d
488 unsigned* tree2d;
510 tree->tree2d = 0;
517 lodepng_free(tree->tree2d);
529 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned));
530 if(!tree->tree2d) return 83; /*alloc fail*/
533 convert tree1d[] to tree2d[][]. In the 2D array, a value of 32767 means
544 tree->tree2d[n] = 32767; /*32767 here means the tree2d isn't filled there yet*/
553 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/
557 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/
566 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes;
570 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes;
576 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/
913 ct = codetree->tree2d[(treepos << 1) + READBIT(*bp, in)];
