node_size
vma_res->node_size,
end += (vma_res->node_size + vma_res->guard) / I915_GTT_PAGE_SIZE;
end += (vma_res->node_size + vma_res->guard) / I915_GTT_PAGE_SIZE;
vma_res->node_size / I915_GTT_PAGE_SIZE, pte_encode))
start += vma_res->node_size / I915_GTT_PAGE_SIZE;
end += (vma_res->node_size + vma_res->guard) / I915_GTT_PAGE_SIZE;
vma_res->node_size = obj->base.size;
if (!vma_res->node_size)
ggtt->vm.clear_range(&ggtt->vm, vma_res->start, vma_res->node_size);
dst->gtt_size = vma_res->node_size;
#define VMA_RES_LAST(_node) ((_node)->start + (_node)->node_size + (_node)->guard - 1)
u64 node_size;
u64 node_size,
vma_res->node_size = node_size;
mock_vma_res->node_size = BIT_ULL(aligned_size);
size_t node_size = NODESIZE;
node_size += key->size;
node_size += data->size;
node_size -= data->size - sizeof(pgno_t);
node_size -= data->size - sizeof(pgno_t);
if (node_size + sizeof(indx_t) > SIZELEFT(mp)) {
DPRINTF("node size = %zu", node_size);
ofs = p->upper - node_size;
tree->size_bytes -= node_size(tree, node);
tree->size_bytes -= node_size(tree, n);
tree->size_bytes += node_size(tree, newnode);
tree->size_bytes += node_size(tree, newnode);
tree->size_bytes += node_size(tree, newnode);