/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/random.h: 1767 - 1870
--------------------------------------------------------------------------------

1767: 	{ return _M_a; }
1768: 
1769: 	result_type
1770: 	b() const
1771: 	{ return _M_b; }
[...]
1870: 	  return (__aurng() * (__p.b() - __p.a())) + __p.a();
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/ext/new_allocator.h: 111 - 145
--------------------------------------------------------------------------------

111: 	if (__builtin_expect(__n > this->_M_max_size(), false))
112: 	  {
113: 	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
114: 	    // 3190. allocator::allocate sometimes returns too little storage
115: 	    if (__n > (std::size_t(-1) / sizeof(_Tp)))
116: 	      std::__throw_bad_array_new_length();
[...]
127: 	return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
[...]
145: 	::operator delete(__p
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/random.tcc: 3364 - 3373
--------------------------------------------------------------------------------

3364:       for (size_t __k = __m; __k != 0; --__k)
3365: 	{
3366: 	  __sum += _RealType(__urng() - __urng.min()) * __tmp;
3367: 	  __tmp *= __r;
3368: 	}
3369:       __ret = __sum / __tmp;
3370:       if (__builtin_expect(__ret >= _RealType(1), 0))
3371: 	{
3372: #if _GLIBCXX_USE_C99_MATH_TR1
3373: 	  __ret = std::nextafter(_RealType(1), _RealType(0));
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Drivers/miniqmc.cpp: 411 - 475
--------------------------------------------------------------------------------

411: #pragma omp parallel for reduction(+ : my_accepted)
412:     for (int iw = 0; iw < nmovers; iw++)
413:     {
414:       auto& els          = *mover_list[iw]->els_ptr;
415:       auto& random_th    = mover_list[iw]->rng;
416:       auto& wavefunction = mover_list[iw]->wavefunction;
417:       auto& ecp          = mover_list[iw]->nlpp;
418: 
419:       ParticlePos delta(nels);
420:       ParticlePos rOnSphere(nknots);
421: 
422:       aligned_vector<RealType> ur(nels);
423: 
424:       Timers[Timer_Diffusion].get().start();
425:       for (int l = 0; l < nsubsteps; ++l) // drift-and-diffusion
426:       {
427:         random_th.generate_uniform(ur.data(), nels);
428:         random_th.generate_normal(&delta[0][0], nels3);
429:         for (int iel = 0; iel < nels; ++iel)
430:         {
431:           // Compute gradient at the current position
432:           Timers[Timer_evalGrad].get().start();
433:           PosType grad_now = wavefunction.evalGrad(els, iel);
434:           Timers[Timer_evalGrad].get().stop();
435: 
436:           // Construct trial move
437:           els.makeMove(iel, delta[iel]);
438: 
439:           // Compute gradient at the trial position
440:           Timers[Timer_ratioGrad].get().start();
441:           PosType grad_new;
442:           wavefunction.ratioGrad(els, iel, grad_new);
443:           Timers[Timer_ratioGrad].get().stop();
444: 
445:           // Accept/reject the trial move
446:           if (ur[iel] < accept) // MC
447:           {
448:             // Update position, and update temporary storage
449:             Timers[Timer_Update].get().start();
450:             wavefunction.acceptMove(els, iel);
451:             Timers[Timer_Update].get().stop();
452:             els.acceptMove(iel);
453:             my_accepted++;
454:           }
455:           else
456:           {
457:             els.rejectMove(iel);
458:             wavefunction.restore(iel);
459:           }
460:         } // iel
461:         wavefunction.completeUpdates();
462:       }   // substeps
463: 
464:       els.donePbyP();
465: 
466:       // evaluate Kinetic Energy
467:       wavefunction.evaluateGL(els);
468: 
469:       Timers[Timer_Diffusion].get().stop();
470: 
471:       // Compute NLPP energy using integral over spherical points
472:       {
473:         ecp.randomize(rOnSphere); // pick random sphere
474:         ScopedTimer local(Timers[Timer_ECP]);
475:         ecp.evaluate(els, wavefunction);
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Particle/ParticleAttrib.h: 34 - 34
--------------------------------------------------------------------------------

34:   explicit inline ParticleAttrib(size_t n = 0) : __my_base(n), InUnit(0) {}
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 242 - 249
--------------------------------------------------------------------------------

242:   ScopeGuard(TIMER& t) : timer(t) { timer.start(); }
[...]
249:   ~ScopeGuard() { timer.stop(); }
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_vector.h: 98 - 1770
--------------------------------------------------------------------------------

98: 	: _M_start(), _M_finish(), _M_end_of_storage()
[...]
335: 	_M_deallocate(_M_impl._M_start,
[...]
346: 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
[...]
353: 	if (__p)
[...]
361: 	this->_M_impl._M_start = this->_M_allocate(__n);
362: 	this->_M_impl._M_finish = this->_M_impl._M_start;
363: 	this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
[...]
1046: 	return *(this->_M_impl._M_start + __n);
[...]
1605: 	this->_M_impl._M_finish =
[...]
1769: 	if (__n > _S_max_size(_Tp_alloc_type(__a)))
1770: 	  __throw_length_error(
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/refwrap.h: 338 - 338
--------------------------------------------------------------------------------

338:       { return *_M_data; }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Platforms/CPU/SIMD/Mallocator.hpp: 76 - 78
--------------------------------------------------------------------------------

76:     if (n == 0)
77:       throw std::runtime_error("Mallocator::deallocate does not accept size 0 allocations.");
78:     free(p);
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 46 - 302
--------------------------------------------------------------------------------

46:   explicit inline Vector(size_t n = 0, Type_t val = Type_t()) : nLocal(n)
47:   {
48:     if (n)
[...]
144:   virtual ~Vector() { free(); }
[...]
210:     if (nAllocated)
211:     {
212:       mAllocator.deallocate(X, nAllocated);
[...]
289:   T* X = nullptr;
[...]
300:     X          = mAllocator.allocate(n);
301:     nLocal     = n;
302:     nAllocated = n;
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_algobase.h: 911 - 912
--------------------------------------------------------------------------------

911:       for (; __first != __last; ++__first)
912: 	*__first = __value;
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_uninitialized.h: 687 - 687
--------------------------------------------------------------------------------

687: 	  for (; __n > 0; --__n, (void) ++__cur)
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/unique_ptr.h: 173 - 173
--------------------------------------------------------------------------------

173:       pointer    _M_ptr() const { return std::get<0>(_M_t); }
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/alloc_traits.h: 261 - 318
--------------------------------------------------------------------------------

261: 	  ::new((void*)__p) _Tp(std::forward<_Args>(__args)...);
[...]
318:       { return __a.allocate(__n); }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/TinyVector.h: 62 - 62
--------------------------------------------------------------------------------

62:       X[d] = T(0);
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Utilities/StdRandom.h: 102 - 106
--------------------------------------------------------------------------------

102:     for (int i = 0; i < n; ++i)
103:       d[i] = uniform(myRNG);
104:   }
105: 
106:   inline void generate_normal(T* restrict d, int n) { BoxMuller2::generate(*this, d, n); }
