Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

New GIF export process #295

Merged
merged 1 commit into from
Aug 7, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions addons/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
# Addons

## gdgifexporter

- Upstream: https://github.com/jegor377/godot-gdgifexporter
- Version: git (9cdc448922717f069dd12e0377c1d9fc09d30f9f, 2020)
- License: MIT

Files extracted from source:
- `gdgifexporter/quantization/enhanced_uniform_quantization.gd`
21 changes: 21 additions & 0 deletions addons/gdgifexporter/LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
MIT License

Copyright (c) 2020 Igor Santarek

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
39 changes: 39 additions & 0 deletions addons/gdgifexporter/converter.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
extends Node


func setup(image: Image, colors: Array) -> PoolByteArray:
var vp = VisualServer.viewport_create()
var canvas = VisualServer.canvas_create()
VisualServer.viewport_attach_canvas(vp, canvas)
VisualServer.viewport_set_size(vp, image.get_width(), image.get_height())
VisualServer.viewport_set_disable_3d(vp, true)
VisualServer.viewport_set_usage(vp, VisualServer.VIEWPORT_USAGE_2D)
VisualServer.viewport_set_hdr(vp, true)
VisualServer.viewport_set_active(vp, true)

var ci_rid = VisualServer.canvas_item_create()
VisualServer.viewport_set_canvas_transform(vp, canvas, Transform())
VisualServer.canvas_item_set_parent(ci_rid, canvas)
var texture = ImageTexture.new()
texture.create_from_image(image)
VisualServer.canvas_item_add_texture_rect(ci_rid, Rect2(Vector2(0, 0), image.get_size()), texture)

var shader = preload("./lookup_similar.shader")
var mat_rid = VisualServer.material_create()
VisualServer.material_set_shader(mat_rid, shader.get_rid())
var lut = Image.new()
lut.create(256, 1, false, Image.FORMAT_RGB8)
lut.lock()
for i in 256:
lut.set_pixel(i, 0, Color8(colors[i][0], colors[i][1], colors[i][2]))
var lut_tex = ImageTexture.new()
lut_tex.create_from_image(lut)
VisualServer.material_set_param(mat_rid, "lut", lut_tex)
VisualServer.canvas_item_set_material(ci_rid, mat_rid)

VisualServer.viewport_set_update_mode(vp, VisualServer.VIEWPORT_UPDATE_ONCE)
VisualServer.viewport_set_vflip(vp, true)
VisualServer.force_draw(false)
image = VisualServer.texture_get_data(VisualServer.viewport_get_texture(vp))
image.convert(Image.FORMAT_R8)
return image.get_data()
21 changes: 21 additions & 0 deletions addons/gdgifexporter/gif-lzw/LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
MIT License

Copyright (c) 2020 Igor Santarek

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
38 changes: 38 additions & 0 deletions addons/gdgifexporter/gif-lzw/lsbbitpacker.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
extends Node


class LSB_LZWBitPacker:
var bit_index: int = 0
var byte: int = 0

var chunks: PoolByteArray = PoolByteArray([])

func get_bit(value: int, index: int) -> int:
return (value >> index) & 1

func set_bit(value: int, index: int) -> int:
return value | (1 << index)

func put_byte():
chunks.append(byte)
bit_index = 0
byte = 0

func write_bits(value: int, bits_count: int) -> void:
for i in range(bits_count):
if self.get_bit(value, i) == 1:
byte = self.set_bit(byte, bit_index)

bit_index += 1
if bit_index == 8:
self.put_byte()

func pack() -> PoolByteArray:
if bit_index != 0:
self.put_byte()
return chunks

func reset() -> void:
bit_index = 0
byte = 0
chunks = PoolByteArray([])
41 changes: 41 additions & 0 deletions addons/gdgifexporter/gif-lzw/lsbbitunpacker.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
extends Node


class LSB_LZWBitUnpacker:
var chunk_stream: PoolByteArray
var bit_index: int = 0
var byte: int
var byte_index: int = 0

func _init(_chunk_stream: PoolByteArray):
chunk_stream = _chunk_stream
self.get_byte()

