| Base 6ae6ba | Head #4517 68fdee | ||||
|---|---|---|---|---|---|
| Total | Total | +/- | New | ||
| Rate | 65.86% | 65.86% | -0.00% | 100.00% | |
| Hits | 79476 | 79469 | -7 | 18 | |
| Misses | 41196 | 41197 | +1 | 0 | |
| Filename | Stmts | Miss | Cover |
|---|---|---|---|
| src/mesh/distributed_mesh.C | -4 | 0 | -0.03% |
| src/mesh/mesh_triangle_holes.C | 0 | +1 | -0.27% |
| src/mesh/unstructured_mesh.C | -2 | 0 | -0.04% |
| TOTAL | -6 | +1 | -0.00% |
codecodecode+
261 262 263 264 + 265 + 266 + 267 + 268 + 269 + 270 271 + 272 + 273 + 274 + 275 + 276 + 277 278 279 |
_max_node_id = this->parallel_max_node_id(); _max_elem_id = this->parallel_max_elem_id(); _next_free_unpartitioned_elem_id = ((_max_elem_id-1) / (this->n_processors() + 1) + 1) * (this->n_processors() + 1) + this->n_processors(); _next_free_local_elem_id = ((_max_elem_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) * (this->n_processors() + 1) + this->processor_id(); _next_free_unpartitioned_node_id = ((_max_node_id-1) / (this->n_processors() + 1) + 1) * (this->n_processors() + 1) + this->n_processors(); _next_free_local_node_id = ((_max_node_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) * (this->n_processors() + 1) + this->processor_id(); #ifdef LIBMESH_ENABLE_UNIQUE_ID _next_unique_id = this->parallel_max_unique_id(); |
270 271 272 273 274 275 276 |
{ ray_target = inside - Point(1); intersection_distances = this->find_ray_intersections(inside, ray_target); } // I'd make this an assert, but I'm not 100% confident we can't |
118 119 120 121 + 122 + 123 124 125 |
const unsigned int hon_begin = lo_elem.n_nodes(); const unsigned int hon_end = hi_elem->n_nodes(); libmesh_assert_less (hon_begin, hon_end); libmesh_assert_less_equal (hon_end-hon_begin, max_new_nodes_per_elem); for (unsigned int hon=hon_begin; hon<hon_end; hon++) |
341 342 343 344 + 345 346 347 |
* The mesh should at least be consistent enough for us to add new * nodes consistently. */ mesh.update_parallel_id_counts(); /* * If the mesh is empty then we have nothing to do |
414 415 416 417 + 418 419 420 |
* completely-partitioned meshes (where we'll sync nodes later); * let's keep track to make sure we're not in any in-between state. */ dof_id_type n_unpartitioned_elem = 0; /** * Loop over the elements in the given range. If any are |
551 552 553 554 + 555 + 556 557 558 |
// We'd better be effectively serialized here. In theory we // could support more complicated cases but for now we // only support "completely partitioned" and/or "serialized" if (mesh.is_serial()) libmesh_assert(mesh.comm().verify(n_unpartitioned_elem)); else libmesh_not_implemented(); } |