Skip to content
GitLab
Commit 279d1bc2 authored by Pedro Gonnet's avatar Pedro Gonnet
Browse files

rearrange several bits of the task hierarchy, more compact memory. 


Former-commit-id: b70cb500785c964d7c9ad508764ecd741873f4c1
parent 22f7b677
Hide whitespace changes
Inline Side-by-side
src/cell.h
View file @ 279d1bc2
......@@ -96,7 +96,7 @@ struct cell {
int sortsize;
/* The tasks computing this cell's density. */
struct task *density[8*27], *force[8*27];
struct link *density, *force;
int nr_density, nr_force;
/* The ghost task to link density to interactions. */
......
src/engine.c
View file @ 279d1bc2
......@@ -77,6 +77,74 @@
int engine_rank;
/**
* @brief Link a density/force task to a cell.
*
* @param e The #engine.
* @param l The #link.
* @param t The #task.
*
* @return The new #link pointer.
*/
struct link *engine_addlink( struct engine *e , struct link *l , struct task *t ) {
struct link *res = &e->links[ atomic_inc( &e->nr_links ) ];
res->next = l;
res->t = t;
return res;
}
/**
* @brief Generate the ghost and kick tasks for a hierarchy of cells.
*
* @param e The #engine.
* @param c The #cell.
* @param super The super #cell.
*/
void engine_mkghosts ( struct engine *e , struct cell *c , struct cell *super ) {
int k;
struct scheduler *s = &e->sched;
/* Am I the super-cell? */
if ( super == NULL && c->nr_tasks > 0 ) {
/* Remember me. */
super = c;
/* Local tasks only... */
if ( c->nodeID == e->nodeID ) {
/* Generate the ghost task. */
c->ghost = scheduler_addtask( s , task_type_ghost , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* Add the kick2 task. */
c->kick2 = scheduler_addtask( s , task_type_kick2 , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* Add the kick1 task if needed. */
if ( !(e->policy & engine_policy_fixdt) )
c->kick1 = scheduler_addtask( s , task_type_kick1 , task_subtype_none , 0 , 0 , c , NULL , 0 );
}
}
/* Set the super-cell. */
c->super = super;
/* Recurse. */
if ( c->split )
for ( k = 0 ; k < 8 ; k++ )
if ( c->progeny[k] != NULL )
engine_mkghosts( e , c->progeny[k] , super );
}
/**
* @brief Redistribute the particles amongst the nodes accorind
* to their cell's node IDs.
......@@ -463,23 +531,24 @@ void engine_repartition ( struct engine *e ) {
void engine_addtasks_send ( struct engine *e , struct cell *ci , struct cell *cj ) {
int k;
struct link *l = NULL;
struct scheduler *s = &e->sched;
/* Check if any of the density tasks are for the target node. */
for ( k = 0 ; k < ci->nr_density ; k++ )
if ( ci->density[k]->ci->nodeID == cj->nodeID ||
( ci->density[k]->cj != NULL && ci->density[k]->cj->nodeID == cj->nodeID ) )
for ( l = ci->density ; l != NULL ; l = l->next )
if ( l->t->ci->nodeID == cj->nodeID ||
( l->t->cj != NULL && l->t->cj->nodeID == cj->nodeID ) )
break;
/* If so, attach send tasks. */
if ( k < ci->nr_density ) {
if ( l != NULL ) {
/* Create the tasks. */
struct task *t_xv = scheduler_addtask( &e->sched , task_type_send_xv , task_subtype_none , 2*ci->tag , 0 , ci , cj , 0 );
struct task *t_rho = scheduler_addtask( &e->sched , task_type_send_rho , task_subtype_none , 2*ci->tag + 1 , 0 , ci , cj , 0 );
/* The send_rho task depends on the cell's ghost task. */
scheduler_addunlock( s , ci->ghost , t_rho );
scheduler_addunlock( s , ci->super->ghost , t_rho );
/* The send_rho task should unlock the super-cell's kick2 task. */
scheduler_addunlock( s , t_rho , ci->super->kick2 );
......@@ -513,37 +582,24 @@ void engine_addtasks_recv ( struct engine *e , struct cell *c , struct task *t_x
struct scheduler *s = &e->sched;
/* Do we need to construct a recv task? */
if ( t_xv != NULL || c->nr_density > 0 ) {
if ( t_xv == NULL && c->nr_density > 0 ) {
/* Create the tasks. */
c->recv_xv = scheduler_addtask( &e->sched , task_type_recv_xv , task_subtype_none , 2*c->tag , 0 , c , NULL , 0 );
c->recv_rho = scheduler_addtask( &e->sched , task_type_recv_rho , task_subtype_none , 2*c->tag + 1 , 0 , c , NULL , 0 );
/* If there has been a higher-up recv task, then these tasks
are implicit and depend on the higher-up task. */
if ( t_xv != NULL ) {
scheduler_addunlock( s , c->parent->recv_xv , c->recv_xv );
scheduler_addunlock( s , c->parent->recv_rho , c->recv_rho );
c->recv_xv->implicit = 1;
c->recv_rho->implicit = 1;
}
else {
t_xv = c->recv_xv;
t_rho = c->recv_rho;
}
t_xv = c->recv_xv = scheduler_addtask( &e->sched , task_type_recv_xv , task_subtype_none , 2*c->tag , 0 , c , NULL , 0 );
t_rho = c->recv_rho = scheduler_addtask( &e->sched , task_type_recv_rho , task_subtype_none , 2*c->tag + 1 , 0 , c , NULL , 0 );
/* Add dependencies if there are density/force tasks. */
for ( k = 0 ; k < c->nr_density ; k++ ) {
scheduler_addunlock( s , c->recv_xv , c->density[k] );
scheduler_addunlock( s , c->density[k] , t_rho );
}
for ( k = 0 ; k < c->nr_force ; k++ )
scheduler_addunlock( s , c->recv_rho , c->force[k] );
if ( c->sorts != NULL )
scheduler_addunlock( s , c->recv_xv , c->sorts );
}
/* Add dependencies. */
for ( struct link *l = c->density ; l != NULL ; l = l->next ) {
scheduler_addunlock( s , t_xv , l->t );
scheduler_addunlock( s , l->t , t_rho );
}
for ( struct link *l = c->force ; l != NULL ; l = l->next )
scheduler_addunlock( s , t_rho , l->t );
if ( c->sorts != NULL )
scheduler_addunlock( s , t_xv , c->sorts );
/* Recurse? */
if ( c->split )
for ( k = 0 ; k < 8 ; k++ )
......@@ -840,6 +896,13 @@ void engine_maketasks ( struct engine *e ) {
/* Split the tasks. */
scheduler_splittasks( sched );
/* Allocate the list of cell-task links. */
if ( e->links != NULL )
free( e->links );
if ( ( e->links = malloc( sizeof(struct link) * s->tot_cells * 27 ) ) == NULL )
error( "Failed to allocate cell-task links." );
e->nr_links = 0;
/* Count the number of tasks associated with each cell and
store the density tasks in each cell, and make each sort
depend on the sorts of its progeny. */
......@@ -857,15 +920,18 @@ void engine_maketasks ( struct engine *e ) {
if ( t->type == task_type_self ) {
atomic_inc( &t->ci->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
t->ci->density = engine_addlink( e , t->ci->density , t );
atomic_inc( &t->ci->nr_density );
}
}
else if ( t->type == task_type_pair ) {
atomic_inc( &t->ci->nr_tasks );
atomic_inc( &t->cj->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
t->cj->density[ atomic_inc( &t->cj->nr_density ) ] = t;
t->ci->density = engine_addlink( e , t->ci->density , t );
atomic_inc( &t->ci->nr_density );
t->cj->density = engine_addlink( e , t->cj->density , t );
atomic_inc( &t->cj->nr_density );
}
}
else if ( t->type == task_type_sub ) {
......@@ -873,18 +939,23 @@ void engine_maketasks ( struct engine *e ) {
if ( t->cj != NULL )
atomic_inc( &t->cj->nr_tasks );
if ( t->subtype == task_subtype_density ) {
t->ci->density[ atomic_inc( &t->ci->nr_density ) ] = t;
if ( t->cj != NULL )
t->cj->density[ atomic_inc( &t->cj->nr_density ) ] = t;
t->ci->density = engine_addlink( e , t->ci->density , t );
atomic_inc( &t->ci->nr_density );
if ( t->cj != NULL ) {
t->cj->density = engine_addlink( e , t->cj->density , t );
atomic_inc( &t->cj->nr_density );
}
}
}
}
/* Append a ghost task to each cell. */
if ( e->policy & engine_policy_fixdt )
for ( k = 0 ; k < s->nr_cells ; k++ )
engine_mkghosts( e , &s->cells[k] , NULL );
/* if ( e->policy & engine_policy_fixdt )
space_map_cells_pre( s , 1 , &scheduler_map_mkghosts_nokick1 , sched );
else
space_map_cells_pre( s , 1 , &scheduler_map_mkghosts , sched );
space_map_cells_pre( s , 1 , &scheduler_map_mkghosts , sched ); */
/* Run through the tasks and make force tasks for each density task.
Each force task depends on the cell ghosts and unlocks the kick2 task
......@@ -904,28 +975,29 @@ void engine_maketasks ( struct engine *e ) {
if ( t->type == task_type_self && t->subtype == task_subtype_density ) {
scheduler_addunlock( sched , t , t->ci->super->ghost );
t2 = scheduler_addtask( sched , task_type_self , task_subtype_force , 0 , 0 , t->ci , NULL , 0 );
scheduler_addunlock( sched , t->ci->ghost , t2 );
scheduler_addunlock( sched , t->ci->super->ghost , t2 );
scheduler_addunlock( sched , t2 , t->ci->super->kick2 );
t->ci->force[ atomic_inc( &t->ci->nr_force ) ] = t2;
t->ci->force = engine_addlink( e , t->ci->force , t2 );
atomic_inc( &t->ci->nr_force );
}
/* Otherwise, pair interaction? */
else if ( t->type == task_type_pair && t->subtype == task_subtype_density ) {
t2 = scheduler_addtask( sched , task_type_pair , task_subtype_force , 0 , 0 , t->ci , t->cj , 0 );
if ( t->ci->nodeID == e->nodeID ) {
scheduler_addunlock( sched , t->ci->ghost , t2 );
scheduler_addunlock( sched , t , t->ci->super->ghost );
scheduler_addunlock( sched , t->ci->super->ghost , t2 );
scheduler_addunlock( sched , t2 , t->ci->super->kick2 );
}
if ( t->cj->nodeID == e->nodeID ) {
scheduler_addunlock( sched , t->cj->ghost , t2 );
if ( t->ci->super != t->cj->super ) {
scheduler_addunlock( sched , t , t->cj->super->ghost );
scheduler_addunlock( sched , t2 , t->cj->super->kick2 );
}
if ( t->cj->nodeID == e->nodeID && t->ci->super != t->cj->super ) {
scheduler_addunlock( sched , t , t->cj->super->ghost );
scheduler_addunlock( sched , t->cj->super->ghost , t2 );
scheduler_addunlock( sched , t2 , t->cj->super->kick2 );
}
t->ci->force[ atomic_inc( &t->ci->nr_force ) ] = t2;
t->cj->force[ atomic_inc( &t->cj->nr_force ) ] = t2;
t->ci->force = engine_addlink( e , t->ci->force , t2 );
atomic_inc( &t->ci->nr_force );
t->cj->force = engine_addlink( e , t->cj->force , t2 );
atomic_inc( &t->cj->nr_force );
}
/* Otherwise, sub interaction? */
......@@ -933,19 +1005,20 @@ void engine_maketasks ( struct engine *e ) {
t2 = scheduler_addtask( sched , task_type_sub , task_subtype_force , t->flags , 0 , t->ci , t->cj , 0 );
if ( t->ci->nodeID == e->nodeID ) {
scheduler_addunlock( sched , t , t->ci->super->ghost );
scheduler_addunlock( sched , t->ci->ghost , t2 );
scheduler_addunlock( sched , t->ci->super->ghost , t2 );
scheduler_addunlock( sched , t2 , t->ci->super->kick2 );
}
if ( t->cj != NULL && t->cj->nodeID == e->nodeID ) {
scheduler_addunlock( sched , t->cj->ghost , t2 );
if ( t->ci->super != t->cj->super ) {
scheduler_addunlock( sched , t , t->cj->super->ghost );
scheduler_addunlock( sched , t2 , t->cj->super->kick2 );
}
if ( t->cj != NULL && t->cj->nodeID == e->nodeID && t->ci->super != t->cj->super ) {
scheduler_addunlock( sched , t , t->cj->super->ghost );
scheduler_addunlock( sched , t->cj->super->ghost , t2 );
scheduler_addunlock( sched , t2 , t->cj->super->kick2 );
}
t->ci->force = engine_addlink( e , t->ci->force , t2 );
atomic_inc( &t->ci->nr_force );
if ( t->cj != NULL ) {
t->cj->force = engine_addlink( e , t->cj->force , t2 );
atomic_inc( &t->cj->nr_force );
}
t->ci->force[ atomic_inc( &t->ci->nr_force ) ] = t2;
if ( t->cj != NULL )
t->cj->force[ atomic_inc( &t->cj->nr_force ) ] = t2;
}
}
......@@ -1852,6 +1925,8 @@ void engine_init ( struct engine *e , struct space *s , float dt , int nr_thread
e->nr_proxies = 0;
e->forcerebuild = 1;
e->forcerepart = 0;
e->links = NULL;
e->nr_links = 0;
engine_rank = nodeID;
/* Make the space link back to the engine. */
......@@ -1899,7 +1974,9 @@ void engine_init ( struct engine *e , struct space *s , float dt , int nr_thread
/* Append a kick1 task to each cell. */
scheduler_reset( &e->sched , s->tot_cells );
space_map_cells_pre( e->s , 1 , &scheduler_map_mkkick1 , &e->sched );
for ( k = 0 ; k < s->nr_cells ; k++ )
s->cells[k].kick1 = scheduler_addtask( &e->sched , task_type_kick1 , task_subtype_none , 0 , 0 , &s->cells[k] , NULL , 0 );
// space_map_cells_pre( e->s , 1 , &scheduler_map_mkkick1 , &e->sched );
scheduler_ranktasks( &e->sched );
/* Allocate and init the threads. */
......
src/engine.h
View file @ 279d1bc2
......@@ -41,6 +41,18 @@
extern int engine_rank;
/* Mini struct to link cells to density/force tasks. */
struct link {
/* The task pointer. */
struct task *t;
/* The next pointer. */
struct link *next;
};
/* Data structure for the engine. */
struct engine {
......@@ -98,6 +110,10 @@ struct engine {
/* How many steps have we done with the same set of tasks? */
int tasks_age;
/* Linked list for cell-task association. */
struct link *links;
int nr_links;
};
......@@ -113,3 +129,4 @@ void engine_rebuild ( struct engine *e );
void engine_repartition ( struct engine *e );
void engine_makeproxies ( struct engine *e );
void engine_redistribute ( struct engine *e );
struct link *engine_addlink( struct engine *e , struct link *l , struct task *t );
src/runner.c
View file @ 279d1bc2
......@@ -528,31 +528,31 @@ void runner_doghost ( struct runner *r , struct cell *c ) {
for ( finger = c ; finger != NULL ; finger = finger->parent ) {
/* Run through this cell's density interactions. */
for ( k = 0 ; k < finger->nr_density ; k++ ) {
for ( struct link *l = finger->density ; l != NULL ; l = l->next ) {
/* Self-interaction? */
if ( finger->density[k]->type == task_type_self )
if ( l->t->type == task_type_self )
runner_doself_subset_density( r , finger , parts , pid , count );
/* Otherwise, pair interaction? */
else if ( finger->density[k]->type == task_type_pair ) {
else if ( l->t->type == task_type_pair ) {
/* Left or right? */
if ( finger->density[k]->ci == finger )
runner_dopair_subset_density( r , finger , parts , pid , count , finger->density[k]->cj );
if ( l->t->ci == finger )
runner_dopair_subset_density( r , finger , parts , pid , count , l->t->cj );
else
runner_dopair_subset_density( r , finger , parts , pid , count , finger->density[k]->ci );
runner_dopair_subset_density( r , finger , parts , pid , count , l->t->ci );
}
/* Otherwise, sub interaction? */
else if ( finger->density[k]->type == task_type_sub ) {
else if ( l->t->type == task_type_sub ) {
/* Left or right? */
if ( finger->density[k]->ci == finger )
runner_dosub_subset_density( r , finger , parts , pid , count , finger->density[k]->cj , -1 , 1 );
if ( l->t->ci == finger )
runner_dosub_subset_density( r , finger , parts , pid , count , l->t->cj , -1 , 1 );
else
runner_dosub_subset_density( r , finger , parts , pid , count , finger->density[k]->ci , -1 , 1 );
runner_dosub_subset_density( r , finger , parts , pid , count , l->t->ci , -1 , 1 );
}
......@@ -1102,10 +1102,10 @@ void *runner_main ( void *data ) {
/* Set super to the first cell that I own. */
if ( ci->super->owner == r->qid )
super = ci->super;
else if ( cj != NULL && cj->super->owner == r->qid )
else if ( cj != NULL && cj->super != NULL && cj->super->owner == r->qid )
super = cj->super;
else
super = NULL;
/* else
super = NULL; */
/* Prefetch? */
if ( runner_prefetch &&
......@@ -1147,8 +1147,7 @@ void *runner_main ( void *data ) {
error( "Unknown task subtype." );
break;
case task_type_ghost:
if ( ci->super == ci )
runner_doghost( r , ci );
runner_doghost( r , ci );
break;
case task_type_kick1:
runner_dokick1( r , ci );
......
src/scheduler.c
View file @ 279d1bc2
......@@ -64,8 +64,8 @@ void scheduler_addunlock ( struct scheduler *s , struct task *ta , struct task *
while ( 1 ) {
/* Follow the links. */
while ( ta->link != NULL )
ta = ta->link;
while ( ta->nr_unlock_tasks == task_maxunlock+1 )
ta = ta->unlock_tasks[ task_maxunlock ];
/* Get the index of the next free task. */
int ind = atomic_inc( &ta->nr_unlock_tasks );
......@@ -81,9 +81,8 @@ void scheduler_addunlock ( struct scheduler *s , struct task *ta , struct task *
/* Only one thread should have to do this. */
if ( ind == task_maxunlock ) {
ta->link = scheduler_addtask( s , task_type_link , task_subtype_none , ta->flags , 0 , ta->ci , ta->cj , 0 );
ta->link->implicit = 1;
ta->unlock_tasks[ ind ] = ta->link;
ta->unlock_tasks[ task_maxunlock ] = scheduler_addtask( s , task_type_link , task_subtype_none , ta->flags , 0 , ta->ci , ta->cj , 0 );
ta->unlock_tasks[ task_maxunlock ]->implicit = 1;
}
/* Otherwise, reduce the count. */
......@@ -97,91 +96,6 @@ void scheduler_addunlock ( struct scheduler *s , struct task *ta , struct task *
}
/**
* @brief Mapping function to append a ghost task to each cell.
*
* Looks for the super cell, e.g. the highest-level cell above each
* cell for which a pair is defined. All ghosts below this cell will
* depend on the ghost of their parents (sounds spooky, but it isn't).
*
* A kick2-task is appended to each super cell.
*/
void scheduler_map_mkghosts ( struct cell *c , void *data ) {
struct scheduler *s = (struct scheduler *)data;
struct cell *finger;
/* Find the super cell, i.e. the highest cell hierarchically above
this one to still have at least one task associated with it. */
c->super = c;
for ( finger = c->parent ; finger != NULL ; finger = finger->parent )
if ( finger->nr_tasks > 0 )
c->super = finger;
/* As of here, things are only interesting for local cells. */
if ( c->nodeID != s->nodeID )
return;
/* Make the ghost task */
if ( c->super != c || c->nr_tasks > 0 )
c->ghost = scheduler_addtask( s , task_type_ghost , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* Append a kick1 task if local and make sure the parent depends on it. */
if (c->parent == NULL || c->parent->count >= space_subsize ) {
c->kick1 = scheduler_addtask( s , task_type_kick1 , task_subtype_none , 0 , 0 , c , NULL , 0 );
if ( c->parent != NULL )
scheduler_addunlock( s , c->kick1 , c->parent->kick1 );
}
/* Append a kick2 task if we are local and the active super cell. */
if ( c->super == c && c->nr_tasks > 0 )
c->kick2 = scheduler_addtask( s , task_type_kick2 , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* If we are not the super cell ourselves, make our ghost depend
on our parent cell. */
if ( c->ghost != NULL && c->super != c ) {
scheduler_addunlock( s , c->parent->ghost , c->ghost );
c->ghost->implicit = 1;
}
}
void scheduler_map_mkghosts_nokick1 ( struct cell *c , void *data ) {
struct scheduler *s = (struct scheduler *)data;
struct cell *finger;
/* Find the super cell, i.e. the highest cell hierarchically above
this one to still have at least one task associated with it. */
c->super = c;
for ( finger = c->parent ; finger != NULL ; finger = finger->parent )
if ( finger->nr_tasks > 0 )
c->super = finger;
/* As of here, things are only interesting for local cells. */
if ( c->nodeID != s->nodeID )
return;
/* Make the ghost task */
if ( c->super != c || c->nr_tasks > 0 )
c->ghost = scheduler_addtask( s , task_type_ghost , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* Append a kick2 task if we are the active super cell. */
if ( c->super == c && c->nr_tasks > 0 )
c->kick2 = scheduler_addtask( s , task_type_kick2 , task_subtype_none , 0 , 0 , c , NULL , 0 );
/* If we are not the super cell ourselves, make our ghost depend
on our parent cell. */
if ( c->super != c ) {
scheduler_addunlock( s , c->parent->ghost , c->ghost );
c->ghost->implicit = 1;
}
}
/**
* @brief Mapping function to append a ghost task to each cell.
*
......@@ -558,7 +472,6 @@ struct task *scheduler_addtask ( struct scheduler *s , int type , int subtype ,
t->tic = 0;
t->toc = 0;
t->nr_unlock_tasks = 0;
t->link = NULL;
/* Init the lock. */
lock_init( &t->lock );
......
src/scheduler.h
View file @ 279d1bc2
......@@ -81,8 +81,6 @@ void scheduler_ranktasks ( struct scheduler *s );
void scheduler_reweight ( struct scheduler *s );
struct task *scheduler_addtask ( struct scheduler *s , int type , int subtype , int flags , int wait , struct cell *ci , struct cell *cj , int tight );
void scheduler_splittasks ( struct scheduler *s );
void scheduler_map_mkghosts ( struct cell *c , void *data );
void scheduler_map_mkghosts_nokick1 ( struct cell *c , void *data );
void scheduler_map_mkkick1 ( struct cell *c , void *data );
struct task *scheduler_done ( struct scheduler *s , struct task *t );
struct task *scheduler_unlock ( struct scheduler *s , struct task *t );
......
src/space.c
View file @ 279d1bc2
......@@ -240,6 +240,7 @@ void space_regrid ( struct space *s , double cell_max ) {
c->dmin = dmin;
c->depth = 0;
c->count = 0;
c->super = c;
lock_init( &c->lock );
}
......@@ -259,11 +260,14 @@ void space_regrid ( struct space *s , double cell_max ) {
s->cells[k].nr_tasks = 0;
s->cells[k].nr_density = 0;
s->cells[k].nr_force = 0;
s->cells[k].density = NULL;
s->cells[k].force = NULL;
s->cells[k].dx_max = 0.0f;
s->cells[k].sorted = 0;
s->cells[k].count = 0;
s->cells[k].kick1 = NULL;
s->cells[k].kick2 = NULL;
s->cells[k].super = &s->cells[k];
}
s->maxdepth = 0;
......@@ -366,6 +370,7 @@ void space_rebuild ( struct space *s , double cell_max ) {
c->dmin = dmin;
c->depth = 0;
c->count = 0;
c->super = c;
lock_init( &c->lock );
}
......@@ -385,9 +390,12 @@ void space_rebuild ( struct space *s , double cell_max ) {
cells[k].nr_tasks = 0;
cells[k].nr_density = 0;
cells[k].nr_force = 0;
cells[k].density = NULL;
cells[k].force = NULL;
cells[k].dx_max = 0.0f;
cells[k].sorted = 0;
cells[k].count = 0;
cells[k].super = &cells[k];
cells[k].kick1 = NULL;
cells[k].kick2 = NULL;
}
......
src/task.h
View file @ 279d1bc2
......@@ -20,7 +20,7 @@
/* Some constants. */
#define task_maxwait 3