/opt/arm/gcc-14.2.0_AmazonLinux-2023/lib/gcc/aarch64-linux-gnu/14.2.0/../../../../include/c++/14.2.0/bits/stl_vector.h: 993 - 1150 -------------------------------------------------------------------------------- 993: { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); } [...] 1150: return *(this->_M_impl._M_start + __n); /home/fmusial/MD_Benchmarks/simulation.cpp: 142 - 176 -------------------------------------------------------------------------------- 142: for (int cx = 0; cx < cellList.num_cells; ++cx) { 143: for (int cy = 0; cy < cellList.num_cells; ++cy) { 144: for (int cz = 0; cz < cellList.num_cells; ++cz) { 145: int cellIndex = cx + cy * cellList.num_cells + cz * cellList.num_cells * cellList.num_cells; [...] 158: for (int n = 0; n < 13; ++n) { 159: 160: int dx = neighbor_patterns[n][0]; 161: int dy = neighbor_patterns[n][1]; 162: int dz = neighbor_patterns[n][2]; 163: 164: int nx = (cx + dx + cellList.num_cells) % cellList.num_cells; 165: int ny = (cy + dy + cellList.num_cells) % cellList.num_cells; 166: int nz = (cz + dz + cellList.num_cells) % cellList.num_cells; 167: 168: int neighborCellIndex = nx + ny * cellList.num_cells + nz * cellList.num_cells * cellList.num_cells; 169: 170: // Bounds check for neighbor cell 171: if (neighborCellIndex < 0 || neighborCellIndex >= static_cast(cellList.cells.size())) { 172: continue; 173: } 174: 175: // Iterate through particles in this cell 176: for (size_t pi = 0; pi < cellList.cells[cellIndex].size(); ++pi) {