Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
Tadah.LAMMPS
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Tadah
Tadah.LAMMPS
Commits
7dcbfa4d
Commit
7dcbfa4d
authored
2 months ago
by
Marcin Kirsz
Browse files
Options
Downloads
Plain Diff
Merge branch 'develop' into 'main'
Develop See merge request
!13
parents
8c8f78f1
87b60a4b
No related branches found
No related tags found
1 merge request
!13
Develop
Pipeline
#51500
passed
2 months ago
Stage: build_debug
Stage: run_unit_tests
Stage: build_release
Stage: test_tadah_lammps
Changes
1
Pipelines
3
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
lammps_tadah.cpp
+14
-14
14 additions, 14 deletions
lammps_tadah.cpp
with
14 additions
and
14 deletions
lammps_tadah.cpp
+
14
−
14
View file @
7dcbfa4d
...
@@ -86,11 +86,11 @@ int LammpsTadah::pack_reverse_linear(int n, int first, double *buf)
...
@@ -86,11 +86,11 @@ int LammpsTadah::pack_reverse_linear(int n, int first, double *buf)
int
last
=
first
+
n
;
int
last
=
first
+
n
;
for
(
int
i
=
first
;
i
<
last
;
i
++
)
{
for
(
int
i
=
first
;
i
<
last
;
i
++
)
{
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
buf
[
m
++
]
=
rhos
(
i
,
x
);
buf
[
m
++
]
=
rhos
(
x
,
i
);
// pack two-body only, as many-body will be computed from rho
// pack two-body only, as many-body will be computed from rho
// which is being packed hence we do now comm mb-aeds
// which is being packed hence we do now comm mb-aeds
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
buf
[
m
++
]
=
aeds
(
i
,
x
);
buf
[
m
++
]
=
aeds
(
x
,
i
);
}
}
return
m
;
return
m
;
}
}
...
@@ -100,9 +100,9 @@ void LammpsTadah::unpack_reverse_linear(int n, int *list, double *buf)
...
@@ -100,9 +100,9 @@ void LammpsTadah::unpack_reverse_linear(int n, int *list, double *buf)
for
(
int
i
=
0
;
i
<
n
;
i
++
)
{
for
(
int
i
=
0
;
i
<
n
;
i
++
)
{
int
j
=
list
[
i
];
int
j
=
list
[
i
];
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
rhos
(
j
,
x
)
+=
buf
[
m
++
];
rhos
(
x
,
j
)
+=
buf
[
m
++
];
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
aeds
(
j
,
x
)
+=
buf
[
m
++
];
aeds
(
x
,
j
)
+=
buf
[
m
++
];
}
}
}
}
// Pack the derivative of the embedding func
// Pack the derivative of the embedding func
...
@@ -112,7 +112,7 @@ int LammpsTadah::pack_forward_linear(int n, int *list, double *buf)
...
@@ -112,7 +112,7 @@ int LammpsTadah::pack_forward_linear(int n, int *list, double *buf)
for
(
int
i
=
0
;
i
<
n
;
i
++
)
{
for
(
int
i
=
0
;
i
<
n
;
i
++
)
{
int
j
=
list
[
i
];
int
j
=
list
[
i
];
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
buf
[
m
++
]
=
rhos
(
j
,
x
);
buf
[
m
++
]
=
rhos
(
x
,
j
);
}
}
return
m
;
return
m
;
}
}
...
@@ -123,7 +123,7 @@ void LammpsTadah::unpack_forward_linear(int n, int first, double *buf)
...
@@ -123,7 +123,7 @@ void LammpsTadah::unpack_forward_linear(int n, int first, double *buf)
int
last
=
first
+
n
;
int
last
=
first
+
n
;
for
(
int
i
=
first
;
i
<
last
;
i
++
)
{
for
(
int
i
=
first
;
i
<
last
;
i
++
)
{
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
rhos
(
i
,
x
)
=
buf
[
m
++
];
rhos
(
x
,
i
)
=
buf
[
m
++
];
}
}
}
}
// NONLINEAR
// NONLINEAR
...
@@ -135,11 +135,11 @@ int LammpsTadah::pack_reverse_nonlinear(int n, int first, double *buf)
...
@@ -135,11 +135,11 @@ int LammpsTadah::pack_reverse_nonlinear(int n, int first, double *buf)
last
=
first
+
n
;
last
=
first
+
n
;
for
(
i
=
first
;
i
<
last
;
i
++
)
{
for
(
i
=
first
;
i
<
last
;
i
++
)
{
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
buf
[
m
++
]
=
rhos
(
i
,
x
);
buf
[
m
++
]
=
rhos
(
x
,
i
);
// pack two-body only, as many-body will be computed from rho
// pack two-body only, as many-body will be computed from rho
// which is packed above hence we do now comm mb-aeds
// which is packed above hence we do now comm mb-aeds
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
buf
[
m
++
]
=
aeds
(
i
,
x
);
buf
[
m
++
]
=
aeds
(
x
,
i
);
}
}
return
m
;
return
m
;
}
}
...
@@ -151,9 +151,9 @@ void LammpsTadah::unpack_reverse_nonlinear(int n, int *list, double *buf)
...
@@ -151,9 +151,9 @@ void LammpsTadah::unpack_reverse_nonlinear(int n, int *list, double *buf)
for
(
i
=
0
;
i
<
n
;
i
++
)
{
for
(
i
=
0
;
i
<
n
;
i
++
)
{
j
=
list
[
i
];
j
=
list
[
i
];
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
for
(
size_t
x
=
0
;
x
<
S
.
dmb
->
rhoi_size
();
x
++
)
rhos
(
j
,
x
)
+=
buf
[
m
++
];
rhos
(
x
,
j
)
+=
buf
[
m
++
];
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
bias
;
x
++
)
aeds
(
j
,
x
)
+=
buf
[
m
++
];
aeds
(
x
,
j
)
+=
buf
[
m
++
];
}
}
}
}
int
LammpsTadah
::
pack_forward_nonlinear
(
int
n
,
int
*
list
,
double
*
buf
)
int
LammpsTadah
::
pack_forward_nonlinear
(
int
n
,
int
*
list
,
double
*
buf
)
...
@@ -164,9 +164,9 @@ int LammpsTadah::pack_forward_nonlinear(int n, int *list, double *buf)
...
@@ -164,9 +164,9 @@ int LammpsTadah::pack_forward_nonlinear(int n, int *list, double *buf)
for
(
i
=
0
;
i
<
n
;
i
++
)
{
for
(
i
=
0
;
i
<
n
;
i
++
)
{
j
=
list
[
i
];
j
=
list
[
i
];
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
buf
[
m
++
]
=
rhos
(
j
,
x
);
buf
[
m
++
]
=
rhos
(
x
,
j
);
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
S
.
dmb
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
S
.
dmb
->
size
()
+
bias
;
x
++
)
buf
[
m
++
]
=
aeds
(
j
,
x
);
buf
[
m
++
]
=
aeds
(
x
,
j
);
}
}
return
m
;
return
m
;
}
}
...
@@ -178,8 +178,8 @@ void LammpsTadah::unpack_forward_nonlinear(int n, int first, double *buf)
...
@@ -178,8 +178,8 @@ void LammpsTadah::unpack_forward_nonlinear(int n, int first, double *buf)
last
=
first
+
n
;
last
=
first
+
n
;
for
(
i
=
first
;
i
<
last
;
i
++
)
{
for
(
i
=
first
;
i
<
last
;
i
++
)
{
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
for
(
size_t
x
=
S
.
dmb
->
rhoi_size
();
x
<
S
.
dmb
->
rhoi_size
()
+
S
.
dmb
->
rhoip_size
();
x
++
)
rhos
(
i
,
x
)
=
buf
[
m
++
];
rhos
(
x
,
i
)
=
buf
[
m
++
];
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
S
.
dmb
->
size
()
+
bias
;
x
++
)
for
(
size_t
x
=
bias
;
x
<
S
.
d2b
->
size
()
+
S
.
dmb
->
size
()
+
bias
;
x
++
)
aeds
(
i
,
x
)
=
buf
[
m
++
];
aeds
(
x
,
i
)
=
buf
[
m
++
];
}
}
}
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment