Lines Matching refs:fname
403 struct fname {
407 struct fname *next;
420 struct fname *fname, *next;
422 rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash)
423 while (fname) {
424 struct fname *old = fname;
425 fname = fname->next;
453 * Given a directory entry, enter it into the fname rb tree.
465 struct fname *fname, *new_fn;
472 /* Create and allocate the fname structure */
473 len = sizeof(struct fname) + ent_name->len + 1;
486 fname = rb_entry(parent, struct fname, rb_hash);
492 if ((new_fn->hash == fname->hash) &&
493 (new_fn->minor_hash == fname->minor_hash)) {
494 new_fn->next = fname->next;
495 fname->next = new_fn;
499 if (new_fn->hash < fname->hash)
501 else if (new_fn->hash > fname->hash)
503 else if (new_fn->minor_hash < fname->minor_hash)
505 else /* if (new_fn->minor_hash > fname->minor_hash) */
518 * for all entries on the fname linked list. (Normally there is only
522 struct fname *fname)
528 if (!fname) {
530 "called with null fname?!?", __func__, __LINE__,
534 ctx->pos = hash2pos(file, fname->hash, fname->minor_hash);
535 while (fname) {
536 if (!dir_emit(ctx, fname->name,
537 fname->name_len,
538 fname->inode,
539 get_dtype(sb, fname->file_type))) {
540 info->extra_fname = fname;
543 fname = fname->next;
552 struct fname *fname;
609 fname = rb_entry(info->curr_node, struct fname, rb_hash);
610 info->curr_hash = fname->hash;
611 info->curr_minor_hash = fname->minor_hash;
612 if (call_filldir(file, ctx, fname))
617 fname = rb_entry(info->curr_node, struct fname,
619 info->curr_hash = fname->hash;
620 info->curr_minor_hash = fname->minor_hash;