Mercurial > hg > GearsTemplate
annotate src/parallel_execution/context.h @ 278:23767f714f4a
fix generate_stub
| author | mir3636 |
|---|---|
| date | Thu, 02 Feb 2017 20:27:56 +0900 |
| parents | 195518ab62fc |
| children | a3448b0f0a56 |
| rev | line source |
|---|---|
| 86 | 1 /* Context definition for llrb example */ |
| 132 | 2 #ifndef CONTEXT_H |
| 3 #define CONTEXT_H | |
|
207
7470b8382672
Fix compile error to stack_test
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
194
diff
changeset
|
4 #include <stdlib.h> |
| 86 | 5 #include <pthread.h> |
| 101 | 6 #ifdef USE_CUDA |
| 98 | 7 #include <cuda.h> |
| 101 | 8 #endif |
| 86 | 9 |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
10 #define ALLOCATE_SIZE 20000000 |
| 101 | 11 #define NEW(type) (type*)(calloc(1, sizeof(type))) |
| 12 #define NEWN(n, type) (type*)(calloc(n, sizeof(type))) | |
| 13 | |
| 133 | 14 #define ALLOC_DATA(context, dseg) ({\ |
| 15 struct Meta* meta = (struct Meta*)context->heap;\ | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
16 meta->type = D_##dseg;\ |
| 236 | 17 meta->size = 1;\ |
| 133 | 18 context->heap += sizeof(struct Meta);\ |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
19 context->data[D_##dseg] = context->heap; context->heap += sizeof(struct dseg); (struct dseg *)context->data[D_##dseg]; }) |
| 101 | 20 |
| 133 | 21 #define ALLOC_DATA_TYPE(context, dseg, t) ({\ |
| 22 struct Meta* meta = (struct Meta*)context->heap;\ | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
23 meta->type = D_##t;\ |
| 236 | 24 meta->size = 1;\ |
| 25 context->heap += sizeof(struct Meta); \ | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
26 context->data[D_##dseg] = context->heap; context->heap += sizeof(struct t); (struct t *)context->data[D_##dseg]; }) |
| 86 | 27 |
| 132 | 28 #define ALLOCATE(context, t) ({ \ |
| 133 | 29 struct Meta* meta = (struct Meta*)context->heap;\ |
| 30 context->heap += sizeof(struct Meta);\ | |
| 31 union Data* data = context->heap; \ | |
| 32 context->heap += sizeof(struct t); \ | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
33 meta->type = D_##t; \ |
| 236 | 34 meta->size = 1; \ |
| 133 | 35 data; }) |
| 132 | 36 |
| 233 | 37 #define ALLOC(context, t) (&ALLOCATE(context, t)->t) |
| 38 | |
| 237 | 39 #define ALLOC_ARRAY(context, dseg, len) ({\ |
| 236 | 40 struct Meta* meta = (struct Meta*)context->heap;\ |
| 41 context->heap += sizeof(struct Meta);\ | |
| 42 union Data* data = context->heap; \ | |
| 244 | 43 context->heap += sizeof(struct dseg *)*len; \ |
| 236 | 44 meta->type = D_##dseg; \ |
| 237 | 45 meta->size = len; \ |
| 236 | 46 data; }) |
| 47 | |
| 133 | 48 #define GET_TYPE(dseg) ({ \ |
| 49 struct Meta* meta = (struct Meta*)(((void*)dseg) - sizeof(struct Meta));\ | |
| 50 meta->type; }) | |
| 132 | 51 |
| 149 | 52 #define Gearef(context, t) (&(context)->data[D_##t]->t) |
| 186 | 53 |
| 232 | 54 // (struct SingleLinkedStack *)context->data[D_Stack]->Stack.stack->Stack.stack |
| 55 | |
| 56 #define GearImpl(context, intf, name) (Gearef(context, intf)->name->intf.name) | |
| 57 | |
| 186 | 58 #include "c/enumCode.h" |
| 86 | 59 |
| 60 enum Relational { | |
| 61 EQ, | |
| 62 GT, | |
| 63 LT, | |
| 64 }; | |
| 65 | |
| 186 | 66 #include "c/enumData.h" |
| 86 | 67 |
| 68 struct Context { | |
| 69 enum Code next; | |
| 230 | 70 struct Worker* worker; |
| 71 struct TaskManager* taskManager; | |
| 86 | 72 int codeNum; |
| 73 __code (**code) (struct Context*); | |
| 74 void* heapStart; | |
| 75 void* heap; | |
| 76 long heapLimit; | |
| 87 | 77 int dataNum; |
| 236 | 78 int idgCount; //number of waiting dataGear |
| 242 | 79 int workerId; |
| 86 | 80 union Data **data; |
| 81 }; | |
| 82 | |
| 83 union Data { | |
| 133 | 84 struct Meta { |
| 85 enum DataType type; | |
| 236 | 86 long size; |
| 176 | 87 struct Queue* wait; // tasks waiting this dataGear |
| 133 | 88 } meta; |
|
259
195518ab62fc
fix type gathering pattern match in generate_stub.pl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
254
diff
changeset
|
89 struct Context Context; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
90 struct Time { |
| 102 | 91 enum Code next; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
92 double time; |
| 149 | 93 } Time; |
| 86 | 94 struct LoopCounter { |
| 95 int i; | |
| 166 | 96 struct Tree* tree; |
|
217
c34e6aa10967
Fix DataGear access name
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
207
diff
changeset
|
97 } LoopCounter; |
| 176 | 98 struct TaskManager { |
|
218
d8a59b727f65
Fix spawnTaskManager
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
217
diff
changeset
|
99 union Data* taskManager; |
| 234 | 100 enum Code createTask; // create NEW contexts for execution & argument |
| 101 enum Code spawn; // start NEW context on the worker | |
| 176 | 102 enum Code shutdown; |
| 233 | 103 |
| 184 | 104 enum Code next; |
| 233 | 105 enum Code task; |
| 106 struct Context* context; | |
| 107 int worker; | |
| 108 int cpu; | |
| 109 int gpu; | |
| 110 int io; | |
| 237 | 111 int maxCPU; |
| 184 | 112 } TaskManager; |
| 182 | 113 struct TaskManagerImpl { |
| 233 | 114 int numWorker; |
| 242 | 115 int sendWorkerIndex; |
| 239 | 116 pthread_mutex_t mutex; |
| 184 | 117 struct Queue* activeQueue; |
| 118 struct Queue* taskQueue; | |
| 244 | 119 struct Worker** workers; |
| 184 | 120 } TaskManagerImpl; |
| 86 | 121 struct Worker { |
| 232 | 122 union Data* worker; |
|
222
77faa28128b4
Add taskSend for TaskManager
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
218
diff
changeset
|
123 enum Code taskReceive; |
| 176 | 124 enum Code shutdown; |
| 230 | 125 enum Code next; |
| 244 | 126 struct Queue* tasks; |
| 184 | 127 } Worker; |
| 232 | 128 struct CPUWorker { |
| 233 | 129 pthread_t thread; |
| 242 | 130 pthread_mutex_t mutex; |
| 131 pthread_cond_t cond; | |
| 232 | 132 struct Context* context; |
| 133 int id; | |
| 134 } CPUWorker; | |
| 101 | 135 #ifdef USE_CUDA |
| 232 | 136 struct CudaWorker { |
| 233 | 137 pthread_t thread; |
| 232 | 138 struct Context* context; |
| 139 int id; | |
| 140 struct Queue* tasks; | |
| 141 int runFlag; | |
| 142 enum Code next; | |
| 98 | 143 CUdevice device; |
| 144 CUcontext cuCtx; | |
| 145 CUfunction code; | |
| 146 CUdeviceptr* deviceptr; | |
| 147 CUstream stream; | |
| 232 | 148 } CudaWorker; |
| 187 | 149 #else |
| 232 | 150 struct CudaWorker { |
| 151 } CudaWorker; | |
| 101 | 152 #endif |
| 177 | 153 struct Main { |
| 154 enum Code code; | |
| 155 enum Code next; | |
| 156 struct Queue* args; | |
| 185 | 157 } Main; |
| 90 | 158 struct Task { |
| 159 enum Code code; | |
| 176 | 160 struct Queue* dataGears; |
| 112 | 161 int idsCount; |
| 166 | 162 } Task; |
|
169
ea7b11f3e717
Using Queue Interface
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
168
diff
changeset
|
163 // Queue Interface |
| 90 | 164 struct Queue { |
| 136 | 165 union Data* queue; |
| 167 | 166 union Data* data; |
| 167 enum Code whenEmpty; | |
| 168 enum Code clear; | |
| 169 enum Code put; | |
| 170 enum Code take; | |
| 171 enum Code isEmpty; | |
| 130 | 172 enum Code next; |
| 184 | 173 } Queue; |
| 167 | 174 struct SingleLinkedQueue { |
| 175 struct Element* top; | |
| 176 struct Element* last; | |
| 184 | 177 } SingleLinkedQueue; |
| 132 | 178 // Stack Interface |
| 130 | 179 struct Stack { |
| 132 | 180 union Data* stack; |
| 130 | 181 union Data* data; |
| 133 | 182 union Data* data1; |
|
169
ea7b11f3e717
Using Queue Interface
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
168
diff
changeset
|
183 enum Code whenEmpty; |
|
145
cc071cf1ba85
add stack clear interface
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
144
diff
changeset
|
184 enum Code clear; |
| 130 | 185 enum Code push; |
| 186 enum Code pop; | |
| 133 | 187 enum Code pop2; |
| 130 | 188 enum Code isEmpty; |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
189 enum Code get; |
| 133 | 190 enum Code get2; |
| 130 | 191 enum Code next; |
| 194 | 192 } Stack; |
| 132 | 193 // Stack implementations |
| 194 struct SingleLinkedStack { | |
| 195 struct Element* top; | |
| 194 | 196 } SingleLinkedStack; |
| 132 | 197 struct ArrayStack { |
| 198 int size; | |
| 199 int limit; | |
| 200 struct Element* array; | |
| 194 | 201 } ArrayStack; |
| 132 | 202 // Stack implementation end |
| 90 | 203 struct Element { |
|
113
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
204 union Data* data; |
| 90 | 205 struct Element* next; |
| 194 | 206 } Element; |
| 86 | 207 struct Array { |
| 90 | 208 int index; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
209 int prefix; |
| 86 | 210 int* array; |
| 194 | 211 } Array; |
| 86 | 212 struct Tree { |
| 166 | 213 union Data* tree; |
| 214 struct Node* node; | |
| 152 | 215 enum Code put; |
| 216 enum Code get; | |
| 217 enum Code remove; | |
| 171 | 218 enum Code clear; |
| 152 | 219 enum Code next; |
| 166 | 220 } Tree; |
| 172 | 221 struct RedBlackTree { |
| 152 | 222 struct Node* root; |
| 122 | 223 struct Node* current; // reading node of original tree |
| 138 | 224 struct Node* previous; // parent of reading node of original tree |
| 124 | 225 struct Node* newNode; // writing node of new tree |
|
143
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
138
diff
changeset
|
226 struct Node* parent; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
138
diff
changeset
|
227 struct Node* grandparent; |
| 132 | 228 struct Stack* nodeStack; |
| 86 | 229 int result; |
| 172 | 230 } RedBlackTree; |
| 147 | 231 struct RotateTree { |
| 232 enum Code next; | |
| 172 | 233 struct RedBlackTree* traverse; |
| 147 | 234 struct Tree* tree; |
|
217
c34e6aa10967
Fix DataGear access name
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
207
diff
changeset
|
235 } RotateTree; |
| 86 | 236 struct Node { |
| 237 int key; // comparable data segment | |
| 90 | 238 union Data* value; |
| 86 | 239 struct Node* left; |
| 240 struct Node* right; | |
| 241 // need to balancing | |
| 242 enum Color { | |
| 243 Red, | |
| 244 Black, | |
| 245 } color; | |
|
217
c34e6aa10967
Fix DataGear access name
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
207
diff
changeset
|
246 } Node; |
| 86 | 247 struct Allocate { |
| 248 enum Code next; | |
| 249 long size; | |
|
217
c34e6aa10967
Fix DataGear access name
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
207
diff
changeset
|
250 } Allocate; |
| 112 | 251 struct OutPutDataSegments { |
| 252 union Data **data; | |
|
217
c34e6aa10967
Fix DataGear access name
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
207
diff
changeset
|
253 } Ods; |
| 254 | 254 }; // union Data end this is necessary for context generator |
|
113
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
255 |
|
259
195518ab62fc
fix type gathering pattern match in generate_stub.pl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
254
diff
changeset
|
256 typedef union Data Data; |
|
195518ab62fc
fix type gathering pattern match in generate_stub.pl
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
254
diff
changeset
|
257 |
| 186 | 258 #include "c/typedefData.h" |
| 278 | 259 |
| 260 #include "c/extern.h" | |
| 261 | |
| 262 extern __code start_code(struct Context* context); | |
| 263 extern __code exit_code(struct Context* context); | |
| 264 extern __code meta(struct Context* context, enum Code next); | |
| 265 extern void initContext(struct Context* context); | |
| 266 | |
| 132 | 267 #endif |