Lines Matching refs:index
51 #define index(i) SI1(p, i) in GmshLexOrder_SEG() macro
57 lex[index(0)] = node++; in GmshLexOrder_SEG()
58 lex[index(p)] = node++; in GmshLexOrder_SEG()
61 loop1(i) lex[index(i)] = node++; in GmshLexOrder_SEG()
64 #undef index in GmshLexOrder_SEG()
71 #define index(i, j) SI2(p, i, j) in GmshLexOrder_TRI() macro
77 lex[index(0, 0)] = node++; in GmshLexOrder_TRI()
78 lex[index(p, 0)] = node++; in GmshLexOrder_TRI()
79 lex[index(0, p)] = node++; in GmshLexOrder_TRI()
82 loop1(i) lex[index(i, 0)] = node++; in GmshLexOrder_TRI()
83 loop1(j) lex[index(p - j, j)] = node++; in GmshLexOrder_TRI()
84 loop1(j) lex[index(0, p - j)] = node++; in GmshLexOrder_TRI()
88 loop2(j, i) lex[index(i, j)] = *sub++; in GmshLexOrder_TRI()
92 #undef index in GmshLexOrder_TRI()
99 #define index(i, j) BI2(p, i, j) in GmshLexOrder_QUA() macro
105 lex[index(0, 0)] = node++; in GmshLexOrder_QUA()
106 lex[index(p, 0)] = node++; in GmshLexOrder_QUA()
107 lex[index(p, p)] = node++; in GmshLexOrder_QUA()
108 lex[index(0, p)] = node++; in GmshLexOrder_QUA()
111 loop1(i) lex[index(i, 0)] = node++; in GmshLexOrder_QUA()
112 loop1(j) lex[index(p, j)] = node++; in GmshLexOrder_QUA()
113 loop1(i) lex[index(p - i, p)] = node++; in GmshLexOrder_QUA()
114 loop1(j) lex[index(0, p - j)] = node++; in GmshLexOrder_QUA()
117 loop2(j, i) lex[index(i, j)] = *sub++; in GmshLexOrder_QUA()
121 #undef index in GmshLexOrder_QUA()
129 #define index(i, j, k) SI3(p, i, j, k) in GmshLexOrder_TET() macro
135 lex[index(0, 0, 0)] = node++; in GmshLexOrder_TET()
136 lex[index(p, 0, 0)] = node++; in GmshLexOrder_TET()
137 lex[index(0, p, 0)] = node++; in GmshLexOrder_TET()
138 lex[index(0, 0, p)] = node++; in GmshLexOrder_TET()
141 loop1(i) lex[index(i, 0, 0)] = node++; in GmshLexOrder_TET()
142 loop1(j) lex[index(p - j, j, 0)] = node++; in GmshLexOrder_TET()
143 loop1(j) lex[index(0, p - j, 0)] = node++; in GmshLexOrder_TET()
144 loop1(k) lex[index(0, 0, p - k)] = node++; in GmshLexOrder_TET()
145 loop1(j) lex[index(0, j, p - j)] = node++; in GmshLexOrder_TET()
146 loop1(i) lex[index(i, 0, p - i)] = node++; in GmshLexOrder_TET()
150 loop2(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_TET()
152 loop2(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_TET()
154 loop2(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_TET()
156 loop2(j, i) lex[index(i, j, p - i - j)] = *sub++; in GmshLexOrder_TET()
160 loop3(k, j, i) lex[index(i, j, k)] = *sub++; in GmshLexOrder_TET()
165 #undef index in GmshLexOrder_TET()
173 #define index(i, j, k) BI3(p, i, j, k) in GmshLexOrder_HEX() macro
179 lex[index(0, 0, 0)] = node++; in GmshLexOrder_HEX()
180 lex[index(p, 0, 0)] = node++; in GmshLexOrder_HEX()
181 lex[index(p, p, 0)] = node++; in GmshLexOrder_HEX()
182 lex[index(0, p, 0)] = node++; in GmshLexOrder_HEX()
183 lex[index(0, 0, p)] = node++; in GmshLexOrder_HEX()
184 lex[index(p, 0, p)] = node++; in GmshLexOrder_HEX()
185 lex[index(p, p, p)] = node++; in GmshLexOrder_HEX()
186 lex[index(0, p, p)] = node++; in GmshLexOrder_HEX()
189 loop1(i) lex[index(i, 0, 0)] = node++; in GmshLexOrder_HEX()
190 loop1(j) lex[index(0, j, 0)] = node++; in GmshLexOrder_HEX()
191 loop1(k) lex[index(0, 0, k)] = node++; in GmshLexOrder_HEX()
192 loop1(j) lex[index(p, j, 0)] = node++; in GmshLexOrder_HEX()
193 loop1(k) lex[index(p, 0, k)] = node++; in GmshLexOrder_HEX()
194 loop1(i) lex[index(p - i, p, 0)] = node++; in GmshLexOrder_HEX()
195 loop1(k) lex[index(p, p, k)] = node++; in GmshLexOrder_HEX()
196 loop1(k) lex[index(0, p, k)] = node++; in GmshLexOrder_HEX()
197 loop1(i) lex[index(i, 0, p)] = node++; in GmshLexOrder_HEX()
198 loop1(j) lex[index(0, j, p)] = node++; in GmshLexOrder_HEX()
199 loop1(j) lex[index(p, j, p)] = node++; in GmshLexOrder_HEX()
200 loop1(i) lex[index(p - i, p, p)] = node++; in GmshLexOrder_HEX()
203 loop2(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_HEX()
205 loop2(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_HEX()
207 loop2(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_HEX()
209 loop2(k, j) lex[index(p, j, k)] = *sub++; in GmshLexOrder_HEX()
211 loop2(k, i) lex[index(p - i, p, k)] = *sub++; in GmshLexOrder_HEX()
213 loop2(j, i) lex[index(i, j, p)] = *sub++; in GmshLexOrder_HEX()
216 loop3(k, j, i) lex[index(i, j, k)] = *sub++; in GmshLexOrder_HEX()
221 #undef index in GmshLexOrder_HEX()
229 #define index(i, j, k) (SI2(p, i, j) + BI1(p, k) * SN2(p)) in GmshLexOrder_PRI() macro
235 lex[index(0, 0, 0)] = node++; in GmshLexOrder_PRI()
236 lex[index(p, 0, 0)] = node++; in GmshLexOrder_PRI()
237 lex[index(0, p, 0)] = node++; in GmshLexOrder_PRI()
238 lex[index(0, 0, p)] = node++; in GmshLexOrder_PRI()
239 lex[index(p, 0, p)] = node++; in GmshLexOrder_PRI()
240 lex[index(0, p, p)] = node++; in GmshLexOrder_PRI()
243 loop1(i) lex[index(i, 0, 0)] = node++; in GmshLexOrder_PRI()
244 loop1(j) lex[index(0, j, 0)] = node++; in GmshLexOrder_PRI()
245 loop1(k) lex[index(0, 0, k)] = node++; in GmshLexOrder_PRI()
246 loop1(j) lex[index(p - j, j, 0)] = node++; in GmshLexOrder_PRI()
247 loop1(k) lex[index(p, 0, k)] = node++; in GmshLexOrder_PRI()
248 loop1(k) lex[index(0, p, k)] = node++; in GmshLexOrder_PRI()
249 loop1(i) lex[index(i, 0, p)] = node++; in GmshLexOrder_PRI()
250 loop1(j) lex[index(0, j, p)] = node++; in GmshLexOrder_PRI()
251 loop1(j) lex[index(p - j, j, p)] = node++; in GmshLexOrder_PRI()
255 loops(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_PRI()
258 loops(j, i) lex[index(i, j, p)] = *sub++; in GmshLexOrder_PRI()
263 loopb(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_PRI()
266 loopb(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_PRI()
269 loopb(k, j) lex[index(p - j, j, k)] = *sub++; in GmshLexOrder_PRI()
289 loop1(k) lex[index(i, j, k)] = *sub++; in GmshLexOrder_PRI()
296 #undef index in GmshLexOrder_PRI()