text stringlengths 0 234 |
|---|
StackPtr := StackPtr + 1; |
end if; |
-- Here we scan back along the linked list of prefixes, pushing |
-- helpless characters (ie. suffixes) onto the stack as we do so. |
while Code >= FirstFree loop |
Stack (StackPtr) := Suffix (Code); |
StackPtr := StackPtr + 1; |
Code := Prefix (Code); |
end loop; |
-- Push the last character on the stack, and set up the new |
-- prefix and suffix, and if the required slot number is greater |
-- than that allowed by the current bit size, increase the bit |
-- size. (NOTE - If we are all full, we *don't* save the new |
-- suffix and prefix... I'm not certain if this is correct... |
-- it might be more proper to overwrite the last code... |
Stack (StackPtr) := Code rem 256; |
if Slot < TopSlot then |
Suffix (Slot) := Code rem 256; |
Fc := Code; |
Prefix (Slot) := Oc; |
Slot := Slot + 1; |
Oc := C; |
end if; |
if Slot >= TopSlot then |
if CurrSize < 12 then |
TopSlot := TopSlot * 2; |
CurrSize := CurrSize + 1; |
end if; |
end if; |
-- Now that we've pushed the decoded string (in reverse order) |
-- onto the stack, lets pop it off and output it... |
loop |
Next_Pixel(Stack (StackPtr)); |
exit when StackPtr = 0; |
StackPtr := StackPtr - 1; |
end loop; |
end if; |
C := Read_Code; |
end loop; |
if full_trace and then BadCodeCount > 0 then |
Ada.Text_IO.Put_Line( |
"Found" & Integer'Image(BadCodeCount) & |
" bad codes" |
); |
end if; |
end GIF_Decode; |
-- Here we have several specialized instances of GIF_Decode, |
-- with parameters known at compile-time -> optimizing compilers |
-- will do expensive tests about interlacing and transparency at compile-time, |
-- not at run-time. |
-- |
procedure GIF_Decode_interlaced_transparent_8 is |
new GIF_Decode(interlaced => True, transparency => True, pixel_mask => 255); |
procedure GIF_Decode_straight_transparent_8 is |
new GIF_Decode(interlaced => False, transparency => True, pixel_mask => 255); |
procedure GIF_Decode_interlaced_opaque_8 is |
new GIF_Decode(interlaced => True, transparency => False, pixel_mask => 255); |
procedure GIF_Decode_straight_opaque_8 is |
new GIF_Decode(interlaced => False, transparency => False, pixel_mask => 255); |
-- |
procedure Skip_sub_blocks is |
temp: U8; |
begin |
sub_blocks_sequence: |
loop |
Get_Byte(image.buffer, temp ); -- load sub-block length byte |
Raw_Byte(temp); |
exit sub_blocks_sequence when temp = 0; |
-- null sub-block = end of sub-block sequence |
for i in 1..temp loop |
Get_Byte(image.buffer, temp ); -- load sub-block byte |
Raw_Byte(temp); |
end loop; |
end loop sub_blocks_sequence; |
end Skip_sub_blocks; |
temp, temp2, label: U8; |
delay_frame: U16; |
c: Character; |
frame_interlaced: Boolean; |
frame_transparency: Boolean:= False; |
local_palette : Boolean; |
-- |
separator : Character ; |
-- Colour information |
new_num_of_colours : Natural; |
pixel_mask : U32; |
BitsPerPixel : Natural; |
begin -- Load |
next_frame:= 0.0; |
-- Scan various GIF blocks, until finding an image |
loop |
Get_Byte(image.buffer, temp); |
Raw_Byte(temp); |
separator:= Character'Val(temp); |
if full_trace then |
Ada.Text_IO.Put( |
"GIF separator [" & separator & |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.