btstack (reference) in projects: kernel - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:btstack (Results 1 - 10 of 10) sorted by relevance

/kernel/linux/linux-5.10/fs/jfs/
H A D	jfs_btree.h	`105 struct btstack { struct 111 #define BT_CLR(btstack)\ 112 (btstack)->top = (btstack)->stack 114 #define BT_STACK_FULL(btstack)\ 115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1])) 125 #define BT_POP(btstack)\ 126 ( (btstack)->top == (btstack) 131 BT_STACK_DUMP(struct btstack *btstack) BT_STACK_DUMP() argument [all...]`
H A D	jfs_xtree.c	105 struct btstack * btstack, int flag); 109 struct xtsplit * split, struct btstack * btstack); 119 xtpage_t * fp, struct btstack * btstack); 123 int cmpp, struct btstack btstack, int flag); 137 struct btstack btstack; in xtLookup() local 226 xtSearch(struct inode ip, s64 xoff, s64 nextp, int cmpp, struct btstack btstack, int flag) xtSearch() argument 534 struct btstack btstack; /* traverse stack / xtInsert() local 675 xtSplitUp(tid_t tid, struct inode ip, struct xtsplit * split, struct btstack * btstack) xtSplitUp() argument 1358 struct btstack btstack; /* traverse stack / xtExtend() local 1521 struct btstack btstack; / traverse stack / xtTailgate() local 1700 struct btstack btstack; / traverse stack / xtUpdate() local 2167 struct btstack btstack; / traverse stack / xtAppend() local 2329 struct btstack btstack; xtDelete() local 2397 xtDeleteUp(tid_t tid, struct inode ip, struct metapage * fmp, xtpage_t * fp, struct btstack * btstack) xtDeleteUp() argument 2568 struct btstack btstack; /* traverse stack / xtRelocate() local 2878 xtSearchNode(struct inode ip, xad_t * xad, int cmpp, struct btstack btstack, int flag) xtSearchNode() argument 3160 struct btstack btstack; xtTruncate() local 3708 struct btstack btstack; xtTruncate_pmap() local [all...]
H A D	namei.c	70 struct btstack btstack; in jfs_create() local 113 if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) { in jfs_create() 137 if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) { in jfs_create() 202 struct btstack btstack; in jfs_mkdir() local 245 if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) { in jfs_mkdir() 269 if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) { in jfs_mkdir() 792 struct btstack btstack; in jfs_link() local 884 struct btstack btstack; jfs_symlink() local 1070 struct btstack btstack; jfs_rename() local 1356 struct btstack btstack; jfs_mknod() local 1448 struct btstack btstack; jfs_lookup() local [all...]
H A D	jfs_dtree.c	140 struct dtsplit * split, struct btstack * btstack); 146 struct dtsplit * split, struct btstack * btstack); 152 dtpage_t * fp, struct btstack * btstack); 156 static int dtReadFirst(struct inode ip, struct btstack btstack); 159 loff_t * offset, struct btstack * btstack); 567 dtSearch(struct inode ip, struct component_name key, ino_t * data, struct btstack * btstack, int flag) dtSearch() argument 814 dtInsert(tid_t tid, struct inode ip, struct component_name name, ino_t * fsn, struct btstack * btstack) dtInsert() argument 923 dtSplitUp(tid_t tid, struct inode ip, struct dtsplit split, struct btstack * btstack) dtSplitUp() argument 1635 dtExtendPage(tid_t tid, struct inode ip, struct dtsplit split, struct btstack * btstack) dtExtendPage() argument 2083 struct btstack btstack; dtDelete() local 2230 dtDeleteUp(tid_t tid, struct inode ip, struct metapage fmp, dtpage_t * fp, struct btstack * btstack) dtDeleteUp() argument 2446 struct btstack btstack; dtRelocate() local 2635 dtSearchNode(struct inode ip, s64 lmxaddr, pxd_t kpxd, struct btstack * btstack) dtSearchNode() argument 3014 struct btstack btstack; jfs_readdir() local 3335 dtReadFirst(struct inode ip, struct btstack btstack) dtReadFirst() argument 3407 dtReadNext(struct inode ip, loff_t offset, struct btstack * btstack) dtReadNext() argument 4520 struct btstack btstack; dtModify() local [all...]
H A D	jfs_dtree.h	`244 ino_t * data, struct btstack * btstack, int flag); 247 ino_t * ino, struct btstack * btstack);`
/kernel/linux/linux-6.6/fs/jfs/
H A D	jfs_btree.h	`105 struct btstack { struct 111 #define BT_CLR(btstack)\ 112 (btstack)->top = (btstack)->stack 114 #define BT_STACK_FULL(btstack)\ 115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1])) 125 #define BT_POP(btstack)\ 126 ( (btstack)->top == (btstack) 131 BT_STACK_DUMP(struct btstack *btstack) BT_STACK_DUMP() argument [all...]`
H A D	jfs_xtree.c	105 struct btstack * btstack, int flag); 109 struct xtsplit * split, struct btstack * btstack); 126 struct btstack btstack; in xtLookup() local 152 if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) { in xtLookup() 164 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index); in xtLookup() 207 * btstack - traverse stack; 211 * btstack contain 215 xtSearch(struct inode ip, s64 xoff, s64 nextp, int cmpp, struct btstack btstack, int flag) xtSearch() argument 523 struct btstack btstack; /* traverse stack / xtInsert() local 664 xtSplitUp(tid_t tid, struct inode ip, struct xtsplit * split, struct btstack * btstack) xtSplitUp() argument 1347 struct btstack btstack; /* traverse stack / xtExtend() local 1506 struct btstack btstack; / traverse stack / xtUpdate() local 1952 struct btstack btstack; / traverse stack */ xtAppend() local 2199 struct btstack btstack; xtTruncate() local 2747 struct btstack btstack; xtTruncate_pmap() local [all...]
H A D	namei.c	70 struct btstack btstack; in jfs_create() local 113 if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) { in jfs_create() 137 if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) { in jfs_create() 203 struct btstack btstack; in jfs_mkdir() local 246 if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) { in jfs_mkdir() 270 if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) { in jfs_mkdir() 793 struct btstack btstack; in jfs_link() local 885 struct btstack btstack; jfs_symlink() local 1071 struct btstack btstack; jfs_rename() local 1357 struct btstack btstack; jfs_mknod() local 1449 struct btstack btstack; jfs_lookup() local [all...]
H A D	jfs_dtree.c	140 struct dtsplit * split, struct btstack * btstack); 146 struct dtsplit * split, struct btstack * btstack); 152 dtpage_t * fp, struct btstack * btstack); 156 static int dtReadFirst(struct inode ip, struct btstack btstack); 159 loff_t * offset, struct btstack * btstack); 567 dtSearch(struct inode ip, struct component_name key, ino_t * data, struct btstack * btstack, int flag) dtSearch() argument 814 dtInsert(tid_t tid, struct inode ip, struct component_name name, ino_t * fsn, struct btstack * btstack) dtInsert() argument 923 dtSplitUp(tid_t tid, struct inode ip, struct dtsplit split, struct btstack * btstack) dtSplitUp() argument 1635 dtExtendPage(tid_t tid, struct inode ip, struct dtsplit split, struct btstack * btstack) dtExtendPage() argument 2083 struct btstack btstack; dtDelete() local 2230 dtDeleteUp(tid_t tid, struct inode ip, struct metapage fmp, dtpage_t * fp, struct btstack * btstack) dtDeleteUp() argument 2716 struct btstack btstack; jfs_readdir() local 3037 dtReadFirst(struct inode ip, struct btstack btstack) dtReadFirst() argument 3109 dtReadNext(struct inode ip, loff_t offset, struct btstack * btstack) dtReadNext() argument 4222 struct btstack btstack; dtModify() local [all...]
H A D	jfs_dtree.h	`244 ino_t * data, struct btstack * btstack, int flag); 247 ino_t * ino, struct btstack * btstack);`

Completed in 10 milliseconds