Lines Matching defs:node2
471 xfs_da_intnode_t *node1, *node2, *tmpnode;
477 node2 = blk2->bp->data;
482 if ((be16_to_cpu(node1->hdr.count) > 0) && (be16_to_cpu(node2->hdr.count) > 0) &&
483 ((be32_to_cpu(node2->btree[0].hashval) < be32_to_cpu(node1->btree[0].hashval)) ||
484 (be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval) <
487 node1 = node2;
488 node2 = tmpnode;
491 ASSERT(be16_to_cpu(node2->hdr.info.magic) == XFS_DA_NODE_MAGIC);
492 count = (be16_to_cpu(node1->hdr.count) - be16_to_cpu(node2->hdr.count)) / 2;
501 * Move elements in node2 up to make a hole.
503 if ((tmp = be16_to_cpu(node2->hdr.count)) > 0) {
505 btree_s = &node2->btree[0];
506 btree_d = &node2->btree[count];
512 * low in node2.
514 be16_add(&node2->hdr.count, count);
517 btree_d = &node2->btree[0];
522 * Move the req'd B-tree elements from low in node2 to
527 btree_s = &node2->btree[0];
535 * Move elements in node2 down to fill the hole.
537 tmp = be16_to_cpu(node2->hdr.count) - count;
539 btree_s = &node2->btree[count];
540 btree_d = &node2->btree[0];
542 be16_add(&node2->hdr.count, -count);
551 XFS_DA_LOGRANGE(node2, &node2->hdr,
552 sizeof(node2->hdr) +
553 sizeof(node2->btree[0]) * be16_to_cpu(node2->hdr.count)));
560 node2 = blk2->bp->data;
562 blk2->hashval = be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval);
1283 xfs_da_intnode_t *node1, *node2;
1286 node2 = node2_bp->data;
1288 (be16_to_cpu(node2->hdr.info.magic) == XFS_DA_NODE_MAGIC));
1289 if ((be16_to_cpu(node1->hdr.count) > 0) && (be16_to_cpu(node2->hdr.count) > 0) &&
1290 ((be32_to_cpu(node2->btree[0].hashval) <
1292 (be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval) <