Home | History | Annotate | Download | only in mllite

Lines Matching refs:kk

197     uint_fast8_t kk;
200 for (kk = 0; kk < len; ++kk) {
202 && (fifo_obj.reference_count[kk + refOffset] > 0)) {
203 fifo_obj.reference_count[kk + refOffset]--;
208 for (kk = 0; kk < len; ++kk) {
210 fifo_obj.reference_count[kk + refOffset]++;
215 for (kk = 0; kk < len; ++kk) {
216 if (fifo_obj.reference_count[kk + refOffset] > 0)
217 elements |= (1 << kk);
233 int_fast8_t kk;
245 for (kk = 0; kk < 3; ++kk) {
247 regs[kk + 1] = DINAA0 + 3;
425 int kk;
431 for (kk = (INV_MAX_NUM_ACCEL_SAMPLES - (fifoRate + 1));
432 kk < INV_MAX_NUM_ACCEL_SAMPLES; kk++) {
443 value.u32 = fifo_obj.decoded[REF_QUANT_ACCEL + kk];
449 fifo_obj.decoded_accel[kk][2] = temp.s10 * 64;
454 fifo_obj.decoded_accel[kk][1] = temp.s10 * 64;
458 fifo_obj.decoded_accel[kk
599 int kk;
641 for (kk = 0; kk < ACCEL_NUM_AXES; ++kk) {
642 fifo_obj.decoded[REF_RAW + 4 + kk] =
643 inv_q30_mult((data[kk] << 16),
644 fifo_scale[REF_RAW + 4 + kk]);
645 fifo_obj.decoded[REF_ACCEL + kk] =
646 inv_q30_mult((data[kk] << 15), fifo_scale[REF_ACCEL + kk]);
647 fifo_obj.decoded[REF_ACCEL + kk] -=
648 inv_obj.scaled_accel_bias[kk];
733 int N, kk;
743 for (kk = 0; kk < N; ++kk) {
744 p[fifo_obj.offsets[kk]] = *dmpData++;
749 for (kk = 0; kk < REF_LAST; ++kk) {
750 fifo_obj.decoded[kk] =
751 inv_q30_mult(fifo_obj.decoded[kk], fifo_scale[kk]);
841 int ii, kk;
849 for (kk = 0; kk < ACCEL_NUM_AXES; kk++) {
850 data[ii * ACCEL_NUM_AXES + kk] = fifo_obj.decoded_accel[ii][kk];
995 int kk;
1007 for (kk = 0; kk < ACCEL_NUM_AXES; kk++) {
1008 fifo_scale[REF_ACCEL + kk] = 2 * inv_obj.accel_sens;
1027 int_fast8_t kk;
1043 for (kk = 0; kk < 4; ++kk) {
1045 regs[kk + 1] = DINAA0 + 3;
1258 uint_fast16_t elements, kk;
1273 for (kk = 0; kk < 4; ++kk) {
1275 regs[kk + 1] = DINAA0 + 3;
1501 int_fast8_t kk;
1515 for (kk = 0; kk < INV_MAX_NUM_ACCEL_SAMPLES; ++kk) {
1516 fifo_obj.decoded[REF_QUANT_ACCEL + kk] = 0;
1518 fifo_obj.decoded_accel[kk][ii] = 0;
1522 for (kk = 0; kk < 4; ++kk) {
1524 regs[kk + 1] = DINAA0 + 3;
1534 for (kk = 0; kk < 4; ++kk) {
1536 regs2[kk] = DINAA0 + 3;
1552 int_fast8_t kk;
1568 for (kk = 0; kk < 3; ++kk) {
1570 regs[kk] = DINAA0 + 7;
1588 int kk;
1601 for (kk = 0; kk < ACCEL_NUM_AXES; ++kk) {
1602 data[kk] = fifo_obj.decoded[REF_ACCEL + kk];
1618 int kk;
1626 for (kk = 0; kk < 4; ++kk) {
1627 data[kk] = fifo_obj.decoded[REF_QUATERNION + kk];
1642 int kk;
1649 for (kk = 0; kk < 4; ++kk) {
1650 data[kk] = fifo_obj.decoded[REF_QUATERNION_6AXIS + kk];
1676 int kk;
1681 for (kk = 0; kk < 3; ++kk) {
1682 data[kk] = fifo_obj.decoded[REF_GYROS + kk];
1762 int kk;
1784 for (kk = 0; kk < ACCEL_NUM_AXES; ++kk) {
1786 x = la[kk] - grav[kk];
1787 fifo_obj.acc_bias_filt[kk] = (long)(x * fifo_obj.acc_filter_coef +
1788 fifo_obj.acc_bias_filt[kk] *
1791 data[kk] = x - fifo_obj.acc_bias_filt[kk];
1794 for (kk = 0; kk < ACCEL_NUM_AXES; ++kk) {
1795 data[kk] = la[kk] - grav[kk] - fifo_obj.acc_bias_filt[kk];
1810 int kk;
1820 for (kk = 0; kk < 3; ++kk) {
1821 data[kk] = wtemp[kk + 1];
1836 int kk;
1843 for (kk = 0; kk < 4; ++kk) {
1844 data[kk] = fifo_obj.decoded[REF_CONTROL + kk];
1858 int kk;
1865 for (kk = 0; kk < 3; ++kk) {
1866 data[kk] = fifo_obj.decoded[REF_EIS + kk];
1881 int kk;
1893 for (kk = 0; kk < ACCEL_NUM_AXES; ++kk) {
1894 data[kk] = lData[kk] / 65536.0f;
1907 int kk;
1915 for (kk = 0; kk < 4; ++kk) {
1916 data[kk] = fifo_obj.decoded[REF_QUATERNION + kk] / 1073741824.0f;
2079 int kk;
2081 for (kk = 0; kk < 3; ++kk) {
2082 temp = fifo_obj.decoded[REF_GYROS + kk] >>
2099 int kk;
2108 for (kk = 0; kk < 3; ++kk) {
2109 temp = accel[kk] >> (16 - (ACC_MAG_SQR_SHIFT / 2));
2120 int kk;
2121 for (kk = 0; kk < 4; ++kk) {
2122 fifo_obj.decoded[REF_QUATERNION + kk] = (long)(q[kk] * (1L << 30));
2139 int kk, nn;
2147 for (kk = 0; kk < fifo_rate_obj.num_cb; ++kk) {
2148 if ((fifo_rate_obj.fifo_process_cb[kk] == func) ||
2149 (fifo_rate_obj.priority[kk] == priority)) {
2157 kk = 0;
2159 // set kk to be where this new callback goes in the array
2160 while ((kk < fifo_rate_obj.num_cb) &&
2161 (fifo_rate_obj.priority[kk] < priority)) {
2162 kk++;
2164 if (kk != fifo_rate_obj.num_cb) {
2166 for (nn = fifo_rate_obj.num_cb; nn > kk; --nn) {
2174 fifo_rate_obj.fifo_process_cb[kk] = func;
2175 fifo_rate_obj.priority[kk] = priority;
2194 int kk, jj;
2203 for (kk = 0; kk < fifo_rate_obj.num_cb; ++kk) {
2204 if (fifo_rate_obj.fifo_process_cb[kk] == func) {
2205 for (jj = kk + 1; jj < fifo_rate_obj.num_cb; ++jj) {
2236 int kk;
2248 for (kk = 0; kk < fifo_rate_obj.num_cb; ++kk) {
2249 if (fifo_rate_obj.fifo_process_cb[kk]) {
2250 result2 = fifo_rate_obj.fifo_process_cb[kk] (&inv_obj);