Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
SWIFTsim
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor 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
SWIFT
SWIFTsim
Commits
00bf5961
Commit
00bf5961
authored
8 years ago
by
Matthieu Schaller
Browse files
Options
Downloads
Patches
Plain Diff
Post-merge fixes
parent
e8f8b0c1
No related branches found
No related tags found
1 merge request
!343
Subset sorting
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/runner_doiact.h
+5
-4
5 additions, 4 deletions
src/runner_doiact.h
with
5 additions
and
4 deletions
src/runner_doiact.h
+
5
−
4
View file @
00bf5961
...
@@ -1125,9 +1125,9 @@ void DOPAIR1_BRANCH(struct runner *r, struct cell *ci, struct cell *cj) {
...
@@ -1125,9 +1125,9 @@ void DOPAIR1_BRANCH(struct runner *r, struct cell *ci, struct cell *cj) {
/* Have the cells been sorted? */
/* Have the cells been sorted? */
if
(
!
(
ci
->
sorted
&
(
1
<<
sid
))
||
ci
->
dx_max_sort
>
space_maxreldx
*
ci
->
dmin
)
if
(
!
(
ci
->
sorted
&
(
1
<<
sid
))
||
ci
->
dx_max_sort
>
space_maxreldx
*
ci
->
dmin
)
runner_do_sort
(
r
,
ci
,
(
1
<<
sid
),
1
);
error
(
"Interacting unsorted cells."
);
if
(
!
(
cj
->
sorted
&
(
1
<<
sid
))
||
cj
->
dx_max_sort
>
space_maxreldx
*
cj
->
dmin
)
if
(
!
(
cj
->
sorted
&
(
1
<<
sid
))
||
cj
->
dx_max_sort
>
space_maxreldx
*
cj
->
dmin
)
runner_do_sort
(
r
,
cj
,
(
1
<<
sid
),
1
);
error
(
"Interacting unsorted cells."
);
/* Have the cells been sorted? */
/* Have the cells been sorted? */
if
(
!
(
ci
->
sorted
&
(
1
<<
sid
))
||
!
(
cj
->
sorted
&
(
1
<<
sid
)))
if
(
!
(
ci
->
sorted
&
(
1
<<
sid
))
||
!
(
cj
->
sorted
&
(
1
<<
sid
)))
...
@@ -2672,8 +2672,8 @@ void DOSUB_SUBSET(struct runner *r, struct cell *ci, struct part *parts,
...
@@ -2672,8 +2672,8 @@ void DOSUB_SUBSET(struct runner *r, struct cell *ci, struct part *parts,
/* Find out in which sub-cell of ci the parts are. */
/* Find out in which sub-cell of ci the parts are. */
struct
cell
*
sub
=
NULL
;
struct
cell
*
sub
=
NULL
;
if
(
ci
->
split
)
if
(
ci
->
split
)
{
for
(
int
k
=
0
;
k
<
8
;
k
++
)
for
(
int
k
=
0
;
k
<
8
;
k
++
)
{
if
(
ci
->
progeny
[
k
]
!=
NULL
)
{
if
(
ci
->
progeny
[
k
]
!=
NULL
)
{
if
(
&
parts
[
ind
[
0
]]
>=
&
ci
->
progeny
[
k
]
->
parts
[
0
]
&&
if
(
&
parts
[
ind
[
0
]]
>=
&
ci
->
progeny
[
k
]
->
parts
[
0
]
&&
&
parts
[
ind
[
0
]]
<
&
ci
->
progeny
[
k
]
->
parts
[
ci
->
progeny
[
k
]
->
count
])
{
&
parts
[
ind
[
0
]]
<
&
ci
->
progeny
[
k
]
->
parts
[
ci
->
progeny
[
k
]
->
count
])
{
...
@@ -2682,6 +2682,7 @@ void DOSUB_SUBSET(struct runner *r, struct cell *ci, struct part *parts,
...
@@ -2682,6 +2682,7 @@ void DOSUB_SUBSET(struct runner *r, struct cell *ci, struct part *parts,
}
}
}
}
}
}
}
/* Is this a single cell? */
/* Is this a single cell? */
if
(
cj
==
NULL
)
{
if
(
cj
==
NULL
)
{
...
...
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