Lines Matching refs:btree
380 size = (int)((char *)&oldroot->btree[INT_GET(oldroot->hdr.count, ARCH_CONVERT)] - in xfs_da_root_split()
405 INT_SET(node->btree[0].hashval, ARCH_CONVERT, blk1->hashval); in xfs_da_root_split()
406 INT_SET(node->btree[0].before, ARCH_CONVERT, blk1->blkno); in xfs_da_root_split()
407 INT_SET(node->btree[1].hashval, ARCH_CONVERT, blk2->hashval); in xfs_da_root_split()
408 INT_SET(node->btree[1].before, ARCH_CONVERT, blk2->blkno); in xfs_da_root_split()
422 XFS_DA_LOGRANGE(node, node->btree, in xfs_da_root_split()
536 …((INT_GET(node2->btree[ 0 ].hashval, ARCH_CONVERT) < INT_GET(node1->btree[ 0 ].hashval, ARCH_CONVE… in xfs_da_node_rebalance()
537 (INT_GET(node2->btree[ INT_GET(node2->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT) < in xfs_da_node_rebalance()
538 INT_GET(node1->btree[ INT_GET(node1->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT)))) { in xfs_da_node_rebalance()
558 btree_s = &node2->btree[0]; in xfs_da_node_rebalance()
559 btree_d = &node2->btree[count]; in xfs_da_node_rebalance()
569 btree_s = &node1->btree[INT_GET(node1->hdr.count, ARCH_CONVERT) - count]; in xfs_da_node_rebalance()
570 btree_d = &node2->btree[0]; in xfs_da_node_rebalance()
581 btree_s = &node2->btree[0]; in xfs_da_node_rebalance()
582 btree_d = &node1->btree[INT_GET(node1->hdr.count, ARCH_CONVERT)]; in xfs_da_node_rebalance()
593 btree_s = &node2->btree[count]; in xfs_da_node_rebalance()
594 btree_d = &node2->btree[0]; in xfs_da_node_rebalance()
607 sizeof(node2->btree[0]) * INT_GET(node2->hdr.count, ARCH_CONVERT))); in xfs_da_node_rebalance()
615 …blk1->hashval = INT_GET(node1->btree[ INT_GET(node1->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CO… in xfs_da_node_rebalance()
616 …blk2->hashval = INT_GET(node2->btree[ INT_GET(node2->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CO… in xfs_da_node_rebalance()
635 xfs_da_node_entry_t *btree; in xfs_da_node_add() local
652 btree = &node->btree[ oldblk->index ]; in xfs_da_node_add()
654 tmp = (INT_GET(node->hdr.count, ARCH_CONVERT) - oldblk->index) * (uint)sizeof(*btree); in xfs_da_node_add()
655 memmove(btree + 1, btree, tmp); in xfs_da_node_add()
657 INT_SET(btree->hashval, ARCH_CONVERT, newblk->hashval); in xfs_da_node_add()
658 INT_SET(btree->before, ARCH_CONVERT, newblk->blkno); in xfs_da_node_add()
660 XFS_DA_LOGRANGE(node, btree, tmp + sizeof(*btree))); in xfs_da_node_add()
668 …oldblk->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CO… in xfs_da_node_add()
807 child = INT_GET(oldroot->btree[ 0 ].before, ARCH_CONVERT); in xfs_da_root_join()
966 xfs_da_node_entry_t *btree; in xfs_da_fixhashpath() local
1001 btree = &node->btree[ blk->index ]; in xfs_da_fixhashpath()
1002 if (INT_GET(btree->hashval, ARCH_CONVERT) == lasthash) in xfs_da_fixhashpath()
1005 INT_SET(btree->hashval, ARCH_CONVERT, lasthash); in xfs_da_fixhashpath()
1007 XFS_DA_LOGRANGE(node, btree, sizeof(*btree))); in xfs_da_fixhashpath()
1009 lasthash = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_fixhashpath()
1020 xfs_da_node_entry_t *btree; in xfs_da_node_remove() local
1030 btree = &node->btree[drop_blk->index]; in xfs_da_node_remove()
1034 memmove(btree, btree + 1, tmp); in xfs_da_node_remove()
1036 XFS_DA_LOGRANGE(node, btree, tmp)); in xfs_da_node_remove()
1037 btree = &node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ]; in xfs_da_node_remove()
1039 memset((char *)btree, 0, sizeof(xfs_da_node_entry_t)); in xfs_da_node_remove()
1041 XFS_DA_LOGRANGE(node, btree, sizeof(*btree))); in xfs_da_node_remove()
1049 btree--; in xfs_da_node_remove()
1050 drop_blk->hashval = INT_GET(btree->hashval, ARCH_CONVERT); in xfs_da_node_remove()
1062 xfs_da_node_entry_t *btree; in xfs_da_node_unbalance() local
1076 …if ((INT_GET(drop_node->btree[ 0 ].hashval, ARCH_CONVERT) < INT_GET(save_node->btree[ 0 ].hashval,… in xfs_da_node_unbalance()
1077 …(INT_GET(drop_node->btree[ INT_GET(drop_node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT) < in xfs_da_node_unbalance()
1078 … INT_GET(save_node->btree[ INT_GET(save_node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT))) in xfs_da_node_unbalance()
1080 btree = &save_node->btree[ INT_GET(drop_node->hdr.count, ARCH_CONVERT) ]; in xfs_da_node_unbalance()
1082 memmove(btree, &save_node->btree[0], tmp); in xfs_da_node_unbalance()
1083 btree = &save_node->btree[0]; in xfs_da_node_unbalance()
1085 XFS_DA_LOGRANGE(save_node, btree, in xfs_da_node_unbalance()
1089 btree = &save_node->btree[ INT_GET(save_node->hdr.count, ARCH_CONVERT) ]; in xfs_da_node_unbalance()
1091 XFS_DA_LOGRANGE(save_node, btree, in xfs_da_node_unbalance()
1100 memcpy(btree, &drop_node->btree[0], tmp); in xfs_da_node_unbalance()
1110 …save_blk->hashval = INT_GET(save_node->btree[ INT_GET(save_node->hdr.count, ARCH_CONVERT)-1 ].hash… in xfs_da_node_unbalance()
1134 xfs_da_node_entry_t *btree; in xfs_da_node_lookup_int() local
1175 …blk->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVE… in xfs_da_node_lookup_int()
1183 for (btree = &node->btree[probe]; span > 4; in xfs_da_node_lookup_int()
1184 btree = &node->btree[probe]) { in xfs_da_node_lookup_int()
1186 if (INT_GET(btree->hashval, ARCH_CONVERT) < hashval) in xfs_da_node_lookup_int()
1188 else if (INT_GET(btree->hashval, ARCH_CONVERT) > hashval) in xfs_da_node_lookup_int()
1194 ASSERT((span <= 4) || (INT_GET(btree->hashval, ARCH_CONVERT) == hashval)); in xfs_da_node_lookup_int()
1200 while ((probe > 0) && (INT_GET(btree->hashval, ARCH_CONVERT) >= hashval)) { in xfs_da_node_lookup_int()
1201 btree--; in xfs_da_node_lookup_int()
1204 while ((probe < max) && (INT_GET(btree->hashval, ARCH_CONVERT) < hashval)) { in xfs_da_node_lookup_int()
1205 btree++; in xfs_da_node_lookup_int()
1214 blkno = INT_GET(node->btree[ max-1 ].before, ARCH_CONVERT); in xfs_da_node_lookup_int()
1217 blkno = INT_GET(btree->before, ARCH_CONVERT); in xfs_da_node_lookup_int()
1398 ((INT_GET(node2->btree[ 0 ].hashval, ARCH_CONVERT) < in xfs_da_node_order()
1399 INT_GET(node1->btree[ 0 ].hashval, ARCH_CONVERT)) || in xfs_da_node_order()
1400 (INT_GET(node2->btree[ INT_GET(node2->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT) < in xfs_da_node_order()
1401 INT_GET(node1->btree[ INT_GET(node1->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT)))) { in xfs_da_node_order()
1421 return(INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT)); in xfs_da_node_lasthash()
1535 blkno = INT_GET(node->btree[ blk->index ].before, ARCH_CONVERT); in xfs_da_path_shift()
1539 blkno = INT_GET(node->btree[ blk->index ].before, ARCH_CONVERT); in xfs_da_path_shift()
1577 …blk->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVE… in xfs_da_path_shift()
1582 blkno = INT_GET(node->btree[ blk->index ].before, ARCH_CONVERT); in xfs_da_path_shift()
1854 …dead_hash = INT_GET(dead_node->btree[INT_GET(dead_node->hdr.count, ARCH_CONVERT) - 1].hashval, ARC… in xfs_da_swap_lastblock()
1922 INT_GET(par_node->btree[entno].hashval, ARCH_CONVERT) < dead_hash; in xfs_da_swap_lastblock()
1931 par_blkno = INT_GET(par_node->btree[entno].before, ARCH_CONVERT); in xfs_da_swap_lastblock()
1944 INT_GET(par_node->btree[entno].before, ARCH_CONVERT) != last_blkno; in xfs_da_swap_lastblock()
1974 INT_SET(par_node->btree[entno].before, ARCH_CONVERT, dead_blkno); in xfs_da_swap_lastblock()
1976 XFS_DA_LOGRANGE(par_node, &par_node->btree[entno].before, in xfs_da_swap_lastblock()
1977 sizeof(par_node->btree[entno].before))); in xfs_da_swap_lastblock()