/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/Registry.hpp: 81 - 83
--------------------------------------------------------------------------------

81:       bool operator!=(const iterator &That) const { return Cur != That.Cur; }
82:       iterator &operator++() { Cur = Cur->Next; return *this; }
83:       const entry &operator*() const { return Cur->Val; }
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/shared_ptr_base.h: 152 - 1165
--------------------------------------------------------------------------------

152: 	if (__gnu_cxx::__exchange_and_add_dispatch(&_M_use_count, -1) == 1)
153: 	  {
154:             _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_use_count);
155: 	    _M_dispose();
[...]
167: 	    if (__gnu_cxx::__exchange_and_add_dispatch(&_M_weak_count,
168: 						       -1) == 1)
169:               {
170:                 _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_weak_count);
171: 	        _M_destroy();
[...]
727: 	if (_M_pi != nullptr)
728: 	  _M_pi->_M_release();
729:       }
730: 
731:       __shared_count(const __shared_count& __r) noexcept
732:       : _M_pi(__r._M_pi)
733:       {
734: 	if (_M_pi != 0)
[...]
1165:       __shared_ptr(const __shared_ptr&) noexcept = default;
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/index/IndexValue.hpp: 252 - 252
--------------------------------------------------------------------------------

252:     return (value == x);
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/stl_tree.h: 316 - 2548
--------------------------------------------------------------------------------

316:       { return _M_node == __x._M_node; }
[...]
742:       { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
[...]
787:       { return static_cast<_Link_type>(__x->_M_left); }
[...]
795:       { return static_cast<_Link_type>(__x->_M_right); }
[...]
1894:       while (__x != 0)
1895: 	if (!_M_impl._M_key_compare(_S_key(__x), __k))
[...]
2546:       iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);
2547:       return (__j == end()
2548: 	      || _M_impl._M_key_compare(__k,
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/ext/atomicity.h: 49 - 95
--------------------------------------------------------------------------------

49:   { return __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL); }
50: 
51:   static inline void
52:   __atomic_add(volatile _Atomic_word* __mem, int __val)
53:   { __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL); }
[...]
67:     _Atomic_word __result = *__mem;
68:     *__mem += __val;
[...]
74:   { *__mem += __val; }
[...]
81:     if (__gthread_active_p())
[...]
95:     if (__gthread_active_p())
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/src/Kripke/Kernel.h: 43 - 52
--------------------------------------------------------------------------------

43:         RAJA::RangeSegment(0, num_elem),
44:         [=](RAJA::Index_type i){
45: 			 	  view1d(i) = value;
[...]
52:       for(Kripke::SdomId sdom_id : field.getWorkList()){
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/src/Kripke/Timing.h: 91 - 101
--------------------------------------------------------------------------------

91:         timer(timer_obj),
92:         name(timer_name)
93: #ifdef KRIPKE_USE_CALIPER
94:         , cali_timer(cali_annot.begin(timer_name.c_str()))
95: #endif
96:     {
97:         timer.start(name);
98:     }
99:     inline ~BlockTimer(){
100:       timer.stop(name);
101:     }
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/stl_iterator.h: 784 - 887
--------------------------------------------------------------------------------

784:       : _M_current(__i) { }
[...]
806: 	++_M_current;
[...]
887:     { return __lhs.base() != __rhs.base(); }
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/policy/loop/forall.hpp: 59 - 59
--------------------------------------------------------------------------------

59:   for (decltype(distance_it) i = 0; i < distance_it; ++i) {
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/src/Kripke/Core/DataStore.h: 49 - 54
--------------------------------------------------------------------------------

49:         throw std::domain_error("Cannot find '" + name + "' in DataStore");
50:       }
51: 
52:       // Cast from BaseVar* and check for correctness
53:       T *var_ptr = dynamic_cast<T*>(it->second);
54:       KRIPKE_ASSERT(var_ptr != nullptr, "Error casting '%s'", name.c_str());
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/Layout.hpp: 55 - 132
--------------------------------------------------------------------------------

55:     return a * b;
[...]
132:             sizes[RangeInts] ? 1 : 0,
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/stl_vector.h: 285 - 951
--------------------------------------------------------------------------------

285: 	_M_deallocate(_M_impl._M_start,
[...]
303: 	if (__p)
[...]
806:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
951: 	return *(this->_M_impl._M_start + __n);
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/src/Kripke/Core/Field.h: 121 - 224
--------------------------------------------------------------------------------

121:         size_t chunk_id = m_subdomain_to_chunk[*sdom_id];
122: 
123:         ElementPtr ptr = m_chunk_to_data[chunk_id];
124:         size_t sdom_size = m_chunk_to_size[chunk_id];
[...]
221:         size_t chunk_id = Parent::m_subdomain_to_chunk[*sdom_id];
222: 
223:         auto ptr = Parent::m_chunk_to_data[chunk_id];
224:         auto layout = m_chunk_to_layout[chunk_id];
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/tpl/raja/include/RAJA/util/plugins.hpp: 21 - 37
--------------------------------------------------------------------------------

21:   for (auto plugin = PluginRegistry::begin(); 
22:       plugin != PluginRegistry::end();
23:       ++plugin)
24:   {
25:     (*plugin).get()->preLaunch(p);
[...]
33:   for (auto plugin = PluginRegistry::begin(); 
34:       plugin != PluginRegistry::end();
35:       ++plugin)
36:   {
37:     (*plugin).get()->postLaunch(p);
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/ext/new_allocator.h: 125 - 125
--------------------------------------------------------------------------------

125: 	::operator delete(__p);
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/basic_string.h: 150 - 6140
--------------------------------------------------------------------------------

150: 	: allocator_type(__a), _M_p(__dat) { }
151: 
152: 	_Alloc_hider(pointer __dat, _Alloc&& __a = _Alloc())
153: 	: allocator_type(std::move(__a)), _M_p(__dat) { }
[...]
176:       { _M_string_length = __length; }
177: 
178:       pointer
179:       _M_data() const
180:       { return _M_dataplus._M_p; }
[...]
186: 	return std::pointer_traits<pointer>::pointer_to(*_M_local_buf);
[...]
196: 	return std::pointer_traits<const_pointer>::pointer_to(*_M_local_buf);
[...]
215:       { return _M_data() == _M_local_data(); }
[...]
224: 	if (!_M_is_local())
[...]
396: 	const difference_type __d = difference_type(__n1 - __n2);
397: 
398: 	if (__d > __gnu_cxx::__numeric_traits<int>::__max)
[...]
935:       { return _M_string_length; }
[...]
2851: 	const size_type __len = std::min(__size, __osize);
2852: 
2853: 	int __r = traits_type::compare(_M_data(), __str.data(), __len);
2854: 	if (!__r)
2855: 	  __r = _S_compare(__size, __osize);
[...]
6140:     { return __lhs.compare(__rhs) < 0; }
/scratch_na/users/xoserete/qaas_runs/171-319-6990/intel/Kripke/build/Kripke/src/Kripke/SweepSolver.cpp: 24 - 87
--------------------------------------------------------------------------------

24: {
[...]
34:   if(block_jacobi){
35:     comm = new BlockJacobiComm(data_store);
36:   }
37:   else {
38:     comm = new SweepComm(data_store);
39:   }
40: 
41:   // Add all subdomains in our list
42:   for(size_t i = 0;i < subdomain_list.size();++ i){
43: //    Kripke::Core::Comm default_comm;
44: //    printf("SweepSolver: rank=%d, sdom=%d\n", (int)default_comm.rank(), (int)*subdomain_list[i]);
45:     SdomId sdom_id = subdomain_list[i];
46:     comm->addSubdomain(data_store, sdom_id);
[...]
52:   while(comm->workRemaining()){
53: 
54:     std::vector<SdomId> sdom_ready = comm->readySubdomains();
55:     int backlog = sdom_ready.size();
56: 
57:     // Run top of list
58:     if(backlog > 0){
59:       SdomId sdom_id = sdom_ready[0];
60: 
61:       auto upwind = field_upwind.getView(sdom_id);
62: 
63:       // Clear boundary conditions
64:       if(upwind(Dimension{0}) == -1){
65:         Kripke::Kernel::kConst(data_store.getVariable<Field_IPlane>("i_plane"), sdom_id, 0.0);
66:       }
67:       if(upwind(Dimension{1}) == -1){
68:         Kripke::Kernel::kConst(data_store.getVariable<Field_JPlane>("j_plane"), sdom_id, 0.0);
69:       }
70:       if(upwind(Dimension{2}) == -1){
71:         Kripke::Kernel::kConst(data_store.getVariable<Field_KPlane>("k_plane"), sdom_id, 0.0);
72:       }
73: 
74:       // Perform subdomain sweep
75:       Kripke::Kernel::sweepSubdomain(data_store, Kripke::SdomId{sdom_id});
76: 
77:       // Mark as complete (and do any communication)
78:       comm->markComplete(sdom_id);
79:     }
80:   }
81: 
82:   delete comm;
83: 
84: //  printf("\nAfter sweep psi:\n");
85: //  data_store.getVariable<Field_Flux>("psi").dump();
86: 
87: }
/usr/lib/gcc/x86_64-redhat-linux/8/../../../../include/c++/8/bits/char_traits.h: 287 - 359
--------------------------------------------------------------------------------

287:       { __c1 = __c2; }
[...]
317: 	if (__n == 0)
318: 	  return 0;
319: 	return __builtin_memcmp(__s1, __s2, __n);
[...]
359: 	return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n));
