14 #define SI2(p, i, j)    ((i) + (SN2(p) - SN2((p) - (j))))  argument
15 #define SI3(p, i, j, k) (SI2((p) - (k), i, j) + (SN3(p) - SN3((p) - (k))))  argument
17 #define SL2(p, i, j)    SL1((p) - 1, i) SL1((p) - (i), j)  argument
18 #define SL3(p, i, j, k) SL1((p) - 2, i) SL1((p) - (i), j) SL1((p) - (i) - (j), k)  argument
24 #define BI2(p, i, j)    ((i) + (j) * BN1(p))  argument
25 #define BI3(p, i, j, k) ((i) + BI2(p, j, k) * BN1(p))  argument
27 #define BL2(p, i, j)    BL1(p, i) BL1(p, j)  argument
28 #define BL3(p, i, j, k) BL1(p, i) BL1(p, j) BL1(p, k)  argument
70 #define loop2(i, j) SL2(p, i, j)  in GmshLexOrder_TRI()  argument
71 #define index(i, j) SI2(p, i, j)  in GmshLexOrder_TRI()  argument
72   int i, j, *sub, buf[SN2(GMSH_MAX_ORDER)];  in GmshLexOrder_TRI()  local
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()
98 #define loop2(i, j) BL2(p, i, j)  in GmshLexOrder_QUA()  argument
99 #define index(i, j) BI2(p, i, j)  in GmshLexOrder_QUA()  argument
100   int i, j, *sub, buf[BN2(GMSH_MAX_ORDER)];  in GmshLexOrder_QUA()  local
112   loop1(j) lex[index(p, j)]     = 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()
127 #define loop2(i, j)    SL2(p, i, j)  in GmshLexOrder_TET()  argument
128 #define loop3(i, j, k) SL3(p, i, j, k)  in GmshLexOrder_TET()  argument
129 #define index(i, j, k) SI3(p, i, j, k)  in GmshLexOrder_TET()  argument
130   int i, j, k, *sub, buf[SN3(GMSH_MAX_ORDER)];  in GmshLexOrder_TET()  local
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()
145   loop1(j) lex[index(0, j, p - j)] = node++;  in GmshLexOrder_TET()
150   loop2(i, j) lex[index(i, j, 0)]         = *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()
171 #define loop2(i, j)    BL2(p, i, j)  in GmshLexOrder_HEX()  argument
172 #define loop3(i, j, k) BL3(p, i, j, k)  in GmshLexOrder_HEX()  argument
173 #define index(i, j, k) BI3(p, i, j, k)  in GmshLexOrder_HEX()  argument
174   int i, j, k, *sub, buf[BN3(GMSH_MAX_ORDER)];  in GmshLexOrder_HEX()  local
190   loop1(j) lex[index(0, j, 0)]     = node++;  in GmshLexOrder_HEX()
192   loop1(j) lex[index(p, j, 0)]     = 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()
203   loop2(i, j) lex[index(i, j, 0)]     = *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()
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()
227 #define loops(i, j)    SL2(p, i, j)  in GmshLexOrder_PRI()  argument
228 #define loopb(i, j)    BL2(p, i, j)  in GmshLexOrder_PRI()  argument
229 #define index(i, j, k) (SI2(p, i, j) + BI1(p, k) * SN2(p))  in GmshLexOrder_PRI()  argument
230   int i, j, k, *sub, buf[BN2(GMSH_MAX_ORDER)];  in GmshLexOrder_PRI()  local
244   loop1(j) lex[index(0, j, 0)]     = node++;  in GmshLexOrder_PRI()
246   loop1(j) lex[index(p - j, j, 0)] = 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()
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()
274       int i, j;  in GmshLexOrder_PRI()  member
278     loops(j, i)  in GmshLexOrder_PRI()
281       tmp[l].j = j;  in GmshLexOrder_PRI()
287       j                            = ij[l].j;  in GmshLexOrder_PRI()
289       loop1(k) lex[index(i, j, k)] = *sub++;  in GmshLexOrder_PRI()