func get_bit(value: int, index: int) -> int:
return (value >> index) & 1

func set_bit(value: int, index: int) -> int:
return value | (1 << index)

func get_byte():
byte = chunk_stream[byte_index]
byte_index += 1
bit_index = 0

func read_bits(bits_count: int) -> int:
var result: int = 0
var result_bit_index: int = 0

for _i in range(bits_count):
if self.get_bit(byte, bit_index) == 1:
result = self.set_bit(result, result_bit_index)
result_bit_index += 1
bit_index += 1

if bit_index == 8:
self.get_byte()

return result

func remove_bits(bits_count: int) -> void:
self.read_bits(bits_count)
202 changes: 202 additions & 0 deletions addons/gdgifexporter/gif-lzw/lzw.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,202 @@
extends Node


var lsbbitpacker = preload('./lsbbitpacker.gd')
var lsbbitunpacker = preload('./lsbbitunpacker.gd')

class CodeEntry:
var sequence: PoolByteArray
var raw_array: Array

func _init(_sequence):
raw_array = _sequence
sequence = _sequence

func add(other):
return CodeEntry.new(self.raw_array + other.raw_array)

func to_string():
var result: String = ''
for element in self.sequence:
result += str(element) + ', '
return result.substr(0, result.length() - 2)

class CodeTable:
var entries: Dictionary = {}
var counter: int = 0
var lookup: Dictionary = {}

func add(entry) -> int:
self.entries[self.counter] = entry
self.lookup[entry.raw_array] = self.counter
counter += 1
return counter

func find(entry) -> int:
return self.lookup.get(entry.raw_array, -1)

func has(entry) -> bool:
return self.find(entry) != -1

func get(index) -> CodeEntry:
return self.entries.get(index, null)

func to_string() -> String:
var result: String = 'CodeTable:\n'
for id in self.entries:
result += str(id) + ': ' + self.entries[id].to_string() + '\n'
result += 'Counter: ' + str(self.counter) + '\n'
return result

func log2(value: float) -> float:
return log(value) / log(2.0)

func get_bits_number_for(value: int) -> int:
if value == 0:
return 1
return int(ceil(log2(value + 1)))

func initialize_color_code_table(colors: PoolByteArray) -> CodeTable:
var result_code_table: CodeTable = CodeTable.new()
for color_id in colors:
# warning-ignore:return_value_discarded
result_code_table.add(CodeEntry.new([color_id]))
# move counter to the first available compression code index
var last_color_index: int = colors.size() - 1
var clear_code_index: int = pow(2, get_bits_number_for(last_color_index))
result_code_table.counter = clear_code_index + 2
return result_code_table

# compression and decompression done with source:
# http://www.matthewflickinger.com/lab/whatsinagif/lzw_image_data.asp

func compress_lzw(image: PoolByteArray, colors: PoolByteArray) -> Array:
# Initialize code table
var code_table: CodeTable = initialize_color_code_table(colors)
# Clear Code index is 2**<code size>
# <code size> is the amount of bits needed to write down all colors
# from color table. We use last color index because we can write
# all colors (for example 16 colors) with indexes from 0 to 15.
# Number 15 is in binary 0b1111, so we'll need 4 bits to write all
# colors down.
var last_color_index: int = colors.size() - 1
var clear_code_index: int = pow(2, get_bits_number_for(last_color_index))
var index_stream: PoolByteArray = image
var current_code_size: int = get_bits_number_for(clear_code_index)
var binary_code_stream = lsbbitpacker.LSB_LZWBitPacker.new()

# initialize with Clear Code
binary_code_stream.write_bits(clear_code_index, current_code_size)

# Read first index from index stream.
var index_buffer: CodeEntry = CodeEntry.new([index_stream[0]])
var data_index: int = 1
# <LOOP POINT>
while data_index < index_stream.size():
# Get the next index from the index stream.
var K: CodeEntry = CodeEntry.new([index_stream[data_index]])
data_index += 1
# Is index buffer + K in our code table?
var new_index_buffer: CodeEntry = index_buffer.add(K)
if code_table.has(new_index_buffer): # if YES
# Add K to the end of the index buffer
index_buffer = new_index_buffer
else: # if NO
# Add a row for index buffer + K into our code table
binary_code_stream.write_bits(code_table.find(index_buffer), current_code_size)

