comparison src/parallel_execution/context.h @ 144:d529c024e5a5

name fixes
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Thu, 10 Nov 2016 07:33:10 +0900
parents 34a7a21edc36
children cc071cf1ba85
comparison
equal deleted inserted replaced
143:34a7a21edc36 144:d529c024e5a5
33 #define GET_TYPE(dseg) ({ \ 33 #define GET_TYPE(dseg) ({ \
34 struct Meta* meta = (struct Meta*)(((void*)dseg) - sizeof(struct Meta));\ 34 struct Meta* meta = (struct Meta*)(((void*)dseg) - sizeof(struct Meta));\
35 meta->type; }) 35 meta->type; })
36 36
37 enum Code { 37 enum Code {
38 Code1, 38 C_code1,
39 Code2, 39 C_code2,
40 Code3, 40 C_code3,
41 Code4, 41 C_code4,
42 Code5, 42 C_code5,
43 Find, 43 C_find,
44 Not_find, 44 Not_find,
45 Code6, 45 Code6,
46 Allocator, 46 Allocator,
47 PutTree, 47 C_put,
48 Replace, 48 C_replaceNode,
49 Replace1, 49 C_replaceNode1,
50 Insert, 50 C_insertNode,
51 Compare, 51 Compare,
52 RotateL, 52 C_rotateLeft,
53 RotateL1, 53 C_rotateLeft1,
54 RotateR, 54 C_rotateRight,
55 RotateR1, 55 C_rotateRight1,
56 SetTree, 56 SetTree,
57 InsertCase1, 57 C_insertCase1,
58 InsertCase2, 58 C_insertCase2,
59 InsertCase3, 59 C_insertCase3,
60 InsertCase4, 60 C_insertCase4,
61 InsertCase5, 61 C_insertCase5,
62 InsertCase51, 62 C_insertCase51,
63 StackClear, 63 C_stackClear,
64 Get, 64 C_get,
65 Search, 65 C_search,
66 Delete, 66 Delete,
67 Delete1, 67 Delete1,
68 Delete2, 68 Delete2,
69 Delete3, 69 Delete3,
70 Replace_d1, 70 Replace_d1,
88 PutQueue1, 88 PutQueue1,
89 PutQueue2, 89 PutQueue2,
90 PutQueue3, 90 PutQueue3,
91 PutQueue4, 91 PutQueue4,
92 GetQueue, 92 GetQueue,
93 PushSingleLinkedStack, 93 C_pushSingleLinkedStack,
94 PopSingleLinkedStack, 94 C_popSingleLinkedStack,
95 Pop2SingleLinkedStack, 95 C_pop2SingleLinkedStack,
96 GetSingleLinkedStack, 96 C_getSingleLinkedStack,
97 Get2SingleLinkedStack, 97 C_get2SingleLinkedStack,
98 IsEmptySingleLinkedStack, 98 C_isEmptySingleLinkedStack,
99 SpawnTask, 99 SpawnTask,
100 Twice, 100 Twice,
101 StartTime, 101 StartTime,
102 EndTime, 102 EndTime,
103 Exit, 103 Exit,