Home
last modified time | relevance | path

Searched refs:ins_len (Results 1 – 4 of 4) sorted by relevance

/linux/tools/perf/util/
H A Dllvm.c203 unsigned int ins_len; in symbol__disassemble_llvm()
212 ins_len = LLVMDisasmInstruction(disasm, (u8 *)(buf + offset), in symbol__disassemble_llvm()
215 if (ins_len == 0) in symbol__disassemble_llvm()
263 pc += ins_len; in symbol__disassemble_llvm()
264 offset += ins_len; in symbol__disassemble_llvm()
197 unsigned int ins_len; symbol__disassemble_llvm() local
/linux/fs/btrfs/
H A Dctree.c1618 struct extent_buffer *b, int level, int ins_len, in setup_nodes_for_search() argument
1624 if ((p->search_for_split || ins_len > 0) && btrfs_header_nritems(b) >= in setup_nodes_for_search()
1637 } else if (ins_len < 0 && btrfs_header_nritems(b) < in setup_nodes_for_search()
1840 int ins_len, in search_leaf() argument
1856 if (ins_len > 0) { in search_leaf()
1867 if (path->locks[1] && leaf_free_space >= ins_len) { in search_leaf()
1931 if (ins_len > 0) { in search_leaf()
1942 ASSERT(ins_len >= sizeof(struct btrfs_item)); in search_leaf()
1943 ins_len -= sizeof(struct btrfs_item); in search_leaf()
1948 if (leaf_free_space < ins_len) { in search_leaf()
[all …]
H A Dctree.h597 int ins_len, int cow);
H A Dfile-item.c258 int ins_len = mod < 0 ? -1 : 0; in btrfs_lookup_file_extent() local
265 return btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); in btrfs_lookup_file_extent()