# We don't want to add new code to code table if we've exceeded 4095
# index.
var last_entry_index: int = code_table.counter - 1
if last_entry_index != 4095:
# Output the code for just the index buffer to our code stream
# warning-ignore:return_value_discarded
code_table.add(new_index_buffer)
else:
# if we exceeded 4095 index (code table is full), we should
# output Clear Code and reset everything.
binary_code_stream.write_bits(clear_code_index, current_code_size)
code_table = initialize_color_code_table(colors)
# get_bits_number_for(clear_code_index) is the same as
# LZW code size + 1
current_code_size = get_bits_number_for(clear_code_index)

# Detect when you have to save new codes in bigger bits boxes
# change current code size when it happens because we want to save
# flexible code sized codes
var new_code_size_candidate: int = get_bits_number_for(code_table.counter - 1)
if new_code_size_candidate > current_code_size:
current_code_size = new_code_size_candidate

# Index buffer is set to K
index_buffer = K
# Output code for contents of index buffer
binary_code_stream.write_bits(code_table.find(index_buffer), current_code_size)

# output end with End Of Information Code
binary_code_stream.write_bits(clear_code_index + 1, current_code_size)

var min_code_size: int = get_bits_number_for(clear_code_index) - 1

return [binary_code_stream.pack(), min_code_size]

func decompress_lzw(code_stream_data: PoolByteArray, min_code_size: int, colors: PoolByteArray) -> PoolByteArray:
var code_table: CodeTable = initialize_color_code_table(colors)
var index_stream: PoolByteArray = PoolByteArray([])
var binary_code_stream = lsbbitunpacker.LSB_LZWBitUnpacker.new(code_stream_data)
var current_code_size: int = min_code_size + 1
var clear_code_index: int = pow(2, min_code_size)

# CODE is an index of code table, {CODE} is sequence inside
# code table with index CODE. The same goes for PREVCODE.

# Remove first Clear Code from stream. We don't need it.
binary_code_stream.remove_bits(current_code_size)

# let CODE be the first code in the code stream
var code: int = binary_code_stream.read_bits(current_code_size)
# output {CODE} to index stream
index_stream.append_array(code_table.get(code).sequence)
# set PREVCODE = CODE
var prevcode: int = code
# <LOOP POINT>
while true:
# let CODE be the next code in the code stream
code = binary_code_stream.read_bits(current_code_size)
# Detect Clear Code. When detected reset everything and get next code.
if code == clear_code_index:
code_table = initialize_color_code_table(colors)
current_code_size = min_code_size + 1
code = binary_code_stream.read_bits(current_code_size)
elif code == clear_code_index + 1: # Stop when detected EOI Code.
break
# is CODE in the code table?
var code_entry: CodeEntry = code_table.get(code)
if code_entry != null: # if YES
# output {CODE} to index stream
index_stream.append_array(code_entry.sequence)
# let K be the first index in {CODE}
var K: CodeEntry = CodeEntry.new([code_entry.sequence[0]])
# warning-ignore:return_value_discarded
# add {PREVCODE} + K to the code table
code_table.add(code_table.get(prevcode).add(K))
# set PREVCODE = CODE
prevcode = code
else: # if NO
# let K be the first index of {PREVCODE}
var prevcode_entry: CodeEntry = code_table.get(prevcode)
var K: CodeEntry = CodeEntry.new([prevcode_entry.sequence[0]])
# output {PREVCODE} + K to index stream
index_stream.append_array(prevcode_entry.add(K).sequence)
# add {PREVCODE} + K to code table
# warning-ignore:return_value_discarded
code_table.add(prevcode_entry.add(K))
# set PREVCODE = CODE
prevcode = code

# Detect when we should increase current code size and increase it.
var new_code_size_candidate: int = get_bits_number_for(code_table.counter)
if new_code_size_candidate > current_code_size:
current_code_size = new_code_size_candidate

return index_stream
Loading