| /dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/lodepng-2.5.0/src/ |
| H A D | huffman.rs | 8 pub tree2d: Vec<u32>, field
19 tree2d: Vec::new(), in new()
45 …let ct = self.tree2d[(treepos << 1) + (((inp[*bp >> 3]) >> (*bp & 7)) & 1u8) as usize]; /*the symb… in decode_symbol()
62 tree.tree2d = vec![32767; tree.numcodes as usize * 2]; in new_2d_tree()
69 if tree.tree2d[2 * treepos + bit as usize] == 32767 { in new_2d_tree()
71 tree.tree2d[2 * treepos + bit] = n as u32; in new_2d_tree()
75 tree.tree2d[2 * treepos + bit] = (nodefilled + tree.numcodes) as u32; in new_2d_tree()
79 let pos = tree.tree2d[2 * treepos + bit] as usize; in new_2d_tree()
88 if tree.tree2d[n] == 32767 { in new_2d_tree()
89 tree.tree2d[n] = 0; in new_2d_tree()
|
| /dports/archivers/maxcso/maxcso-1.10.0/zopfli/src/zopflipng/lodepng/ |
| H A D | lodepng_util.cpp | 339 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()
345 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in in makeFromLengths()
350 tree2d[2 * treepos + bit] = n; in makeFromLengths()
356 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
360 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
366 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()
368 result = tree2d[2 * treepos + bit]; in decode()
374 std::vector<unsigned long> tree2d; member
|
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/emulators/mesen/Mesen-0.9.8-4-g4c701ad6/Utilities/ |
| H A D | PNGHelper.cpp | 155 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in DecodePNG()
161 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in in DecodePNG()
163 if(i + 1 == bitlen[n]) { tree2d[2 * treepos + bit] = n; treepos = 0; } //last bit in DecodePNG()
164 …else { tree2d[2 * treepos + bit] = ++nodefilled + numcodes; treepos = nodefilled; } //addresses ar… in DecodePNG()
166 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in DecodePNG()
172 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in DecodePNG()
174 result = tree2d[2 * treepos + bit]; in DecodePNG()
179 …std::vector<unsigned long> tree2d; //2D representation of a huffman tree: The one dimension is "0"… in DecodePNG() member
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/rendering/ |
| H A D | DecodePNG.cxx | 149 tree2d.clear(); in DecodePNG()
150 tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled there yet in DecodePNG()
157 if (tree2d[2 * treepos + bit] == 32767) //not yet filled in in DecodePNG()
161 tree2d[2 * treepos + bit] = n; in DecodePNG()
166 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in DecodePNG()
171 treepos = tree2d[2 * treepos + bit] - in DecodePNG()
181 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in DecodePNG()
184 result = tree2d[2 * treepos + bit]; in DecodePNG()
190 …tree2d; //2D representation of a huffman tree: The one dimension is "0" or "1", the other contains… in DecodePNG() member
|
| /dports/devel/doxygen/doxygen-1.9.3/liblodepng/ |
| H A D | lodepng.cpp | 395 uivector tree2d; member
417 uivector_init(&tree->tree2d); in HuffmanTree_init()
424 uivector_cleanup(&tree->tree2d); in HuffmanTree_cleanup()
436 …if(!uivector_resize(&tree->tree2d, tree->numcodes * 2)) return 9901; /*if failed return not enough… in HuffmanTree_make2DTree()
439 …for(n = 0; n < tree->numcodes * 2; n++) tree->tree2d.data[n] = 32767; /*32767 here means the tree… in HuffmanTree_make2DTree()
446 if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
450 tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
456 …tree->tree2d.data[2 * treepos + bit] = nodefilled + tree->numcodes; /*addresses encoded with numco… in HuffmanTree_make2DTree()
460 else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
462 …for(n = 0; n < tree->numcodes * 2; n++) if(tree->tree2d.data[n] == 32767) tree->tree2d.data[n] = … in HuffmanTree_make2DTree()
|
| /dports/emulators/citra/citra-ac98458e0/externals/lodepng/lodepng/ |
| H A D | lodepng_util.cpp | 1418 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()
1423 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1426 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1430 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1434 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1439 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()
1441 result = tree2d[2 * treepos + bit]; in decode()
1447 std::vector<unsigned long> tree2d; member
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/lodepng/lodepng/ |
| H A D | lodepng_util.cpp | 1418 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()
1423 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1426 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1430 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1434 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1439 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()
1441 result = tree2d[2 * treepos + bit]; in decode()
1447 std::vector<unsigned long> tree2d; member
|
| /dports/graphics/libjxl/libjxl-0.6.1/third_party/lodepng/ |
| H A D | lodepng_util.cpp | 1476 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()
1481 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1484 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1488 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1492 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1497 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()
1499 result = tree2d[2 * treepos + bit]; in decode()
1505 std::vector<unsigned long> tree2d; member
|
| /dports/archivers/zopfli/zopfli-zopfli-1.0.3/src/zopflipng/lodepng/ |
| H A D | lodepng_util.cpp | 1480 …tree2d.clear(); tree2d.resize(numcodes * 2, 32767); //32767 here means the tree2d isn't filled the… in makeFromLengths()
1485 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1488 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1492 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1496 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1501 unsigned long numcodes = (unsigned long)tree2d.size() / 2; in decode()
1503 result = tree2d[2 * treepos + bit]; in decode()
1509 std::vector<unsigned long> tree2d; member
|
| /dports/net/freerdp/freerdp-2.5.0/winpr/libwinpr/utils/lodepng/ |
| H A D | lodepng.c | 523 unsigned* tree2d; member
545 tree->tree2d = 0; in HuffmanTree_init()
554 free(tree->tree2d); in HuffmanTree_cleanup()
567 if (!tree->tree2d) in HuffmanTree_make2DTree()
593 if (tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
606 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
611 treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
617 if (tree->tree2d[n] == 32767) in HuffmanTree_make2DTree()
618 tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
987 if (!codetree || !codetree->tree2d) in huffmanDecodeSymbol()
[all …]
|
| /dports/games/passage/Passage_v4_UnixSource/minorGems/graphics/converters/ |
| H A D | lodepng.cpp | 421 uivector tree2d; member
443 uivector_init(&tree->tree2d); in HuffmanTree_init()
450 uivector_cleanup(&tree->tree2d); in HuffmanTree_cleanup()
462 …if(!uivector_resize(&tree->tree2d, tree->numcodes * 2)) return 9901; /*if failed return not enough… in HuffmanTree_make2DTree()
465 …for(n = 0; n < tree->numcodes * 2; n++) tree->tree2d.data[n] = 32767; /*32767 here means the tree… in HuffmanTree_make2DTree()
472 if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
476 tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
482 …tree->tree2d.data[2 * treepos + bit] = nodefilled + tree->numcodes; /*addresses encoded with numco… in HuffmanTree_make2DTree()
486 else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
488 …for(n = 0; n < tree->numcodes * 2; n++) if(tree->tree2d.data[n] == 32767) tree->tree2d.data[n] = … in HuffmanTree_make2DTree()
[all …]
|
| /dports/emulators/almostti/AlmostTI-DougMelton-Source/ATI85/Unix/ |
| H A D | lodepng.c | 421 uivector tree2d; member
443 uivector_init(&tree->tree2d); in HuffmanTree_init()
450 uivector_cleanup(&tree->tree2d); in HuffmanTree_cleanup()
462 …if(!uivector_resize(&tree->tree2d, tree->numcodes * 2)) return 9901; /*if failed return not enough… in HuffmanTree_make2DTree()
465 …for(n = 0; n < tree->numcodes * 2; n++) tree->tree2d.data[n] = 32767; /*32767 here means the tree… in HuffmanTree_make2DTree()
472 if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
476 tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
482 …tree->tree2d.data[2 * treepos + bit] = nodefilled + tree->numcodes; /*addresses encoded with numco… in HuffmanTree_make2DTree()
486 else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
488 …for(n = 0; n < tree->numcodes * 2; n++) if(tree->tree2d.data[n] == 32767) tree->tree2d.data[n] = … in HuffmanTree_make2DTree()
[all …]
|
| /dports/science/simbody/simbody-Simbody-3.7/Simbody/Visualizer/simbody-visualizer/ |
| H A D | lodepng.cpp | 456 uivector tree2d; member
478 uivector_init(&tree->tree2d); in HuffmanTree_init()
485 uivector_cleanup(&tree->tree2d); in HuffmanTree_cleanup()
497 if(!uivector_resize(&tree->tree2d, tree->numcodes * 2)) return 9901; in HuffmanTree_make2DTree()
500 …for(n = 0; n < tree->numcodes * 2; n++) tree->tree2d.data[n] = 32767; /*32767 here means the tree… in HuffmanTree_make2DTree()
508 if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
512 tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
518 …tree->tree2d.data[2 * treepos + bit] = nodefilled + tree->numcodes; /*addresses encoded with numco… in HuffmanTree_make2DTree()
522 else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
528 … if(tree->tree2d.data[n] == 32767) tree->tree2d.data[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/games/openxcom/OpenXcom-1.0/src/ |
| H A D | lodepng.cpp | 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()
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()
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bimg/3rdparty/lodepng/ |
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/games/craft/Craft-1.0fbsd/deps/lodepng/ |
| H A D | lodepng.c | 497 unsigned* tree2d; member
519 tree->tree2d = 0; in HuffmanTree_init()
526 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
538 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
539 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
562 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
566 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
575 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
579 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
585 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/audio/drumgizmo/drumgizmo-0.9.19/plugingui/lodepng/ |
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/emulators/nestopia/nestopia-1.51.1/source/fltkui/ |
| H A D | png.cpp | 505 unsigned* tree2d; member
527 tree->tree2d = 0; in HuffmanTree_init()
534 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
546 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
547 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
571 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
575 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
584 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
588 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
594 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/devel/love/love-11.3/src/libraries/lodepng/ |
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/devel/love10/love-0.10.2/src/libraries/lodepng/ |
| H A D | lodepng.cpp | 510 unsigned* tree2d; member
532 tree->tree2d = 0; in HuffmanTree_init()
539 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
551 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
552 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
576 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
580 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
589 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
593 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
599 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/science/ascent/ascent-0.7.1-66-gbcf2742a/src/thirdparty_builtin/lodepng/ |
| H A D | lodepng.cpp | 492 unsigned* tree2d; member
514 tree->tree2d = 0; in HuffmanTree_init()
521 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
533 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
534 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
558 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
562 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
571 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
575 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
581 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bimg/3rdparty/lodepng/ |
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/misc/dartsim/dart-6.11.1/dart/external/lodepng/ |
| H A D | lodepng.cpp | 511 unsigned* tree2d; member
533 tree->tree2d = 0; in HuffmanTree_init()
540 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
552 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
553 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
577 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
581 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
590 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
594 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
600 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|
| /dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/examples/graph/stereo/ |
| H A D | lodepng.cpp | 528 unsigned* tree2d; member
550 tree->tree2d = 0; in HuffmanTree_init()
557 lodepng_free(tree->tree2d); in HuffmanTree_cleanup()
569 tree->tree2d = (unsigned*)lodepng_malloc(tree->numcodes * 2 * sizeof(unsigned)); in HuffmanTree_make2DTree()
570 if(!tree->tree2d) return 83; /*alloc fail*/ in HuffmanTree_make2DTree()
594 if(tree->tree2d[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
598 tree->tree2d[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
607 tree->tree2d[2 * treepos + bit] = nodefilled + tree->numcodes; in HuffmanTree_make2DTree()
611 else treepos = tree->tree2d[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
617 if(tree->tree2d[n] == 32767) tree->tree2d[n] = 0; /*remove possible remaining 32767's*/ in HuffmanTree_make2DTree()
[all …]
|