Lines Matching refs:node
41 static inline int GmshLexOrder_VTX(int p, int lex[], int node) in GmshLexOrder_VTX() argument
43 lex[0] = node++; in GmshLexOrder_VTX()
45 return node; in GmshLexOrder_VTX()
48 static inline int GmshLexOrder_SEG(int p, int lex[], int node) in GmshLexOrder_SEG() argument
54 if (p == 0) lex[0] = node++; in GmshLexOrder_SEG()
55 if (p == 0) return node; in GmshLexOrder_SEG()
57 lex[index(0)] = node++; in GmshLexOrder_SEG()
58 lex[index(p)] = node++; in GmshLexOrder_SEG()
59 if (p == 1) return node; in GmshLexOrder_SEG()
61 loop1(i) lex[index(i)] = node++; in GmshLexOrder_SEG()
62 return node; in GmshLexOrder_SEG()
67 static inline int GmshLexOrder_TRI(int p, int lex[], int node) in GmshLexOrder_TRI() argument
74 if (p == 0) lex[0] = node++; in GmshLexOrder_TRI()
75 if (p == 0) return node; in GmshLexOrder_TRI()
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()
80 if (p == 1) return 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()
85 if (p == 2) return node; in GmshLexOrder_TRI()
87 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TRI()
89 return node; in GmshLexOrder_TRI()
95 static inline int GmshLexOrder_QUA(int p, int lex[], int node) in GmshLexOrder_QUA() argument
102 if (p == 0) lex[0] = node++; in GmshLexOrder_QUA()
103 if (p == 0) return node; in GmshLexOrder_QUA()
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()
109 if (p == 1) return 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()
116 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_QUA()
118 return node; in GmshLexOrder_QUA()
124 static inline int GmshLexOrder_TET(int p, int lex[], int node) in GmshLexOrder_TET() argument
132 if (p == 0) lex[0] = node++; in GmshLexOrder_TET()
133 if (p == 0) return node; in GmshLexOrder_TET()
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()
139 if (p == 1) return 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()
147 if (p == 2) return node; in GmshLexOrder_TET()
149 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
151 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
153 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
155 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
157 if (p == 3) return node; in GmshLexOrder_TET()
159 node = GmshLexOrder_TET(p - 4, sub = buf, node); in GmshLexOrder_TET()
161 return node; in GmshLexOrder_TET()
168 static inline int GmshLexOrder_HEX(int p, int lex[], int node) in GmshLexOrder_HEX() argument
176 if (p == 0) lex[0] = node++; in GmshLexOrder_HEX()
177 if (p == 0) return node; in GmshLexOrder_HEX()
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()
187 if (p == 1) return 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()
202 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
204 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
206 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
208 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
210 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
212 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
215 node = GmshLexOrder_HEX(p - 2, sub = buf, node); in GmshLexOrder_HEX()
217 return node; in GmshLexOrder_HEX()
224 static inline int GmshLexOrder_PRI(int p, int lex[], int node) in GmshLexOrder_PRI() argument
232 if (p == 0) lex[0] = node++; in GmshLexOrder_PRI()
233 if (p == 0) return node; in GmshLexOrder_PRI()
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()
241 if (p == 1) return 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()
254 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_PRI()
257 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_PRI()
262 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
265 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
268 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
288 node = GmshLexOrder_SEG(p - 2, sub = buf, node); in GmshLexOrder_PRI()
292 return node; in GmshLexOrder_PRI()
299 static inline int GmshLexOrder_PYR(int p, int lex[], int node) in GmshLexOrder_PYR() argument
302 for (i = 0; i < m; ++i) lex[i] = node++; /* TODO */ in GmshLexOrder_PYR()
303 return node; in GmshLexOrder_PYR()