/*
    Copyright (C) 1996-1997  Id Software, Inc.
    Copyright (C) 1997       Greg Lewis

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA

    See file, 'COPYING', for details.
*/

#pragma once

#include <common/bspfile.hh>
#include <qbsp/brush.hh>
#include <qbsp/qbsp.hh>

#include <atomic>
#include <memory>

struct side_t;
struct tree_t;

struct portal_t
{
    qbsp_plane_t plane;
    node_t *onnode; // nullptr = portal to the outside of the world (one of six sides of a box)
    node_t *nodes[2]; // [0] = front side of planenum
    portal_t *next[2]; // [0] = next portal in nodes[0]'s list of portals
    std::optional<winding_t> winding;

    bool sidefound; // false if ->side hasn't been checked
    side_t *sides[2]; // [0] = the brush side visible on nodes[0] - it could come from a brush in nodes[1]. NULL =
                      // non-visible
    face_t *face[2]; // output face in bsp file
};

struct portalstats_t
{
    std::atomic<int> c_tinyportals;
};

contentflags_t ClusterContents(const node_t *node);
bool Portal_VisFlood(const portal_t *p);
bool Portal_EntityFlood(const portal_t *p, int32_t s);
void MakeNodePortal(tree_t *tree, node_t *node, portalstats_t &stats);
void SplitNodePortals(tree_t *tree, node_t *node, portalstats_t &stats);
void MakeTreePortals(tree_t *tree);
void AssertNoPortals(tree_t *tree);
void MakeHeadnodePortals(tree_t *tree);
void EmitAreaPortals(node_t *headnode);
void FloodAreas(mapentity_t *entity, node_t *headnode);
void MarkVisibleSides(tree_t *tree, mapentity_t *entity);