Mercurial > hg > Members > Moririn
annotate src/parallel_execution/context.h @ 173:8260b230dc2f
fix RedBlackTree.c
| author | ikkun |
|---|---|
| date | Thu, 24 Nov 2016 20:51:32 +0900 |
| parents | 661b0b0d0399 |
| children | f0427e27dd7b |
| rev | line source |
|---|---|
| 86 | 1 /* Context definition for llrb example */ |
| 132 | 2 #ifndef CONTEXT_H |
| 3 #define CONTEXT_H | |
| 86 | 4 #include <pthread.h> |
| 101 | 5 #ifdef USE_CUDA |
| 98 | 6 #include <cuda.h> |
| 101 | 7 #endif |
| 86 | 8 |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
9 #define ALLOCATE_SIZE 20000000 |
| 101 | 10 #define NEW(type) (type*)(calloc(1, sizeof(type))) |
| 11 #define NEWN(n, type) (type*)(calloc(n, sizeof(type))) | |
| 12 | |
| 133 | 13 #define ALLOC_DATA(context, dseg) ({\ |
| 14 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
|
15 meta->type = D_##dseg;\ |
| 133 | 16 context->heap += sizeof(struct Meta);\ |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
17 context->data[D_##dseg] = context->heap; context->heap += sizeof(struct dseg); (struct dseg *)context->data[D_##dseg]; }) |
| 101 | 18 |
| 133 | 19 #define ALLOC_DATA_TYPE(context, dseg, t) ({\ |
| 20 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
|
21 meta->type = D_##t;\ |
| 133 | 22 context->heap += sizeof(struct Meta);\ |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
23 context->data[D_##dseg] = context->heap; context->heap += sizeof(struct t); (struct t *)context->data[D_##dseg]; }) |
| 86 | 24 |
| 132 | 25 #define ALLOCATE(context, t) ({ \ |
| 133 | 26 struct Meta* meta = (struct Meta*)context->heap;\ |
| 27 context->heap += sizeof(struct Meta);\ | |
| 28 union Data* data = context->heap; \ | |
| 29 context->heap += sizeof(struct t); \ | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
30 meta->type = D_##t; \ |
| 133 | 31 data; }) |
| 132 | 32 |
| 133 | 33 #define GET_TYPE(dseg) ({ \ |
| 34 struct Meta* meta = (struct Meta*)(((void*)dseg) - sizeof(struct Meta));\ | |
| 35 meta->type; }) | |
| 132 | 36 |
| 149 | 37 #define Gearef(context, t) (&(context)->data[D_##t]->t) |
| 86 | 38 enum Code { |
| 144 | 39 C_code1, |
| 40 C_code2, | |
| 41 C_code3, | |
| 42 C_code4, | |
| 43 C_code5, | |
| 44 C_find, | |
| 86 | 45 Not_find, |
| 46 Code6, | |
| 47 Allocator, | |
| 144 | 48 C_put, |
| 49 C_replaceNode, | |
| 50 C_replaceNode1, | |
| 51 C_insertNode, | |
| 86 | 52 Compare, |
| 144 | 53 C_rotateLeft, |
| 54 C_rotateLeft1, | |
| 55 C_rotateRight, | |
| 56 C_rotateRight1, | |
| 86 | 57 SetTree, |
| 144 | 58 C_insertCase1, |
| 59 C_insertCase2, | |
| 60 C_insertCase3, | |
| 61 C_insertCase4, | |
| 62 C_insertCase5, | |
| 63 C_insertCase51, | |
| 64 C_stackClear, | |
| 65 C_get, | |
| 66 C_search, | |
| 86 | 67 Delete, |
| 68 Delete1, | |
| 69 Delete2, | |
| 70 Delete3, | |
| 71 Replace_d1, | |
| 72 Replace_d2, | |
| 73 FindMax1, | |
| 74 FindMax2, | |
| 75 DeleteCase1, | |
| 76 DeleteCase2, | |
| 77 DeleteCase3, | |
| 78 DeleteCase4, | |
| 79 DeleteCase5, | |
| 80 DeleteCase6, | |
| 81 CreateWorker, | |
| 82 TaskManager, | |
| 90 | 83 CreateData1, |
| 84 CreateData2, | |
| 85 CreateTask1, | |
| 86 CreateTask2, | |
| 112 | 87 CreateTask3, |
| 88 CreateTask4, | |
| 90 | 89 PutQueue1, |
| 90 PutQueue2, | |
| 91 PutQueue3, | |
| 92 PutQueue4, | |
| 170 | 93 C_getTask1, |
| 94 C_getTask2, | |
|
145
cc071cf1ba85
add stack clear interface
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
144
diff
changeset
|
95 C_clearSingleLinkedStack, |
| 144 | 96 C_pushSingleLinkedStack, |
| 97 C_popSingleLinkedStack, | |
| 98 C_pop2SingleLinkedStack, | |
| 99 C_getSingleLinkedStack, | |
| 100 C_get2SingleLinkedStack, | |
| 101 C_isEmptySingleLinkedStack, | |
|
168
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
102 C_takeSingleLinkedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
103 C_putSingleLinkedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
104 C_isEmptySingleLinkedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
105 C_clearSingleLinkedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
106 C_takeSynchronizedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
107 C_putSynchronizedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
108 C_isEmptySynchronizedQueue, |
|
fa7419e2c67c
Add synchornizedQueue
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
167
diff
changeset
|
109 C_clearSynchronizedQueue, |
| 170 | 110 C_putRedBlackTree, |
| 111 C_getRedBlackTree, | |
| 112 C_removeRedBlackTree, | |
| 113 C_clearRedBlackTree, | |
| 112 | 114 SpawnTask, |
| 92 | 115 Twice, |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
116 StartTime, |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
117 EndTime, |
| 86 | 118 Exit, |
| 119 }; | |
| 120 | |
| 121 enum Relational { | |
| 122 EQ, | |
| 123 GT, | |
| 124 LT, | |
| 125 }; | |
| 126 | |
| 130 | 127 enum DataType { |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
128 D_Worker, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
129 D_Allocate, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
130 D_SingleLinkedStack, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
131 D_Stack, |
| 171 | 132 D_RedBlackTree, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
133 D_Tree, |
| 170 | 134 D_Task, |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
135 D_Traverse, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
136 D_RotateTree, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
137 D_Node, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
138 D_LoopCounter, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
139 D_Time, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
140 D_Element, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
141 D_ActiveQueue, |
|
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
142 D_WaitQueue, |
| 171 | 143 D_SingleLinkedQueue, |
| 144 D_SynchronizedQueue, | |
|
148
473b7d990a1f
fix data gears type enum
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
147
diff
changeset
|
145 D_Queue |
| 86 | 146 }; |
| 147 | |
| 148 struct Context { | |
| 149 enum Code next; | |
| 150 int codeNum; | |
| 151 __code (**code) (struct Context*); | |
| 152 void* heapStart; | |
| 153 void* heap; | |
| 154 long heapLimit; | |
| 155 pthread_t thread; | |
| 92 | 156 int thread_num; |
| 87 | 157 int dataNum; |
| 86 | 158 union Data **data; |
| 159 }; | |
| 160 | |
| 161 union Data { | |
| 133 | 162 struct Meta { |
| 163 enum DataType type; | |
| 164 } meta; | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
165 struct Time { |
| 102 | 166 enum Code next; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
167 double time; |
| 149 | 168 } Time; |
| 86 | 169 struct LoopCounter { |
| 170 int i; | |
| 166 | 171 struct Tree* tree; |
| 86 | 172 } loopCounter; |
| 173 struct Worker { | |
| 174 int num; | |
| 175 struct Context* contexts; | |
| 176 } worker; | |
| 101 | 177 #ifdef USE_CUDA |
| 98 | 178 struct CudaTask { |
| 179 CUdevice device; | |
| 180 CUcontext cuCtx; | |
| 181 CUfunction code; | |
| 182 CUdeviceptr* deviceptr; | |
| 183 CUstream stream; | |
| 184 } cudatask; | |
| 101 | 185 #endif |
| 90 | 186 struct Task { |
| 187 enum Code code; | |
| 188 int key; | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
106
diff
changeset
|
189 struct Queue* waitMe; |
|
114
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
190 struct Queue* waitI; |
| 112 | 191 int idsCount; |
| 166 | 192 } Task; |
|
169
ea7b11f3e717
Using Queue Interface
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
168
diff
changeset
|
193 // Queue Interface |
| 90 | 194 struct Queue { |
| 136 | 195 union Data* queue; |
| 167 | 196 union Data* data; |
| 197 enum Code whenEmpty; | |
| 198 enum Code clear; | |
| 199 enum Code put; | |
| 200 enum Code take; | |
| 201 enum Code isEmpty; | |
| 130 | 202 enum Code next; |
| 166 | 203 } Queue; |
| 167 | 204 struct SingleLinkedQueue { |
| 205 struct Element* top; | |
| 206 struct Element* last; | |
| 207 enum Code next; | |
| 208 } SingleLinkedQueue; | |
| 132 | 209 // Stack Interface |
| 130 | 210 struct Stack { |
| 132 | 211 union Data* stack; |
| 130 | 212 union Data* data; |
| 133 | 213 union Data* data1; |
|
169
ea7b11f3e717
Using Queue Interface
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
168
diff
changeset
|
214 enum Code whenEmpty; |
|
145
cc071cf1ba85
add stack clear interface
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
144
diff
changeset
|
215 enum Code clear; |
| 130 | 216 enum Code push; |
| 217 enum Code pop; | |
| 133 | 218 enum Code pop2; |
| 130 | 219 enum Code isEmpty; |
|
134
2eccf4564efe
fix stack call in rb_tree
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
133
diff
changeset
|
220 enum Code get; |
| 133 | 221 enum Code get2; |
| 130 | 222 enum Code next; |
|
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
223 } stack; |
| 132 | 224 // Stack implementations |
| 225 struct SingleLinkedStack { | |
| 226 struct Element* top; | |
| 135 | 227 } singleLinkedStack; |
| 132 | 228 struct ArrayStack { |
| 229 int size; | |
| 230 int limit; | |
| 231 struct Element* array; | |
| 232 } arrayStack; | |
| 233 // Stack implementation end | |
| 90 | 234 struct Element { |
|
114
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
235 union Data* data; |
| 90 | 236 struct Element* next; |
| 237 } element; | |
| 86 | 238 struct Array { |
| 90 | 239 int index; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
240 int prefix; |
| 86 | 241 int* array; |
| 242 } array; | |
| 243 struct Tree { | |
| 166 | 244 union Data* tree; |
| 245 struct Node* node; | |
| 150 | 246 enum Code put; |
| 247 enum Code get; | |
| 248 enum Code remove; | |
| 171 | 249 enum Code clear; |
| 150 | 250 enum Code next; |
| 166 | 251 } Tree; |
| 172 | 252 struct RedBlackTree { |
| 150 | 253 struct Node* root; |
| 122 | 254 struct Node* current; // reading node of original tree |
| 138 | 255 struct Node* previous; // parent of reading node of original tree |
| 124 | 256 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
|
257 struct Node* parent; |
|
34a7a21edc36
recude stack get using traverse field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
138
diff
changeset
|
258 struct Node* grandparent; |
| 132 | 259 struct Stack* nodeStack; |
| 86 | 260 int result; |
| 172 | 261 } RedBlackTree; |
| 147 | 262 struct RotateTree { |
| 263 enum Code next; | |
| 172 | 264 struct RedBlackTree* traverse; |
| 147 | 265 struct Tree* tree; |
| 266 } rotateTree; | |
| 86 | 267 struct Node { |
| 268 int key; // comparable data segment | |
| 90 | 269 union Data* value; |
| 86 | 270 struct Node* left; |
| 271 struct Node* right; | |
| 272 // need to balancing | |
| 273 enum Color { | |
| 274 Red, | |
| 275 Black, | |
| 276 } color; | |
| 277 } node; | |
| 278 struct Allocate { | |
| 279 enum Code next; | |
| 280 long size; | |
| 281 } allocate; | |
| 112 | 282 struct OutPutDataSegments { |
| 283 union Data **data; | |
| 284 } ods; | |
| 86 | 285 }; |
|
114
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
286 |
| 147 | 287 // typedef struct RotateTree D_RotateTree; |
| 149 | 288 typedef struct Time Time; |
|
151
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
289 typedef struct LoopCounter LoopCounter; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
290 typedef struct Worker Worker; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
291 typedef struct CudaTask CudaTask; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
292 typedef struct Task Task; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
293 typedef struct Queue Queue; |
| 167 | 294 typedef struct SingleLinkedQueue SingleLinkedQueue; |
| 171 | 295 typedef struct SynchronizedQueue SynchronizedQueue; |
|
151
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
296 typedef struct Stack Stack; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
297 typedef struct SingleLinkedStack SingleLinkedStack; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
298 typedef struct ArrayStack ArrayStack; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
299 typedef struct Element Element; |
|
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
300 typedef struct Array Array; |
| 171 | 301 typedef struct RedBlackTree RedBlackTree; |
|
151
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
302 typedef struct Tree Tree; |
| 152 | 303 typedef struct RotateTree RotateTree; |
| 304 typedef struct Node Node; | |
| 305 typedef struct Allocate Allocate; | |
|
151
8c687b8fabf2
Add typedef to define Code Gear
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
149
diff
changeset
|
306 typedef struct OutputDataSegments OutputDataSegments; |
| 147 | 307 |
|
114
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
308 union MetaData { |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
309 struct Queue waitMeTasks; |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
310 struct Queue waitI; |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
311 }; |
| 132 | 312 #endif |