Lines Matching refs:sub
72 int i, j, *sub, buf[SN2(GMSH_MAX_ORDER)]; in GmshLexOrder_TRI() local
87 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TRI()
88 loop2(j, i) lex[index(i, j)] = *sub++; in GmshLexOrder_TRI()
100 int i, j, *sub, buf[BN2(GMSH_MAX_ORDER)]; in GmshLexOrder_QUA() local
116 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_QUA()
117 loop2(j, i) lex[index(i, j)] = *sub++; in GmshLexOrder_QUA()
130 int i, j, k, *sub, buf[SN3(GMSH_MAX_ORDER)]; in GmshLexOrder_TET() local
149 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
150 loop2(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_TET()
151 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
152 loop2(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_TET()
153 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
154 loop2(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_TET()
155 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_TET()
156 loop2(j, i) lex[index(i, j, p - i - j)] = *sub++; in GmshLexOrder_TET()
159 node = GmshLexOrder_TET(p - 4, sub = buf, node); in GmshLexOrder_TET()
160 loop3(k, j, i) lex[index(i, j, k)] = *sub++; in GmshLexOrder_TET()
174 int i, j, k, *sub, buf[BN3(GMSH_MAX_ORDER)]; in GmshLexOrder_HEX() local
202 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
203 loop2(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_HEX()
204 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
205 loop2(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_HEX()
206 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
207 loop2(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_HEX()
208 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
209 loop2(k, j) lex[index(p, j, k)] = *sub++; in GmshLexOrder_HEX()
210 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
211 loop2(k, i) lex[index(p - i, p, k)] = *sub++; in GmshLexOrder_HEX()
212 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_HEX()
213 loop2(j, i) lex[index(i, j, p)] = *sub++; in GmshLexOrder_HEX()
215 node = GmshLexOrder_HEX(p - 2, sub = buf, node); in GmshLexOrder_HEX()
216 loop3(k, j, i) lex[index(i, j, k)] = *sub++; in GmshLexOrder_HEX()
230 int i, j, k, *sub, buf[BN2(GMSH_MAX_ORDER)]; in GmshLexOrder_PRI() local
254 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_PRI()
255 loops(i, j) lex[index(i, j, 0)] = *sub++; in GmshLexOrder_PRI()
257 node = GmshLexOrder_TRI(p - 3, sub = buf, node); in GmshLexOrder_PRI()
258 loops(j, i) lex[index(i, j, p)] = *sub++; in GmshLexOrder_PRI()
262 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
263 loopb(k, i) lex[index(i, 0, k)] = *sub++; in GmshLexOrder_PRI()
265 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
266 loopb(j, k) lex[index(0, j, k)] = *sub++; in GmshLexOrder_PRI()
268 node = GmshLexOrder_QUA(p - 2, sub = buf, node); in GmshLexOrder_PRI()
269 loopb(k, j) lex[index(p - j, j, k)] = *sub++; in GmshLexOrder_PRI()
277 int m = GmshLexOrder_TRI(p - 3, sub = buf, 0), l = 0; in GmshLexOrder_PRI()
284 for (l = 0; l < m; ++l) ij[sub[l]] = tmp[l]; in GmshLexOrder_PRI()
288 node = GmshLexOrder_SEG(p - 2, sub = buf, node); in GmshLexOrder_PRI()
289 loop1(k) lex[index(i, j, k)] = *sub++; in GmshLexOrder_PRI()