rem: for (int32 x = 0; x < second->count; x++) {
add: for (long x = 0; x < second->count; x++) {
context: and_region_1_to_n(BRegion *first, BRegion *second, BRegion *dest){	PRINT(("%s\n", __PRETTY_FUNCTION__));	ASSERT(first);	ASSERT(second);	ASSERT(dest);		// The easy case first: We already know that the regions intersect,	// so we check if the first region contains the second.	// If it's the case, the intersection is exactly the second region.	if ((first->bound.top <= second->bound.top) 			&& (first->bound.bottom >= second->bound.bottom)			&& (first->bound.left <= second->bound.left)			&& (first->bound.right >= second->bound.right))		copy_region(second, dest);	else {	// Otherwise, we check the rect of the first region against the rects	// of the second, and we add their intersections to the destination region		zero_region(dest);		for (int32 x = 0; x < second->count; x++) {			clipping_rect testRect = sect_rect(first->data[0], second->data[x]);			if (valid_rect(testRect))				dest->_AddRect(testRect);		}	}}