1 /* Project 16 Source Code~
2 * Copyright (C) 2012-2016 sparky4 & pngwen & andrius4669 & joncampbell123 & yakui-lover
4 * This file is part of Project 16.
6 * Project 16 is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 3 of the License, or
9 * (at your option) any later version.
11 * Project 16 is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>, or
18 * write to the Free Software Foundation, Inc., 51 Franklin Street,
19 * Fifth Floor, Boston, MA 02110-1301 USA.
22 #include "src/lib/16_vrs.h"
23 #include "src/lib/typdefst.h"
25 // Read .vrs file into far memory
26 int read_vrs(global_game_variables_t *gvar, char *filename, struct vrs_container *vrs_cont){
31 void __based(seg)* bigbuffer;
37 vrl1_vgax_offset_t **vrl_line_offsets;
38 uint32_t huge *vrl_headers_offsets;
39 uint32_t huge *vrl_id_iter;
42 struct vrl1_vgax_header huge *curr_vrl;
45 // Open filename, get size of file,
46 // populate the vrs_container if all tests pass
47 fd = open(filename, O_RDONLY|O_BINARY);
48 // Insert sanity cheks later
49 size = lseek(fd, 0, SEEK_END);
50 buffer = malloc(size);
51 lseek(fd, 0, SEEK_SET);
52 read(fd, buffer, size);
56 fprintf(stderr, "Unablee to load file");
59 vrs_cont->size = size;
60 vrs_cont->buffer = buffer;
62 // Calculate vrl offsets
65 vrl_id_iter = (uint32_t huge *)(buffer + vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_SPRITE_ID_LIST]);
66 while(vrl_id_iter[num_of_vrl]){
69 // Allocate memory for vrl line offsets table
70 vrl_line_offsets = malloc(sizeof(vrl1_vgax_offset_t)*num_of_vrl);
72 vrl_headers_offsets = (uint32_t huge *)(buffer + vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_VRS_LIST]);
73 // Calculate line offsets for each vrl
74 for(i = 0; i < num_of_vrl; i++){
75 curr_vrl = (struct vrl1_vgax_header huge *)(buffer + vrl_headers_offsets[i]);
77 // Calc. vrl size as (next_offset - curr_offset)
78 if (i != num_of_vrl - 1){
79 vrl_size = vrl_headers_offsets[i+1] - vrl_headers_offsets[i];
81 // If it's the last vrl, size is (next_vrs_struct_offset - curr_offset)
83 vrl_size = vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_SPRITE_ID_LIST] - vrl_headers_offsets[i];
85 vrl_line_offsets[i] = vrl1_vgax_genlineoffsets(curr_vrl, (byte *)curr_vrl + sizeof(*curr_vrl), vrl_size - sizeof(*curr_vrl));
87 vrs_cont->vrl_line_offsets = vrl_line_offsets;
91 // Seek and return a specified .vrl blob from .vrs blob in far memory
92 struct vrl_container * get_vrl_by_id(struct vrs_container /*huge*/ *vrs_cont, uint16_t id){
94 uint32_t huge *vrl_offs_list;
95 struct vrl_container huge *vrl_cont;
98 // If id is invalid, return null
100 // Probably add an error message?
104 // Get id list from .vrs blob (base + offset)
105 ids = (uint16_t huge*)vrs_cont->buffer +
106 (dword)vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_SPRITE_ID_LIST];
108 // Loop through the id list until we found the right one or hit the end of the list
109 // Counter is keeping track of the offset(in ids/vrl blobs)
110 while(ids[counter] != id && ids[counter]){
113 // Return null if we couldn't find the requested id
119 // Get vrl offsets list from .vrs blob (base + offset)
120 vrl_offs_list = (uint32_t huge *)(vrs_cont->buffer +
121 vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_VRS_LIST]);
123 // Allocate memory for vrl_cont
124 vrl_cont = (struct vrl_container *)malloc(sizeof(struct vrl_container));
126 // Get vrl_header from .vrs (base + offset from vrl_list)
127 // Counter is number of vrls to skip (ids and vrls are aligned according to the .vrs specification)
128 vrl_cont->vrl_header = (struct vrl1_vgax_header huge *)(vrs_cont->buffer + vrl_offs_list[counter]);
130 // Get .vrl size by integer arithmetics (next vrl offset - current vrl offset)
132 vrl_cont->size = vrl_offs_list[counter+1] - vrl_offs_list[counter];
134 // If we are retriving the last vrl, size is ids_list offset - current vrl offset, as next vrl offs is 0
136 vrl_cont->size = vrs_cont->vrs_hdr->offset_table[VRS_HEADER_OFFSET_SPRITE_ID_LIST] - vrl_offs_list[counter];
139 // Retrive line offsets form .vrs
140 vrl_cont->line_offsets = vrs_cont->vrl_line_offsets[counter];