28975504630

Committed 08 Jul 2026 09:02PM UTC coverage: 81.341% (+0.07%) from 81.267%

Build # 28975504630

Build Type

Pull #3971

github

Committed by

web-flow

Commit Message

Merge af2ecaf51 into 8b15ee391

Pull Request Pull Request #3971: Delta tracking

Coverage Stats

18549 of 26870 branches covered (69.03%)

Branch coverage included in aggregate %.

614 of 661 new or added lines in 20 files covered. (92.89%)

545 existing lines in 20 files now uncovered.

59935 of 69618 relevant lines covered (86.09%)

49705850.0 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

84.26

/src/geometry.cpp

#include "openmc/geometry.h"

#include <fmt/core.h>
#include <fmt/ostream.h>

#include "openmc/array.h"
#include "openmc/cell.h"
#include "openmc/constants.h"
#include "openmc/error.h"
#include "openmc/lattice.h"
#include "openmc/settings.h"
#include "openmc/simulation.h"
#include "openmc/string_utils.h"
#include "openmc/surface.h"

namespace openmc {

//==============================================================================
// Global variables
//==============================================================================

namespace model {

int root_universe {-1};
int n_coord_levels;

vector<int> boundary_surfaces;

vector<int64_t> overlap_check_count;

vector<OverlapKey> overlap_keys;
std::unordered_map<OverlapKey, int, OverlapKeyHash> overlap_key_index;

} // namespace model

//==============================================================================
// Non-member functions
//==============================================================================

int check_cell_overlap(GeometryState& p, bool error)
{
  int n_coord = p.n_coord();

  // If no overlap found, return a nonphysical index
  int overlap_index = -1;

  // Loop through each coordinate level
  for (int j = 0; j < n_coord; j++) {
    Universe& univ = *model::universes[p.coord(j).universe()];

    // Loop through each cell on this level
    for (auto index_cell : univ.cells_) {
      Cell& c = *model::cells[index_cell];
      if (c.contains(p.coord(j).r(), p.coord(j).u(), p.surface())) {
#pragma omp atomic
        ++model::overlap_check_count[index_cell];
        if (index_cell != p.coord(j).cell()) {
          if (error) {
            fatal_error(
              fmt::format("Overlapping cells detected: {}, {} on universe {}",
                c.id_, model::cells[p.coord(j).cell()]->id_, univ.id_));
          }

          // With no fatal error (plotter is calling), now adds overlaps and
          // ensures order does not matter when making overlap key
          int cell_a = model::cells[index_cell]->id_;
          int cell_b = model::cells[p.coord(j).cell()]->id_;
          int a = std::min(cell_a, cell_b);
          int b = std::max(cell_a, cell_b);
          OverlapKey key {univ.id_, a, b};
#pragma omp critical(overlap_key_update)
          {
            auto it = model::overlap_key_index.find(key);
            if (it != model::overlap_key_index.end()) {
              overlap_index = it->second; // already exists, reuse index
            } else {
              int idx = int(model::overlap_keys.size());
              model::overlap_keys.push_back(key);
              model::overlap_key_index[key] = idx;
              overlap_index = idx;
            }
          }
          break;
        }
      }
    }
  }
  return overlap_index;
}

//==============================================================================

int cell_instance_at_level(const GeometryState& p, int level)
{
  // throw error if the requested level is too deep for the geometry
  if (level > model::n_coord_levels) {
    fatal_error(fmt::format("Cell instance at level {} requested, but only {} "
                            "levels exist in the geometry.",
      level, p.n_coord()));
  }

  // determine the cell instance
  Cell& c {*model::cells[p.coord(level).cell()]};

  // quick exit if this cell doesn't have distribcell instances
  if (c.distribcell_index_ == C_NONE)
    return C_NONE;

  // compute the cell's instance
  int instance = 0;
  for (int i = 0; i < level; i++) {
    const auto& c_i {*model::cells[p.coord(i).cell()]};
    if (c_i.type_ == Fill::UNIVERSE) {
      instance += c_i.offset_[c.distribcell_index_];
    } else if (c_i.type_ == Fill::LATTICE) {
      instance += c_i.offset_[c.distribcell_index_];
      auto& lat {*model::lattices[p.coord(i + 1).lattice()]};
      const auto& i_xyz {p.coord(i + 1).lattice_index()};
      if (lat.are_valid_indices(i_xyz)) {
        instance += lat.offset(c.distribcell_index_, i_xyz);
      }
    }
  }
  return instance;
}

//==============================================================================

bool find_cell_inner(
  GeometryState& p, const NeighborList* neighbor_list, bool verbose)
{
  // Find which cell of this universe the particle is in.  Use the neighbor list
  // to shorten the search if one was provided.
  bool found = false;
  int32_t i_cell = C_NONE;
  if (neighbor_list) {
    for (auto it = neighbor_list->cbegin(); it != neighbor_list->cend(); ++it) {
      i_cell = *it;

      // Make sure the search cell is in the same universe.
      int i_universe = p.lowest_coord().universe();
      if (model::cells[i_cell]->universe_ != i_universe)
        continue;

      // Check if this cell contains the particle.
      Position r {p.r_local()};
      Direction u {p.u_local()};
      auto surf = p.surface();
      if (model::cells[i_cell]->contains(r, u, surf)) {
        p.lowest_coord().cell() = i_cell;
        found = true;
        break;
      }
    }

    // If we're attempting a neighbor list search and fail, we
    // now know we should return false. This will trigger an
    // exhaustive search from neighbor_list_find_cell and make
    // the result from that be appended to the neighbor list.
    if (!found) {
      return found;
    }
  }

  // Check successively lower coordinate levels until finding material fill
  for (;; ++p.n_coord()) {
    // If we did not attempt to use neighbor lists, i_cell is still C_NONE.  In
    // that case, we should now do an exhaustive search to find the right value
    // of i_cell.
    //
    // Alternatively, neighbor list searches could have succeeded, but we found
    // that the fill of the neighbor cell was another universe. As such, in the
    // code below this conditional, we set i_cell back to C_NONE to indicate
    // that.
    if (i_cell == C_NONE) {
      int i_universe = p.lowest_coord().universe();
      const auto& univ {model::universes[i_universe]};
      found = univ->find_cell(p);
    }

    if (!found) {
      return found;
    }
    i_cell = p.lowest_coord().cell();

    // Announce the cell that the particle is entering.
    if (found && verbose) {
      auto msg = fmt::format("    Entering cell {}", model::cells[i_cell]->id_);
      write_message(msg, 1);
    }

    Cell& c {*model::cells[i_cell]};
    if (c.type_ == Fill::MATERIAL) {
      // Found a material cell which means this is the lowest coord level.

      p.cell_instance() = 0;
      // Find the distribcell instance number.
      if (c.distribcell_index_ >= 0) {
        p.cell_instance() = cell_instance_at_level(p, p.n_coord() - 1);
      }

      // Set the material, temperature and density multiplier.
      p.material_last() = p.material();
      p.material() = c.material(p.cell_instance());
      p.sqrtkT_last() = p.sqrtkT();
      p.sqrtkT() = c.sqrtkT(p.cell_instance());
      p.density_mult_last() = p.density_mult();
      p.density_mult() = c.density_mult(p.cell_instance());

      return true;

    } else if (c.type_ == Fill::UNIVERSE) {
      //========================================================================
      //! Found a lower universe, update this coord level then search the next.

      // Set the lower coordinate level universe.
      auto& coord {p.coord(p.n_coord())};
      coord.universe() = c.fill_;

      // Set the position and direction.
      coord.r() = p.r_local();
      coord.u() = p.u_local();

      // Apply translation.
      coord.r() -= c.translation_;

      // Apply rotation.
      if (!c.rotation_.empty()) {
        coord.rotate(c.rotation_);
      }

    } else if (c.type_ == Fill::LATTICE) {
      //========================================================================
      //! Found a lower lattice, update this coord level then search the next.

      Lattice& lat {*model::lattices[c.fill_]};

      // Set the position and direction.
      auto& coord {p.coord(p.n_coord())};
      coord.r() = p.r_local();
      coord.u() = p.u_local();

      // Apply translation.
      coord.r() -= c.translation_;

      // Apply rotation.
      if (!c.rotation_.empty()) {
        coord.rotate(c.rotation_);
      }

      // Determine lattice indices.
      auto& i_xyz {coord.lattice_index()};
      lat.get_indices(coord.r(), coord.u(), i_xyz);

      // Get local position in appropriate lattice cell
      coord.r() = lat.get_local_position(coord.r(), i_xyz);

      // Set lattice indices.
      coord.lattice() = c.fill_;

      // Set the lower coordinate level universe.
      if (lat.are_valid_indices(i_xyz)) {
        coord.universe() = lat[i_xyz];
      } else {
        if (lat.outer_ != NO_OUTER_UNIVERSE) {
          coord.universe() = lat.outer_;
        } else {
          p.mark_as_lost(fmt::format(
            "Particle {} left lattice {}, but it has no outer definition.",
            p.id(), lat.id_));
        }
      }
    }
    i_cell = C_NONE; // trip non-neighbor cell search at next iteration
    found = false;
  }

  return found;
}

//==============================================================================

bool neighbor_list_find_cell(GeometryState& p, bool verbose)
{

  // Reset all the deeper coordinate levels.
  for (int i = p.n_coord(); i < model::n_coord_levels; i++) {
    p.coord(i).reset();
  }

  // Get the cell this particle was in previously.
  auto coord_lvl = p.n_coord() - 1;
  auto i_cell = p.coord(coord_lvl).cell();
  Cell& c {*model::cells[i_cell]};

  // Search for the particle in that cell's neighbor list.  Return if we
  // found the particle.
  bool found = find_cell_inner(p, &c.neighbors_, verbose);
  if (found)
    return found;

  // The particle could not be found in the neighbor list.  Try searching all
  // cells in this universe, and update the neighbor list if we find a new
  // neighboring cell.
  found = find_cell_inner(p, nullptr, verbose);
  if (found)
    c.neighbors_.push_back(p.coord(coord_lvl).cell());
  return found;
}

bool exhaustive_find_cell(GeometryState& p, bool verbose)
{
  int i_universe = p.lowest_coord().universe();
  if (i_universe == C_NONE) {
    p.coord(0).universe() = model::root_universe;
    p.n_coord() = 1;
    i_universe = model::root_universe;
  }
  // Reset all the deeper coordinate levels.
  for (int i = p.n_coord(); i < model::n_coord_levels; i++) {
    p.coord(i).reset();
  }
  return find_cell_inner(p, nullptr, verbose);
}

//==============================================================================

void cross_lattice(GeometryState& p, const BoundaryInfo& boundary, bool verbose)
{
  auto& coord {p.lowest_coord()};
  auto& lat {*model::lattices[coord.lattice()]};

  if (verbose) {
    write_message(
      fmt::format("    Crossing lattice {}. Current position ({},{},{}). r={}",
        lat.id_, coord.lattice_index()[0], coord.lattice_index()[1],
        coord.lattice_index()[2], p.r()),
      1);
  }

  // Set the lattice indices.
  coord.lattice_index()[0] += boundary.lattice_translation()[0];
  coord.lattice_index()[1] += boundary.lattice_translation()[1];
  coord.lattice_index()[2] += boundary.lattice_translation()[2];

  // Set the new coordinate position.
  const auto& upper_coord {p.coord(p.n_coord() - 2)};
  const auto& cell {model::cells[upper_coord.cell()]};
  Position r = upper_coord.r();
  r -= cell->translation_;
  if (!cell->rotation_.empty()) {
    r = r.rotate(cell->rotation_);
  }
  p.r_local() = lat.get_local_position(r, coord.lattice_index());

  if (!lat.are_valid_indices(coord.lattice_index())) {
    // The particle is outside the lattice.  Search for it from the base coords.
    p.n_coord() = 1;
    bool found = exhaustive_find_cell(p);

    if (!found) {
      p.mark_as_lost(fmt::format("Particle {} could not be located after "
                                 "crossing a boundary of lattice {}",
        p.id(), lat.id_));
    }

  } else {
    // Find cell in next lattice element.
    p.lowest_coord().universe() = lat[coord.lattice_index()];
    bool found = exhaustive_find_cell(p);

    if (!found) {
      // A particle crossing the corner of a lattice tile may not be found.  In
      // this case, search for it from the base coords.
      p.n_coord() = 1;
      bool found = exhaustive_find_cell(p);
      if (!found) {
        p.mark_as_lost(fmt::format("Particle {} could not be located after "
                                   "crossing a boundary of lattice {}",
          p.id(), lat.id_));
      }
    }
  }
}

//==============================================================================

BoundaryInfo distance_to_boundary(GeometryState& p)
{
  BoundaryInfo info;
  double d_lat = INFINITY;
  double d_surf = INFINITY;
  int32_t level_surf_cross;
  array<int, 3> level_lat_trans {};

  // Loop over each coordinate level.
  for (int i = 0; i < p.n_coord(); i++) {
    const auto& coord {p.coord(i)};
    const Position& r {coord.r()};
    const Direction& u {coord.u()};
    Cell& c {*model::cells[coord.cell()]};

    // Find the oncoming surface in this cell and the distance to it.
    auto surface_distance = c.distance(r, u, p.surface(), &p);
    d_surf = surface_distance.first;
    level_surf_cross = surface_distance.second;

    // Find the distance to the next lattice tile crossing.
    if (coord.lattice() != C_NONE) {
      auto& lat {*model::lattices[coord.lattice()]};
      // TODO: refactor so both lattice use the same position argument (which
      // also means the lat.type attribute can be removed)
      std::pair<double, array<int, 3>> lattice_distance;
      switch (lat.type_) {
      case LatticeType::rect:
        lattice_distance = lat.distance(r, u, coord.lattice_index());
        break;
      case LatticeType::hex:
        auto& cell_above {model::cells[p.coord(i - 1).cell()]};
        Position r_hex {p.coord(i - 1).r()};
        r_hex -= cell_above->translation_;
        if (coord.rotated()) {
          r_hex = r_hex.rotate(cell_above->rotation_);
        }
        r_hex.z = coord.r().z;
        lattice_distance = lat.distance(r_hex, u, coord.lattice_index());
        break;
      }
      d_lat = lattice_distance.first;
      level_lat_trans = lattice_distance.second;

      if (d_lat < 0) {
        p.mark_as_lost(fmt::format("Particle {} had a negative distance "
                                   "to a lattice boundary.",
          p.id()));
      }
    }

    // If the boundary on this coordinate level is coincident with a boundary on
    // a higher level then we need to make sure that the higher level boundary
    // is selected.  This logic must consider floating point precision.
    double& d = info.distance();
    if (d_surf < d_lat - FP_COINCIDENT) {
      if (d == INFINITY || (d - d_surf) / d >= FP_REL_PRECISION) {
        // Update closest distance
        d = d_surf;

        // If the cell is not simple, it is possible that both the negative and
        // positive half-space were given in the region specification. Thus, we
        // have to explicitly check which half-space the particle would be
        // traveling into if the surface is crossed
        if (c.is_simple() || d == INFTY) {
          info.surface() = level_surf_cross;
        } else {
          Position r_hit = r + d_surf * u;
          Surface& surf {*model::surfaces[std::abs(level_surf_cross) - 1]};
          Direction norm = surf.normal(r_hit);
          if (u.dot(norm) > 0) {
            info.surface() = std::abs(level_surf_cross);
          } else {
            info.surface() = -std::abs(level_surf_cross);
          }
        }

        info.lattice_translation()[0] = 0;
        info.lattice_translation()[1] = 0;
        info.lattice_translation()[2] = 0;
        info.coord_level() = i + 1;
      }
    } else {
      if (d == INFINITY || (d - d_lat) / d >= FP_REL_PRECISION) {
        d = d_lat;
        info.surface() = SURFACE_NONE;
        info.lattice_translation() = level_lat_trans;
        info.coord_level() = i + 1;
      }
    }
  }
  return info;
}

//==============================================================================

BoundaryInfo distance_to_external_boundary(GeometryState& p)
{
  BoundaryInfo info;

  info.distance() = INFTY;
  info.surface() = 0;
  info.coord_level() = 1;
  for (auto s_idx : model::boundary_surfaces) {
    const auto& s = model::surfaces[s_idx];
    double surf_dist = s->distance(p.r(), p.u(), false);
    if (surf_dist < info.distance()) {
      info.distance() = surf_dist;
      info.surface() = s_idx + 1;
      if (s->sense(p.r(), p.u())) {
        info.surface() *= -1;
      }
    }
  }

  return info;
}

//==============================================================================
// C API
//==============================================================================

extern "C" int openmc_find_cell(
  const double* xyz, int32_t* index, int32_t* instance)
{
  GeometryState geom_state;

  geom_state.r() = Position {xyz};
  geom_state.u() = {0.0, 0.0, 1.0};

  if (!exhaustive_find_cell(geom_state)) {
    set_errmsg(
      fmt::format("Could not find cell at position {}.", geom_state.r()));
    return OPENMC_E_GEOMETRY;
  }

  *index = geom_state.lowest_coord().cell();
  *instance = geom_state.cell_instance();
  return 0;
}

extern "C" int openmc_global_bounding_box(double* llc, double* urc)
{
  auto bbox = model::universes.at(model::root_universe)->bounding_box();

  // set lower left corner values
  llc[0] = bbox.min.x;
  llc[1] = bbox.min.y;
  llc[2] = bbox.min.z;

  // set upper right corner values
  urc[0] = bbox.max.x;
  urc[1] = bbox.max.y;
  urc[2] = bbox.max.z;

  return 0;
}

} // namespace openmc

