Searched refs:ROOT (Results 1 – 3 of 3) sorted by relevance
| /fs/jfs/ |
| A D | jfs_btree.h | 50 #define BT_PAGE(IP, MP, TYPE, ROOT)\ argument
51 (BT_IS_ROOT(MP) ? (TYPE *)&JFS_IP(IP)->ROOT : (TYPE *)(MP)->data)
54 #define BT_GETPAGE(IP, BN, MP, TYPE, SIZE, P, RC, ROOT)\ argument
59 P = (TYPE *)&JFS_IP(IP)->ROOT;\
142 #define BT_GETSEARCH(IP, LEAF, BN, MP, TYPE, P, INDEX, ROOT)\ argument
149 P = (TYPE *)&JFS_IP(IP)->ROOT;\
|
| A D | jfs_dmap.c | 1854 if (dp->tree.stree[ROOT] != L2BPERDMAP) { in dbAllocCtl()
2031 oldroot = dp->tree.stree[ROOT]; in dbAllocDmap()
2037 if (dp->tree.stree[ROOT] == oldroot) in dbAllocDmap()
2086 oldroot = dp->tree.stree[ROOT]; in dbFreeDmap()
2092 if (rc || (dp->tree.stree[ROOT] == oldroot)) in dbFreeDmap()
2504 oldroot = dcp->stree[ROOT]; in dbAdjCtl()
2549 if (dcp->stree[ROOT] != oldroot) { in dbAdjCtl()
2596 bmp->db_maxfreebud = dcp->stree[ROOT]; in dbAdjCtl()
2958 if (l2nb > tp->dmt_stree[ROOT]) in dbFindLeaf()
3257 oldroot = tp->stree[ROOT]; in dbAllocDmapBU()
[all …]
|
| A D | jfs_dmap.h | 24 #define ROOT 0 /* index of the root of a tree */ macro
|
Completed in 11 milliseconds