-
-
Notifications
You must be signed in to change notification settings - Fork 140
/
Dependencies_c.c
146 lines (129 loc) · 4.9 KB
/
Dependencies_c.c
1
2
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
// Copyright (c) 2020 Doug Binks
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgement in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
#include "TaskScheduler_c.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
enkiTaskScheduler* pETS;
void TaskSetFunc( uint32_t start_, uint32_t end_, uint32_t threadnum_, void* pArgs_ )
{
(void)start_; (void)end_;
char* str = (char*)pArgs_;
printf("%s on thread %u\n", str, threadnum_);
}
void PinnedTaskFunc( void* pArgs_ )
{
char* str = (char*)pArgs_;
printf("%s Pinned task on thread 0, should be %u\n", str, enkiGetThreadNum( pETS ) );
}
#define NUM_TASK_B 4
#define NUM_TASK_D 2
int main(int argc, const char * argv[])
{
int run;
enkiTaskSet* pTaskA;
enkiTaskSet* pTaskB[NUM_TASK_B];
enkiDependency* pTaskBDependencyToA[NUM_TASK_B];
enkiPinnedTask* pPinnedTaskC;
enkiDependency* pPinnedTaskCDependencyToBs[NUM_TASK_B];
enkiTaskSet* pTaskD[NUM_TASK_D];
enkiDependency* pTaskDDependencyToC[NUM_TASK_D];
enkiCompletable* pCompletableFinished; // A completable can be used on it's own to check if tasks complete.
enkiDependency* pDependencyToD[NUM_TASK_D];
pETS = enkiNewTaskScheduler();
enkiInitTaskScheduler( pETS );
// create tasks and set dependencies once, reuse many times
pTaskA = enkiCreateTaskSet( pETS, TaskSetFunc );
enkiSetArgsTaskSet( pTaskA, "A" );
for( int i=0; i<NUM_TASK_B; ++i )
{
pTaskB[i] = enkiCreateTaskSet( pETS, TaskSetFunc );
enkiSetArgsTaskSet( pTaskB[i], "B" );
pTaskBDependencyToA[i] = enkiCreateDependency( pETS );
enkiSetDependency(
pTaskBDependencyToA[i],
enkiGetCompletableFromTaskSet( pTaskA ),
enkiGetCompletableFromTaskSet( pTaskB[i] )
);
}
pPinnedTaskC = enkiCreatePinnedTask( pETS, PinnedTaskFunc, 0 );
enkiSetArgsPinnedTask( pPinnedTaskC, "C" );
for( int i=0; i<NUM_TASK_B; ++i )
{
pPinnedTaskCDependencyToBs[i] = enkiCreateDependency( pETS );
enkiSetDependency(
pPinnedTaskCDependencyToBs[i],
enkiGetCompletableFromTaskSet( pTaskB[i] ),
enkiGetCompletableFromPinnedTask( pPinnedTaskC )
);
}
for( int i=0; i<NUM_TASK_D; ++i )
{
pTaskD[i] = enkiCreateTaskSet( pETS, TaskSetFunc );
enkiSetArgsTaskSet( pTaskD[i], "D" );
pTaskDDependencyToC[i] = enkiCreateDependency( pETS );
enkiSetDependency(
pTaskDDependencyToC[i],
enkiGetCompletableFromPinnedTask( pPinnedTaskC ),
enkiGetCompletableFromTaskSet( pTaskD[i] )
);
}
pCompletableFinished = enkiCreateCompletable( pETS );
for( int i=0; i<NUM_TASK_D; ++i )
{
pDependencyToD[i] = enkiCreateDependency( pETS );
enkiSetDependency(
pDependencyToD[i],
enkiGetCompletableFromTaskSet( pTaskD[i] ),
pCompletableFinished
);
}
// run task graph as many times as you like by adding first task,
// and waiting for last (if needed).
for( run=0; run<10; ++run )
{
printf("Starting run %d\n", run);
enkiAddTaskSet( pETS, pTaskA );
enkiWaitForCompletable( pETS, pCompletableFinished );
printf("FINISHED run %d\n", run);
}
// new delete functions require task scheduler argument
// as this reduces memory requirements
for( int i=0; i<NUM_TASK_D; ++i )
{
enkiDeleteDependency( pETS, pDependencyToD[i] );
}
enkiDeleteCompletable( pETS, pCompletableFinished );
for( int i=0; i<NUM_TASK_D; ++i )
{
enkiDeleteDependency( pETS, pTaskDDependencyToC[i] );
enkiDeleteTaskSet( pETS, pTaskD[i] );
}
for( int i=0; i<NUM_TASK_B; ++i )
{
enkiDeleteDependency( pETS, pPinnedTaskCDependencyToBs[i] );
}
enkiDeletePinnedTask( pETS, pPinnedTaskC );
for( int i=0; i<NUM_TASK_B; ++i )
{
enkiDeleteDependency( pETS, pTaskBDependencyToA[i] );
enkiDeleteTaskSet( pETS, pTaskB[i] );
}
enkiDeleteTaskSet( pETS, pTaskA );
enkiDeleteTaskScheduler( pETS );
}