Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 10 of 10) sorted by relevance

/fs/jfs/
A Djfs_btree.h108 struct btframe stack[MAXTREEHEIGHT]; member
112 (btstack)->top = (btstack)->stack
115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
126 ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
129 ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
137 (long long)btstack->stack[i].bn, in BT_STACK_DUMP()
138 btstack->stack[i].index); in BT_STACK_DUMP()
/fs/bcachefs/
A Dutil.c297 stack->nr = 0; in bch2_save_backtrace()
298 int ret = darray_make_room_gfp(stack, 32, gfp); in bch2_save_backtrace()
306 nr_entries = stack_trace_save_tsk(task, stack->data, stack->size, skipnr + 1); in bch2_save_backtrace()
307 } while (nr_entries == stack->size && in bch2_save_backtrace()
308 !(ret = darray_make_room_gfp(stack, stack->size * 2, gfp))); in bch2_save_backtrace()
310 stack->nr = nr_entries; in bch2_save_backtrace()
321 darray_for_each(*stack, i) { in bch2_prt_backtrace()
329 bch_stacktrace stack = { 0 }; in bch2_prt_task_backtrace() local
330 int ret = bch2_save_backtrace(&stack, task, skipnr + 1, gfp); in bch2_prt_task_backtrace()
332 bch2_prt_backtrace(out, &stack); in bch2_prt_task_backtrace()
[all …]
A Dutil.h220 int bch2_save_backtrace(bch_stacktrace *stack, struct task_struct *, unsigned, gfp_t);
/fs/overlayfs/
A Dnamei.c634 struct ovl_path *stack = &origin; in ovl_verify_index() local
1162 stack = ovl_stack_alloc(ofs->numlayer - 1); in ovl_lookup()
1163 if (!stack) in ovl_lookup()
1235 stack[ctr].dentry = this; in ovl_lookup()
1236 stack[ctr].layer = lower.layer; in ovl_lookup()
1276 if (WARN_ON(stack != NULL)) { in ovl_lookup()
1280 stack = origin_path; in ovl_lookup()
1306 origin = stack[0].dentry; in ovl_lookup()
1324 ovl_stack_cpy(ovl_lowerstack(oe), stack, ctr); in ovl_lookup()
1396 ovl_stack_free(stack, ctr); in ovl_lookup()
[all …]
A Dutil.c133 void ovl_stack_put(struct ovl_path *stack, unsigned int n) in ovl_stack_put() argument
137 for (i = 0; stack && i < n; i++) in ovl_stack_put()
138 dput(stack[i].dentry); in ovl_stack_put()
141 void ovl_stack_free(struct ovl_path *stack, unsigned int n) in ovl_stack_free() argument
143 ovl_stack_put(stack, n); in ovl_stack_free()
144 kfree(stack); in ovl_stack_free()
A Dexport.c696 struct ovl_path *stack = &origin; in ovl_lower_fh_to_d() local
703 err = ovl_check_origin_fh(ofs, fh, false, NULL, &stack); in ovl_lower_fh_to_d()
748 err = ovl_check_origin_fh(ofs, fh, true, NULL, &stack); in ovl_lower_fh_to_d()
A Doverlayfs.h454 void ovl_stack_put(struct ovl_path *stack, unsigned int n);
455 void ovl_stack_free(struct ovl_path *stack, unsigned int n);
/fs/
A Dnamei.c647 } *stack, internal[EMBEDDED_LEVELS]; member
664 p->stack = p->internal; in __set_nameidata()
694 if (now->stack != now->internal) in restore_nameidata()
695 kfree(now->stack); in restore_nameidata()
707 nd->stack = p; in nd_alloc_stack()
734 struct saved *last = nd->stack + i; in drop_links()
754 path_put(&nd->stack[i].link); in terminate_walk()
799 struct saved *last = nd->stack + i; in legitimize_links()
1894 last = nd->stack + nd->depth++; in pick_link()
2493 name = nd->stack[--depth].name; in link_path_walk()
[all …]
A DMakefile16 stack.o fs_struct.o statfs.o fs_pin.o nsfs.o \
/fs/btrfs/
A Dsend.c3663 struct list_head *stack) in tail_append_pending_moves() argument
3666 list_add_tail(&moves->list, stack); in tail_append_pending_moves()
3670 list_add_tail(&moves->list, stack); in tail_append_pending_moves()
3671 list_splice_tail(&list, stack); in tail_append_pending_moves()
3682 LIST_HEAD(stack); in apply_children_dir_moves()
3690 tail_append_pending_moves(sctx, pm, &stack); in apply_children_dir_moves()
3692 while (!list_empty(&stack)) { in apply_children_dir_moves()
3693 pm = list_first_entry(&stack, struct pending_dir_move, list); in apply_children_dir_moves()
3701 tail_append_pending_moves(sctx, pm, &stack); in apply_children_dir_moves()
3706 while (!list_empty(&stack)) { in apply_children_dir_moves()
[all …]

Completed in 45 milliseconds