task.c 4.29 KB
Newer Older
1
/*******************************************************************************
2
 * This file is part of SWIFT.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
 * Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@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/>.
 * 
 ******************************************************************************/

/* Config parameters. */
#include "../config.h"

/* Some standard headers. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <pthread.h>
#include <math.h>
#include <float.h>
#include <limits.h>
#include <omp.h>
#include <sched.h>

/* Local headers. */
#include "cycle.h"
#include "lock.h"
#include "task.h"


/* Task type names. */
41
const char *taskID_names[task_type_count] = { "none" , "sort" , "self" , "pair" , "sub" , "ghost" };
42
43

/* Error macro. */
44
#define error(s) { fprintf( stderr , "%s:%s:%i: %s\n" , __FILE__ , __FUNCTION__ , __LINE__ , s ); abort(); }
45
46


47
/**
48
 * @brief Remove all unlocks to tasks that are of the given type.
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
 *
 * @param t The #task.
 * @param type The task type ID to remove.
 */
 
void task_cleanunlock ( struct task *t , int type ) {

    int k;
    
    lock_lock( &t->lock );
    
    for ( k = 0 ; k < t->nr_unlock_tasks ; k++ )
        if ( t->unlock_tasks[k]->type == type ) {
            t->nr_unlock_tasks -= 1;
            t->unlock_tasks[k] = t->unlock_tasks[ t->nr_unlock_tasks ];
            }
    
    lock_unlock_blind( &t->lock );
    
    }


71
72
73
74
75
76
77
/**
 * @brief Remove an unlock_task from the given task.
 *
 * @param ta The unlocking #task.
 * @param tb The #task that will be unlocked.
 */
 
78
void task_rmunlock ( struct task *ta , struct task *tb ) {
79
80
81

    int k;
    
82
83
    lock_lock( &ta->lock );
    
84
85
86
87
    for ( k = 0 ; k < ta->nr_unlock_tasks ; k++ )
        if ( ta->unlock_tasks[k] == tb ) {
            ta->nr_unlock_tasks -= 1;
            ta->unlock_tasks[k] = ta->unlock_tasks[ ta->nr_unlock_tasks ];
88
            lock_unlock_blind( &ta->lock );
89
90
91
92
93
94
95
            return;
            }
    error( "Task not found." );

    }
    

Pedro Gonnet's avatar
Pedro Gonnet committed
96
97
98
99
100
101
102
103
104
105
/**
 * @brief Remove an unlock_task from the given task.
 *
 * @param ta The unlocking #task.
 * @param tb The #task that will be unlocked.
 *
 * Differs from #task_rmunlock in that it will not fail if
 * the task @c tb is not in the unlocks of @c ta.
 */
 
106
void task_rmunlock_blind ( struct task *ta , struct task *tb ) {
Pedro Gonnet's avatar
Pedro Gonnet committed
107
108
109

    int k;
    
110
111
    lock_lock( &ta->lock );
    
Pedro Gonnet's avatar
Pedro Gonnet committed
112
113
114
115
    for ( k = 0 ; k < ta->nr_unlock_tasks ; k++ )
        if ( ta->unlock_tasks[k] == tb ) {
            ta->nr_unlock_tasks -= 1;
            ta->unlock_tasks[k] = ta->unlock_tasks[ ta->nr_unlock_tasks ];
116
            break;
Pedro Gonnet's avatar
Pedro Gonnet committed
117
            }
118
119
            
    lock_unlock_blind( &ta->lock );
Pedro Gonnet's avatar
Pedro Gonnet committed
120
121
122
123

    }
    

124
125
126
127
128
129
130
/**
 * @brief Add an unlock_task to the given task.
 *
 * @param ta The unlocking #task.
 * @param tb The #task that will be unlocked.
 */
 
131
132
133
134
135
136
137
138
139
140
141
142
143
void task_addunlock ( struct task *ta , struct task *tb ) {

    /* Add the lock atomically. */
    ta->unlock_tasks[ __sync_fetch_and_add( &ta->nr_unlock_tasks, 1 ) ] = tb;

    /* Check a posteriori if we did not overshoot. */
    if ( ta->nr_unlock_tasks > task_maxunlock )
        error( "Too many unlock_tasks in task." );
        
    }
    

void task_addunlock_old ( struct task *ta , struct task *tb ) {
144
145
146

    int k;
    
147
148
    lock_lock( &ta->lock );
    
149
150
    /* Check if ta already unlocks tb. */
    for ( k = 0 ; k < ta->nr_unlock_tasks ; k++ )
151
        if ( ta->unlock_tasks[k] == tb ) {
152
            error( "Duplicate unlock." );
153
            lock_unlock_blind( &ta->lock );
154
            return;
155
            }
156
157
158
159
160
161
162

    if ( ta->nr_unlock_tasks == task_maxunlock )
        error( "Too many unlock_tasks in task." );
        
    ta->unlock_tasks[ ta->nr_unlock_tasks] = tb;
    ta->nr_unlock_tasks += 1;

163
164
    lock_unlock_blind( &ta->lock );
    
165
166
167
    }