Lines Matching defs:header
57 index_header header;
191 header = *(index_header *)addr;
192 if (header.magic != INDEX_MAGIC) {
196 if (header.version != INDEX_VERSION) {
198 name, header.version, INDEX_VERSION);
201 int sz = (header.tags_size * sizeof(tag)
202 + header.lists_size * sizeof(int)
203 + header.table_size * sizeof(int)
204 + header.strings_size
205 + sizeof(header));
211 tags = (tag *)(addr + sizeof(header));
212 lists = (int *)(tags + header.tags_size);
213 table = (int *)(lists + header.lists_size);
214 pool = (char *)(table + header.table_size);
216 key_buffer = new char[header.truncate];
225 if (lists[header.lists_size - 1] >= 0)
228 for (i = 0; i < header.table_size; i++) {
230 if (li >= header.lists_size)
234 if (*ptr >= header.tags_size)
241 for (i = 0; i < header.tags_size; i++) {
242 if (tags[i].filename_index >= header.strings_size)
249 if (pool[header.strings_size - 1] != '\0')
265 return filename_id + header.strings_size + 1;
304 searcher(q, strlen(q), ind->ignore_fields, ind->header.truncate),
357 if (tagno < 0 || tagno >= indx->header.tags_size) {
470 if (len < header.shortest)
472 if (len > header.truncate)
473 len = header.truncate;
496 int li = table[int(hc % header.table_size)];
563 if (header.common <= 0)
572 common_words_table_size = 2*header.common + 1;
587 if (key_len < header.truncate)
591 if (key_len >= header.shortest) {
602 if (++count >= header.common)
624 const char *pool_end = pool + header.strings_size;