Mercurial > hg > Members > innparusu > Gears
annotate src/parallel_execution/context.h @ 115:135472238fb7
Add meta Data Gear allocate
| author | Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Tue, 28 Jun 2016 15:59:24 +0900 |
| parents | d05b9937aa95 |
| children | 69fbd905d750 |
| rev | line source |
|---|---|
| 86 | 1 /* Context definition for llrb example */ |
| 2 #include <pthread.h> | |
| 101 | 3 #ifdef USE_CUDA |
| 98 | 4 #include <cuda.h> |
| 101 | 5 #endif |
| 86 | 6 #include "stack.h" |
| 7 | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
8 #define ALLOCATE_SIZE 20000000 |
| 101 | 9 #define NEW(type) (type*)(calloc(1, sizeof(type))) |
| 10 #define NEWN(n, type) (type*)(calloc(n, sizeof(type))) | |
| 11 | |
| 12 #define ALLOC_DATA(context, dseg) ({ context->data[dseg] = context->heap; context->heap += sizeof(struct dseg); (struct dseg *)context->data[dseg]; }) | |
| 13 | |
| 14 #define ALLOC_DATA_TYPE(context, dseg, type) ({ context->data[dseg] = context->heap; context->heap += sizeof(struct type); (struct type *)context->data[dseg]; }) | |
| 86 | 15 |
| 16 enum Code { | |
| 17 Code1, | |
| 18 Code2, | |
| 19 Code3, | |
| 20 Code4, | |
| 21 Code5, | |
| 22 Find, | |
| 23 Not_find, | |
| 24 Code6, | |
| 25 Allocator, | |
| 90 | 26 PutTree, |
| 86 | 27 Replace, |
| 28 Insert, | |
| 29 Compare, | |
| 30 RotateL, | |
| 31 RotateR, | |
| 32 SetTree, | |
| 33 InsertCase1, | |
| 34 InsertCase2, | |
| 35 InsertCase3, | |
| 36 InsertCase4, | |
| 37 InsertCase4_1, | |
| 38 InsertCase4_2, | |
| 39 InsertCase5, | |
| 40 StackClear, | |
| 41 Get, | |
| 42 Search, | |
| 43 Delete, | |
| 44 Delete1, | |
| 45 Delete2, | |
| 46 Delete3, | |
| 47 Replace_d1, | |
| 48 Replace_d2, | |
| 49 FindMax1, | |
| 50 FindMax2, | |
| 51 DeleteCase1, | |
| 52 DeleteCase2, | |
| 53 DeleteCase3, | |
| 54 DeleteCase4, | |
| 55 DeleteCase5, | |
| 56 DeleteCase6, | |
| 57 CreateWorker, | |
| 58 TaskManager, | |
| 90 | 59 CreateData1, |
| 60 CreateData2, | |
| 61 CreateTask1, | |
| 62 CreateTask2, | |
| 63 PutQueue1, | |
| 64 PutQueue2, | |
| 65 PutQueue3, | |
| 66 PutQueue4, | |
| 91 | 67 GetQueue, |
| 112 | 68 SpawnTask, |
| 92 | 69 Twice, |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
70 StartTime, |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
71 EndTime, |
| 86 | 72 Exit, |
| 73 }; | |
| 74 | |
| 75 enum Relational { | |
| 76 EQ, | |
| 77 GT, | |
| 78 LT, | |
| 79 }; | |
| 80 | |
| 81 enum UniqueData { | |
| 82 Worker, | |
| 83 Allocate, | |
| 84 Tree, | |
| 91 | 85 Traverse, |
| 86 | 86 Node, |
| 87 LoopCounter, | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
88 Time, |
| 90 | 89 Element, |
| 87 | 90 ActiveQueue, |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
104
diff
changeset
|
91 WaitQueue, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
104
diff
changeset
|
92 Queue, |
| 86 | 93 }; |
| 94 | |
| 95 struct Context { | |
| 96 enum Code next; | |
| 97 int codeNum; | |
| 98 __code (**code) (struct Context*); | |
| 99 void* heapStart; | |
| 100 void* heap; | |
| 101 long heapLimit; | |
| 102 pthread_t thread; | |
| 92 | 103 int thread_num; |
| 86 | 104 stack_ptr code_stack; |
| 105 stack_ptr node_stack; | |
| 87 | 106 int dataNum; |
|
115
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
107 int metaDataNum; |
| 86 | 108 union Data **data; |
|
115
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
109 union MetaData **mData; |
| 86 | 110 }; |
| 111 | |
| 112 union Data { | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
113 struct Time { |
| 102 | 114 enum Code next; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
115 double time; |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
116 } time; |
| 86 | 117 struct LoopCounter { |
| 118 int i; | |
| 119 } loopCounter; | |
| 120 struct Worker { | |
| 121 int num; | |
| 122 struct Context* contexts; | |
| 123 } worker; | |
| 101 | 124 #ifdef USE_CUDA |
| 98 | 125 struct CudaTask { |
| 126 CUdevice device; | |
| 127 CUcontext cuCtx; | |
| 128 CUfunction code; | |
| 129 CUdeviceptr* deviceptr; | |
| 130 CUstream stream; | |
| 131 } cudatask; | |
| 101 | 132 #endif |
| 90 | 133 struct Task { |
| 134 enum Code code; | |
| 135 int key; | |
| 112 | 136 int idsCount; |
| 90 | 137 } task; |
| 138 struct Queue { | |
| 139 struct Element* first; | |
| 140 struct Element* last; | |
| 141 int count; | |
| 142 } queue; | |
| 143 struct Element { | |
|
113
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
144 union Data* data; |
| 90 | 145 struct Element* next; |
| 146 } element; | |
| 86 | 147 struct Array { |
| 90 | 148 int index; |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
149 int prefix; |
| 86 | 150 int* array; |
| 151 } array; | |
| 152 struct Tree { | |
| 153 struct Node* root; | |
| 91 | 154 } tree; |
| 155 struct Traverse { | |
| 103 | 156 enum Code next; |
| 86 | 157 struct Node* current; |
| 158 int result; | |
| 91 | 159 } traverse; |
| 86 | 160 struct Node { |
| 161 // need to tree | |
| 162 enum Code next; | |
| 163 int key; // comparable data segment | |
| 90 | 164 union Data* value; |
| 86 | 165 struct Node* left; |
| 166 struct Node* right; | |
| 167 // need to balancing | |
| 168 enum Color { | |
| 169 Red, | |
| 170 Black, | |
| 171 } color; | |
| 172 } node; | |
| 173 struct Allocate { | |
| 174 enum Code next; | |
| 175 long size; | |
| 176 } allocate; | |
|
115
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
177 struct Integer { |
|
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
178 int value; |
|
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
179 int mDataOffset; |
|
135472238fb7
Add meta Data Gear allocate
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
113
diff
changeset
|
180 } integer; |
| 86 | 181 }; |
|
113
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
182 |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
183 union MetaData { |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
184 struct Queue waitMeTasks; |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
185 }; |
|
d05b9937aa95
Change element data from Task to Data
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
112
diff
changeset
|
186 |