Lines Matching refs:array
20 struct dir_info *array;
80 db->array = 0;
98 db->array = (struct dir_info *)
129 &ctx->dir_info->array);
151 * the dir_info array needs to be sorted by inode number for
155 ctx->dir_info->array[ctx->dir_info->count-1].ino >= ino) {
157 if (ctx->dir_info->array[i-1].ino < ino)
159 dir = &ctx->dir_info->array[i];
162 ctx->dir_info->array[j] = ctx->dir_info->array[j-1];
164 dir = &ctx->dir_info->array[ctx->dir_info->count++];
219 if (ino == ctx->dir_info->array[low].ino) {
222 ctx->dir_info->array[low].dotdot,
223 ctx->dir_info->array[low].parent);
225 return &ctx->dir_info->array[low];
227 if (ino == ctx->dir_info->array[high].ino) {
230 ctx->dir_info->array[high].dotdot,
231 ctx->dir_info->array[high].parent);
233 return &ctx->dir_info->array[high];
240 if (ino == ctx->dir_info->array[mid].ino) {
243 ctx->dir_info->array[mid].dotdot,
244 ctx->dir_info->array[mid].parent);
246 return &ctx->dir_info->array[mid];
248 if (ino < ctx->dir_info->array[mid].ino)
371 printf("iter(%d, %d, %d)...", ctx->dir_info->array[iter->i].ino,
372 ctx->dir_info->array[iter->i].dotdot,
373 ctx->dir_info->array[iter->i].parent);
375 ctx->dir_info->last_lookup = ctx->dir_info->array + iter->i++;
