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
a15ce3e7
Commit
a15ce3e7
authored
7 years ago
by
Pedro Gonnet
Browse files
Options
Downloads
Patches
Plain Diff
we only need ti_sorted in debug mode.
parent
87140172
Branches
Branches containing commit
Tags
Tags containing commit
1 merge request
!374
Random fixes
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
src/cell.h
+3
-3
3 additions, 3 deletions
src/cell.h
src/runner.c
+1
-1
1 addition, 1 deletion
src/runner.c
with
4 additions
and
4 deletions
src/cell.h
+
3
−
3
View file @
a15ce3e7
...
...
@@ -239,9 +239,6 @@ struct cell {
/*! Maximum beginning of (integer) time step in this cell. */
integertime_t
ti_beg_max
;
/*! Last (integer) time the cell's sort arrays were updated. */
integertime_t
ti_sort
;
/*! Last (integer) time the cell's part were drifted forward in time. */
integertime_t
ti_old_part
;
...
...
@@ -347,6 +344,9 @@ struct cell {
char
do_sub_sort
;
#ifdef SWIFT_DEBUG_CHECKS
/*! Last (integer) time the cell's sort arrays were updated. */
integertime_t
ti_sort
;
/*! The list of tasks that have been executed on this cell */
char
tasks_executed
[
64
];
...
...
This diff is collapsed.
Click to expand it.
src/runner.c
+
1
−
1
View file @
a15ce3e7
...
...
@@ -355,11 +355,11 @@ void runner_do_sort(struct runner *r, struct cell *c, int flags, int cleanup,
finger
=
finger
->
parent
)
{
if
(
finger
->
sorted
&
~
c
->
sorted
)
error
(
"Inconsistent sort flags (upward)."
);
}
#endif
/* Update the sort timer which represents the last time the sorts
were re-set. */
if
(
c
->
sorted
==
0
)
c
->
ti_sort
=
r
->
e
->
ti_current
;
#endif
/* start by allocating the entry arrays. */
if
(
c
->
sort
==
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