24201667475

Committed 09 Apr 2026 04:34PM UTC coverage: 81.306% (-0.03%) from 81.337%

Build # 24201667475

Build Type

Pull #3702

github

Committed by

web-flow

Commit Message

Merge 85e3d3a8b into 1eb368bbd

Pull Request Pull Request #3702: Random Ray Kinetic Simulation Mode

Coverage Stats

18160 of 26198 branches covered (69.32%)

Branch coverage included in aggregate %.

935 of 1075 new or added lines in 20 files covered. (86.98%)

74 existing lines in 8 files now uncovered.

58936 of 68624 relevant lines covered (85.88%)

52648244.8 hits per line

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

83.86

/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<int64_t> overlap_check_count;

} // namespace model

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

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

  // 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())) {
        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_));
          }
          return true;
        }
#pragma omp atomic
        ++model::overlap_check_count[index_cell];
      }
    }
  }

  return false;
}

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

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;
}

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

openmc-dev / openmc / 24201667475

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