| /src/crypto/external/apache2/openssl/dist/test/ |
| run_tests.pl | 86 sub reorder { subroutine
343 sort { reorder($a) cmp reorder($b) } keys %tests);
|
| /src/crypto/external/bsd/openssl/dist/test/ |
| run_tests.pl | 81 sub reorder { subroutine
316 sort { reorder($a) cmp reorder($b) } keys %tests);
|
| /src/sys/external/bsd/drm/dist/shared-core/ |
| savage_state.c | 280 unsigned char reorder = 0; local
298 reorder = 1;
335 if (reorder) {
374 if (reorder) {
375 /* Need to reorder indices for correct flat
422 unsigned char reorder = 0; local
436 reorder = 1;
494 if (reorder) {
495 /* Need to reorder vertices for correct flat
541 unsigned char reorder = 0 local
684 unsigned char reorder = 0; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/savage/ |
| savage_state.c | 294 unsigned char reorder = 0; local
312 reorder = 1;
349 if (reorder) {
388 if (reorder) {
389 /* Need to reorder indices for correct flat
392 int reorder[3] = { -1, -1, -1 }; local
393 reorder[start % 3] = 2;
399 BCI_WRITE((i + reorder[i % 3]) |
401 reorder[(i + 1) % 3]) << 16));
403 BCI_WRITE(i + reorder[i % 3])
436 unsigned char reorder = 0; local
512 int reorder[3] = { -1, -1, -1 }; local
555 unsigned char reorder = 0; local
654 int reorder[3] = { 2, -1, -1 }; local
698 unsigned char reorder = 0; local
775 int reorder[3] = { 2, -1, -1 }; local
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| LoadStoreVectorizer.cpp | 143 /// After vectorization, reorder the instructions that I depends on
145 void reorder(Instruction *I);
551 void Vectorizer::reorder(Instruction *I) { function in class:Vectorizer
1281 // constant. In that case, no need to reorder anything.
1283 reorder(BitcastInst);
1301 reorder(BitcastInst);
|
| SLPVectorizer.cpp | 1390 void reorder() { function in class:llvm::slpvectorizer::BoUpSLP::VLOperands
1447 // We keep the original operand order for the FirstLane, so reorder the
1604 /// Reorder commutative or alt operands to get better probability of
1757 /// Update operations state of this entry if reorder occurred.
2981 // Need to reorder.
3372 // Reorder operands if reordering would enable vectorization.
4634 // Reorder the operands in place.
4635 Ops.reorder();
6574 // TODO: reorder tree nodes without tree rebuilding.
6869 // TODO: reorder tree nodes without tree rebuilding
[all...] |
| /src/lib/libc/net/ |
| getaddrinfo.c | 264 static int reorder(struct addrinfo *, struct servent_data *);
664 * and the given name is not numeric, reorder the
679 (void)reorder(&sentinel, &svd);
702 reorder(struct addrinfo *sentinel, struct servent_data *svd) function
742 /* reorder the addrinfo chain. */
|
| /src/external/mit/isl/dist/ |
| isl_polynomial.c | 1574 static __isl_give isl_poly *reorder(__isl_take isl_poly *poly, int *r) function
1595 res = reorder(isl_poly_copy(rec->p[rec->n - 1]), r);
1599 res = isl_poly_sum(res, reorder(isl_poly_copy(rec->p[i]), r));
1732 qp->poly = reorder(qp->poly, reordering);
2564 qp->poly = reorder(qp->poly, reordering);
2978 qp->poly = reorder(qp->poly, reordering);
3603 poly = reorder(poly, reordering);
4668 /* Reorder the dimension of "qp" according to the given reordering.
4689 poly = reorder(poly, r->pos);
|
