protocol-hpack 1.5.0 → 1.5.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3d664c70ae90134d28bf5491fe5f46612ce17292d8ebdc06daba9e423459501e
-  data.tar.gz: 0ede73ffcfb63a755022f3212309ce6ce4a74dcebd819f0287f8cf610a17fbee
+  metadata.gz: ad81d71708c7c92bb94e9616655872045a31052aa62c3543487064ddea8c99ad
+  data.tar.gz: 1945361f8e8576ef3db44de1e0cf44554795699d910c40b8659232a499ded6b8
 SHA512:
-  metadata.gz: a194f5bbdfdbb5552f0ca6216b9cbb314bb5590a10316d51f99578961ebd3247bfa3aea6f3f8430f0e2f34ec89e9a18574c7080988f5cfde571b58ed8d6b143e
-  data.tar.gz: e11f0747b74859d27a2834350e46c49ea573e71f772687b387d6b4e4d1fd6b3033bc2c99537961fe2c59944e0acb2e0aeb78c0d7a9dbeb681cb04391d7e0ebb2
+  metadata.gz: c0537372d9278691fa9621622b84f32facde4f9efdfbfd0c36eb7573bba4b19ec05bc91f5191a7463405cbed952c4c6ac614531c4c0fc0b26707196db8d800b3
+  data.tar.gz: fc53196d54e9b02a56df5c1294e819f5a4002c49201811c12d2666725a0325e27df75603afc4b04a5fc5c1845237937097bf51352ea4d5f1c3741d1b73fa244a

data/lib/protocol/hpack/compressor.rb

@@ -13,8 +13,8 @@
 # Copyright, 2020, by Justin Mazzocchi.
 # Copyright, 2024, by Nathan Froyd.
 
-require_relative 'context'
-require_relative 'huffman'
+require_relative "context"
+require_relative "huffman"
 
 module Protocol
 	module HPACK
@@ -75,22 +75,19 @@ module Protocol
 			# @param bits [Integer] number of available bits
 			# @return [String] binary string
 			def write_integer(value, bits)
-				limit = 2**bits - 1
+				limit = (1 << bits) - 1
 				
-				return write_bytes([value].pack('C')) if value < limit
+				return @buffer << value if value < limit
 				
-				bytes = []
-				bytes.push(limit) unless bits.zero?
+				@buffer << limit unless bits.zero?
 				
 				value -= limit
 				while value >= 128
-					bytes.push((value % 128) + 128)
+					@buffer << ((value & 0x7f) + 128)
 					value /= 128
 				end
 				
-				bytes.push(value)
-				
-				write_bytes(bytes.pack('C*'))
+				@buffer << value
 			end
 			
 			def huffman

data/lib/protocol/hpack/context.rb

@@ -5,7 +5,7 @@
 # Copyright, 2024, by Maruth Goyal.
 # Copyright, 2024, by Nathan Froyd.
 
-require_relative 'huffman'
+require_relative "huffman"
 
 module Protocol
 	# Implementation of header compression for HTTP 2.0 (HPACK) format adapted

data/lib/protocol/hpack/decompressor.rb

@@ -5,8 +5,8 @@
 # Copyright, 2024, by Maruth Goyal.
 # Copyright, 2024, by Nathan Froyd.
 
-require_relative 'context'
-require_relative 'huffman'
+require_relative "context"
+require_relative "huffman"
 
 module Protocol
 	module HPACK

data/lib/protocol/hpack/huffman/generator.rb

