-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmake_binary_op.h
More file actions
130 lines (130 loc) · 3.01 KB
/
make_binary_op.h
File metadata and controls
130 lines (130 loc) · 3.01 KB
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
#define BINARY_OPERATOR(base_name, oper)\
\
case S_S_##base_name: {\
d_stack[p_d-2] = d_stack[p_d-2] oper d_stack[p_d-1];\
p_d--;\
break;\
}\
case S_AS_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k] = d_stack[p_d-1] oper b[k];\
}\
p_d--;\
break;\
}\
case S_V_##base_name: {\
double tmp = d_stack[p_d-4];\
d_stack[p_d-4] = tmp oper d_stack[p_d-3];\
d_stack[p_d-3] = tmp oper d_stack[p_d-2];\
d_stack[p_d-2] = tmp oper d_stack[p_d-1];\
p_d--;\
break;\
}\
case S_AV_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = d_stack[p_d-1] oper b[k*3 ];\
res[k*3+1] = d_stack[p_d-1] oper b[k*3+1];\
res[k*3+2] = d_stack[p_d-1] oper b[k*3+2];\
}\
p_d--;\
break;\
}\
\
case AS_S_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k] = a[k] oper d_stack[p_d-1];\
}\
p_d--;\
break;\
}\
case AS_AS_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k] = a[k] oper b[k];\
}\
break;\
}\
case AS_V_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k] oper d_stack[p_d-3];\
res[k*3+1] = a[k] oper d_stack[p_d-2];\
res[k*3+2] = a[k] oper d_stack[p_d-1];\
}\
p_d -= 3;\
break;\
}\
case AS_AV_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k] oper b[3*k ];\
res[k*3+1] = a[k] oper b[3*k+1];\
res[k*3+2] = a[k] oper b[3*k+2];\
}\
break;\
}\
\
case V_S_##base_name: {\
d_stack[p_d-4] = d_stack[p_d-4] oper d_stack[p_d-1];\
d_stack[p_d-3] = d_stack[p_d-3] oper d_stack[p_d-1];\
d_stack[p_d-2] = d_stack[p_d-2] oper d_stack[p_d-1];\
p_d--;\
break;\
}\
case V_AS_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = d_stack[p_d-3] oper b[k];\
res[k*3+1] = d_stack[p_d-2] oper b[k];\
res[k*3+2] = d_stack[p_d-1] oper b[k];\
}\
p_d -= 3;\
break;\
}\
case V_V_##base_name: {\
d_stack[p_d-6] = d_stack[p_d-6] oper d_stack[p_d-3];\
d_stack[p_d-5] = d_stack[p_d-5] oper d_stack[p_d-2];\
d_stack[p_d-4] = d_stack[p_d-4] oper d_stack[p_d-1];\
p_d -= 3;\
break;\
}\
case V_AV_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = d_stack[p_d-3] oper b[k*3 ];\
res[k*3+1] = d_stack[p_d-2] oper b[k*3+1];\
res[k*3+2] = d_stack[p_d-1] oper b[k*3+2];\
}\
p_d -= 3;\
break;\
}\
\
case AV_S_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k*3 ] oper d_stack[p_d-1];\
res[k*3+1] = a[k*3+1] oper d_stack[p_d-1];\
res[k*3+2] = a[k*3+2] oper d_stack[p_d-1];\
}\
p_d--;\
break;\
}\
case AV_AS_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k*3 ] oper b[k];\
res[k*3+1] = a[k*3+1] oper b[k];\
res[k*3+2] = a[k*3+2] oper b[k];\
}\
break;\
}\
case AV_V_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k*3 ] oper d_stack[p_d-3];\
res[k*3+1] = a[k*3+1] oper d_stack[p_d-2];\
res[k*3+2] = a[k*3+2] oper d_stack[p_d-1];\
}\
p_d -= 3;\
break;\
}\
case AV_AV_##base_name: {\
for (k=0; k<chunk; k++) {\
res[k*3 ] = a[k*3 ] oper b[k*3 ];\
res[k*3+1] = a[k*3+1] oper b[k*3+1];\
res[k*3+2] = a[k*3+2] oper b[k*3+2];\
}\
break;\
}