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