Remove mjData.qLDiagSqrtInv, add corresponding argument to mj_solveM2.
- `qLDiagSqrtInv` is only required for the dual solvers. It is now computed as-needed rather than unconditionally. - `mj_solveM2` now requires a new input array `sqrtInvD` which contains the square root of the inverse diagonal D (formerly saved in `qLDiagSqrtInv`). PiperOrigin-RevId: 710805133 Change-Id: I0622d6a8da3882916824e9c10bad9223c122c321
This commit is contained in:
committed by
Copybara-Service
parent
ec322641b7
commit
69c9ac074a
@@ -1087,7 +1087,6 @@ void mj_mulM_island(const mjModel* m, const mjData* d, mjtNum* res, const mjtNum
|
||||
void mj_mulM2(const mjModel* m, const mjData* d, mjtNum* res, const mjtNum* vec) {
|
||||
int nv = m->nv;
|
||||
const mjtNum* qLD = d->qLD;
|
||||
const mjtNum* qLDiagSqrtInv = d->qLDiagSqrtInv;
|
||||
const int* dofMadr = m->dof_Madr;
|
||||
|
||||
mju_zero(res, nv);
|
||||
@@ -1117,9 +1116,9 @@ void mj_mulM2(const mjModel* m, const mjData* d, mjtNum* res, const mjtNum* vec)
|
||||
}
|
||||
}
|
||||
|
||||
// res = sqrt(D) * res
|
||||
// res *= sqrt(D)
|
||||
for (int i=0; i < nv; i++) {
|
||||
res[i] /= qLDiagSqrtInv[i];
|
||||
res[i] *= mju_sqrt(qLD[dofMadr[i]]);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user