Lines Matching refs:header

136 	struct header	header;  in read_entry()  local
156 read(fd, &header, sizeof (header)); in read_entry()
159 header.magic = swap(header.magic); in read_entry()
160 header.name_size = swap(header.name_size); in read_entry()
161 header.bool_count = swap(header.bool_count); in read_entry()
162 header.num_count = swap(header.num_count); in read_entry()
163 header.str_count = swap(header.str_count); in read_entry()
164 header.str_size = swap(header.str_size); in read_entry()
167 if (header.magic != MAGIC) { in read_entry()
172 read(fd, TermNames, min(127, header.name_size)); in read_entry()
174 if (header.name_size > 127) in read_entry()
175 lseek(fd, (long)(header.name_size - 127), 1); in read_entry()
180 read(fd, UB, min(BoolCount, header.bool_count)); in read_entry()
181 if (header.bool_count > BoolCount) in read_entry()
182 lseek(fd, (long)(header.bool_count - BoolCount), 1); in read_entry()
184 for (i = header.bool_count; i < BoolCount; i++) in read_entry()
187 if ((header.name_size + header.bool_count) % 2 != 0) in read_entry()
191 read(fd, (char *)UN, min(NumCount, header.num_count) * 2); in read_entry()
193 for (i = 0; i < min(header.num_count, NumCount); i++) { in read_entry()
208 if (header.num_count > NumCount) in read_entry()
209 lseek(fd, (long)(2 * (header.num_count - NumCount)), 1); in read_entry()
211 for (i = header.num_count; i < NumCount; i++) in read_entry()
216 pst = malloc((unsigned)header.str_size); in read_entry()
226 num_strings = min(StrCount, header.str_count); in read_entry()
271 if (header.str_count > StrCount) in read_entry()
272 lseek(fd, (long)(2 * (header.str_count - StrCount)), 1); in read_entry()
273 else for (i = header.str_count; i < StrCount; i++) in read_entry()
276 numread = read(fd, pst, header.str_size); in read_entry()
278 if (numread != header.str_size) in read_entry()