236 lines
7.7 KiB
C++
236 lines
7.7 KiB
C++
/* ----------------------------------------------------------------------
|
|
LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator
|
|
http://lammps.sandia.gov, Sandia National Laboratories
|
|
Steve Plimpton, sjplimp@sandia.gov
|
|
|
|
This software is distributed under the GNU General Public License.
|
|
|
|
See the README file in the top-level LAMMPS directory.
|
|
------------------------------------------------------------------------- */
|
|
|
|
/* ----------------------------------------------------------------------
|
|
Contributing author: Axel Kohlmeyer (Temple U)
|
|
------------------------------------------------------------------------- */
|
|
|
|
#include "math.h"
|
|
#include "pair_lj_sdk_coul_long_omp.h"
|
|
#include "atom.h"
|
|
#include "comm.h"
|
|
#include "force.h"
|
|
#include "neighbor.h"
|
|
#include "neigh_list.h"
|
|
|
|
#include "lj_sdk_common.h"
|
|
|
|
#include "suffix.h"
|
|
using namespace LAMMPS_NS;
|
|
using namespace LJSDKParms;
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
PairLJSDKCoulLongOMP::PairLJSDKCoulLongOMP(LAMMPS *lmp) :
|
|
PairLJSDKCoulLong(lmp), ThrOMP(lmp, THR_PAIR)
|
|
{
|
|
suffix_flag |= Suffix::OMP;
|
|
respa_enable = 0;
|
|
}
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
void PairLJSDKCoulLongOMP::compute(int eflag, int vflag)
|
|
{
|
|
if (eflag || vflag) {
|
|
ev_setup(eflag,vflag);
|
|
} else evflag = vflag_fdotr = 0;
|
|
|
|
const int nall = atom->nlocal + atom->nghost;
|
|
const int nthreads = comm->nthreads;
|
|
const int inum = list->inum;
|
|
|
|
#if defined(_OPENMP)
|
|
#pragma omp parallel default(none) shared(eflag,vflag)
|
|
#endif
|
|
{
|
|
int ifrom, ito, tid;
|
|
|
|
loop_setup_thr(ifrom, ito, tid, inum, nthreads);
|
|
ThrData *thr = fix->get_thr(tid);
|
|
ev_setup_thr(eflag, vflag, nall, eatom, vatom, thr);
|
|
|
|
if (evflag) {
|
|
if (eflag) {
|
|
if (force->newton_pair) eval_thr<1,1,1>(ifrom, ito, thr);
|
|
else eval_thr<1,1,0>(ifrom, ito, thr);
|
|
} else {
|
|
if (force->newton_pair) eval_thr<1,0,1>(ifrom, ito, thr);
|
|
else eval_thr<1,0,0>(ifrom, ito, thr);
|
|
}
|
|
} else {
|
|
if (force->newton_pair) eval_thr<0,0,1>(ifrom, ito, thr);
|
|
else eval_thr<0,0,0>(ifrom, ito, thr);
|
|
}
|
|
|
|
reduce_thr(this, eflag, vflag, thr);
|
|
} // end of omp parallel region
|
|
}
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
template <int EVFLAG, int EFLAG, int NEWTON_PAIR>
|
|
void PairLJSDKCoulLongOMP::eval_thr(int iifrom, int iito, ThrData * const thr)
|
|
{
|
|
|
|
const dbl3_t * _noalias const x = (dbl3_t *) atom->x[0];
|
|
dbl3_t * _noalias const f = (dbl3_t *) thr->get_f()[0];
|
|
const double * _noalias const q = atom->q;
|
|
const int * _noalias const type = atom->type;
|
|
const double * _noalias const special_coul = force->special_coul;
|
|
const double * _noalias const special_lj = force->special_lj;
|
|
const double qqrd2e = force->qqrd2e;
|
|
|
|
const int * const ilist = list->ilist;
|
|
const int * const numneigh = list->numneigh;
|
|
const int * const * const firstneigh = list->firstneigh;
|
|
const int nlocal = atom->nlocal;
|
|
|
|
// loop over neighbors of my atoms
|
|
|
|
for (int ii = iifrom; ii < iito; ++ii) {
|
|
|
|
const int i = ilist[ii];
|
|
const int itype = type[i];
|
|
const double qtmp = q[i];
|
|
const double xtmp = x[i].x;
|
|
const double ytmp = x[i].y;
|
|
const double ztmp = x[i].z;
|
|
double fxtmp,fytmp,fztmp;
|
|
fxtmp=fytmp=fztmp=0.0;
|
|
|
|
const int * const jlist = firstneigh[i];
|
|
const int jnum = numneigh[i];
|
|
|
|
for (int jj = 0; jj < jnum; jj++) {
|
|
double forcecoul, forcelj, evdwl, ecoul;
|
|
forcecoul = forcelj = evdwl = ecoul = 0.0;
|
|
|
|
const int sbindex = sbmask(jlist[jj]);
|
|
const int j = jlist[jj] & NEIGHMASK;
|
|
|
|
const double delx = xtmp - x[j].x;
|
|
const double dely = ytmp - x[j].y;
|
|
const double delz = ztmp - x[j].z;
|
|
const double rsq = delx*delx + dely*dely + delz*delz;
|
|
const int jtype = type[j];
|
|
|
|
if (rsq < cutsq[itype][jtype]) {
|
|
const double r2inv = 1.0/rsq;
|
|
const int ljt = lj_type[itype][jtype];
|
|
|
|
if (rsq < cut_coulsq) {
|
|
if (!ncoultablebits || rsq <= tabinnersq) {
|
|
const double A1 = 0.254829592;
|
|
const double A2 = -0.284496736;
|
|
const double A3 = 1.421413741;
|
|
const double A4 = -1.453152027;
|
|
const double A5 = 1.061405429;
|
|
const double EWALD_F = 1.12837917;
|
|
const double INV_EWALD_P = 1.0/0.3275911;
|
|
|
|
const double r = sqrt(rsq);
|
|
const double grij = g_ewald * r;
|
|
const double expm2 = exp(-grij*grij);
|
|
const double t = INV_EWALD_P / (INV_EWALD_P + grij);
|
|
const double erfc = t * (A1+t*(A2+t*(A3+t*(A4+t*A5)))) * expm2;
|
|
const double prefactor = qqrd2e * qtmp*q[j]/r;
|
|
forcecoul = prefactor * (erfc + EWALD_F*grij*expm2);
|
|
if (EFLAG) ecoul = prefactor*erfc;
|
|
if (sbindex) {
|
|
const double adjust = (1.0-special_coul[sbindex])*prefactor;
|
|
forcecoul -= adjust;
|
|
if (EFLAG) ecoul -= adjust;
|
|
}
|
|
} else {
|
|
union_int_float_t rsq_lookup;
|
|
rsq_lookup.f = rsq;
|
|
const int itable = (rsq_lookup.i & ncoulmask) >> ncoulshiftbits;
|
|
const double fraction = (rsq_lookup.f - rtable[itable]) * drtable[itable];
|
|
const double table = ftable[itable] + fraction*dftable[itable];
|
|
forcecoul = qtmp*q[j] * table;
|
|
if (EFLAG) ecoul = qtmp*q[j] * (etable[itable] + fraction*detable[itable]);
|
|
if (sbindex) {
|
|
const double table2 = ctable[itable] + fraction*dctable[itable];
|
|
const double prefactor = qtmp*q[j] * table2;
|
|
const double adjust = (1.0-special_coul[sbindex])*prefactor;
|
|
forcecoul -= adjust;
|
|
if (EFLAG) ecoul -= adjust;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (rsq < cut_ljsq[itype][jtype]) {
|
|
|
|
if (ljt == LJ12_4) {
|
|
const double r4inv=r2inv*r2inv;
|
|
forcelj = r4inv*(lj1[itype][jtype]*r4inv*r4inv
|
|
- lj2[itype][jtype]);
|
|
|
|
if (EFLAG)
|
|
evdwl = r4inv*(lj3[itype][jtype]*r4inv*r4inv
|
|
- lj4[itype][jtype]) - offset[itype][jtype];
|
|
|
|
} else if (ljt == LJ9_6) {
|
|
const double r3inv = r2inv*sqrt(r2inv);
|
|
const double r6inv = r3inv*r3inv;
|
|
forcelj = r6inv*(lj1[itype][jtype]*r3inv
|
|
- lj2[itype][jtype]);
|
|
if (EFLAG)
|
|
evdwl = r6inv*(lj3[itype][jtype]*r3inv
|
|
- lj4[itype][jtype]) - offset[itype][jtype];
|
|
|
|
} else if (ljt == LJ12_6) {
|
|
const double r6inv = r2inv*r2inv*r2inv;
|
|
forcelj = r6inv*(lj1[itype][jtype]*r6inv
|
|
- lj2[itype][jtype]);
|
|
if (EFLAG)
|
|
evdwl = r6inv*(lj3[itype][jtype]*r6inv
|
|
- lj4[itype][jtype]) - offset[itype][jtype];
|
|
}
|
|
|
|
if (sbindex) {
|
|
const double factor_lj = special_lj[sbindex];
|
|
forcelj *= factor_lj;
|
|
if (EFLAG) evdwl *= factor_lj;
|
|
}
|
|
|
|
}
|
|
|
|
const double fpair = (forcecoul + forcelj) * r2inv;
|
|
|
|
fxtmp += delx*fpair;
|
|
fytmp += dely*fpair;
|
|
fztmp += delz*fpair;
|
|
if (NEWTON_PAIR || j < nlocal) {
|
|
f[j].x -= delx*fpair;
|
|
f[j].y -= dely*fpair;
|
|
f[j].z -= delz*fpair;
|
|
}
|
|
|
|
if (EVFLAG) ev_tally_thr(this,i,j,nlocal,NEWTON_PAIR,
|
|
evdwl,ecoul,fpair,delx,dely,delz,thr);
|
|
}
|
|
}
|
|
f[i].x += fxtmp;
|
|
f[i].y += fytmp;
|
|
f[i].z += fztmp;
|
|
}
|
|
}
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
double PairLJSDKCoulLongOMP::memory_usage()
|
|
{
|
|
double bytes = memory_usage_thr();
|
|
bytes += PairLJSDKCoulLong::memory_usage();
|
|
|
|
return bytes;
|
|
}
|