Searched refs:lex (Results 1 – 2 of 2) sorted by relevance
41 static inline int GmshLexOrder_VTX(int p, int lex[], int node) in GmshLexOrder_VTX() argument43 lex[0] = node++; in GmshLexOrder_VTX()48 static inline int GmshLexOrder_SEG(int p, int lex[], int node) in GmshLexOrder_SEG() argument54 if (p == 0) lex[0] = node++; in GmshLexOrder_SEG()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()67 static inline int GmshLexOrder_TRI(int p, int lex[], int node) in GmshLexOrder_TRI() argument74 if (p == 0) lex[0] = node++; in GmshLexOrder_TRI()77 lex[index(0, 0)] = node++; in GmshLexOrder_TRI()[all …]
10 int *lex = Gmsh_LexOrder_##T##_##p; \11 if (lex[0] == -1) (void)GmshLexOrder_##T(p, lex, 0); \12 return lex; \18 int *lex = Gmsh_LexOrder_QUA_2_Serendipity; in GmshLexOrder_QUA_2_Serendipity() local19 if (lex[0] == -1) { in GmshLexOrder_QUA_2_Serendipity()21 lex[0] = 0; in GmshLexOrder_QUA_2_Serendipity()22 lex[2] = 1; in GmshLexOrder_QUA_2_Serendipity()23 lex[8] = 2; in GmshLexOrder_QUA_2_Serendipity()24 lex[6] = 3; in GmshLexOrder_QUA_2_Serendipity()26 lex[1] = 4; in GmshLexOrder_QUA_2_Serendipity()[all …]