Searched refs:belem (Results 1 - 4 of 4) sorted by relevance
/asus-wl-520gu-7.0.1.45/src/linux/linux/fs/hfs/ |
H A D | bdelete.c | 19 * struct hfs_belem* belem: which node in 'brec' to delete from 26 * 'belem' points to a valid (struct hfs_belem) in 'brec'. 30 static void bdelete_nonempty(struct hfs_brec *brec, struct hfs_belem *belem) argument 35 struct hfs_bnode *bnode = belem->bnr.bn; 37 rec = belem->record; 285 struct hfs_belem *belem = brec->bottom; local 286 struct hfs_belem *parent = (belem-1); 294 while ((belem > brec->top) && 295 (belem->flags & (HFS_BPATH_UNDERFLOW | HFS_BPATH_FIRST))) { 296 bnode = belem 437 struct hfs_belem *belem; local [all...] |
H A D | bfind.c | 257 struct hfs_belem *belem; local 260 if (!brec || !(belem = brec->bottom) || (belem != brec->top) || 261 !(bn = belem->bnr.bn) || (bn->magic != HFS_BNODE_MAGIC) || 269 int left = bn->ndNRecs - belem->record; 277 hfs_brec_relse(brec, belem); 282 hfs_brec_relse(brec, belem); 285 old = belem->bnr; 286 belem->bnr = hfs_bnode_find(brec->tree, node, 287 belem [all...] |
H A D | bins_del.c | 15 * struct hfs_belem *belem: the search path element with the changed key 17 * int offset: the "distance" from 'belem->bn' to 'bnode': 18 * 0 if the change is in 'belem->bn', 26 * 'belem' points to a valid (struct hfs_belem) in 'brec'. 28 * and is 'belem->bn' or one of its siblings. 33 void hfs_bnode_update_key(struct hfs_brec *brec, struct hfs_belem *belem, argument 36 int record = (--belem)->record + offset; 41 memcpy(1+bnode_key(belem->bnr.bn, record), key, keysize); 50 while ((belem > limit) && (record == 1)) { 51 record = (--belem) 208 const struct hfs_belem *belem = brec->bottom; local [all...] |
H A D | binsert.c | 28 * struct hfs_belem* belem: the element in the search path to insert in 39 * 'belem' points to a valid (struct hfs_belem) in 'brec', the node 47 static void binsert_nonfull(struct hfs_brec *brec, struct hfs_belem *belem, argument 53 struct hfs_bnode *bnode = belem->bnr.bn; 55 rec = ++(belem->record); 320 struct hfs_belem *belem = brec->bottom; local 325 while ((belem >= brec->top) && (belem->flags & HFS_BPATH_OVERFLOW)) { 326 left = belem->bnr; 335 right = split(belem, ROUN 416 struct hfs_belem *belem; local [all...] |
Completed in 40 milliseconds