INNER CODE UNIT · C

node

xonotic/darkplaces · bih.c:64

	node = bih->nodes + nodenum;
	// store bounds for node
	node->mins[0] = mins[0];
	node->mins[1] = mins[1];
	node->mins[2] = mins[2];
	node->maxs[0] = maxs[0];
	node->maxs[1] = maxs[1];
	node->maxs[2] = maxs[2];
	node->front = 0;
	node->back = 0;
	node->frontmin = 0;
	node->backmax = 0;
	memset(node->children, -1, sizeof(node->children));
	// check if there are few enough children to store an unordered node
	if (numchildren <= BIH_MAXUNORDEREDCHILDREN)
	{
		node->type = BIH_UNORDERED;
		for (j = 0;j < numchildren;j++)

View source record →