@@ -0,0 +1,186 @@
+# frozen_string_literal: true
+
+# Released under the MIT License.
+# Copyright, 2014, by Kaoru Maeda.
+# Copyright, 2015, by Tamir Duberstein.
+# Copyright, 2015, by Ilya Grigorik.
+# Copyright, 2016, by George Ulmer.
+# Copyright, 2018-2024, by Samuel Williams.
+# Copyright, 2024, by Nathan Froyd.
+
+require_relative "../huffman"
+require "set"
+
+module Protocol
+	module HPACK
+		class Huffman
+			module Generator
+				EOS = 256
+				
+				class Node
+					attr_accessor :next, :emit, :final, :depth
+					attr_accessor :transitions
+					attr_accessor :id
+					
+					@@id = 0
+					
+					def initialize(depth)
+						@next = [nil, nil]
+						@id = @@id
+						@@id += 1
+						@final = false
+						@depth = depth
+					end
+					
+					def add(code, len, chr)
+						self.final = true if chr == EOS && @depth <= 7
+						if len.zero?
+							@emit = chr
+						else
+							bit = (code & (1 << (len - 1))).zero? ? 0 : 1
+							node = @next[bit] ||= Node.new(@depth + 1)
+							node.add(code, len - 1, chr)
+						end
+					end
+					
+					class Transition
+						attr_accessor :emit, :node
+						def initialize(emit, node)
+							@emit = emit
+							@node = node
+						end
+					end
+					
+					def self.generate_tree
+						@root = new(0)
+						Protocol::HPACK::Huffman::CODES.each_with_index do |c, chr|
+							code, len = c
+							@root.add(code, len, chr)
+						end
+						puts "#{@@id} nodes"
+						@root
+					end
+					
+					def self.generate_machine
+						generate_tree
+						
+						# Using un-ordered sets (potentially) produces non-deterministic results:
+						togo = Set[@root]
+						@states = Set[@root]
+						
+						until togo.empty?
+							node = togo.first
+							togo.delete(node)
+							
+							next if node.transitions
+							node.transitions = Array[1 << BITS_AT_ONCE]
+							
+							(1 << BITS_AT_ONCE).times do |input|
+								n = node
+								emit = +""
+								(BITS_AT_ONCE - 1).downto(0) do |i|
+									bit = (input & (1 << i)).zero? ? 0 : 1
+									n = n.next[bit]
+									next unless n.emit
+									if n.emit == EOS
+										emit = EOS # cause error on decoding
+									else
+										emit << n.emit.chr(Encoding::BINARY) unless emit == EOS
+									end
+									n = @root
+								end
+								node.transitions[input] = Transition.new(emit, n)
+								togo << n
+								@states << n
+							end
+						end
+						puts "#{@states.size} states"
+						@root
+					end
+					
+					MACHINE_PATH = File.expand_path("machine.rb", __dir__)
+					
+					def self.generate_state_table(output_path = MACHINE_PATH)
+						generate_machine
+						state_id = {}
+						id_state = {}
+						state_id[@root] = 0
+						id_state[0] = @root
+						max_final = 0
+						id = 1
+						(@states - [@root]).sort_by {|s| s.final ? 0 : 1}.each do |s|
+							state_id[s] = id
+							id_state[id] = s
+							max_final = id if s.final
+							id += 1
+						end
+
+						File.open(output_path, "w") do |file|
+							file.print <<~HEADER
+								# frozen_string_literal: true
+
+								# Released under the MIT License.
+								# Copyright, 2018-2024, by Samuel Williams.
+
+								# Machine generated Huffman decoder state machine.
+								# DO NOT EDIT THIS FILE.
+
+								module Protocol
+									module HPACK
+										class Huffman
+											# :nodoc:
+											MAX_FINAL_STATE = #{max_final}
+											MACHINE = [
+							HEADER
+							
+							id.times do |i|
+								n = id_state[i]
+								file.print "\t\t\t\t["
+								string = (1 << BITS_AT_ONCE).times.map do |t|
+									transition = n.transitions.fetch(t)
+									emit = transition.emit
+									unless emit == EOS
+										bytes = emit.bytes
+										fail ArgumentError if bytes.size > 1
+										emit = bytes.first
+									end
+									"[#{emit.inspect}, #{state_id.fetch(transition.node)}]"
+								end.join(", ")
+								file.print(string)
+								file.print "],\n"
+							end
+							
+							file.print <<~FOOTER
+											].each {|arr| arr.each {|subarr| subarr.each(&:freeze)}.freeze}.freeze
+										end
+									end
+								end
+							FOOTER
+						end
+					end
+					
+					class << self
+						attr_reader :root
+					end
+					
+					# Test decoder
+					def self.decode(input)
+						emit = ""
+						n = root
+						nibbles = input.unpack("C*").flat_map {|b| [((b & 0xf0) >> 4), b & 0xf]}
+						until nibbles.empty?
+							nb = nibbles.shift
+							t = n.transitions[nb]
+							emit << t.emit
+							n = t.node
+						end
+						unless n.final && nibbles.all? {|x| x == 0xf}
+							puts "len = #{emit.size} n.final = #{n.final} nibbles = #{nibbles}"
+						end
+						emit
+					end
+				end
+			end
+		end
+	end
+end