Home
last modified time | relevance | path

Searched refs:abp (Results 1 – 2 of 2) sorted by relevance

/dragonfly/sys/vfs/hpfs/
HDhpfs.h152 #define AB_ALLEAF(abp) ((alleaf_t *)((caddr_t)(abp) + sizeof(alblk_t))) argument
153 #define AB_ALNODE(abp) ((alnode_t *)((caddr_t)(abp) + sizeof(alblk_t))) argument
154 #define AB_FREEALP(abp) ((alleaf_t *)((caddr_t)(abp) + (abp)->ab_freeoff)) argument
155 #define AB_FREEANP(abp) ((alnode_t *)((caddr_t)(abp) + (abp)->ab_freeoff)) argument
156 #define AB_LASTALP(abp) (AB_ALLEAF(abp) + (abp)->ab_busycnt - 1) argument
157 #define AB_LASTANP(abp) (AB_ALNODE(abp) + (abp)->ab_busycnt - 1) argument
158 #define AB_ADDNREC(abp, sz, n) { \ argument
159 (abp)->ab_busycnt += (n); \
160 (abp)->ab_freecnt -= (n); \
161 (abp)->ab_freeoff += (n) * (sz); \
[all …]
HDhpfs_alsubr.c66 alblk_t * abp; in hpfs_hpbmap() local
74 abp = &hp->h_fn.fn_ab; in hpfs_hpbmap()
79 if (abp->ab_flag & AB_NODES) { in hpfs_hpbmap()
80 for (i=0; i<abp->ab_busycnt; i++, anp++) { in hpfs_hpbmap()
106 abp = &asp->as_ab; in hpfs_hpbmap()
114 for (i=0; i<abp->ab_busycnt; i++, alp++) { in hpfs_hpbmap()
213 alblk_t *abp; in hpfs_splitalsec() local
223 abp = &asp->as_ab; in hpfs_splitalsec()
225 n1 = (abp->ab_busycnt + 1) / 2; in hpfs_splitalsec()
226 n2 = (abp->ab_busycnt - n1); in hpfs_splitalsec()
[all …]