Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F87719919
npair_half_respa_bin_newton_tri.cpp
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Mon, Oct 14, 12:24
Size
6 KB
Mime Type
text/x-c
Expires
Wed, Oct 16, 12:24 (2 d)
Engine
blob
Format
Raw Data
Handle
21645158
Attached To
rLAMMPS lammps
npair_half_respa_bin_newton_tri.cpp
View Options
/* ----------------------------------------------------------------------
LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator
http://lammps.sandia.gov, Sandia National Laboratories
Steve Plimpton, sjplimp@sandia.gov
Copyright (2003) Sandia Corporation. Under the terms of Contract
DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government retains
certain rights in this software. This software is distributed under
the GNU General Public License.
See the README file in the top-level LAMMPS directory.
------------------------------------------------------------------------- */
#include "npair_half_respa_bin_newton_tri.h"
#include "neighbor.h"
#include "neigh_list.h"
#include "atom.h"
#include "atom_vec.h"
#include "molecule.h"
#include "domain.h"
#include "my_page.h"
#include "error.h"
using
namespace
LAMMPS_NS
;
/* ---------------------------------------------------------------------- */
NPairHalfRespaBinNewtonTri
::
NPairHalfRespaBinNewtonTri
(
LAMMPS
*
lmp
)
:
NPair
(
lmp
)
{}
/* ----------------------------------------------------------------------
multiple respa lists
binned neighbor list construction with Newton's 3rd law for triclinic
each owned atom i checks its own bin and other bins in triclinic stencil
every pair stored exactly once by some processor
------------------------------------------------------------------------- */
void
NPairHalfRespaBinNewtonTri
::
build
(
NeighList
*
list
)
{
int
i
,
j
,
k
,
n
,
itype
,
jtype
,
ibin
,
n_inner
,
n_middle
,
imol
,
iatom
,
moltemplate
;
tagint
tagprev
;
double
xtmp
,
ytmp
,
ztmp
,
delx
,
dely
,
delz
,
rsq
;
int
*
neighptr
,
*
neighptr_inner
,
*
neighptr_middle
;
double
**
x
=
atom
->
x
;
int
*
type
=
atom
->
type
;
int
*
mask
=
atom
->
mask
;
tagint
*
tag
=
atom
->
tag
;
tagint
*
molecule
=
atom
->
molecule
;
tagint
**
special
=
atom
->
special
;
int
**
nspecial
=
atom
->
nspecial
;
int
nlocal
=
atom
->
nlocal
;
if
(
includegroup
)
nlocal
=
atom
->
nfirst
;
int
*
molindex
=
atom
->
molindex
;
int
*
molatom
=
atom
->
molatom
;
Molecule
**
onemols
=
atom
->
avec
->
onemols
;
if
(
molecular
==
2
)
moltemplate
=
1
;
else
moltemplate
=
0
;
int
*
ilist
=
list
->
ilist
;
int
*
numneigh
=
list
->
numneigh
;
int
**
firstneigh
=
list
->
firstneigh
;
MyPage
<
int
>
*
ipage
=
list
->
ipage
;
NeighList
*
listinner
=
list
->
listinner
;
int
*
ilist_inner
=
listinner
->
ilist
;
int
*
numneigh_inner
=
listinner
->
numneigh
;
int
**
firstneigh_inner
=
listinner
->
firstneigh
;
MyPage
<
int
>
*
ipage_inner
=
listinner
->
ipage
;
NeighList
*
listmiddle
;
int
*
ilist_middle
,
*
numneigh_middle
,
**
firstneigh_middle
;
MyPage
<
int
>
*
ipage_middle
;
int
respamiddle
=
list
->
respamiddle
;
if
(
respamiddle
)
{
listmiddle
=
list
->
listmiddle
;
ilist_middle
=
listmiddle
->
ilist
;
numneigh_middle
=
listmiddle
->
numneigh
;
firstneigh_middle
=
listmiddle
->
firstneigh
;
ipage_middle
=
listmiddle
->
ipage
;
}
int
inum
=
0
;
int
which
=
0
;
int
minchange
=
0
;
ipage
->
reset
();
ipage_inner
->
reset
();
if
(
respamiddle
)
ipage_middle
->
reset
();
for
(
i
=
0
;
i
<
nlocal
;
i
++
)
{
n
=
n_inner
=
0
;
neighptr
=
ipage
->
vget
();
neighptr_inner
=
ipage_inner
->
vget
();
if
(
respamiddle
)
{
n_middle
=
0
;
neighptr_middle
=
ipage_middle
->
vget
();
}
itype
=
type
[
i
];
xtmp
=
x
[
i
][
0
];
ytmp
=
x
[
i
][
1
];
ztmp
=
x
[
i
][
2
];
if
(
moltemplate
)
{
imol
=
molindex
[
i
];
iatom
=
molatom
[
i
];
tagprev
=
tag
[
i
]
-
iatom
-
1
;
}
// loop over all atoms in bins in stencil
// pairs for atoms j "below" i are excluded
// below = lower z or (equal z and lower y) or (equal zy and lower x)
// (equal zyx and j <= i)
// latter excludes self-self interaction but allows superposed atoms
ibin
=
coord2bin
(
x
[
i
]);
for
(
k
=
0
;
k
<
nstencil
;
k
++
)
{
for
(
j
=
binhead
[
ibin
+
stencil
[
k
]];
j
>=
0
;
j
=
bins
[
j
])
{
if
(
x
[
j
][
2
]
<
ztmp
)
continue
;
if
(
x
[
j
][
2
]
==
ztmp
)
{
if
(
x
[
j
][
1
]
<
ytmp
)
continue
;
if
(
x
[
j
][
1
]
==
ytmp
)
{
if
(
x
[
j
][
0
]
<
xtmp
)
continue
;
if
(
x
[
j
][
0
]
==
xtmp
&&
j
<=
i
)
continue
;
}
}
jtype
=
type
[
j
];
if
(
exclude
&&
exclusion
(
i
,
j
,
itype
,
jtype
,
mask
,
molecule
))
continue
;
delx
=
xtmp
-
x
[
j
][
0
];
dely
=
ytmp
-
x
[
j
][
1
];
delz
=
ztmp
-
x
[
j
][
2
];
rsq
=
delx
*
delx
+
dely
*
dely
+
delz
*
delz
;
if
(
rsq
<=
cutneighsq
[
itype
][
jtype
])
{
if
(
molecular
)
{
if
(
!
moltemplate
)
which
=
find_special
(
special
[
i
],
nspecial
[
i
],
tag
[
j
]);
else
if
(
imol
>=
0
)
which
=
find_special
(
onemols
[
imol
]
->
special
[
iatom
],
onemols
[
imol
]
->
nspecial
[
iatom
],
tag
[
j
]
-
tagprev
);
else
which
=
0
;
if
(
which
==
0
)
neighptr
[
n
++
]
=
j
;
else
if
((
minchange
=
domain
->
minimum_image_check
(
delx
,
dely
,
delz
)))
neighptr
[
n
++
]
=
j
;
else
if
(
which
>
0
)
neighptr
[
n
++
]
=
j
^
(
which
<<
SBBITS
);
}
else
neighptr
[
n
++
]
=
j
;
if
(
rsq
<
cut_inner_sq
)
{
if
(
which
==
0
)
neighptr_inner
[
n_inner
++
]
=
j
;
else
if
(
minchange
)
neighptr_inner
[
n_inner
++
]
=
j
;
else
if
(
which
>
0
)
neighptr_inner
[
n_inner
++
]
=
j
^
(
which
<<
SBBITS
);
}
if
(
respamiddle
&&
rsq
<
cut_middle_sq
&&
rsq
>
cut_middle_inside_sq
)
{
if
(
which
==
0
)
neighptr_middle
[
n_middle
++
]
=
j
;
else
if
(
minchange
)
neighptr_middle
[
n_middle
++
]
=
j
;
else
if
(
which
>
0
)
neighptr_middle
[
n_middle
++
]
=
j
^
(
which
<<
SBBITS
);
}
}
}
}
ilist
[
inum
]
=
i
;
firstneigh
[
i
]
=
neighptr
;
numneigh
[
i
]
=
n
;
ipage
->
vgot
(
n
);
if
(
ipage
->
status
())
error
->
one
(
FLERR
,
"Neighbor list overflow, boost neigh_modify one"
);
ilist_inner
[
inum
]
=
i
;
firstneigh_inner
[
i
]
=
neighptr_inner
;
numneigh_inner
[
i
]
=
n_inner
;
ipage_inner
->
vgot
(
n_inner
);
if
(
ipage_inner
->
status
())
error
->
one
(
FLERR
,
"Neighbor list overflow, boost neigh_modify one"
);
if
(
respamiddle
)
{
ilist_middle
[
inum
]
=
i
;
firstneigh_middle
[
i
]
=
neighptr_middle
;
numneigh_middle
[
i
]
=
n_middle
;
ipage_middle
->
vgot
(
n_middle
);
if
(
ipage_middle
->
status
())
error
->
one
(
FLERR
,
"Neighbor list overflow, boost neigh_modify one"
);
}
inum
++
;
}
list
->
inum
=
inum
;
listinner
->
inum
=
inum
;
if
(
respamiddle
)
listmiddle
->
inum
=
inum
;
}
Event Timeline
Log In to Comment