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
07e5d70c
Commit
07e5d70c
authored
9 years ago
by
Matthieu Schaller
Browse files
Options
Downloads
Patches
Plain Diff
Moved the mapping functions out of main.c into a separate files.
parent
44933f56
Branches
Branches containing commit
Tags
Tags containing commit
1 merge request
!52
Cleaning up of the main file
Changes
5
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
examples/main.c
+0
-173
0 additions, 173 deletions
examples/main.c
src/Makefile.am
+2
-2
2 additions, 2 deletions
src/Makefile.am
src/map.c
+199
-0
199 additions, 0 deletions
src/map.c
src/map.h
+36
-0
36 additions, 0 deletions
src/map.h
src/swift.h
+1
-0
1 addition, 0 deletions
src/swift.h
with
238 additions
and
175 deletions
examples/main.c
+
0
−
173
View file @
07e5d70c
...
...
@@ -56,179 +56,6 @@
#define ENGINE_POLICY engine_policy_none
#endif
/**
* @brief Mapping function to draw a specific cell (gnuplot).
*/
void
map_cells_plot
(
struct
cell
*
c
,
void
*
data
)
{
int
depth
=
*
(
int
*
)
data
;
double
*
l
=
c
->
loc
,
*
h
=
c
->
h
;
if
(
c
->
depth
<=
depth
)
{
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
if
(
!
c
->
split
)
{
for
(
int
k
=
0
;
k
<
c
->
count
;
k
++
)
printf
(
"0 0 0 %.16e %.16e %.16e
\n
"
,
c
->
parts
[
k
].
x
[
0
],
c
->
parts
[
k
].
x
[
1
],
c
->
parts
[
k
].
x
[
2
]);
printf
(
"
\n\n
"
);
}
/* else
for ( int k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
map_cells_plot( c->progeny[k] , data ); */
}
}
/**
* @brief Mapping function for checking if each part is in its box.
*/
/* void map_check ( struct part *p , struct cell *c , void *data ) {
if ( p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] ||
p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] ||
p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] )
printf( "map_check: particle %i is outside of its box.\n" , p->id );
} */
/**
* @brief Mapping function for neighbour count.
*/
void
map_cellcheck
(
struct
cell
*
c
,
void
*
data
)
{
int
k
,
*
count
=
(
int
*
)
data
;
struct
part
*
p
;
__sync_fetch_and_add
(
count
,
c
->
count
);
/* Loop over all parts and check if they are in the cell. */
for
(
k
=
0
;
k
<
c
->
count
;
k
++
)
{
p
=
&
c
->
parts
[
k
];
if
(
p
->
x
[
0
]
<
c
->
loc
[
0
]
||
p
->
x
[
1
]
<
c
->
loc
[
1
]
||
p
->
x
[
2
]
<
c
->
loc
[
2
]
||
p
->
x
[
0
]
>
c
->
loc
[
0
]
+
c
->
h
[
0
]
||
p
->
x
[
1
]
>
c
->
loc
[
1
]
+
c
->
h
[
1
]
||
p
->
x
[
2
]
>
c
->
loc
[
2
]
+
c
->
h
[
2
])
{
printf
(
"map_cellcheck: particle at [ %.16e %.16e %.16e ] outside of cell [ "
"%.16e %.16e %.16e ] - [ %.16e %.16e %.16e ].
\n
"
,
p
->
x
[
0
],
p
->
x
[
1
],
p
->
x
[
2
],
c
->
loc
[
0
],
c
->
loc
[
1
],
c
->
loc
[
2
],
c
->
loc
[
0
]
+
c
->
h
[
0
],
c
->
loc
[
1
]
+
c
->
h
[
1
],
c
->
loc
[
2
]
+
c
->
h
[
2
]);
error
(
"particle out of bounds!"
);
}
}
}
/**
* @brief Mapping function for maxdepth cell count.
*/
void
map_maxdepth
(
struct
cell
*
c
,
void
*
data
)
{
int
maxdepth
=
((
int
*
)
data
)[
0
];
int
*
count
=
&
((
int
*
)
data
)[
1
];
// printf( "%e\n" , p->count );
if
(
c
->
depth
==
maxdepth
)
*
count
+=
1
;
}
/**
* @brief Mapping function for neighbour count.
*/
void
map_count
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
double
*
wcount
=
(
double
*
)
data
;
// printf( "%i %e %e\n" , p->id , p->count , p->count_dh );
*
wcount
+=
p
->
density
.
wcount
;
}
void
map_wcount_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
density
.
wcount
<
(
*
p2
)
->
density
.
wcount
)
*
p2
=
p
;
}
void
map_wcount_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
density
.
wcount
>
(
*
p2
)
->
density
.
wcount
)
*
p2
=
p
;
}
void
map_h_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
h
<
(
*
p2
)
->
h
)
*
p2
=
p
;
}
void
map_h_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
h
>
(
*
p2
)
->
h
)
*
p2
=
p
;
}
/**
* @brief Mapping function for neighbour count.
*/
void
map_icount
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
// int *count = (int *)data;
// printf( "%i\n" , p->icount );
// *count += p->icount;
}
/**
* @brief Mapping function to print the particle position.
*/
void
map_dump
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
double
*
shift
=
(
double
*
)
data
;
printf
(
"%g
\t
%g
\t
%g
\n
"
,
p
->
x
[
0
]
-
shift
[
0
],
p
->
x
[
1
]
-
shift
[
1
],
p
->
x
[
2
]
-
shift
[
2
]);
}
/**
* @brief Compute the average number of pairs per particle using
...
...
This diff is collapsed.
Click to expand it.
src/Makefile.am
+
2
−
2
View file @
07e5d70c
...
...
@@ -35,12 +35,12 @@ endif
# List required headers
include_HEADERS
=
space.h runner.h queue.h task.h lock.h cell.h part.h const.h
\
engine.h swift.h serial_io.h timers.h debug.h scheduler.h proxy.h parallel_io.h
\
common_io.h single_io.h multipole.h
common_io.h single_io.h multipole.h
map.h
# Common source files
AM_SOURCES
=
space.c runner.c queue.c task.c cell.c engine.c
\
serial_io.c timers.c debug.c scheduler.c proxy.c parallel_io.c
\
units.c common_io.c single_io.c multipole.c version.c
units.c common_io.c single_io.c multipole.c version.c
map.c
# Include files for distribution, not installation.
noinst_HEADERS
=
atomic.h cycle.h error.h inline.h kernel.h vector.h
\
...
...
This diff is collapsed.
Click to expand it.
src/map.c
0 → 100644
+
199
−
0
View file @
07e5d70c
/*******************************************************************************
* This file is part of SWIFT.
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Matthieu Schaller (matthieu.schaller@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
******************************************************************************/
#include
"map.h"
#include
"error.h"
#include
<stdio.h>
#include
<stdlib.h>
/**
* @brief Mapping function to draw a specific cell (gnuplot).
*/
void
map_cells_plot
(
struct
cell
*
c
,
void
*
data
)
{
int
depth
=
*
(
int
*
)
data
;
double
*
l
=
c
->
loc
,
*
h
=
c
->
h
;
if
(
c
->
depth
<=
depth
)
{
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]
+
h
[
2
]);
printf
(
"%.16e %.16e %.16e
\n\n\n
"
,
l
[
0
]
+
h
[
0
],
l
[
1
]
+
h
[
1
],
l
[
2
]);
if
(
!
c
->
split
)
{
for
(
int
k
=
0
;
k
<
c
->
count
;
k
++
)
printf
(
"0 0 0 %.16e %.16e %.16e
\n
"
,
c
->
parts
[
k
].
x
[
0
],
c
->
parts
[
k
].
x
[
1
],
c
->
parts
[
k
].
x
[
2
]);
printf
(
"
\n\n
"
);
}
/* else
for ( int k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
map_cells_plot( c->progeny[k] , data ); */
}
}
/**
* @brief Mapping function for checking if each part is in its box.
*/
/* void map_check ( struct part *p , struct cell *c , void *data ) {
if ( p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] ||
p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] ||
p->x[0] < c->loc[0] || p->x[0] > c->loc[0]+c->h[0] )
printf( "map_check: particle %i is outside of its box.\n" , p->id );
} */
/**
* @brief Mapping function for neighbour count.
*/
void
map_cellcheck
(
struct
cell
*
c
,
void
*
data
)
{
int
k
,
*
count
=
(
int
*
)
data
;
struct
part
*
p
;
__sync_fetch_and_add
(
count
,
c
->
count
);
/* Loop over all parts and check if they are in the cell. */
for
(
k
=
0
;
k
<
c
->
count
;
k
++
)
{
p
=
&
c
->
parts
[
k
];
if
(
p
->
x
[
0
]
<
c
->
loc
[
0
]
||
p
->
x
[
1
]
<
c
->
loc
[
1
]
||
p
->
x
[
2
]
<
c
->
loc
[
2
]
||
p
->
x
[
0
]
>
c
->
loc
[
0
]
+
c
->
h
[
0
]
||
p
->
x
[
1
]
>
c
->
loc
[
1
]
+
c
->
h
[
1
]
||
p
->
x
[
2
]
>
c
->
loc
[
2
]
+
c
->
h
[
2
])
{
printf
(
"map_cellcheck: particle at [ %.16e %.16e %.16e ] outside of cell [ "
"%.16e %.16e %.16e ] - [ %.16e %.16e %.16e ].
\n
"
,
p
->
x
[
0
],
p
->
x
[
1
],
p
->
x
[
2
],
c
->
loc
[
0
],
c
->
loc
[
1
],
c
->
loc
[
2
],
c
->
loc
[
0
]
+
c
->
h
[
0
],
c
->
loc
[
1
]
+
c
->
h
[
1
],
c
->
loc
[
2
]
+
c
->
h
[
2
]);
error
(
"particle out of bounds!"
);
}
}
}
/**
* @brief Mapping function for maxdepth cell count.
*/
void
map_maxdepth
(
struct
cell
*
c
,
void
*
data
)
{
int
maxdepth
=
((
int
*
)
data
)[
0
];
int
*
count
=
&
((
int
*
)
data
)[
1
];
// printf( "%e\n" , p->count );
if
(
c
->
depth
==
maxdepth
)
*
count
+=
1
;
}
/**
* @brief Mapping function for neighbour count.
*/
void
map_count
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
double
*
wcount
=
(
double
*
)
data
;
// printf( "%i %e %e\n" , p->id , p->count , p->count_dh );
*
wcount
+=
p
->
density
.
wcount
;
}
void
map_wcount_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
density
.
wcount
<
(
*
p2
)
->
density
.
wcount
)
*
p2
=
p
;
}
void
map_wcount_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
density
.
wcount
>
(
*
p2
)
->
density
.
wcount
)
*
p2
=
p
;
}
void
map_h_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
h
<
(
*
p2
)
->
h
)
*
p2
=
p
;
}
void
map_h_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
struct
part
**
p2
=
(
struct
part
**
)
data
;
if
(
p
->
h
>
(
*
p2
)
->
h
)
*
p2
=
p
;
}
/**
* @brief Mapping function for neighbour count.
*/
void
map_icount
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
// int *count = (int *)data;
// printf( "%i\n" , p->icount );
// *count += p->icount;
}
/**
* @brief Mapping function to print the particle position.
*/
void
map_dump
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
)
{
double
*
shift
=
(
double
*
)
data
;
printf
(
"%g
\t
%g
\t
%g
\n
"
,
p
->
x
[
0
]
-
shift
[
0
],
p
->
x
[
1
]
-
shift
[
1
],
p
->
x
[
2
]
-
shift
[
2
]);
}
This diff is collapsed.
Click to expand it.
src/map.h
0 → 100644
+
36
−
0
View file @
07e5d70c
/*******************************************************************************
* This file is part of SWIFT.
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Matthieu Schaller (matthieu.schaller@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
******************************************************************************/
/* Includes. */
#include
"cell.h"
#include
"part.h"
void
map_cells_plot
(
struct
cell
*
c
,
void
*
data
);
void
map_check
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_cellcheck
(
struct
cell
*
c
,
void
*
data
);
void
map_maxdepth
(
struct
cell
*
c
,
void
*
data
);
void
map_count
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_wcount_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_wcount_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_h_min
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_h_max
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_icount
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
void
map_dump
(
struct
part
*
p
,
struct
cell
*
c
,
void
*
data
);
This diff is collapsed.
Click to expand it.
src/swift.h
+
1
−
0
View file @
07e5d70c
...
...
@@ -32,6 +32,7 @@
#include
"engine.h"
#include
"error.h"
#include
"lock.h"
#include
"map.h"
#include
"multipole.h"
#include
"parallel_io.h"
#include
"part.h"
...
...
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