Lines Matching refs:ARCH_CONVERT
140 INT_ZERO(node->hdr.info.forw, ARCH_CONVERT); in xfs_da_node_create()
141 INT_ZERO(node->hdr.info.back, ARCH_CONVERT); in xfs_da_node_create()
142 INT_SET(node->hdr.info.magic, ARCH_CONVERT, XFS_DA_NODE_MAGIC); in xfs_da_node_create()
143 INT_ZERO(node->hdr.info.pad, ARCH_CONVERT); in xfs_da_node_create()
144 INT_ZERO(node->hdr.count, ARCH_CONVERT); in xfs_da_node_create()
145 INT_SET(node->hdr.level, ARCH_CONVERT, level); in xfs_da_node_create()
309 if (!INT_ISZERO(node->hdr.info.forw, ARCH_CONVERT)) { in xfs_da_split()
310 if (INT_GET(node->hdr.info.forw, ARCH_CONVERT) == addblk->blkno) { in xfs_da_split()
317 INT_SET(node->hdr.info.back, ARCH_CONVERT, oldblk->blkno); in xfs_da_split()
323 if (INT_GET(node->hdr.info.back, ARCH_CONVERT)) { in xfs_da_split()
324 if (INT_GET(node->hdr.info.back, ARCH_CONVERT) == addblk->blkno) { in xfs_da_split()
331 INT_SET(node->hdr.info.forw, ARCH_CONVERT, oldblk->blkno); in xfs_da_split()
379 if (INT_GET(oldroot->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC) { in xfs_da_root_split()
380 size = (int)((char *)&oldroot->btree[INT_GET(oldroot->hdr.count, ARCH_CONVERT)] - in xfs_da_root_split()
384 ASSERT(INT_GET(oldroot->hdr.info.magic, ARCH_CONVERT) == XFS_DIR2_LEAFN_MAGIC); in xfs_da_root_split()
386 size = (int)((char *)&leaf->ents[INT_GET(leaf->hdr.count, ARCH_CONVERT)] - in xfs_da_root_split()
401 INT_GET(node->hdr.level, ARCH_CONVERT) + 1, &bp, args->whichfork); 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()
409 INT_SET(node->hdr.count, ARCH_CONVERT, 2); in xfs_da_root_split()
412 if (INT_GET(oldroot->hdr.info.magic, ARCH_CONVERT) == XFS_DIR2_LEAFN_MAGIC) { in xfs_da_root_split()
444 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_split()
454 if ((INT_GET(node->hdr.count, ARCH_CONVERT) + newcount) > state->node_ents) { in xfs_da_node_split()
491 if (oldblk->index <= INT_GET(node->hdr.count, ARCH_CONVERT)) { in xfs_da_node_split()
535 …if ((INT_GET(node1->hdr.count, ARCH_CONVERT) > 0) && (INT_GET(node2->hdr.count, ARCH_CONVERT) > 0)… in xfs_da_node_rebalance()
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()
543 ASSERT(INT_GET(node1->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_rebalance()
544 ASSERT(INT_GET(node2->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_rebalance()
545 count = (INT_GET(node1->hdr.count, ARCH_CONVERT) - INT_GET(node2->hdr.count, ARCH_CONVERT)) / 2; in xfs_da_node_rebalance()
556 if ((tmp = INT_GET(node2->hdr.count, ARCH_CONVERT)) > 0) { in xfs_da_node_rebalance()
567 INT_MOD(node2->hdr.count, ARCH_CONVERT, count); in xfs_da_node_rebalance()
569 btree_s = &node1->btree[INT_GET(node1->hdr.count, ARCH_CONVERT) - count]; in xfs_da_node_rebalance()
572 INT_MOD(node1->hdr.count, ARCH_CONVERT, -(count)); in xfs_da_node_rebalance()
582 btree_d = &node1->btree[INT_GET(node1->hdr.count, ARCH_CONVERT)]; in xfs_da_node_rebalance()
584 INT_MOD(node1->hdr.count, ARCH_CONVERT, count); in xfs_da_node_rebalance()
591 tmp = INT_GET(node2->hdr.count, ARCH_CONVERT) - count; in xfs_da_node_rebalance()
596 INT_MOD(node2->hdr.count, ARCH_CONVERT, -(count)); in xfs_da_node_rebalance()
607 sizeof(node2->btree[0]) * INT_GET(node2->hdr.count, ARCH_CONVERT))); in xfs_da_node_rebalance()
615 …hashval = INT_GET(node1->btree[ INT_GET(node1->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_node_rebalance()
616 …hashval = INT_GET(node2->btree[ INT_GET(node2->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_node_rebalance()
621 if (blk1->index >= INT_GET(node1->hdr.count, ARCH_CONVERT)) { in xfs_da_node_rebalance()
622 blk2->index = blk1->index - INT_GET(node1->hdr.count, ARCH_CONVERT); in xfs_da_node_rebalance()
623 blk1->index = INT_GET(node1->hdr.count, ARCH_CONVERT) + 1; /* make it invalid */ in xfs_da_node_rebalance()
641 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_add()
642 ASSERT((oldblk->index >= 0) && (oldblk->index <= INT_GET(node->hdr.count, ARCH_CONVERT))); in xfs_da_node_add()
653 if (oldblk->index < INT_GET(node->hdr.count, ARCH_CONVERT)) { in xfs_da_node_add()
654 tmp = (INT_GET(node->hdr.count, ARCH_CONVERT) - oldblk->index) * (uint)sizeof(*btree); 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()
661 INT_MOD(node->hdr.count, ARCH_CONVERT, +1); in xfs_da_node_add()
668 …->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_node_add()
793 ASSERT(INT_GET(oldroot->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_root_join()
794 ASSERT(INT_ISZERO(oldroot->hdr.info.forw, ARCH_CONVERT)); in xfs_da_root_join()
795 ASSERT(INT_ISZERO(oldroot->hdr.info.back, ARCH_CONVERT)); in xfs_da_root_join()
800 if (INT_GET(oldroot->hdr.count, ARCH_CONVERT) > 1) in xfs_da_root_join()
807 child = INT_GET(oldroot->btree[ 0 ].before, ARCH_CONVERT); in xfs_da_root_join()
815 if (INT_GET(oldroot->hdr.level, ARCH_CONVERT) == 1) { in xfs_da_root_join()
816 ASSERT(INT_GET(blkinfo->magic, ARCH_CONVERT) == XFS_DIRX_LEAF_MAGIC(state->mp) || in xfs_da_root_join()
817 INT_GET(blkinfo->magic, ARCH_CONVERT) == XFS_ATTR_LEAF_MAGIC); in xfs_da_root_join()
819 ASSERT(INT_GET(blkinfo->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_root_join()
821 ASSERT(INT_ISZERO(blkinfo->forw, ARCH_CONVERT)); in xfs_da_root_join()
822 ASSERT(INT_ISZERO(blkinfo->back, ARCH_CONVERT)); in xfs_da_root_join()
855 ASSERT(INT_GET(info->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_toosmall()
857 count = INT_GET(node->hdr.count, ARCH_CONVERT); in xfs_da_node_toosmall()
874 forward = (!INT_ISZERO(info->forw, ARCH_CONVERT)); in xfs_da_node_toosmall()
896 forward = (INT_GET(info->forw, ARCH_CONVERT) in xfs_da_node_toosmall()
897 < INT_GET(info->back, ARCH_CONVERT)); in xfs_da_node_toosmall()
900 blkno = INT_GET(info->forw, ARCH_CONVERT); in xfs_da_node_toosmall()
902 blkno = INT_GET(info->back, ARCH_CONVERT); in xfs_da_node_toosmall()
914 count -= INT_GET(node->hdr.count, ARCH_CONVERT); in xfs_da_node_toosmall()
916 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_toosmall()
917 count -= INT_GET(node->hdr.count, ARCH_CONVERT); in xfs_da_node_toosmall()
1000 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); 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()
1009 lasthash = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_fixhashpath()
1024 ASSERT(drop_blk->index < INT_GET(node->hdr.count, ARCH_CONVERT)); in xfs_da_node_remove()
1031 if (drop_blk->index < (INT_GET(node->hdr.count, ARCH_CONVERT)-1)) { in xfs_da_node_remove()
1032 tmp = INT_GET(node->hdr.count, ARCH_CONVERT) - drop_blk->index - 1; in xfs_da_node_remove()
1037 btree = &node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ]; in xfs_da_node_remove()
1042 INT_MOD(node->hdr.count, ARCH_CONVERT, -1); in xfs_da_node_remove()
1050 drop_blk->hashval = INT_GET(btree->hashval, ARCH_CONVERT); in xfs_da_node_remove()
1068 ASSERT(INT_GET(drop_node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_unbalance()
1069 ASSERT(INT_GET(save_node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_unbalance()
1076 …f ((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()
1081 tmp = INT_GET(save_node->hdr.count, ARCH_CONVERT) * (uint)sizeof(xfs_da_node_entry_t); in xfs_da_node_unbalance()
1086 (INT_GET(save_node->hdr.count, ARCH_CONVERT) + INT_GET(drop_node->hdr.count, ARCH_CONVERT)) * in xfs_da_node_unbalance()
1089 btree = &save_node->btree[ INT_GET(save_node->hdr.count, ARCH_CONVERT) ]; in xfs_da_node_unbalance()
1092 INT_GET(drop_node->hdr.count, ARCH_CONVERT) * in xfs_da_node_unbalance()
1099 tmp = INT_GET(drop_node->hdr.count, ARCH_CONVERT) * (uint)sizeof(xfs_da_node_entry_t); in xfs_da_node_unbalance()
1101 INT_MOD(save_node->hdr.count, ARCH_CONVERT, INT_GET(drop_node->hdr.count, ARCH_CONVERT)); in xfs_da_node_unbalance()
1110 …= INT_GET(save_node->btree[ INT_GET(save_node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_node_unbalance()
1165 ASSERT(INT_GET(curr->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC || in xfs_da_node_lookup_int()
1166 INT_GET(curr->magic, ARCH_CONVERT) == XFS_DIRX_LEAF_MAGIC(state->mp) || in xfs_da_node_lookup_int()
1167 INT_GET(curr->magic, ARCH_CONVERT) == XFS_ATTR_LEAF_MAGIC); in xfs_da_node_lookup_int()
1172 blk->magic = INT_GET(curr->magic, ARCH_CONVERT); in xfs_da_node_lookup_int()
1173 if (INT_GET(curr->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC) { in xfs_da_node_lookup_int()
1175 …->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_node_lookup_int()
1180 max = INT_GET(node->hdr.count, ARCH_CONVERT); 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()
1204 while ((probe < max) && (INT_GET(btree->hashval, ARCH_CONVERT) < hashval)) { 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()
1221 else if (INT_GET(curr->magic, ARCH_CONVERT) == XFS_ATTR_LEAF_MAGIC) { in xfs_da_node_lookup_int()
1226 else if (INT_GET(curr->magic, ARCH_CONVERT) == XFS_DIR_LEAF_MAGIC) { in xfs_da_node_lookup_int()
1230 else if (INT_GET(curr->magic, ARCH_CONVERT) == XFS_DIR2_LEAFN_MAGIC) { in xfs_da_node_lookup_int()
1307 ASSERT(old_blk->magic == INT_GET(old_info->magic, ARCH_CONVERT)); in xfs_da_blk_link()
1308 ASSERT(new_blk->magic == INT_GET(new_info->magic, ARCH_CONVERT)); in xfs_da_blk_link()
1337 INT_SET(new_info->forw, ARCH_CONVERT, old_blk->blkno); in xfs_da_blk_link()
1339 if (INT_GET(old_info->back, ARCH_CONVERT)) { in xfs_da_blk_link()
1342 ARCH_CONVERT), -1, &bp, in xfs_da_blk_link()
1348 ASSERT(INT_GET(tmp_info->magic, ARCH_CONVERT) == INT_GET(old_info->magic, ARCH_CONVERT)); in xfs_da_blk_link()
1349 ASSERT(INT_GET(tmp_info->forw, ARCH_CONVERT) == old_blk->blkno); in xfs_da_blk_link()
1350 INT_SET(tmp_info->forw, ARCH_CONVERT, new_blk->blkno); in xfs_da_blk_link()
1354 INT_SET(old_info->back, ARCH_CONVERT, new_blk->blkno); in xfs_da_blk_link()
1360 INT_SET(new_info->back, ARCH_CONVERT, old_blk->blkno); in xfs_da_blk_link()
1361 if (INT_GET(old_info->forw, ARCH_CONVERT)) { in xfs_da_blk_link()
1363 INT_GET(old_info->forw, ARCH_CONVERT), -1, &bp, in xfs_da_blk_link()
1369 ASSERT(INT_GET(tmp_info->magic, ARCH_CONVERT) in xfs_da_blk_link()
1370 == INT_GET(old_info->magic, ARCH_CONVERT)); in xfs_da_blk_link()
1371 ASSERT(INT_GET(tmp_info->back, ARCH_CONVERT) in xfs_da_blk_link()
1373 INT_SET(tmp_info->back, ARCH_CONVERT, new_blk->blkno); in xfs_da_blk_link()
1377 INT_SET(old_info->forw, ARCH_CONVERT, new_blk->blkno); in xfs_da_blk_link()
1395 ASSERT((INT_GET(node1->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC) && in xfs_da_node_order()
1396 (INT_GET(node2->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC)); in xfs_da_node_order()
1397 …if ((INT_GET(node1->hdr.count, ARCH_CONVERT) > 0) && (INT_GET(node2->hdr.count, ARCH_CONVERT) > 0)… in xfs_da_node_order()
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()
1416 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_node_lasthash()
1418 *count = INT_GET(node->hdr.count, ARCH_CONVERT); in xfs_da_node_lasthash()
1419 if (INT_ISZERO(node->hdr.count, ARCH_CONVERT)) in xfs_da_node_lasthash()
1421 return(INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT)); in xfs_da_node_lasthash()
1446 ASSERT(save_blk->magic == INT_GET(save_info->magic, ARCH_CONVERT)); in xfs_da_blk_unlink()
1447 ASSERT(drop_blk->magic == INT_GET(drop_info->magic, ARCH_CONVERT)); in xfs_da_blk_unlink()
1449 ASSERT((INT_GET(save_info->forw, ARCH_CONVERT) == drop_blk->blkno) || in xfs_da_blk_unlink()
1450 (INT_GET(save_info->back, ARCH_CONVERT) == drop_blk->blkno)); in xfs_da_blk_unlink()
1451 ASSERT((INT_GET(drop_info->forw, ARCH_CONVERT) == save_blk->blkno) || in xfs_da_blk_unlink()
1452 (INT_GET(drop_info->back, ARCH_CONVERT) == save_blk->blkno)); in xfs_da_blk_unlink()
1457 if (INT_GET(save_info->back, ARCH_CONVERT) == drop_blk->blkno) { in xfs_da_blk_unlink()
1459 if (INT_GET(drop_info->back, ARCH_CONVERT)) { in xfs_da_blk_unlink()
1462 ARCH_CONVERT), -1, &bp, in xfs_da_blk_unlink()
1468 ASSERT(INT_GET(tmp_info->magic, ARCH_CONVERT) == INT_GET(save_info->magic, ARCH_CONVERT)); in xfs_da_blk_unlink()
1469 ASSERT(INT_GET(tmp_info->forw, ARCH_CONVERT) == drop_blk->blkno); in xfs_da_blk_unlink()
1470 INT_SET(tmp_info->forw, ARCH_CONVERT, save_blk->blkno); in xfs_da_blk_unlink()
1477 if (INT_GET(drop_info->forw, ARCH_CONVERT)) { in xfs_da_blk_unlink()
1479 INT_GET(drop_info->forw, ARCH_CONVERT), -1, &bp, in xfs_da_blk_unlink()
1485 ASSERT(INT_GET(tmp_info->magic, ARCH_CONVERT) in xfs_da_blk_unlink()
1486 == INT_GET(save_info->magic, ARCH_CONVERT)); in xfs_da_blk_unlink()
1487 ASSERT(INT_GET(tmp_info->back, ARCH_CONVERT) in xfs_da_blk_unlink()
1489 INT_SET(tmp_info->back, ARCH_CONVERT, save_blk->blkno); in xfs_da_blk_unlink()
1532 ASSERT(INT_GET(node->hdr.info.magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_path_shift()
1533 if (forward && (blk->index < INT_GET(node->hdr.count, ARCH_CONVERT)-1)) { in xfs_da_path_shift()
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()
1571 ASSERT(INT_GET(info->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC || in xfs_da_path_shift()
1572 INT_GET(info->magic, ARCH_CONVERT) == XFS_DIRX_LEAF_MAGIC(state->mp) || in xfs_da_path_shift()
1573 INT_GET(info->magic, ARCH_CONVERT) == XFS_ATTR_LEAF_MAGIC); in xfs_da_path_shift()
1574 blk->magic = INT_GET(info->magic, ARCH_CONVERT); in xfs_da_path_shift()
1575 if (INT_GET(info->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC) { in xfs_da_path_shift()
1577 …->hashval = INT_GET(node->btree[ INT_GET(node->hdr.count, ARCH_CONVERT)-1 ].hashval, ARCH_CONVERT); in xfs_da_path_shift()
1581 blk->index = INT_GET(node->hdr.count, ARCH_CONVERT)-1; in xfs_da_path_shift()
1582 blkno = INT_GET(node->btree[ blk->index ].before, ARCH_CONVERT); in xfs_da_path_shift()
1839 if (INT_GET(dead_info->magic, ARCH_CONVERT) == XFS_DIR_LEAF_MAGIC) { in xfs_da_swap_lastblock()
1844 …INT_GET(dead_leaf->entries[INT_GET(dead_leaf->hdr.count, ARCH_CONVERT) - 1].hashval, ARCH_CONVERT); in xfs_da_swap_lastblock()
1845 } else if (INT_GET(dead_info->magic, ARCH_CONVERT) == XFS_DIR2_LEAFN_MAGIC) { in xfs_da_swap_lastblock()
1849 … INT_GET(dead_leaf2->ents[INT_GET(dead_leaf2->hdr.count, ARCH_CONVERT) - 1].hashval, ARCH_CONVERT); in xfs_da_swap_lastblock()
1851 ASSERT(INT_GET(dead_info->magic, ARCH_CONVERT) == XFS_DA_NODE_MAGIC); in xfs_da_swap_lastblock()
1853 dead_level = INT_GET(dead_node->hdr.level, ARCH_CONVERT); in xfs_da_swap_lastblock()
1854 …= INT_GET(dead_node->btree[INT_GET(dead_node->hdr.count, ARCH_CONVERT) - 1].hashval, ARCH_CONVERT); in xfs_da_swap_lastblock()
1860 if ((sib_blkno = INT_GET(dead_info->back, ARCH_CONVERT))) { in xfs_da_swap_lastblock()
1865 INT_GET(sib_info->forw, ARCH_CONVERT) != last_blkno || in xfs_da_swap_lastblock()
1866 INT_GET(sib_info->magic, ARCH_CONVERT) != INT_GET(dead_info->magic, ARCH_CONVERT))) { in xfs_da_swap_lastblock()
1872 INT_SET(sib_info->forw, ARCH_CONVERT, dead_blkno); in xfs_da_swap_lastblock()
1882 if ((sib_blkno = INT_GET(dead_info->forw, ARCH_CONVERT))) { in xfs_da_swap_lastblock()
1887 INT_GET(sib_info->back, ARCH_CONVERT) != last_blkno in xfs_da_swap_lastblock()
1888 || INT_GET(sib_info->magic, ARCH_CONVERT) in xfs_da_swap_lastblock()
1889 != INT_GET(dead_info->magic, ARCH_CONVERT))) { in xfs_da_swap_lastblock()
1895 INT_SET(sib_info->back, ARCH_CONVERT, dead_blkno); in xfs_da_swap_lastblock()
1912 INT_GET(par_node->hdr.info.magic, ARCH_CONVERT) != XFS_DA_NODE_MAGIC || in xfs_da_swap_lastblock()
1913 (level >= 0 && level != INT_GET(par_node->hdr.level, ARCH_CONVERT) + 1))) { in xfs_da_swap_lastblock()
1919 level = INT_GET(par_node->hdr.level, ARCH_CONVERT); in xfs_da_swap_lastblock()
1921 entno < INT_GET(par_node->hdr.count, ARCH_CONVERT) && in xfs_da_swap_lastblock()
1922 INT_GET(par_node->btree[entno].hashval, ARCH_CONVERT) < dead_hash; in xfs_da_swap_lastblock()
1925 if (unlikely(entno == INT_GET(par_node->hdr.count, ARCH_CONVERT))) { in xfs_da_swap_lastblock()
1931 par_blkno = INT_GET(par_node->btree[entno].before, ARCH_CONVERT); in xfs_da_swap_lastblock()
1943 entno < INT_GET(par_node->hdr.count, ARCH_CONVERT) && in xfs_da_swap_lastblock()
1944 INT_GET(par_node->btree[entno].before, ARCH_CONVERT) != last_blkno; in xfs_da_swap_lastblock()
1947 if (entno < INT_GET(par_node->hdr.count, ARCH_CONVERT)) in xfs_da_swap_lastblock()
1949 par_blkno = INT_GET(par_node->hdr.info.forw, ARCH_CONVERT); in xfs_da_swap_lastblock()
1962 INT_GET(par_node->hdr.level, ARCH_CONVERT) != level || in xfs_da_swap_lastblock()
1963 INT_GET(par_node->hdr.info.magic, ARCH_CONVERT) != XFS_DA_NODE_MAGIC)) { in xfs_da_swap_lastblock()
1974 INT_SET(par_node->btree[entno].before, ARCH_CONVERT, dead_blkno); in xfs_da_swap_lastblock()
2258 magic = INT_GET(info->magic, ARCH_CONVERT); in xfs_da_do_buf()
2259 magic1 = INT_GET(data->hdr.magic, ARCH_CONVERT); in xfs_da_do_buf()
2268 (INT_GET(free->hdr.magic, ARCH_CONVERT) != XFS_DIR2_FREE_MAGIC), in xfs_da_do_buf()