50 #define loop1(i) SL1(p, i)  in GmshLexOrder_SEG()  macro
61   loop1(i) lex[index(i)] = node++;  in GmshLexOrder_SEG()
63 #undef loop1  in GmshLexOrder_SEG()
69 #define loop1(i)    SL1(p, i)  in GmshLexOrder_TRI()  macro
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()
90 #undef loop1  in GmshLexOrder_TRI()
97 #define loop1(i)    BL1(p, i)  in GmshLexOrder_QUA()  macro
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()
119 #undef loop1  in GmshLexOrder_QUA()
126 #define loop1(i)       SL1(p, i)  in GmshLexOrder_TET()  macro
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()
162 #undef loop1  in GmshLexOrder_TET()
170 #define loop1(i)       BL1(p, i)  in GmshLexOrder_HEX()  macro
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()
218 #undef loop1  in GmshLexOrder_HEX()
226 #define loop1(i)       BL1(p, i)  in GmshLexOrder_PRI()  macro
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()
289       loop1(k) lex[index(i, j, k)] = *sub++;  in GmshLexOrder_PRI()
293 #undef loop1  in GmshLexOrder_PRI()