1	#include "openmc/geometry.h"
2
3	#include <fmt/core.h>
4	#include <fmt/ostream.h>
5
6	#include "openmc/array.h"
7	#include "openmc/cell.h"
8	#include "openmc/constants.h"
9	#include "openmc/error.h"
10	#include "openmc/lattice.h"
11	#include "openmc/settings.h"
12	#include "openmc/simulation.h"
13	#include "openmc/string_utils.h"
14	#include "openmc/surface.h"
15
16	namespace openmc {
17
18	//==============================================================================
19	// Global variables
20	//==============================================================================
21
22	namespace model {
23
24	int root_universe {-1};
25	int n_coord_levels;
26
27	vector<int> boundary_surfaces;
28
29	vector<int64_t> overlap_check_count;
30
31	vector<OverlapKey> overlap_keys;
32	std::unordered_map<OverlapKey, int, OverlapKeyHash> overlap_key_index;
33
34	} // namespace model
35
36	//==============================================================================
37	// Non-member functions
38	//==============================================================================
39
40	int check_cell_overlap(GeometryState& p, bool error)	1,442,100✔
41	{
42	int n_coord = p.n_coord();	1,442,100✔
43
44	// If no overlap found, return a nonphysical index
45	int overlap_index = -1;	1,442,100✔
46
47	// Loop through each coordinate level
48	for (int j = 0; j < n_coord; j++) {	2,884,200✔
49	Universe& univ = *model::universes[p.coord(j).universe()];	1,442,100✔
50
51	// Loop through each cell on this level
52	for (auto index_cell : univ.cells_) {	4,968,568✔
53	Cell& c = *model::cells[index_cell];	3,920,488✔
54	if (c.contains(p.coord(j).r(), p.coord(j).u(), p.surface())) {	3,920,488✔
55	#pragma omp atomic	759,036✔
56	++model::overlap_check_count[index_cell];	1,391,566✔
57	if (index_cell != p.coord(j).cell()) {	1,391,566✔
58	if (error) {	394,020!
UNCOV 59	fatal_error(	×
UNCOV 60	fmt::format("Overlapping cells detected: {}, {} on universe {}",	×
UNCOV 61	c.id_, model::cells[p.coord(j).cell()]->id_, univ.id_));	×
62	}
63
64	// With no fatal error (plotter is calling), now adds overlaps and
65	// ensures order does not matter when making overlap key
66	int cell_a = model::cells[index_cell]->id_;	394,020!
67	int cell_b = model::cells[p.coord(j).cell()]->id_;	394,020!
68	int a = std::min(cell_a, cell_b);	394,020!
69	int b = std::max(cell_a, cell_b);	394,020!
70	OverlapKey key {univ.id_, a, b};	394,020✔
71	#pragma omp critical(overlap_key_update)	429,840✔
72	{	394,020✔
73	auto it = model::overlap_key_index.find(key);	394,020✔
74	if (it != model::overlap_key_index.end()) {	394,020✔
75	overlap_index = it->second; // already exists, reuse index	393,965✔
76	} else {
77	int idx = int(model::overlap_keys.size());	55✔
78	model::overlap_keys.push_back(key);	55✔
79	model::overlap_key_index[key] = idx;	55✔
80	overlap_index = idx;	55✔
81	}
82	}
83	break;	394,020✔
84	}
85	}
86	}
87	}
88	return overlap_index;	1,442,100✔
89	}
90
91	//==============================================================================
92
93	int cell_instance_at_level(const GeometryState& p, int level)	2,147,483,647✔
94	{
95	// throw error if the requested level is too deep for the geometry
96	if (level > model::n_coord_levels) {	2,147,483,647!
UNCOV 97	fatal_error(fmt::format("Cell instance at level {} requested, but only {} "	×
98	"levels exist in the geometry.",
99	level, p.n_coord()));
100	}
101
102	// determine the cell instance
103	Cell& c {*model::cells[p.coord(level).cell()]};	2,147,483,647!
104
105	// quick exit if this cell doesn't have distribcell instances
106	if (c.distribcell_index_ == C_NONE)	2,147,483,647!
107	return C_NONE;
108
109	// compute the cell's instance
110	int instance = 0;
111	for (int i = 0; i < level; i++) {	2,147,483,647✔
112	const auto& c_i {*model::cells[p.coord(i).cell()]};	2,147,483,647✔
113	if (c_i.type_ == Fill::UNIVERSE) {	2,147,483,647✔
114	instance += c_i.offset_[c.distribcell_index_];	1,890,444,654✔
115	} else if (c_i.type_ == Fill::LATTICE) {	1,578,655,467!
116	instance += c_i.offset_[c.distribcell_index_];	1,578,655,467✔
117	auto& lat {*model::lattices[p.coord(i + 1).lattice()]};	1,578,655,467✔
118	const auto& i_xyz {p.coord(i + 1).lattice_index()};	1,578,655,467✔
119	if (lat.are_valid_indices(i_xyz)) {	1,578,655,467✔
120	instance += lat.offset(c.distribcell_index_, i_xyz);	1,573,771,500✔
121	}
122	}
123	}
124	return instance;
125	}
126
127	//==============================================================================
128
129	bool find_cell_inner(	2,147,483,647✔
130	GeometryState& p, const NeighborList* neighbor_list, bool verbose)
131	{
132	// Find which cell of this universe the particle is in. Use the neighbor list
133	// to shorten the search if one was provided.
134	bool found = false;	2,147,483,647✔
135	int32_t i_cell = C_NONE;	2,147,483,647✔
136	if (neighbor_list) {	2,147,483,647✔
137	for (auto it = neighbor_list->cbegin(); it != neighbor_list->cend(); ++it) {	2,147,483,647✔
138	i_cell = *it;	2,147,483,647!
139
140	// Make sure the search cell is in the same universe.
141	int i_universe = p.lowest_coord().universe();	2,147,483,647!
142	if (model::cells[i_cell]->universe_ != i_universe)	2,147,483,647!
UNCOV 143	continue;	×
144
145	// Check if this cell contains the particle.
146	Position r {p.r_local()};	2,147,483,647✔
147	Direction u {p.u_local()};	2,147,483,647✔
148	auto surf = p.surface();	2,147,483,647✔
149	if (model::cells[i_cell]->contains(r, u, surf)) {	2,147,483,647✔
150	p.lowest_coord().cell() = i_cell;	2,147,483,647✔
151	found = true;	2,147,483,647✔
152	break;	2,147,483,647✔
153	}
154	}
155
156	// If we're attempting a neighbor list search and fail, we
157	// now know we should return false. This will trigger an
158	// exhaustive search from neighbor_list_find_cell and make
159	// the result from that be appended to the neighbor list.
160	if (!found) {	2,147,483,647✔
161	return found;
162	}
163	}
164
165	// Check successively lower coordinate levels until finding material fill
166	for (;; ++p.n_coord()) {	2,147,483,647✔
167	// If we did not attempt to use neighbor lists, i_cell is still C_NONE. In
168	// that case, we should now do an exhaustive search to find the right value
169	// of i_cell.
170	//
171	// Alternatively, neighbor list searches could have succeeded, but we found
172	// that the fill of the neighbor cell was another universe. As such, in the
173	// code below this conditional, we set i_cell back to C_NONE to indicate
174	// that.
175	if (i_cell == C_NONE) {	2,147,483,647✔
176	int i_universe = p.lowest_coord().universe();	2,147,483,647✔
177	const auto& univ {model::universes[i_universe]};	2,147,483,647✔
178	found = univ->find_cell(p);	2,147,483,647✔
179	}
180
181	if (!found) {	2,147,483,647✔
182	return found;
183	}
184	i_cell = p.lowest_coord().cell();	2,147,483,647!
185
186	// Announce the cell that the particle is entering.
187	if (found && verbose) {	2,147,483,647!
UNCOV 188	auto msg = fmt::format(" Entering cell {}", model::cells[i_cell]->id_);	×
UNCOV 189	write_message(msg, 1);	×
UNCOV 190	}	×
191
192	Cell& c {*model::cells[i_cell]};	2,147,483,647✔
193	if (c.type_ == Fill::MATERIAL) {	2,147,483,647✔
194	// Found a material cell which means this is the lowest coord level.
195
196	p.cell_instance() = 0;	2,147,483,647✔
197	// Find the distribcell instance number.
198	if (c.distribcell_index_ >= 0) {	2,147,483,647✔
199	p.cell_instance() = cell_instance_at_level(p, p.n_coord() - 1);	2,147,483,647✔
200	}
201
202	// Set the material, temperature and density multiplier.
203	p.material_last() = p.material();	2,147,483,647✔
204	p.material() = c.material(p.cell_instance());	2,147,483,647✔
205	p.sqrtkT_last() = p.sqrtkT();	2,147,483,647✔
206	p.sqrtkT() = c.sqrtkT(p.cell_instance());	2,147,483,647✔
207	p.density_mult_last() = p.density_mult();	2,147,483,647✔
208	p.density_mult() = c.density_mult(p.cell_instance());	2,147,483,647✔
209
210	return true;	2,147,483,647✔
211
212	} else if (c.type_ == Fill::UNIVERSE) {	1,432,772,650✔
213	//========================================================================
214	//! Found a lower universe, update this coord level then search the next.
215
216	// Set the lower coordinate level universe.
217	auto& coord {p.coord(p.n_coord())};	1,001,660,078✔
218	coord.universe() = c.fill_;	1,001,660,078✔
219
220	// Set the position and direction.
221	coord.r() = p.r_local();	1,001,660,078✔
222	coord.u() = p.u_local();	1,001,660,078✔
223
224	// Apply translation.
225	coord.r() -= c.translation_;	1,001,660,078✔
226
227	// Apply rotation.
228	if (!c.rotation_.empty()) {	1,001,660,078✔
229	coord.rotate(c.rotation_);	66,157,597✔
230	}
231
232	} else if (c.type_ == Fill::LATTICE) {	431,112,572!
233	//========================================================================
234	//! Found a lower lattice, update this coord level then search the next.
235
236	Lattice& lat {*model::lattices[c.fill_]};	431,112,572✔
237
238	// Set the position and direction.
239	auto& coord {p.coord(p.n_coord())};	431,112,572✔
240	coord.r() = p.r_local();	431,112,572✔
241	coord.u() = p.u_local();	431,112,572✔
242
243	// Apply translation.
244	coord.r() -= c.translation_;	431,112,572✔
245
246	// Apply rotation.
247	if (!c.rotation_.empty()) {	431,112,572✔
248	coord.rotate(c.rotation_);	358,336✔
249	}
250
251	// Determine lattice indices.
252	auto& i_xyz {coord.lattice_index()};	431,112,572✔
253	lat.get_indices(coord.r(), coord.u(), i_xyz);	431,112,572✔
254
255	// Get local position in appropriate lattice cell
256	coord.r() = lat.get_local_position(coord.r(), i_xyz);	431,112,572✔
257
258	// Set lattice indices.
259	coord.lattice() = c.fill_;	431,112,572✔
260
261	// Set the lower coordinate level universe.
262	if (lat.are_valid_indices(i_xyz)) {	431,112,572✔
263	coord.universe() = lat[i_xyz];	426,228,605✔
264	} else {
265	if (lat.outer_ != NO_OUTER_UNIVERSE) {	4,883,967!
266	coord.universe() = lat.outer_;	4,883,967✔
267	} else {
UNCOV 268	p.mark_as_lost(fmt::format(	×
269	"Particle {} left lattice {}, but it has no outer definition.",
UNCOV 270	p.id(), lat.id_));	×
271	}
272	}
273	}
274	i_cell = C_NONE; // trip non-neighbor cell search at next iteration	1,432,772,650✔
275	found = false;	1,432,772,650✔
276	}
277
278	return found;
279	}
280
281	//==============================================================================
282
283	bool neighbor_list_find_cell(GeometryState& p, bool verbose)	2,147,483,647✔
284	{
285
286	// Reset all the deeper coordinate levels.
287	for (int i = p.n_coord(); i < model::n_coord_levels; i++) {	2,147,483,647✔
288	p.coord(i).reset();	1,937,636,361✔
289	}
290
291	// Get the cell this particle was in previously.
292	auto coord_lvl = p.n_coord() - 1;	2,147,483,647✔
293	auto i_cell = p.coord(coord_lvl).cell();	2,147,483,647✔
294	Cell& c {*model::cells[i_cell]};	2,147,483,647✔
295
296	// Search for the particle in that cell's neighbor list. Return if we
297	// found the particle.
298	bool found = find_cell_inner(p, &c.neighbors_, verbose);	2,147,483,647✔
299	if (found)	2,147,483,647✔
300	return found;
301
302	// The particle could not be found in the neighbor list. Try searching all
303	// cells in this universe, and update the neighbor list if we find a new
304	// neighboring cell.
305	found = find_cell_inner(p, nullptr, verbose);	1,602,213✔
306	if (found)	1,602,213✔
307	c.neighbors_.push_back(p.coord(coord_lvl).cell());	30,476✔
308	return found;
309	}
310
311	bool exhaustive_find_cell(GeometryState& p, bool verbose)	1,638,313,177✔
312	{
313	int i_universe = p.lowest_coord().universe();	1,638,313,177✔
314	if (i_universe == C_NONE) {	1,638,313,177✔
315	p.coord(0).universe() = model::root_universe;	616,706,802✔
316	p.n_coord() = 1;	616,706,802✔
317	i_universe = model::root_universe;	616,706,802✔
318	}
319	// Reset all the deeper coordinate levels.
320	for (int i = p.n_coord(); i < model::n_coord_levels; i++) {	1,990,723,608✔
321	p.coord(i).reset();	352,410,431✔
322	}
323	return find_cell_inner(p, nullptr, verbose);	1,638,313,177✔
324	}
325
326	//==============================================================================
327
328	void cross_lattice(GeometryState& p, const BoundaryInfo& boundary, bool verbose)	801,517,771✔
329	{
330	auto& coord {p.lowest_coord()};	801,517,771!
331	auto& lat {*model::lattices[coord.lattice()]};	801,517,771!
332
333	if (verbose) {	801,517,771!
UNCOV 334	write_message(	×
UNCOV 335	fmt::format(" Crossing lattice {}. Current position ({},{},{}). r={}",	×
UNCOV 336	lat.id_, coord.lattice_index()[0], coord.lattice_index()[1],	×
337	coord.lattice_index()[2], p.r()),	×
338	1);
339	}
340
341	// Set the lattice indices.
342	coord.lattice_index()[0] += boundary.lattice_translation()[0];	801,517,771✔
343	coord.lattice_index()[1] += boundary.lattice_translation()[1];	801,517,771✔
344	coord.lattice_index()[2] += boundary.lattice_translation()[2];	801,517,771✔
345
346	// Set the new coordinate position.
347	const auto& upper_coord {p.coord(p.n_coord() - 2)};	801,517,771✔
348	const auto& cell {model::cells[upper_coord.cell()]};	801,517,771✔
349	Position r = upper_coord.r();	801,517,771✔
350	r -= cell->translation_;	801,517,771✔
351	if (!cell->rotation_.empty()) {	801,517,771✔
352	r = r.rotate(cell->rotation_);	471,647✔
353	}
354	p.r_local() = lat.get_local_position(r, coord.lattice_index());	801,517,771✔
355
356	if (!lat.are_valid_indices(coord.lattice_index())) {	801,517,771✔
357	// The particle is outside the lattice. Search for it from the base coords.
358	p.n_coord() = 1;	3,714,425✔
359	bool found = exhaustive_find_cell(p);	3,714,425✔
360
361	if (!found) {	3,714,425!
UNCOV 362	p.mark_as_lost(fmt::format("Particle {} could not be located after "	×
363	"crossing a boundary of lattice {}",
UNCOV 364	p.id(), lat.id_));	×
365	}
366
367	} else {
368	// Find cell in next lattice element.
369	p.lowest_coord().universe() = lat[coord.lattice_index()];	797,803,346✔
370	bool found = exhaustive_find_cell(p);	797,803,346✔
371
372	if (!found) {	797,803,346!
373	// A particle crossing the corner of a lattice tile may not be found. In
374	// this case, search for it from the base coords.
UNCOV 375	p.n_coord() = 1;	×
UNCOV 376	bool found = exhaustive_find_cell(p);	×
UNCOV 377	if (!found) {	×
UNCOV 378	p.mark_as_lost(fmt::format("Particle {} could not be located after "	×
379	"crossing a boundary of lattice {}",
UNCOV 380	p.id(), lat.id_));	×
381	}
382	}
383	}
384	}	801,517,771✔
385
386	//==============================================================================
387
388	BoundaryInfo distance_to_boundary(GeometryState& p)	2,147,483,647✔
389	{
390	BoundaryInfo info;	2,147,483,647✔
391	double d_lat = INFINITY;	2,147,483,647✔
392	double d_surf = INFINITY;	2,147,483,647✔
393	int32_t level_surf_cross;	2,147,483,647✔
394	array<int, 3> level_lat_trans {};	2,147,483,647✔
395
396	// Loop over each coordinate level.
397	for (int i = 0; i < p.n_coord(); i++) {	2,147,483,647✔
398	const auto& coord {p.coord(i)};	2,147,483,647✔
399	const Position& r {coord.r()};	2,147,483,647✔
400	const Direction& u {coord.u()};	2,147,483,647✔
401	Cell& c {*model::cells[coord.cell()]};	2,147,483,647✔
402
403	// Find the oncoming surface in this cell and the distance to it.
404	auto surface_distance = c.distance(r, u, p.surface(), &p);	2,147,483,647✔
405	d_surf = surface_distance.first;	2,147,483,647✔
406	level_surf_cross = surface_distance.second;	2,147,483,647✔
407
408	// Find the distance to the next lattice tile crossing.
409	if (coord.lattice() != C_NONE) {	2,147,483,647✔
410	auto& lat {*model::lattices[coord.lattice()]};	1,386,026,049!
411	// TODO: refactor so both lattice use the same position argument (which
412	// also means the lat.type attribute can be removed)
413	std::pair<double, array<int, 3>> lattice_distance;	1,386,026,049✔
414	switch (lat.type_) {	1,386,026,049!
415	case LatticeType::rect:	1,300,522,752✔
416	lattice_distance = lat.distance(r, u, coord.lattice_index());	1,300,522,752✔
417	break;	1,300,522,752✔
418	case LatticeType::hex:	85,503,297✔
419	auto& cell_above {model::cells[p.coord(i - 1).cell()]};	85,503,297✔
420	Position r_hex {p.coord(i - 1).r()};	85,503,297✔
421	r_hex -= cell_above->translation_;	85,503,297✔
422	if (coord.rotated()) {	85,503,297✔
423	r_hex = r_hex.rotate(cell_above->rotation_);	701,954✔
424	}
425	r_hex.z = coord.r().z;	85,503,297✔
426	lattice_distance = lat.distance(r_hex, u, coord.lattice_index());	85,503,297✔
427	break;	85,503,297✔
428	}
429	d_lat = lattice_distance.first;	1,386,026,049✔
430	level_lat_trans = lattice_distance.second;	1,386,026,049✔
431
432	if (d_lat < 0) {	1,386,026,049!
UNCOV 433	p.mark_as_lost(fmt::format("Particle {} had a negative distance "	×
434	"to a lattice boundary.",
UNCOV 435	p.id()));	×
436	}
437	}
438
439	// If the boundary on this coordinate level is coincident with a boundary on
440	// a higher level then we need to make sure that the higher level boundary
441	// is selected. This logic must consider floating point precision.
442	double& d = info.distance();	2,147,483,647✔
443	if (d_surf < d_lat - FP_COINCIDENT) {	2,147,483,647✔
444	if (d == INFINITY \|\| (d - d_surf) / d >= FP_REL_PRECISION) {	2,147,483,647✔
445	// Update closest distance
446	d = d_surf;	2,147,483,647✔
447
448	// If the cell is not simple, it is possible that both the negative and
449	// positive half-space were given in the region specification. Thus, we
450	// have to explicitly check which half-space the particle would be
451	// traveling into if the surface is crossed
452	if (c.is_simple() \|\| d == INFTY) {	2,147,483,647✔
453	info.surface() = level_surf_cross;	2,147,483,647✔
454	} else {
455	Position r_hit = r + d_surf * u;	22,141,426✔
456	Surface& surf {*model::surfaces[std::abs(level_surf_cross) - 1]};	22,141,426✔
457	Direction norm = surf.normal(r_hit);	22,141,426✔
458	if (u.dot(norm) > 0) {	22,141,426✔
459	info.surface() = std::abs(level_surf_cross);	11,069,060✔
460	} else {
461	info.surface() = -std::abs(level_surf_cross);	11,072,366✔
462	}
463	}
464
465	info.lattice_translation()[0] = 0;	2,147,483,647✔
466	info.lattice_translation()[1] = 0;	2,147,483,647✔
467	info.lattice_translation()[2] = 0;	2,147,483,647✔
468	info.coord_level() = i + 1;	2,147,483,647✔
469	}
470	} else {
471	if (d == INFINITY \|\| (d - d_lat) / d >= FP_REL_PRECISION) {	1,151,490,069!
472	d = d_lat;	942,562,605✔
473	info.surface() = SURFACE_NONE;	942,562,605✔
474	info.lattice_translation() = level_lat_trans;	942,562,605✔
475	info.coord_level() = i + 1;	942,562,605✔
476	}
477	}
478	}
479	return info;	2,147,483,647✔
480	}
481
482	//==============================================================================
483
484	BoundaryInfo distance_to_external_boundary(GeometryState& p)	264,250,987✔
485	{
486	BoundaryInfo info;	264,250,987✔
487
488	info.distance() = INFTY;	264,250,987✔
489	info.surface() = 0;	264,250,987✔
490	info.coord_level() = 1;	264,250,987✔
491	for (auto s_idx : model::boundary_surfaces) {	1,321,254,935✔
492	const auto& s = model::surfaces[s_idx];	1,057,003,948✔
493	double surf_dist = s->distance(p.r(), p.u(), false);	1,057,003,948✔
494	if (surf_dist < info.distance()) {	1,057,003,948✔
495	info.distance() = surf_dist;	395,555,237✔
496	info.surface() = s_idx + 1;	395,555,237✔
497	if (s->sense(p.r(), p.u())) {	395,555,237✔
498	info.surface() *= -1;	192,576,659✔
499	}
500	}
501	}
502
503	return info;	264,250,987✔
504	}
505
506	//==============================================================================
507	// C API
508	//==============================================================================
509
510	extern "C" int openmc_find_cell(	600,308✔
511	const double* xyz, int32_t* index, int32_t* instance)
512	{
513	GeometryState geom_state;	600,308✔
514
515	geom_state.r() = Position {xyz};	600,308✔
516	geom_state.u() = {0.0, 0.0, 1.0};	600,308✔
517
518	if (!exhaustive_find_cell(geom_state)) {	600,308✔
519	set_errmsg(	11✔
520	fmt::format("Could not find cell at position {}.", geom_state.r()));	11✔
521	return OPENMC_E_GEOMETRY;	11✔
522	}
523
524	*index = geom_state.lowest_coord().cell();	600,297✔
525	*instance = geom_state.cell_instance();	600,297✔
526	return 0;	600,297✔
527	}	600,308✔
528
529	extern "C" int openmc_global_bounding_box(double* llc, double* urc)	11✔
530	{
531	auto bbox = model::universes.at(model::root_universe)->bounding_box();	11✔
532
533	// set lower left corner values
534	llc[0] = bbox.min.x;	11✔
535	llc[1] = bbox.min.y;	11✔
536	llc[2] = bbox.min.z;	11✔
537
538	// set upper right corner values
539	urc[0] = bbox.max.x;	11✔
540	urc[1] = bbox.max.y;	11✔
541	urc[2] = bbox.max.z;	11✔
542
543	return 0;	11✔
544	}
545
546	} // namespace openmc

openmc-dev / openmc / 28975504630

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous