Home
last modified time | relevance | path

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

/linux-2.4.37.9/fs/hfs/
Dbdelete.c43 static void bdelete_nonempty(struct hfs_brec *brec, struct hfs_belem *belem) in bdelete_nonempty() argument
48 struct hfs_bnode *bnode = belem->bnr.bn; in bdelete_nonempty()
50 rec = belem->record; in bdelete_nonempty()
298 struct hfs_belem *belem = brec->bottom; in bdelete() local
299 struct hfs_belem *parent = (belem-1); in bdelete()
307 while ((belem > brec->top) && in bdelete()
308 (belem->flags & (HFS_BPATH_UNDERFLOW | HFS_BPATH_FIRST))) { in bdelete()
309 bnode = belem->bnr.bn; in bdelete()
310 fix_key = belem->flags & HFS_BPATH_FIRST; in bdelete()
313 bdelete_nonempty(brec, belem); in bdelete()
[all …]
Dbfind.c270 struct hfs_belem *belem; in hfs_bsucc() local
273 if (!brec || !(belem = brec->bottom) || (belem != brec->top) || in hfs_bsucc()
274 !(bn = belem->bnr.bn) || (bn->magic != HFS_BNODE_MAGIC) || in hfs_bsucc()
282 int left = bn->ndNRecs - belem->record; in hfs_bsucc()
290 hfs_brec_relse(brec, belem); in hfs_bsucc()
295 hfs_brec_relse(brec, belem); in hfs_bsucc()
298 old = belem->bnr; in hfs_bsucc()
299 belem->bnr = hfs_bnode_find(brec->tree, node, in hfs_bsucc()
300 belem->bnr.lock_type); in hfs_bsucc()
302 if (!(bn = belem->bnr.bn)) { in hfs_bsucc()
[all …]
Dbins_del.c47 void hfs_bnode_update_key(struct hfs_brec *brec, struct hfs_belem *belem, in hfs_bnode_update_key() argument
50 int record = (--belem)->record + offset; in hfs_bnode_update_key()
55 memcpy(1+bnode_key(belem->bnr.bn, record), key, keysize); in hfs_bnode_update_key()
64 while ((belem > limit) && (record == 1)) { in hfs_bnode_update_key()
65 record = (--belem)->record; in hfs_bnode_update_key()
66 memcpy(1+belem_key(belem), key, keysize); in hfs_bnode_update_key()
222 const struct hfs_belem *belem = brec->bottom; in hfs_bnode_in_brec() local
224 while (belem && (belem >= brec->top)) { in hfs_bnode_in_brec()
225 if (belem->bnr.bn && (belem->bnr.bn->node == node)) { in hfs_bnode_in_brec()
228 --belem; in hfs_bnode_in_brec()
Dbinsert.c60 static void binsert_nonfull(struct hfs_brec *brec, struct hfs_belem *belem, in binsert_nonfull() argument
66 struct hfs_bnode *bnode = belem->bnr.bn; in binsert_nonfull()
68 rec = ++(belem->record); in binsert_nonfull()
377 struct hfs_belem *belem = brec->bottom; in binsert() local
382 while ((belem >= brec->top) && (belem->flags & HFS_BPATH_OVERFLOW)) { in binsert()
383 left = belem->bnr; in binsert()
392 right = split(belem, ROUND(keysize+1) + ROUND(datasize)); in binsert()
401 binsert_nonfull(brec, belem, key, data, keysize, datasize); in binsert()
403 if (belem->bnr.bn == left.bn) { in binsert()
405 if (belem->record == 1) { in binsert()
[all …]