
Add all drivers for new platforms. Change-Id: Ie9947b0c6f8ddfee7dab6dfa80d6aca62323f4da Signed-off-by: Fei Mao <feim1@codeaurora.org>
3845 lines
103 KiB
C
3845 lines
103 KiB
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
/*
|
|
* FTS Capacitive touch screen controller (FingerTipS)
|
|
*
|
|
* Copyright (C) 2016-2019, STMicroelectronics Limited.
|
|
* Authors: AMG(Analog Mems Group) <marco.cali@st.com>
|
|
*
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 as published by
|
|
* the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
|
* more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along with
|
|
* this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
/*
|
|
*
|
|
**************************************************************************
|
|
** STMicroelectronics **
|
|
**************************************************************************
|
|
** marco.cali@st.com **
|
|
**************************************************************************
|
|
* *
|
|
* FTS API for MP test ***
|
|
* *
|
|
**************************************************************************
|
|
**************************************************************************
|
|
*
|
|
*/
|
|
|
|
#include <linux/init.h>
|
|
#include <linux/errno.h>
|
|
#include <linux/platform_device.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/module.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/string.h>
|
|
#include <stdarg.h>
|
|
#include <linux/input.h>
|
|
#include <linux/interrupt.h>
|
|
#include <linux/serio.h>
|
|
#include <linux/time.h>
|
|
#include <linux/pm.h>
|
|
#include <linux/delay.h>
|
|
#include <linux/ctype.h>
|
|
#include <linux/gpio.h>
|
|
#include <linux/i2c.h>
|
|
#include <linux/i2c-dev.h>
|
|
#include <linux/fs.h>
|
|
#include <linux/uaccess.h>
|
|
#include <linux/power_supply.h>
|
|
#include <linux/firmware.h>
|
|
#include <linux/regulator/consumer.h>
|
|
#include <linux/of_gpio.h>
|
|
//#include <linux/sec_sysfs.h>
|
|
|
|
#include "ftsCrossCompile.h"
|
|
#include "ftsCompensation.h"
|
|
#include "ftsError.h"
|
|
#include "ftsFrame.h"
|
|
#include "ftsHardware.h"
|
|
#include "ftsIO.h"
|
|
#include "ftsSoftware.h"
|
|
#include "ftsTest.h"
|
|
#include "ftsTime.h"
|
|
#include "ftsTool.h"
|
|
#include "../fts.h"
|
|
|
|
#ifdef LIMITS_H_FILE
|
|
#include <../fts_limits.h>
|
|
#endif
|
|
|
|
static char tag[8] = "[ FTS ]\0";
|
|
|
|
int computeAdjHoriz(u8 *data, int row, int column, u8 **result)
|
|
{
|
|
int i, j;
|
|
int size = row * (column - 1);
|
|
|
|
if (column < 2) {
|
|
logError(1, "%s %s: ERROR % 02X\n",
|
|
tag, __func__, ERROR_OP_NOT_ALLOW);
|
|
return ERROR_OP_NOT_ALLOW;
|
|
}
|
|
|
|
*result = (u8 *) kmalloc_array(size, sizeof(u8), GFP_KERNEL);
|
|
if (*result == NULL) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
return ERROR_ALLOC;
|
|
}
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 1; j < column; j++) {
|
|
*(*result + (i * (column - 1) + (j - 1))) =
|
|
abs(data[i * column + j] -
|
|
data[i * column + (j - 1)]);
|
|
}
|
|
}
|
|
return OK;
|
|
}
|
|
|
|
int computeAdjHorizTotal(u16 *data, int row, int column, u16 **result)
|
|
{
|
|
int i, j;
|
|
int size = row * (column - 1);
|
|
|
|
if (column < 2) {
|
|
logError(1, "%s %s: ERROR % 02X\n",
|
|
tag, __func__, ERROR_OP_NOT_ALLOW);
|
|
return ERROR_OP_NOT_ALLOW;
|
|
}
|
|
|
|
*result = (u16 *)kmalloc_array(size, sizeof(u16), GFP_KERNEL);
|
|
if (*result == NULL) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
return ERROR_ALLOC;
|
|
}
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 1; j < column; j++) {
|
|
*(*result + (i * (column - 1) + (j - 1))) =
|
|
abs(data[i * column + j] -
|
|
data[i * column + (j - 1)]);
|
|
}
|
|
}
|
|
|
|
return OK;
|
|
}
|
|
|
|
int computeAdjVert(u8 *data, int row, int column, u8 **result)
|
|
{
|
|
int i, j;
|
|
int size = (row - 1) * (column);
|
|
|
|
if (row < 2) {
|
|
logError(1, "%s %s: ERROR % 02X\n",
|
|
tag, __func__, ERROR_OP_NOT_ALLOW);
|
|
return ERROR_OP_NOT_ALLOW;
|
|
}
|
|
|
|
*result = (u8 *)kmalloc_array(size, sizeof(u8), GFP_KERNEL);
|
|
if (*result == NULL) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
return ERROR_ALLOC;
|
|
}
|
|
|
|
for (i = 1; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
*(*result + ((i - 1) * column + j)) =
|
|
abs(data[i * column + j] -
|
|
data[(i - 1) * column + j]);
|
|
}
|
|
}
|
|
|
|
return OK;
|
|
}
|
|
|
|
int computeAdjVertTotal(u16 *data, int row, int column, u16 **result)
|
|
{
|
|
int i, j;
|
|
int size = (row - 1) * (column);
|
|
|
|
if (row < 2) {
|
|
logError(1, "%s %s: ERROR % 02X\n",
|
|
tag, __func__, ERROR_OP_NOT_ALLOW);
|
|
return ERROR_OP_NOT_ALLOW;
|
|
}
|
|
|
|
*result = (u16 *)kmalloc_array(size, sizeof(u16), GFP_KERNEL);
|
|
if (*result == NULL) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
return ERROR_ALLOC;
|
|
}
|
|
|
|
for (i = 1; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
*(*result + ((i - 1) * column + j)) =
|
|
abs(data[i * column + j] -
|
|
data[(i - 1) * column + j]);
|
|
}
|
|
}
|
|
|
|
return OK;
|
|
}
|
|
|
|
int computeTotal(u8 *data, u8 main, int row, int column,
|
|
int m, int n, u16 **result)
|
|
{
|
|
int i, j;
|
|
int size = (row) * (column);
|
|
|
|
*result = (u16 *)kmalloc_array(size, sizeof(u16), GFP_KERNEL);
|
|
if (*result == NULL) {
|
|
logError(1, "%s %s : ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
return ERROR_ALLOC;
|
|
}
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
*(*result + (i * column + j)) =
|
|
m * main + n * data[i * column + j];
|
|
}
|
|
}
|
|
|
|
return OK;
|
|
}
|
|
|
|
int checkLimitsMinMax(short *data, int row, int column, int min, int max)
|
|
{
|
|
int i, j;
|
|
int count = 0;
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] < min
|
|
|| data[i * column + j] > max) {
|
|
logError(1, "%s %s:Node[%d,%d] = %d ", tag,
|
|
__func__, i, j, data[i * column + j]);
|
|
logError(1, "exceed limit [%d,%d]\n", min, max);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
|
|
return count;//if count is 0 = OK, test completed successfully
|
|
}
|
|
|
|
int checkLimitsGap(short *data, int row, int column, int threshold)
|
|
{
|
|
int i, j;
|
|
int min_node;
|
|
int max_node;
|
|
|
|
if (row == 0 || column == 0) {
|
|
logError(1, "%s %s:invalid number of rows = %d ",
|
|
tag, __func__, row);
|
|
logError(1, "or columns = %d %02\n",
|
|
column, ERROR_OP_NOT_ALLOW);
|
|
return ERROR_OP_NOT_ALLOW;
|
|
}
|
|
|
|
min_node = data[0];
|
|
max_node = data[0];
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] < min_node) {
|
|
min_node = data[i * column + j];
|
|
} else {
|
|
if (data[i * column + j] > max_node)
|
|
max_node = data[i * column + j];
|
|
}
|
|
}
|
|
}
|
|
|
|
if (max_node - min_node > threshold) {
|
|
logError(1, "%s %s: GAP = %d exceed limit %d\n",
|
|
tag, __func__, max_node - min_node, threshold);
|
|
return ERROR_TEST_CHECK_FAIL;
|
|
}
|
|
return OK;
|
|
}
|
|
|
|
int checkLimitsMap(u8 *data, int row, int column, int *min, int *max)
|
|
{
|
|
int i, j;
|
|
int count = 0;
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] < min[i * column + j]
|
|
|| data[i * column + j] > max[i * column + j]) {
|
|
logError(1, "%s %s: Node[%d,%d] = %d ",
|
|
tag, __func__,
|
|
i, j,
|
|
data[i * column + j]);
|
|
logError(1, "exceed limit [%d, %d]\n",
|
|
min[i * column + j],
|
|
max[i * column + j]);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
|
|
return count; //if count is 0 = OK, test completed successfully
|
|
}
|
|
|
|
int checkLimitsMapTotal(u16 *data, int row, int column, int *min, int *max)
|
|
{
|
|
int i, j;
|
|
int count = 0;
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] < min[i * column + j]
|
|
|| data[i * column + j] > max[i * column + j]) {
|
|
logError(1, "%s %s:Node[%d,%d] = %d\n",
|
|
tag, __func__, i, j,
|
|
data[i * column + j]);
|
|
logError(1, "exceed limit [%d, %d]\n",
|
|
min[i * column + j],
|
|
max[i * column + j]);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
|
|
return count; //if count is 0 = OK, test completed successfully
|
|
}
|
|
|
|
int checkLimitsMapAdj(u8 *data, int row, int column, int *max)
|
|
{
|
|
int i, j;
|
|
int count = 0;
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] > max[i * column + j]) {
|
|
logError(1, "%s %s:Node[%d,%d] = %d ",
|
|
tag, __func__, i, j);
|
|
logError(1, "exceed limit > %d\n",
|
|
data[i * column + j],
|
|
max[i * column + j]);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
//if count is 0 = OK, test completed successfully
|
|
return count;
|
|
}
|
|
|
|
int checkLimitsMapAdjTotal(u16 *data, int row, int column, int *max)
|
|
{
|
|
int i, j;
|
|
int count = 0;
|
|
|
|
for (i = 0; i < row; i++) {
|
|
for (j = 0; j < column; j++) {
|
|
if (data[i * column + j] > max[i * column + j]) {
|
|
logError(1, "%s %s:Node[%d,%d] = %d ",
|
|
tag, __func__, i, j);
|
|
logError(1, "exceed limit > %d\n",
|
|
data[i * column + j],
|
|
max[i * column + j]);
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
//if count is 0 = OK, test completed successfully
|
|
return count;
|
|
}
|
|
|
|
int production_test_ito(void)
|
|
{
|
|
int res = OK;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
//look for ito event
|
|
int eventToSearch[2] = {EVENTID_ERROR_EVENT, EVENT_TYPE_ITO};
|
|
|
|
logError(0, "%s ITO Production test is starting...\n", tag);
|
|
|
|
res = fts_system_reset();
|
|
if (res < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_ITO);
|
|
return (res | ERROR_PROD_TEST_ITO);
|
|
}
|
|
|
|
cmd = FTS_CMD_ITO_CHECK;
|
|
|
|
logError(0, "%s ITO Check command sent...\n", tag);
|
|
if (fts_writeFwCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, (ERROR_I2C_W | ERROR_PROD_TEST_ITO));
|
|
return (ERROR_I2C_W | ERROR_PROD_TEST_ITO);
|
|
}
|
|
|
|
logError(0, "%s Looking for ITO Event...\n", tag);
|
|
res = pollForEvent(eventToSearch, 2,
|
|
readData, TIMEOUT_ITO_TEST_RESULT);
|
|
if (res < 0) {
|
|
logError(1, "%s %s: ITO Production test failed ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_ITO);
|
|
return (res | ERROR_PROD_TEST_ITO);
|
|
}
|
|
|
|
if (readData[2] != 0x00 || readData[3] != 0x00) {
|
|
logError(0, "%s ITO Production testes finished! ERROR %02X\n",
|
|
tag, (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_ITO));
|
|
res = (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_ITO);
|
|
} else {
|
|
logError(0, "%s ITO Production test finished!..OK\n", tag);
|
|
res = OK;
|
|
}
|
|
|
|
res |= fts_system_reset();
|
|
if (res < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_ITO);
|
|
res = (res | ERROR_PROD_TEST_ITO);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int production_test_initialization(void)
|
|
{
|
|
int res;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
|
|
int eventToSearch[2] = {EVENTID_STATUS_UPDATE,
|
|
EVENT_TYPE_FULL_INITIALIZATION};
|
|
logError(0, "%s INITIALIZATION Production test is starting\n", tag);
|
|
|
|
res = fts_system_reset();
|
|
if (res < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s INITIALIZATION command sent...\n", tag);
|
|
cmd = FTS_CMD_FULL_INITIALIZATION;
|
|
if (fts_writeFwCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n", tag, __func__,
|
|
(ERROR_I2C_W | ERROR_PROD_TEST_INITIALIZATION));
|
|
return (ERROR_I2C_W | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s Looking for INITIALIZATION Event...\n", tag);
|
|
res = pollForEvent(eventToSearch, 2, readData,
|
|
TIMEOUT_INITIALIZATION_TEST_RESULT);
|
|
if (res < 0) {
|
|
logError(1, "%s %s: INITIALIZATION Production ", tag, __func__);
|
|
logError(1, "test failed %02X\n",
|
|
ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
if (readData[2] != 0x00) {
|
|
logError(0, "%sINITIALIZATION Production ", tag);
|
|
logError(0, "testes finished! FAILED %02X\n",
|
|
(ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_INITIALIZATION));
|
|
res = (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_INITIALIZATION);
|
|
} else {
|
|
logError(0, "%s INITIALIZATION Production test...OK\n", tag);
|
|
res = OK;
|
|
}
|
|
|
|
logError(0, "%s Refresh Chip Info...\n", tag);
|
|
//need to update the chipInfo in order to refresh the tuning_versione
|
|
res |= readChipInfo(1);
|
|
|
|
if (res < 0) {
|
|
logError(1, "%s %s: read chip info ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_INITIALIZATION);
|
|
res = (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int ms_compensation_tuning(void)
|
|
{
|
|
int res;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
int eventToSearch[2] = {EVENTID_STATUS_UPDATE,
|
|
EVENT_TYPE_MS_TUNING_CMPL};
|
|
|
|
logError(0, "%s MS INITIALIZATION command sent...\n", tag);
|
|
cmd = FTS_CMD_MS_COMP_TUNING;
|
|
if (fts_writeFwCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s 2: ERROR %02X\n",
|
|
tag, __func__, (ERROR_I2C_W | ERROR_MS_TUNING));
|
|
return (ERROR_I2C_W | ERROR_MS_TUNING);
|
|
}
|
|
|
|
logError(0, "%s Looking for MS INITIALIZATION Event...\n", tag);
|
|
res = pollForEvent(eventToSearch, 2, readData,
|
|
TIMEOUT_INITIALIZATION_TEST_RESULT);
|
|
if (res < 0) {
|
|
logError(1, "%s %s:MS INITIALIZATION Production\n",
|
|
tag, __func__);
|
|
logError(1, "test failed %02X\n", ERROR_MS_TUNING);
|
|
return (res | ERROR_MS_TUNING);
|
|
}
|
|
|
|
if (readData[2] != 0x00 || readData[3] != 0x00) {
|
|
logError(0, "%s MS INITIALIZATION Production ", tag);
|
|
logError(0, "test finished! FAILED %02X\n", ERROR_MS_TUNING);
|
|
res = ERROR_MS_TUNING;
|
|
} else {
|
|
logError(0,
|
|
"%s MS INITIALIZATION Production test finished! OK\n",
|
|
tag);
|
|
res = OK;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int ss_compensation_tuning(void)
|
|
{
|
|
int res;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
|
|
int eventToSearch[2] = {EVENTID_STATUS_UPDATE,
|
|
EVENT_TYPE_SS_TUNING_CMPL};
|
|
|
|
logError(0, "%s SS INITIALIZATION command sent...\n", tag);
|
|
cmd = FTS_CMD_SS_COMP_TUNING;
|
|
if (fts_writeFwCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s 2: ERROR %02X\n",
|
|
tag, __func__, (ERROR_I2C_W | ERROR_SS_TUNING));
|
|
return (ERROR_I2C_W | ERROR_SS_TUNING);
|
|
}
|
|
|
|
logError(0, "%s Looking for SS INITIALIZATION Event...\n", tag);
|
|
res = pollForEvent(eventToSearch,
|
|
2,
|
|
readData,
|
|
TIMEOUT_INITIALIZATION_TEST_RESULT);
|
|
if (res < 0) {
|
|
logError(1, "%s %s:SS INITIALIZATION Production ",
|
|
tag, __func__);
|
|
logError(1, "test failed %02X\n", ERROR_SS_TUNING);
|
|
return (res | ERROR_SS_TUNING);
|
|
}
|
|
logError(0, "%s SS INITIALIZATION Production test finished!", tag);
|
|
if (readData[2] != 0x00 || readData[3] != 0x00) {
|
|
logError(0, "%s.................FAILED ERROR %02X\n",
|
|
tag, ERROR_SS_TUNING);
|
|
res = ERROR_SS_TUNING;
|
|
} else {
|
|
logError(0, "%s.................OK\n", tag);
|
|
res = OK;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int lp_timer_calibration(void)
|
|
{
|
|
int res;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
int eventToSearch[2] = {EVENTID_STATUS_UPDATE,
|
|
EVENT_TYPE_LPTIMER_TUNING_CMPL};
|
|
|
|
logError(0, "%s LP TIMER CALIBRATION command sent...\n", tag);
|
|
cmd = FTS_CMD_LP_TIMER_CALIB;
|
|
if (fts_writeFwCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s 2:ERROR %02X\n", tag, __func__,
|
|
(ERROR_I2C_W | ERROR_LP_TIMER_TUNING));
|
|
return (ERROR_I2C_W | ERROR_LP_TIMER_TUNING);
|
|
}
|
|
|
|
logError(0, "%s Looking for LP TIMER CALIBRATION Event...\n", tag);
|
|
res = pollForEvent(eventToSearch,
|
|
2,
|
|
readData,
|
|
TIMEOUT_INITIALIZATION_TEST_RESULT);
|
|
|
|
if (res < 0) {
|
|
logError(1, "%s:LP TIMER CALIBRATION Production test failed\n",
|
|
tag);
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_LP_TIMER_TUNING);
|
|
return (res | ERROR_LP_TIMER_TUNING);
|
|
}
|
|
|
|
logError(0, "LP TIMER CALIBRATION Production test finished!");
|
|
if (readData[2] != 0x00 || readData[3] != 0x01) {
|
|
logError(0, "%s........FAILED ERROR %02X\n",
|
|
tag, ERROR_LP_TIMER_TUNING);
|
|
res = ERROR_LP_TIMER_TUNING;
|
|
} else {
|
|
logError(0, "%s.................OK\n", tag);
|
|
res = OK;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int save_cx_tuning(void)
|
|
{
|
|
int res;
|
|
u8 cmd;
|
|
u8 readData[FIFO_EVENT_SIZE] = {0};
|
|
int eventToSearch[2] = {EVENTID_STATUS_UPDATE,
|
|
EVENT_TYPE_COMP_DATA_SAVED};
|
|
|
|
logError(0, "%s SAVE CX command sent...\n", tag);
|
|
cmd = FTS_CMD_SAVE_CX_TUNING;
|
|
if (fts_writeCmd(&cmd, 1) < 0) {
|
|
logError(1, "%s %s 2:ERROR %02X\n", tag, __func__,
|
|
(ERROR_I2C_W | ERROR_SAVE_CX_TUNING));
|
|
return (ERROR_I2C_W | ERROR_SAVE_CX_TUNING);
|
|
}
|
|
|
|
logError(0, "%s Looking for SAVE CX Event...\n", tag);
|
|
res = pollForEvent(eventToSearch,
|
|
2,
|
|
readData,
|
|
TIMEOUT_INITIALIZATION_TEST_RESULT);
|
|
if (res < 0) {
|
|
logError(1, "%s %s: SAVE CX failed... ERROR %02X\n",
|
|
tag, ERROR_SAVE_CX_TUNING);
|
|
return (res | ERROR_SAVE_CX_TUNING);
|
|
}
|
|
|
|
if (readData[2] != 0x00 || readData[3] != 0x00) {
|
|
logError(0, "%s SAVE CX finished! FAILED ERROR %02X\n",
|
|
tag, ERROR_SAVE_CX_TUNING);
|
|
res = ERROR_SAVE_CX_TUNING;
|
|
} else {
|
|
logError(0, "%s SAVE CX finished!.................OK\n", tag);
|
|
res = OK;
|
|
}
|
|
|
|
return res;
|
|
}
|
|
|
|
int production_test_split_initialization(int saveToFlash)
|
|
{
|
|
int res;
|
|
|
|
logError(0, "%s Split Initialization test is starting...\n", tag);
|
|
res = fts_system_reset();
|
|
if (res < 0) {
|
|
logError(1, "%s %s: ERROR %02X\n", tag, __func__,
|
|
ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s MS INITIALIZATION TEST:\n", tag);
|
|
res = ms_compensation_tuning();
|
|
if (res < 0) {
|
|
logError(0, "%s %s:MS INITIALIZATION TEST FAILED! ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s MS INITIALIZATION TEST OK!\n", tag);
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SS INITIALIZATION TEST:\n", tag);
|
|
res = ss_compensation_tuning();
|
|
if (res < 0) {
|
|
logError(0, "%s %s: SS INITIALIZATION TEST FAILED! ",
|
|
tag, __func__);
|
|
logError(0, "ERROR %02X\n", ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s SS INITIALIZATION TEST OK!\n", tag);
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s LP INITIALIZATION TEST:\n", tag);
|
|
res = lp_timer_calibration();
|
|
if (res < 0) {
|
|
logError(0, "%s %s: LP INITIALIZATION TEST FAILED! ",
|
|
tag, __func__);
|
|
logError(0, "ERROR %02X\n", ERROR_PROD_TEST_INITIALIZATION);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
|
|
logError(0, "%s LP INITIALIZATION TEST OK!\n", tag);
|
|
if (saveToFlash) {
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SAVE CX TEST:\n", tag);
|
|
res = save_cx_tuning();
|
|
if (res < 0) {
|
|
logError(0, "%s %s: SAVE CX TEST FAILED! ERROR %02X\n",
|
|
tag, __func__, res);
|
|
return (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
}
|
|
logError(0, "%s SAVE CX TEST OK!\n", tag);
|
|
}
|
|
|
|
logError(0, "%s Refresh Chip Info...\n", tag);
|
|
res |= readChipInfo(1);
|
|
if (res < 0) {
|
|
logError(1, "%s %s: read chip info ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_INITIALIZATION);
|
|
res = (res | ERROR_PROD_TEST_INITIALIZATION);
|
|
} else {
|
|
logError(0, "%s Split Initialization test finished! OK\n", tag);
|
|
}
|
|
return res;
|
|
|
|
}
|
|
|
|
int production_test_main(char *pathThresholds, int stop_on_fail, int saveInit,
|
|
struct TestToDo *todo, u32 signature)
|
|
{
|
|
int res, ret;
|
|
|
|
logError(0, "%s MAIN Production test is starting...\n", tag);
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s ITO TEST:\n", tag);
|
|
|
|
res = production_test_ito();
|
|
if (res < 0) {
|
|
logError(0, "%s Error during ITO TEST! ERROR %08X\n", tag, res);
|
|
//in case of ITO TEST failure is no sense keep going
|
|
goto END;
|
|
}
|
|
logError(0, "%s ITO TEST OK!\n", tag);
|
|
|
|
logError(0, "%s:\n", tag);
|
|
logError(0, "%s INITIALIZATION TEST:\n", tag);
|
|
|
|
if (saveInit == 1) {
|
|
res = production_test_initialization();
|
|
if (res < 0) {
|
|
logError(0, "%s Error during INITIALIZATION TEST!",
|
|
tag);
|
|
logError(0, "ERROR %08X\n", res);
|
|
if (stop_on_fail)
|
|
goto END;
|
|
} else {
|
|
logError(0, "%s INITIALIZATION TEST OK!\n", tag);
|
|
}
|
|
} else
|
|
logError(0, "%s INITIALIZATION TEST:..SKIPPED\n", tag);
|
|
|
|
logError(0, "%s\n", tag);
|
|
if (saveInit == 1) {
|
|
logError(0, "%s Cleaning up...\n", tag);
|
|
ret = cleanUp(0);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s: clean up ERROR %02X\n",
|
|
tag, __func__, ret);
|
|
res |= ret;
|
|
if (stop_on_fail)
|
|
goto END;
|
|
}
|
|
logError(0, "%s\n", tag);
|
|
}
|
|
|
|
logError(0, "%s PRODUCTION DATA TEST:\n", tag);
|
|
ret = production_test_data(pathThresholds, stop_on_fail, todo);
|
|
if (ret < 0) {
|
|
logError(0, "%sError during PRODUCTION DATA TEST %08X\n",
|
|
tag, ret);
|
|
} else {
|
|
logError(0, "%s PRODUCTION DATA TEST OK!\n", tag);
|
|
}
|
|
res |= ret;
|
|
// the OR is important because if
|
|
//the data test is OK but the inizialization
|
|
//test fail, the main production
|
|
//test result should = FAIL
|
|
|
|
if (ret == OK && saveInit == 1) {
|
|
logError(0, "%s SAVE FLAG:\n", tag);
|
|
ret = save_mp_flag(signature);
|
|
if (ret < OK)
|
|
logError(0, "%s SAVE FLAG:FAIL! ERROR %08X\n",
|
|
tag, ret);
|
|
else
|
|
logError(0, "%s SAVE FLAG:OK!\n", tag);
|
|
res |= ret;
|
|
// need to update the MP Flag
|
|
ret = readChipInfo(1);
|
|
if (ret < OK)
|
|
logError(1, "%s %s:read chip info ERROR %08X\n",
|
|
tag, __func__, ret);
|
|
res |= ret;
|
|
}
|
|
logError(0, "%s\n", tag);
|
|
END:
|
|
if (res < 0) {
|
|
logError(0, "%s MAIN Production test finished..FAILED\n", tag);
|
|
return res;
|
|
}
|
|
logError(0, "%s MAIN Production test finished..OK\n", tag);
|
|
return OK;
|
|
}
|
|
|
|
int production_test_ms_raw(char *path_limits, int stop_on_fail,
|
|
struct TestToDo *todo)
|
|
{
|
|
int ret, count_fail = 0;
|
|
struct MutualSenseFrame msRawFrame = {0};
|
|
|
|
int *thresholds = NULL;
|
|
int trows, tcolumns;
|
|
|
|
//****** Mutual Sense Test ************/
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s MS RAW DATA TEST is starting...\n", tag);
|
|
if (todo->MutualRaw == 1 || todo->MutualRawGap == 1) {
|
|
ret = getMSFrame2(MS_TOUCH_ACTIVE, &msRawFrame);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:getMSFrame failed... ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
logError(0, "%s MS RAW MIN MAX TEST:\n", tag);
|
|
if (todo->MutualRaw == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_RAW_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(0, "%s %s:MS_RAW_MIN_MAX failed...",
|
|
tag, __func__);
|
|
logError(0, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMinMax(msRawFrame.node_data,
|
|
msRawFrame.header.force_node,
|
|
msRawFrame.header.sense_node,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(0, "%s %s:MS RAW failed...",
|
|
tag, __func__);
|
|
logError(0, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s MS RAW MIN MAX TEST:...", tag);
|
|
logError(0, "FAIL\n\n", tag);
|
|
count_fail += 1;
|
|
if (stop_on_fail == 1)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS RAW MIN MAX TEST:OK\n", tag);
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else
|
|
logError(0, "%s MS RAW MIN MAX TEST:SKIPPED\n", tag);
|
|
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s MS RAW GAP TEST:\n", tag);
|
|
if (todo->MutualRawGap == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_RAW_GAP,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s %s: MS_RAW_GAP failed... ",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsGap(msRawFrame.node_data,
|
|
msRawFrame.header.force_node,
|
|
msRawFrame.header.sense_node,
|
|
thresholds[0]);
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsGap MS RAW ",
|
|
tag, __func__);
|
|
logError(1, "failed ERROR:%02X\n", ret);
|
|
count_fail += 1;
|
|
if (stop_on_fail == 1)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS RAW GAP TEST:....OK\n\n",
|
|
tag);
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else
|
|
logError(0, "%s MS RAW GAP TEST:..SKIPPED\n", tag);
|
|
} else
|
|
logError(0, "%s MS RAW FRAME TEST:.SKIPPED\n", tag);
|
|
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s MS KEY RAW TEST:\n", tag);
|
|
if (todo->MutualKeyRaw == 1) {
|
|
ret = production_test_ms_key_raw(path_limits);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:production_test_ms_key_raw ",
|
|
tag, __func__);
|
|
logError(1, "failed ERROR:%02X\n", ret);
|
|
count_fail += 1;
|
|
if (count_fail == 1) {
|
|
logError(0, "%s MS RAW DATA TEST:FAIL ", tag);
|
|
logError(0, "fails_count:%d\n\n", count_fail);
|
|
goto ERROR_LIMITS;
|
|
}
|
|
}
|
|
} else
|
|
logError(0, "%s MS KEY RAW TEST:....SKIPPED\n", tag);
|
|
ERROR:
|
|
logError(0, "%s\n", tag);
|
|
if (count_fail == 0) {
|
|
kfree(msRawFrame.node_data);
|
|
msRawFrame.node_data = NULL;
|
|
logError(0, "%s MS RAW DATA TEST finished!.OK\n", tag);
|
|
return OK;
|
|
}
|
|
print_frame_short("MS Raw frame =",
|
|
array1dTo2d_short(msRawFrame.node_data,
|
|
msRawFrame.node_data_size,
|
|
msRawFrame.header.sense_node),
|
|
msRawFrame.header.force_node,
|
|
msRawFrame.header.sense_node);
|
|
kfree(msRawFrame.node_data);
|
|
kfree(thresholds);
|
|
logError(0, "%s MS RAW DATA TEST: FAIL fails_count = %d\n\n",
|
|
tag, count_fail);
|
|
return (ERROR_PROD_TEST_DATA | ERROR_TEST_CHECK_FAIL);
|
|
|
|
ERROR_LIMITS:
|
|
kfree(msRawFrame.node_data);
|
|
kfree(thresholds);
|
|
return ret;
|
|
}
|
|
|
|
int production_test_ms_key_raw(char *path_limits)
|
|
{
|
|
int ret;
|
|
struct MutualSenseFrame msRawFrame;
|
|
|
|
int *thresholds = NULL;
|
|
int trows, tcolumns;
|
|
|
|
//************* Mutual Sense Test ************/
|
|
logError(0, "%s MS KEY RAW DATA TEST is starting...\n", tag);
|
|
|
|
ret = getMSFrame2(MS_KEY, &msRawFrame);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:getMSKeyFrame failed...ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_RAW_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s %s: MS_KEY_RAW_MIN_MAX failed...ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMinMax(msRawFrame.node_data,
|
|
msRawFrame.header.force_node,
|
|
msRawFrame.header.sense_node,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMinMax failed..ERROR COUNT:%d\n",
|
|
tag, __func__, ret);
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS KEY RAW TEST:.................OK\n\n", tag);
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
|
|
kfree(msRawFrame.node_data);
|
|
msRawFrame.node_data = NULL;
|
|
return OK;
|
|
ERROR:
|
|
print_frame_short("MS Key Raw frame =",
|
|
array1dTo2d_short(msRawFrame.node_data,
|
|
msRawFrame.node_data_size,
|
|
msRawFrame.header.sense_node),
|
|
msRawFrame.header.force_node,
|
|
msRawFrame.header.sense_node);
|
|
kfree(msRawFrame.node_data);
|
|
kfree(thresholds);
|
|
logError(0, "%s MS KEY RAW TEST:......FAIL\n\n", tag);
|
|
return (ERROR_PROD_TEST_DATA | ERROR_TEST_CHECK_FAIL);
|
|
ERROR_LIMITS:
|
|
kfree(msRawFrame.node_data);
|
|
kfree(thresholds);
|
|
return ret;
|
|
}
|
|
|
|
int production_test_ms_cx(char *path_limits,
|
|
int stop_on_fail, struct TestToDo *todo)
|
|
{
|
|
int ret;
|
|
int count_fail = 0;
|
|
|
|
int *thresholds = NULL;
|
|
int *thresholds_min = NULL;
|
|
int *thresholds_max = NULL;
|
|
int trows, tcolumns;
|
|
|
|
struct MutualSenseData msCompData;
|
|
|
|
u8 *adjhor = NULL;
|
|
|
|
u8 *adjvert = NULL;
|
|
|
|
u16 container;
|
|
u16 *total_cx = NULL;
|
|
u16 *total_adjhor = NULL;
|
|
u16 *total_adjvert = NULL;
|
|
|
|
//MS CX TEST
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s MS CX Testes are starting...\n", tag);
|
|
//read MS compensation data
|
|
ret = readMutualSenseCompensationData(MS_TOUCH_ACTIVE, &msCompData);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:readMutualSenseCompensationData ",
|
|
tag, __func__);
|
|
logError(1, "failed %02X\n", ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
logError(0, "%s MS CX1 TEST:\n", tag);
|
|
if (todo->MutualCx1 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_CX1_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s %s:parseProductionTestLimits failed ",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
container = (u16)msCompData.cx1;
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]); //check the limits
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMinMax MS CX1 failed ",
|
|
tag, __func__);
|
|
logError(1, "ERROR COUNT:%d\n", ret);
|
|
logError(0, "%s MS CX1 TEST:.........FAIL\n\n", tag);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS CX1 TEST:..........OK\n\n", tag);
|
|
} else
|
|
logError(0, "%s MS CX1 TEST:.......SKIPPED\n\n", tag);
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
|
|
logError(0, "%s MS CX2 MIN MAX TEST:\n", tag);
|
|
if (todo->MutualCx2 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_CX2_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns); //load min thresholds
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s %s:parseProductionTestLimits ",
|
|
tag, __func__);
|
|
logError(1, "failed %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_CX2_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns); //load max thresholds
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s %s: MS_CX2_MAP_MAX failed ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMap(msCompData.node_data,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);//check the limits
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMap MS CX2 MIN MAX ",
|
|
tag, __func__);
|
|
logError(1, "failed ERR_COUNT:%d\n", ret);
|
|
logError(0, "%s MS CX2 MIN MAX TEST:......FAIL\n\n",
|
|
tag);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS CX2 MIN MAX TEST:....OK\n\n", tag);
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else
|
|
logError(0, "%s MS CX2 MIN MAX TEST:....SKIPPED\n\n", tag);
|
|
|
|
logError(0, "%s MS CX2 ADJ TEST:\n", tag);
|
|
if (todo->MutualCx2Adj == 1) {
|
|
//MS CX2 ADJ HORIZ
|
|
logError(0, "%s MS CX2 ADJ HORIZ TEST:\n", tag);
|
|
|
|
ret = computeAdjHoriz(msCompData.node_data,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
&adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:computeAdjHoriz failed...",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s MS CX2 ADJ HORIZ computed!\n", tag);
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_CX2_ADJH_MAP_MAX,
|
|
&thresholds_max, &trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node - 1)) {
|
|
|
|
logError(1, "%s %s: MS_CX2_ADJH_MAP_MAX failed...",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMapAdj(adjhor,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMapAdj CX2 ADJH failed ",
|
|
tag, __func__);
|
|
logError(1, "ERROR COUNT:%d\n", ret);
|
|
logError(0, "%s MS CX2 ADJ HORIZ TEST:..FAIL\n\n", tag);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS CX2 ADJ HORIZ TEST:..OK\n\n", tag);
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjhor);
|
|
adjhor = NULL;
|
|
|
|
//MS CX2 ADJ VERT
|
|
logError(0, "%s MS CX2 ADJ VERT TEST:\n", tag);
|
|
ret = computeAdjVert(msCompData.node_data,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
&adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:computeAdjVert failed... ",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s MS CX2 ADJ VERT computed!\n", tag);
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_CX2_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != msCompData.header.force_node - 1
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s %s:MS_CX2_ADJV_MAP_MAX failed ",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMapAdj(adjvert,
|
|
msCompData.header.force_node - 1,
|
|
msCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMapAdj CX2 ADJV failed ",
|
|
tag, __func__);
|
|
logError(1, "COUNT:%d\n", ret);
|
|
logError(0, "%s MS CX2 ADJ HORIZ TEST:FAIL\n\n", tag);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s MS CX2 ADJ VERT TEST:OK\n\n", tag);
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjvert);
|
|
adjvert = NULL;
|
|
} else
|
|
logError(0, "%s MS CX2 ADJ TEST:SKIPPED\n\n", tag);
|
|
|
|
//START OF TOTAL CHECK
|
|
logError(0, "%s MS TOTAL CX TEST:\n", tag);
|
|
|
|
if (todo->MutualCxTotal == 1 || todo->MutualCxTotalAdj == 1) {
|
|
ret = computeTotal(msCompData.node_data,
|
|
msCompData.cx1,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
CX1_WEIGHT,
|
|
CX2_WEIGHT,
|
|
&total_cx);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:computeTotalCx failed...",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s MS TOTAL CX MIN MAX TEST:\n", tag);
|
|
if (todo->MutualCxTotal == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_TOTAL_CX_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);//load min thresholds
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s %s:parseProductionTestLimits ",
|
|
tag, __func__);
|
|
logError(1, "failed %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
//load max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_TOTAL_CX_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s %s:MS_TOTAL_CX_MAP_MAX failed",
|
|
tag, __func__);
|
|
logError(1, "...ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMapTotal(total_cx,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);//check the limits
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:MS TOTAL CX TEST failed ",
|
|
tag, __func__);
|
|
logError(1, "COUNT:%d\n", ret);
|
|
logError(0, "%s MS TOTAL CX MIN MAX ", tag);
|
|
logError(0, "TEST:FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS TOTAL CX MIN MAX TEST", tag);
|
|
logError(0, ":OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else
|
|
logError(0, "%s MS TOTAL CX MIN MAX TEST:SKIPPED\n\n",
|
|
tag);
|
|
|
|
|
|
logError(0, "%s MS TOTAL CX ADJ TEST:\n", tag);
|
|
if (todo->MutualCxTotalAdj == 1) {
|
|
//MS TOTAL CX ADJ HORIZ
|
|
logError(0, "%s MS TOTAL CX ADJ HORIZ TEST:\n", tag);
|
|
|
|
//thresholds_max = NULL;
|
|
ret = computeAdjHorizTotal(total_cx,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
&total_adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjHoriz failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s MS TOTAL CX ADJ HORIZ computed!\n",
|
|
tag);
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_TOTAL_CX_ADJH_MAP_MAX,
|
|
&thresholds_max, &trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != msCompData.header.force_node
|
|
|| tcolumns != msCompData.header.sense_node - 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "MS_TOTAL_CX_ADJH_MAP_MAX ");
|
|
logError(1, "failed...RROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMapAdjTotal(total_adjhor,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj MS TOTAL ");
|
|
logError(1, "CX ADJH failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s MS TOTAL CX ADJ HORIZ ", tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS TOTAL CX ADJ HORIZ ", tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjhor);
|
|
total_adjhor = NULL;
|
|
|
|
//MS TOTAL CX ADJ VERT
|
|
logError(0, "%s MS TOTAL CX ADJ VERT TEST:\n", tag);
|
|
|
|
ret = computeAdjVertTotal(total_cx,
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node,
|
|
&total_adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjVert failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s MS TOTAL CX ADJ VERT computed!\n",
|
|
tag);
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_TOTAL_CX_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 ||
|
|
(trows != msCompData.header.force_node - 1
|
|
|| tcolumns != msCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "MS_TOTAL_CX_ADJV_MAP_MAX failed");
|
|
logError(1, "... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMapAdjTotal(total_adjvert,
|
|
msCompData.header.force_node - 1,
|
|
msCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj MS TOTAL ");
|
|
logError(1, "CX ADJV failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s MS TOTAL CX ADJ HORIZ ", tag);
|
|
logError(0, "TEST:.................FAIL\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS TOTAL CX ADJ VERT ", tag);
|
|
logError(0, "TEST:.................OK\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjvert);
|
|
total_adjvert = NULL;
|
|
} else {
|
|
logError(0, "%s MS TOTAL CX ADJ ", tag);
|
|
logError(0, "TEST:.................SKIPPED\n");
|
|
}
|
|
|
|
kfree(total_cx);
|
|
total_cx = NULL;
|
|
} else
|
|
logError(0, "%s MS TOTAL CX TEST:.................SKIPPED\n",
|
|
tag);
|
|
|
|
if ((todo->MutualKeyCx1
|
|
| todo->MutualKeyCx2 | todo->MutualKeyCxTotal) == 1) {
|
|
ret = production_test_ms_key_cx(path_limits,
|
|
stop_on_fail,
|
|
todo);
|
|
if (ret < 0) {
|
|
count_fail += 1;
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "production_test_ms_key_cx failed...");
|
|
logError(1, "ERROR = %02X\n", ret);
|
|
logError(0, "%s MS CX testes finished!", tag);
|
|
logError(0, ".................FAILED ");
|
|
logError(0, "fails_count = %d\n\n", count_fail);
|
|
return ret;
|
|
}
|
|
} else
|
|
logError(0, "%s MS KEY CX TEST:.................SKIPPED\n",
|
|
tag);
|
|
|
|
if ((todo->MutualKeyCx1 | todo->MutualKeyCx2
|
|
| todo->MutualKeyCxTotal) == 1) {
|
|
ret = production_test_ms_key_cx(path_limits,
|
|
stop_on_fail,
|
|
todo);
|
|
|
|
if (ret < 0) {
|
|
count_fail += 1;
|
|
logError(1, "%s %s:production_test_ms_key_cx ",
|
|
tag, __func__);
|
|
logError(1, "failed :%02X\n", ret);
|
|
logError(0, "%s MS CX testes finished! ", tag);
|
|
logError(0, "fails_count = %d\n\n", count_fail);
|
|
return ret;
|
|
}
|
|
} else
|
|
logError(0, "%s MS KEY CX TEST:..SKIPPED\n", tag);
|
|
ERROR:
|
|
logError(0, "%s\n", tag);
|
|
if (count_fail == 0) {
|
|
logError(0, "%s MS CX testes finished! OK\n", tag);
|
|
kfree(msCompData.node_data);
|
|
msCompData.node_data = NULL;
|
|
return OK;
|
|
}
|
|
print_frame_u8("MS Init Data (Cx2) =",
|
|
array1dTo2d_u8(msCompData.node_data,
|
|
msCompData.node_data_size,
|
|
msCompData.header.sense_node),
|
|
msCompData.header.force_node,
|
|
msCompData.header.sense_node);
|
|
logError(0, "%s MS CX testes finished! fails_count = %d\n\n",
|
|
tag, count_fail);
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(adjhor);
|
|
kfree(adjvert);
|
|
kfree(total_cx);
|
|
kfree(total_adjhor);
|
|
kfree(total_adjvert);
|
|
kfree(msCompData.node_data);
|
|
|
|
return (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_DATA);
|
|
|
|
ERROR_LIMITS:
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(adjhor);
|
|
kfree(adjvert);
|
|
kfree(total_cx);
|
|
kfree(total_adjhor);
|
|
kfree(total_adjvert);
|
|
kfree(msCompData.node_data);
|
|
return ret;
|
|
}
|
|
|
|
int production_test_ms_key_cx(char *path_limits, int stop_on_fail,
|
|
struct TestToDo *todo)
|
|
{
|
|
int ret;
|
|
int count_fail = 0;
|
|
int num_keys = 0;
|
|
|
|
int *thresholds = NULL;
|
|
int *thresholds_min = NULL;
|
|
int *thresholds_max = NULL;
|
|
int trows, tcolumns;
|
|
|
|
struct MutualSenseData msCompData;
|
|
|
|
u16 container;
|
|
u16 *total_cx = NULL;
|
|
|
|
|
|
//MS CX TEST
|
|
logError(0, "%s MS KEY CX Testes are starting...\n", tag);
|
|
|
|
//read MS compensation data
|
|
ret = readMutualSenseCompensationData(MS_KEY, &msCompData);
|
|
if (ret < 0) {
|
|
logError(0, "%s production_test_data: ", tag);
|
|
logError(0, "readMutualSenseCompensationData failed... ");
|
|
logError(0, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
//the meaningful data are only in the first row, the other rows are
|
|
// only a copy of the first one
|
|
if (msCompData.header.force_node > msCompData.header.sense_node)
|
|
num_keys = msCompData.header.force_node;
|
|
else
|
|
num_keys = msCompData.header.sense_node;
|
|
|
|
logError(0, "%s MS KEY CX1 TEST:\n", tag);
|
|
if (todo->MutualKeyCx1 == 1) {
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_CX1_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(0, "%s production_test_data: ", tag);
|
|
logError(0, "parseProductionTestLimits ");
|
|
logError(0, "MS_KEY_CX1_MIN_MAX failed... ");
|
|
logError(0, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
container = (u16) msCompData.cx1;
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]); //check the limits
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax MS CX1 failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s MS KEY CX1 TEST:................", tag);
|
|
logError(0, ".FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS KEY CX1 TEST:................", tag);
|
|
logError(0, ".OK\n\n");
|
|
}
|
|
} else
|
|
logError(0, "%s MS KEY CX1 TEST:.................SKIPPED\n\n",
|
|
tag);
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
|
|
logError(0, "%s MS KEY CX2 TEST:\n", tag);
|
|
if (todo->MutualKeyCx2 == 1) {
|
|
//load min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_CX2_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != num_keys)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "MS_KEY_CX2_MAP_MIN failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_CX2_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != num_keys)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "MS_KEY_CX2_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the limits
|
|
ret = checkLimitsMap(msCompData.node_data,
|
|
1,
|
|
num_keys,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap MS KEY CX2 failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s MS KEY CX2 TEST:................", tag);
|
|
logError(0, ".FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS KEY CX2 TEST:...............", tag);
|
|
logError(0, "..OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else
|
|
logError(0, "%s MS CX2 TEST:.................SKIPPED\n\n",
|
|
tag);
|
|
|
|
//START OF TOTAL CHECK
|
|
logError(0, "%s MS KEY TOTAL CX TEST:\n", tag);
|
|
|
|
if (todo->MutualKeyCxTotal == 1) {
|
|
ret = computeTotal(msCompData.node_data,
|
|
msCompData.cx1, 1,
|
|
num_keys,
|
|
CX1_WEIGHT,
|
|
CX2_WEIGHT,
|
|
&total_cx);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeTotalCx failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_TOTAL_CX_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != num_keys)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "%parseProductionTestLimits ");
|
|
logError(1, "MS_KEY_TOTAL_CX_MAP_MIN failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
MS_KEY_TOTAL_CX_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != num_keys)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "MS_KEY_TOTAL_CX_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the limits
|
|
ret = checkLimitsMapTotal(total_cx,
|
|
1,
|
|
num_keys,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap MS TOTAL ");
|
|
logError(1, "KEY CX TEST failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s MS KEY TOTAL CX TEST:...........", tag);
|
|
logError(0, "......FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s MS KEY TOTAL CX TEST:...........", tag);
|
|
logError(0, "......OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
|
|
kfree(total_cx);
|
|
total_cx = NULL;
|
|
} else {
|
|
logError(0, "%s MS KEY TOTAL CX TEST:.................", tag);
|
|
logError(0, "SKIPPED\n");
|
|
}
|
|
|
|
ERROR:
|
|
logError(0, "%s\n", tag);
|
|
if (count_fail == 0) {
|
|
logError(0,
|
|
"%s MS KEY CX testes finished! OK\n", tag);
|
|
kfree(msCompData.node_data);
|
|
msCompData.node_data = NULL;
|
|
return OK;
|
|
}
|
|
print_frame_u8("MS Key Init Data (Cx2) =",
|
|
array1dTo2d_u8(msCompData.node_data,
|
|
msCompData.node_data_size,
|
|
msCompData.header.sense_node),
|
|
1,
|
|
msCompData.header.sense_node);
|
|
logError(0, "%s MS Key CX testes finished!..............", tag);
|
|
logError(0, "...FAILED fails_count = %d\n\n", count_fail);
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(msCompData.node_data);
|
|
kfree(total_cx);
|
|
return (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_DATA);
|
|
ERROR_LIMITS:
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(msCompData.node_data);
|
|
kfree(total_cx);
|
|
return ret;
|
|
}
|
|
|
|
int production_test_ss_raw(char *path_limits,
|
|
int stop_on_fail, struct TestToDo *todo)
|
|
{
|
|
int ret;
|
|
int count_fail = 0;
|
|
int rows, columns;
|
|
|
|
//short *ssRawFrame = NULL;
|
|
struct SelfSenseFrame ssRawFrame;
|
|
|
|
int *thresholds = NULL;
|
|
int trows, tcolumns;
|
|
|
|
//MS SS TEST
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SS RAW Testes are starting...\n", tag);
|
|
|
|
//******* Self Sense Test ***************/
|
|
logError(0, "%s Getting SS Frame...\n", tag);
|
|
ret = getSSFrame2(SS_TOUCH, &ssRawFrame);
|
|
if (ret < 0) {
|
|
logError(1, "%s %s:getSSFrame failed...ERROR %02X\n",
|
|
tag, __func__, ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
//SS RAW (PROXIMITY) FORCE TEST
|
|
logError(0, "%s SS RAW (PROXIMITY) FORCE TEST:\n", tag);
|
|
|
|
if (todo->SelfForceRaw == 1 || todo->SelfForceRawGap == 1) {
|
|
//there are no data for the sense
|
|
//channels due to the fact that
|
|
//the force frame is analized
|
|
columns = 1;
|
|
rows = ssRawFrame.header.force_node;
|
|
|
|
logError(0, "%s SS RAW (PROXIMITY) FORCE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfForceRaw == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_RAW_FORCE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s %s:parseProductionTestLimits ",
|
|
tag, __func__);
|
|
logError(1, "failed %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
//return (ret | ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMinMax(ssRawFrame.force_data,
|
|
rows, columns,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s %s:checkLimitsMinMax ",
|
|
tag, __func__);
|
|
logError(1, "failed ERROR COUNT:%d\n", ret);
|
|
logError(0, "%s SS RAW (PROXIMITY) FORCE", tag);
|
|
logError(0, " MIN MAX TEST:FAIL\n\n");
|
|
count_fail += 1;
|
|
print_frame_short("SS Raw force frame =",
|
|
array1dTo2d_short(ssRawFrame.force_data,
|
|
rows*columns, columns),
|
|
rows,
|
|
columns);
|
|
if (stop_on_fail) {
|
|
ret = ERROR_PROD_TEST_DATA
|
|
| ERROR_TEST_CHECK_FAIL;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "FORCE MIN MAX TEST:.............");
|
|
logError(0, "....OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "FORCE MIN MAX TEST:.................");
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SS RAW (PROXIMITY) FORCE GAP TEST:\n", tag);
|
|
if (todo->SelfForceRawGap == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_RAW_FORCE_GAP,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_RAW_FORCE_GAP failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsGap(ssRawFrame.force_data,
|
|
rows,
|
|
columns,
|
|
thresholds[0]);
|
|
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsGap SS RAW ");
|
|
logError(1, "(PROXIMITY) FORCE GAP failed...");
|
|
logError(1, "ERROR = %02X\n", ret);
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "FORCE GAP TEST:.................");
|
|
logError(0, "FAIL\n\n");
|
|
count_fail += 1;
|
|
print_frame_short("SS Raw force frame =",
|
|
array1dTo2d_short(ssRawFrame.force_data,
|
|
rows*columns, columns),
|
|
rows,
|
|
columns);
|
|
if (stop_on_fail) {
|
|
ret = ERROR_PROD_TEST_DATA
|
|
| ERROR_TEST_CHECK_FAIL;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "FORCE GAP TEST:.................");
|
|
logError(0, "OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "FORCE GAP TEST:.................");
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
kfree(ssRawFrame.force_data);
|
|
ssRawFrame.force_data = NULL;
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) FORCE ", tag);
|
|
logError(0, "TEST:.................SKIPPED\n\n");
|
|
}
|
|
|
|
logError(0, "%s\n", tag);
|
|
//SS RAW (PROXIMITY) SENSE TEST
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE TEST:\n", tag);
|
|
|
|
if (todo->SelfSenseRaw == 1 || todo->SelfSenseRawGap == 1) {
|
|
columns = ssRawFrame.header.sense_node;
|
|
// there are no data for the force channels due
|
|
// to the fact that the sense frame is analized
|
|
rows = 1;
|
|
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfSenseRaw == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_RAW_SENSE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_RAW_SENSE_MIN_MAX failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsMinMax(ssRawFrame.sense_data,
|
|
rows,
|
|
columns,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax SS RAW ");
|
|
logError(1, "(PROXIMITY) SENSE failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "SENSE MIN MAX TEST:.............");
|
|
logError(0, "....FAIL\n");
|
|
count_fail += 1;
|
|
print_frame_short("SS Raw sense frame =",
|
|
array1dTo2d_short(ssRawFrame.sense_data,
|
|
rows*columns, columns),
|
|
rows,
|
|
columns);
|
|
if (stop_on_fail) {
|
|
ret = ERROR_PROD_TEST_DATA
|
|
| ERROR_TEST_CHECK_FAIL;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "SENSE MIN MAX TEST:.............");
|
|
logError(0, "....OK\n");
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE MIN MAX", tag);
|
|
logError(0, " TEST:.................SKIPPED\n");
|
|
}
|
|
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE GAP TEST:\n", tag);
|
|
if (todo->SelfSenseRawGap == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_RAW_SENSE_GAP,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_RAW_SENSE_GAP failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = checkLimitsGap(ssRawFrame.sense_data,
|
|
rows,
|
|
columns,
|
|
thresholds[0]);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsGap SS RAW ");
|
|
logError(1, "(PROXIMITY) SENSE GAP failed... ");
|
|
logError(1, "ERROR = %02X\n", ret);
|
|
logError(0, "%s SS RAW (PROXIMITY) ", tag);
|
|
logError(0, "SENSE GAP TEST:.................");
|
|
logError(0, "FAIL\n");
|
|
count_fail += 1;
|
|
print_frame_short("SS Raw sense frame =",
|
|
array1dTo2d_short(ssRawFrame.sense_data,
|
|
rows*columns, columns),
|
|
rows,
|
|
columns);
|
|
if (stop_on_fail) {
|
|
ret = ERROR_PROD_TEST_DATA
|
|
| ERROR_TEST_CHECK_FAIL;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE", tag);
|
|
logError(0, " GAP TEST:.................OK\n");
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS RAW (PROXIMITY) SENSE GAP ", tag);
|
|
logError(0, "TEST:.................SKIPPED\n");
|
|
}
|
|
|
|
kfree(ssRawFrame.sense_data);
|
|
ssRawFrame.sense_data = NULL;
|
|
}
|
|
|
|
logError(0, "%s\n", tag);
|
|
if (count_fail == 0) {
|
|
logError(0, "%s SS RAW testes finished!.................OK\n\n",
|
|
tag);
|
|
return OK;
|
|
}
|
|
logError(0, "%s SS RAW testes finished!.................", tag);
|
|
logError(0, "FAILED fails_count = %d\n\n", count_fail);
|
|
return (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_DATA);
|
|
|
|
ERROR_LIMITS:
|
|
kfree(ssRawFrame.force_data);
|
|
kfree(ssRawFrame.sense_data);
|
|
kfree(thresholds);
|
|
return ret;
|
|
|
|
}
|
|
|
|
int production_test_ss_ix_cx(char *path_limits, int stop_on_fail,
|
|
struct TestToDo *todo)
|
|
{
|
|
int ret;
|
|
int count_fail = 0;
|
|
|
|
int *thresholds = NULL;
|
|
int trows, tcolumns;
|
|
int *thresholds_min = NULL;
|
|
int *thresholds_max = NULL;
|
|
|
|
struct SelfSenseData ssCompData;
|
|
|
|
u8 *adjhor = NULL;
|
|
u8 *adjvert = NULL;
|
|
|
|
u16 container;
|
|
int *ix1_w = NULL;
|
|
int *ix2_w = NULL;
|
|
u16 *total_ix = NULL;
|
|
u16 *total_cx = NULL;
|
|
|
|
u16 *total_adjhor = NULL;
|
|
u16 *total_adjvert = NULL;
|
|
|
|
logError(0, "%s\n", tag);
|
|
logError(0, "%s SS IX CX testes are starting...\n", tag);
|
|
|
|
//read the SS compensation data
|
|
ret = readSelfSenseCompensationData(SS_TOUCH, &ssCompData);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "readSelfSenseCompensationData failed... ", tag);
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
//********************** SS FORCE IX *********************************/
|
|
//SS IX1 FORCE TEST
|
|
logError(0, "%s SS IX1 FORCE TEST:\n", tag);
|
|
if (todo->SelfForceIx1 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX1_FORCE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_FORCE_MIN_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
container = (u16) ssCompData.f_ix1;
|
|
|
|
//check the limits
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax ");
|
|
logError(1, "SS IX1 FORCE TEST failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else
|
|
logError(0, "%s SS IX1 FORCE TEST:......OK\n\n", tag);
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
//SS IX2 FORCE TEST
|
|
logError(0, "%s SS IX2 FORCE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfForceIx2 == 1) {
|
|
//load the min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_FORCE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX2_FORCE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_FORCE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits");
|
|
logError(1, "SS_IX2_FORCE_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMap(ssCompData.ix2_fm,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS IX2 FORCE failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS IX2 FORCE MIN MAX TEST:..........");
|
|
logError(0, "FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS IX2 FORCE MIN MAX TEST:.....", tag);
|
|
logError(0, "OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS IX2 FORCE MIN MAX TEST:...........", tag);
|
|
logError(0, "KIPPED\n\n");
|
|
}
|
|
|
|
logError(0, "%s SS IX2 FORCE ADJ TEST:\n", tag);
|
|
if (todo->SelfForceIx2Adj == 1) {
|
|
//SS IX2 FORCE ADJV TEST
|
|
logError(0, "%s SS IX2 FORCE ADJVERT TEST:\n", tag);
|
|
ret = computeAdjVert(ssCompData.ix2_fm,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
&adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjVert SS IX2 FORCE ADJV ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS IX2 FORCE ADJV computed!\n", tag);
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_FORCE_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node - 1
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX2_FORCE_ADJV_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdj(adjvert,
|
|
ssCompData.header.force_node - 1,
|
|
1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS IX2 FORCE failed... ");
|
|
logError(0, "FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS IX2 FORCE ADJV TEST:", tag);
|
|
logError(0, ".................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjvert);
|
|
adjvert = NULL;
|
|
|
|
} else {
|
|
logError(0, "%s SS IX2 FORCE ADJ TEST:", tag);
|
|
logError(0, ".................SKIPPED\n\n");
|
|
}
|
|
|
|
//SS TOTAL FORCE IX
|
|
logError(0, "%s SS TOTAL IX FORCE TEST:\n", tag);
|
|
if (todo->SelfForceIxTotal == 1 || todo->SelfForceIxTotalAdj == 1) {
|
|
logError(0, "%s Reading TOTAL IX FORCE Weights...\n", tag);
|
|
|
|
//load the IX1 weight
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX1_FORCE_W,
|
|
&ix1_w,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_FORCE_W failed... ERROR %02X\n",
|
|
tag, ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
//load the IX2 weight
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_FORCE_W,
|
|
&ix2_w,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_FORCE_W failed... ERROR %02X\n",
|
|
tag, ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
logError(0, "%s Weights: IX1_W = %d IX2_W = %d\n",
|
|
tag, *ix1_w, *ix2_w);
|
|
ret = computeTotal(ssCompData.ix2_fm, ssCompData.f_ix1,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
*ix1_w,
|
|
*ix2_w,
|
|
&total_ix);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeTotal Ix Force failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
kfree(ix1_w);
|
|
ix1_w = NULL;
|
|
kfree(ix2_w);
|
|
ix2_w = NULL;
|
|
|
|
logError(0, "%s SS TOTAL IX FORCE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfForceIxTotal == 1) {
|
|
//load the min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_FORCE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_FORCE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_FORCE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_FORCE_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapTotal(total_ix,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS TOTAL IX FORCE");
|
|
logError(1, "failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s SS TOTAL IX FORCE MIN MAX ",
|
|
tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX FORCE MIN MAX ",
|
|
tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX FORCE MIN MAX TEST:", tag);
|
|
logError(0, ".................SKIPPED\n");
|
|
}
|
|
|
|
logError(0, "%s SS TOTAL IX FORCE ADJ TEST:\n", tag);
|
|
if (todo->SelfForceIxTotalAdj == 1) {
|
|
//SS TOTAL IX FORCE ADJV TEST
|
|
logError(0, "%s SS TOTAL IX FORCE ADJVERT TEST:\n",
|
|
tag);
|
|
ret = computeAdjVertTotal(total_ix,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
&total_adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjVert SS TOTAL IX ");
|
|
logError(1, "FORCE ADJV failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS TOTAL IX FORCE ADJV computed!\n",
|
|
tag);
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_FORCE_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0
|
|
|| (trows != ssCompData.header.force_node - 1
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_FORCE_ADJV_MAP_MAX");
|
|
logError(1, "... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdjTotal(total_adjvert,
|
|
ssCompData.header.force_node - 1,
|
|
1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS TOTAL IX ");
|
|
logError(1, "FORCE failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS TOTAL IX FORCE ADJV TEST:",
|
|
tag);
|
|
logError(0, ".................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX FORCE ADJV TEST:",
|
|
tag);
|
|
logError(0, ".................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjvert);
|
|
total_adjvert = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX FORCE ADJ TEST:");
|
|
logError(0, ".................SKIPPED\n");
|
|
}
|
|
|
|
kfree(total_ix);
|
|
total_ix = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX FORCE TEST:", tag);
|
|
logError(0, ".................SKIPPED\n\n");
|
|
}
|
|
|
|
|
|
//************** SS SENSE IX *******************/
|
|
//SS IX1 SENSE TEST
|
|
logError(0, "%s SS IX1 SENSE TEST:\n", tag);
|
|
if (todo->SelfSenseIx1 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX1_SENSE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_SENSE_MIN_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
container = (u16) ssCompData.s_ix1;
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]); //check the limits
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax SS IX1 SENSE TEST ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS IX1 SENSE TEST:..............", tag);
|
|
logError(0, "...OK\n\n");
|
|
}
|
|
} else {
|
|
logError(0, "%s SS IX1 SENSE TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
//SS IX2 SENSE TEST
|
|
logError(0, "%s SS IX2 SENSE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfSenseIx2 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_SENSE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns); //load the min thresholds
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "S_IX2_SENSE_MAP_MIN failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_SENSE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns); //load the max thresholds
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX2_SENSE_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMap(ssCompData.ix2_sn,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS IX2 SENSE failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS IX2 SENSE MIN MAX TEST:.....", tag);
|
|
logError(0, "............FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS IX2 SENSE MIN MAX TEST:", tag);
|
|
logError(0, ".................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS IX2 SENSE MIN MAX TEST:..............", tag);
|
|
logError(0, "...SKIPPED\n\n");
|
|
}
|
|
|
|
logError(0, "%s SS IX2 SENSE ADJ TEST:\n", tag);
|
|
if (todo->SelfSenseIx2Adj == 1) {
|
|
//SS IX2 SENSE ADJH TEST
|
|
logError(0, "%s SS IX2 SENSE ADJHORIZ TEST:\n", tag);
|
|
ret = computeAdjHoriz(ssCompData.ix2_sn,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
&adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjHoriz SS IX2 SENSE ADJH ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS IX2 SENSE ADJ HORIZ computed!\n", tag);
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_SENSE_ADJH_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns); //load the max thresholds
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node - 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX2_SENSE_ADJH_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdj(adjhor,
|
|
1,
|
|
ssCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj SS IX2 SENSE ADJH ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS IX2 SENSE ADJH TEST:.......", tag);
|
|
logError(0, "..........FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS IX2 SENSE ADJH TEST:........", tag);
|
|
logError(0, ".........OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjhor);
|
|
adjhor = NULL;
|
|
} else {
|
|
logError(0, "%s SS IX2 SENSE ADJ TEST:.................", tag);
|
|
logError(0, "SKIPPED\n", tag);
|
|
}
|
|
|
|
//SS TOTAL IX SENSE
|
|
logError(0, "%s SS TOTAL IX SENSE TEST:\n", tag);
|
|
if (todo->SelfSenseIxTotal == 1 || todo->SelfSenseIxTotalAdj == 1) {
|
|
logError(0, "%s Reading TOTAL IX SENSE Weights...\n", tag);
|
|
//load the IX1 weight
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX1_SENSE_W,
|
|
&ix1_w,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_SENSE_W failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the IX2 weight
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_IX2_SENSE_W,
|
|
&ix2_w,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX1_SENSE_W failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
logError(0, "%s Weights: IX1_W = %d IX2_W = %d\n",
|
|
tag, *ix1_w, *ix2_w);
|
|
|
|
ret = computeTotal(ssCompData.ix2_sn,
|
|
ssCompData.s_ix1,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
*ix1_w,
|
|
*ix2_w,
|
|
&total_ix);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeTotal Ix Sense ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
kfree(ix1_w);
|
|
ix1_w = NULL;
|
|
kfree(ix2_w);
|
|
ix2_w = NULL;
|
|
|
|
logError(0, "%s SS TOTAL IX SENSE MIN MAX TEST:\n", tag);
|
|
//load the min thresholds
|
|
if (todo->SelfSenseIxTotal == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_SENSE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_SENSE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_SENSE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 ||
|
|
tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_SENSE_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapTotal(total_ix,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS TOTAL IX SENSE");
|
|
logError(1, " failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s SS TOTAL IX SENSE MIN MAX ",
|
|
tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX SENSE MIN MAX ",
|
|
tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX SENSE MIN MAX ", tag);
|
|
logError(0, "TEST:.................SKIPPED\n");
|
|
}
|
|
|
|
|
|
logError(0, "%s SS TOTAL IX SENSE ADJ TEST:\n", tag);
|
|
if (todo->SelfSenseIxTotalAdj == 1) {
|
|
//SS TOTAL IX SENSE ADJH TEST
|
|
logError(0, "%s SS TOTAL IX SENSE ADJHORIZ TEST:\n",
|
|
tag);
|
|
ret = computeAdjHorizTotal(total_ix,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
&total_adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjHoriz SS TOTAL ");
|
|
logError(1, "IXSENSE ADJH failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS TOTAL IX SENSE ADJ HORIZ ", tag);
|
|
logError(0, "computed!\n");
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_IX_SENSE_ADJH_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node - 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_IX_SENSE_ADJH_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdjTotal(total_adjhor,
|
|
1,
|
|
ssCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj SS TOTAL ");
|
|
logError(1, "IX SENSE ADJH failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS TOTAL IX SENSE ADJH ", tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX SENSE ADJH ", tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjhor);
|
|
total_adjhor = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX SENSE ADJ TEST:.....", tag);
|
|
logError(0, "............SKIPPED\n");
|
|
}
|
|
kfree(total_ix);
|
|
total_ix = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL IX SENSE TEST:............", tag);
|
|
logError(0, ".....SKIPPED\n");
|
|
}
|
|
|
|
//************************ SS SENSE CX *******************************/
|
|
//SS CX1 FORCE TEST
|
|
logError(0, "%s SS CX1 FORCE TEST:\n", tag);
|
|
if (todo->SelfForceCx1 == 1) {
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX1_FORCE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX1_FORCE_MIN_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the limits
|
|
container = (u16) ssCompData.f_cx1;
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax SS CX1 FORCE TEST ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX1 FORCE TEST:.............", tag);
|
|
logError(0, "....OK\n\n");
|
|
}
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX1 FORCE TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
//SS CX2 FORCE TEST
|
|
logError(0, "%s SS CX2 FORCE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfForceCx2 == 1) {
|
|
//load the min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_FORCE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "SS_CX2_FORCE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_FORCE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX2_FORCE_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMap(ssCompData.cx2_fm,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "%checkLimitsMap SS CX2 FORCE ");
|
|
logError(1, "%failed... ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS CX2 FORCE MIN MAX TEST:.....", tag);
|
|
logError(0, "............FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX2 FORCE MIN MAX TEST:......", tag);
|
|
logError(0, "...........OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX2 FORCE MIN MAX TEST:..............", tag);
|
|
logError(0, "...SKIPPED\n");
|
|
}
|
|
|
|
logError(0, "%s SS CX2 FORCE ADJ TEST:\n", tag);
|
|
if (todo->SelfForceCx2Adj == 1) {
|
|
//SS CX2 FORCE ADJV TEST
|
|
logError(0, "%s SS CX2 FORCE ADJVERT TEST:\n", tag);
|
|
//comepute the ADJV for CX2 FORCE
|
|
ret = computeAdjVert(ssCompData.cx2_fm,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
&adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjVert SS CX2 FORCE ADJV ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS CX2 FORCE ADJV computed!\n", tag);
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_FORCE_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node - 1
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX2_FORCE_ADJV_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdj(adjvert,
|
|
ssCompData.header.force_node - 1,
|
|
1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS IX2 FORCE ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS CX2 FORCE ADJV TEST:......", tag);
|
|
logError(0, "...........FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX2 FORCE ADJV TEST:.....", tag);
|
|
logError(0, "............OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjvert);
|
|
adjvert = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX2 FORCE ADJ TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
//SS TOTAL CX FORCE
|
|
logError(0, "%s SS TOTAL CX FORCE TEST:\n", tag);
|
|
if (todo->SelfForceCxTotal == 1 || todo->SelfForceCxTotalAdj == 1) {
|
|
ret = computeTotal(ssCompData.cx2_fm,
|
|
ssCompData.f_cx1,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
CX1_WEIGHT,
|
|
CX2_WEIGHT,
|
|
&total_cx);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeTotal Cx Force failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
return (ret | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
logError(0, "%s SS TOTAL CX FORCE MIN MAX TEST:\n", tag);
|
|
//load the min thresholds
|
|
if (todo->SelfForceCxTotal == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_FORCE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_FORCE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_FORCE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != ssCompData.header.force_node
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_FORCE_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapTotal(total_cx,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS TOTAL FORCE ");
|
|
logError(1, "failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s SS TOTAL FORCE MIN MAX ", tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL FORCE MIN MAX ", tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX FORCE MIN MAX TEST:", tag);
|
|
logError(0, ".................SKIPPED\n");
|
|
}
|
|
|
|
//SS TOTAL CX FORCE ADJV TEST
|
|
logError(0, "%s SS TOTAL CX FORCE ADJ TEST:\n", tag);
|
|
if (todo->SelfForceCxTotalAdj == 1) {
|
|
logError(0, "%s SS TOTAL CX FORCE ADJVERT ", tag);
|
|
logError(0, "TEST:\n");
|
|
|
|
//comepute the ADJV for CX2 FORCE
|
|
ret = computeAdjVertTotal(total_cx,
|
|
ssCompData.header.force_node,
|
|
1,
|
|
&total_adjvert);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjVert SS TOTAL CX FORCE");
|
|
logError(1, " ADJV failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS TOTAL CX FORCE ADJV computed!\n",
|
|
tag);
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_FORCE_ADJV_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns); //load the max thresholds
|
|
if (ret < 0
|
|
|| (trows != ssCompData.header.force_node - 1
|
|
|| tcolumns != 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_FORCE_ADJV_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdjTotal(total_adjvert,
|
|
ssCompData.header.force_node - 1,
|
|
1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS TOTAL CX FORCE");
|
|
logError(1, " failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s SS TOTAL CX FORCE ADJV ", tag);
|
|
logError(0, "TEST:.................FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX FORCE ADJV ", tag);
|
|
logError(0, "TEST:.................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjvert);
|
|
total_adjvert = NULL;
|
|
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX FORCE ADJ TEST:......",
|
|
tag);
|
|
logError(0, "..........SKIPPED\n");
|
|
}
|
|
kfree(total_cx);
|
|
total_cx = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX FORCE TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
|
|
//**************** SS SENSE CX **************************************/
|
|
//SS CX1 SENSE TEST
|
|
logError(0, "%s SS CX1 SENSE TEST:\n", tag);
|
|
if (todo->SelfSenseCx1 == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX1_SENSE_MIN_MAX,
|
|
&thresholds,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1 || tcolumns != 2)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX1_SENSE_MIN_MAX failed");
|
|
logError(1, "... ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
container = (u16) ssCompData.s_cx1;
|
|
//check the limits
|
|
ret = checkLimitsMinMax(&container,
|
|
1,
|
|
1,
|
|
thresholds[0],
|
|
thresholds[1]);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMinMax SS CX1 SENSE TEST ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX1 SENSE TEST:..............", tag);
|
|
logError(0, "...OK\n\n");
|
|
}
|
|
kfree(thresholds);
|
|
thresholds = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX1 SENSE TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
|
|
//SS CX2 SENSE TEST
|
|
logError(0, "%s SS CX2 SENSE MIN MAX TEST:\n", tag);
|
|
if (todo->SelfSenseCx2 == 1) {
|
|
//load the min thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_SENSE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX2_SENSE_MAP_MIN failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_SENSE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_CX2_SENSE_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMap(ssCompData.cx2_sn,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMap SS CX2 SENSE failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS CX2 SENSE MIN MAX TEST:......", tag);
|
|
logError(0, "...........FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX2 SENSE MIN MAX TEST:", tag);
|
|
logError(0, ".................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX2 SENSE MIN MAX TEST:.........", tag);
|
|
logError(0, "........SKIPPED\n");
|
|
}
|
|
logError(0, "%s SS CX2 SENSE ADJ TEST:\n", tag);
|
|
if (todo->SelfSenseCx2Adj == 1) {
|
|
//SS CX2 SENSE ADJH TEST
|
|
logError(0, "%s SS CX2 SENSE ADJHORIZ TEST:\n", tag);
|
|
ret = computeAdjHoriz(ssCompData.cx2_sn,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
&adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjHoriz SS CX2 SENSE ADJH ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS CX2 SENSE ADJH computed!\n", tag);
|
|
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_CX2_SENSE_ADJH_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node - 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_IX2_SENSE_MAP_MAX failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdj(adjhor,
|
|
1,
|
|
ssCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj SS CX2 SENSE ADJH ");
|
|
logError(1, "failed... ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS CX2 SENSE ADJH TEST:.........", tag);
|
|
logError(0, "........FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS CX2 SENSE ADJH TEST:.........", tag);
|
|
logError(0, "........OK\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(adjhor);
|
|
adjhor = NULL;
|
|
} else {
|
|
logError(0, "%s SS CX2 SENSE ADJ TEST:.................", tag);
|
|
logError(0, "SKIPPED\n\n");
|
|
}
|
|
|
|
//SS TOTAL CX SENSE
|
|
logError(0, "%s SS TOTAL CX SENSE TEST:\n", tag);
|
|
if (todo->SelfSenseCxTotal == 1 || todo->SelfSenseCxTotalAdj == 1) {
|
|
ret = computeTotal(ssCompData.cx2_sn,
|
|
ssCompData.s_cx1,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
CX1_WEIGHT,
|
|
CX2_WEIGHT,
|
|
&total_cx);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeTotal Cx Sense failed... ");
|
|
logError(1, "ERROR %02X\n", ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
logError(0, "%s SS TOTAL CX SENSE MIN MAX TEST:\n", tag);
|
|
//load the min thresholds
|
|
if (todo->SelfSenseCxTotal == 1) {
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_SENSE_MAP_MIN,
|
|
&thresholds_min,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_SENSE_MAP_MIN ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
//load the max thresholds
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_SENSE_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns);
|
|
if (ret < 0 || (trows != 1
|
|
|| tcolumns != ssCompData.header.sense_node)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_SENSE_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapTotal(total_cx,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
thresholds_min,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "heckLimitsMap SS TOTAL CX SENSE ");
|
|
logError(1, "failed... ERROR COUNT = %d\n",
|
|
ret);
|
|
logError(0, "%s SS TOTAL CX SENSE MIN ", tag);
|
|
logError(0, "MAX TEST:.................");
|
|
logError(0, "FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX SENSE MIN ", tag);
|
|
logError(0, "MAX TEST:................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_min);
|
|
thresholds_min = NULL;
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX SENSE MIN MAX TEST:", tag);
|
|
logError(0, ".................SKIPPED\n");
|
|
}
|
|
|
|
|
|
//SS TOTAL IX SENSE ADJH TEST
|
|
logError(0, "%s SS TOTAL CX SENSE ADJ TEST:\n", tag);
|
|
if (todo->SelfSenseCxTotalAdj == 1) {
|
|
logError(0, "%s SS TOTAL CX SENSE ADJHORIZ TEST:\n",
|
|
tag);
|
|
ret = computeAdjHorizTotal(total_cx,
|
|
1,
|
|
ssCompData.header.sense_node,
|
|
&total_adjhor);
|
|
if (ret < 0) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "computeAdjHoriz SS TOTAL CX ");
|
|
logError(1, "SENSE ADJH failed... ");
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
logError(0, "%s SS TOTAL CX SENSE ADJ HORIZ ", tag);
|
|
logError(0, "computed!\n");
|
|
|
|
ret = parseProductionTestLimits(path_limits,
|
|
SS_TOTAL_CX_SENSE_ADJH_MAP_MAX,
|
|
&thresholds_max,
|
|
&trows,
|
|
&tcolumns); //load the max thresholds
|
|
if (ret < 0 || (trows != 1 ||
|
|
tcolumns != ssCompData.header.sense_node - 1)) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "parseProductionTestLimits ");
|
|
logError(1, "SS_TOTAL_CX_SENSE_ADJH_MAP_MAX ");
|
|
logError(1, "failed... ERROR %02X\n",
|
|
ERROR_PROD_TEST_DATA);
|
|
ret |= ERROR_PROD_TEST_DATA;
|
|
goto ERROR_LIMITS;
|
|
}
|
|
|
|
//check the values with thresholds
|
|
ret = checkLimitsMapAdjTotal(total_adjhor,
|
|
1,
|
|
ssCompData.header.sense_node - 1,
|
|
thresholds_max);
|
|
if (ret != OK) {
|
|
logError(1, "%s production_test_data: ", tag);
|
|
logError(1, "checkLimitsMapAdj SS TOTAL ");
|
|
logError(1, "CX SENSE ADJH failed... ");
|
|
logError(1, "ERROR COUNT = %d\n", ret);
|
|
logError(0, "%s SS TOTAL CX SENSE ADJH ", tag);
|
|
logError(0, "TEST:...FAIL\n\n");
|
|
count_fail += 1;
|
|
if (stop_on_fail)
|
|
goto ERROR;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX SENSE ADJH TEST:",
|
|
tag);
|
|
logError(0, ".................OK\n\n");
|
|
}
|
|
|
|
kfree(thresholds_max);
|
|
thresholds_max = NULL;
|
|
kfree(total_adjhor);
|
|
total_adjhor = NULL;
|
|
} else {
|
|
logError(0, "%s SS TOTAL CX SENSE ADJ TEST:.", tag);
|
|
logError(0, "SKIPPED\n");
|
|
}
|
|
kfree(total_cx);
|
|
total_cx = NULL;
|
|
} else
|
|
logError(0, "%s SS TOTAL CX SENSE TEST:.....SKIPPED\n", tag);
|
|
|
|
|
|
ERROR:
|
|
logError(0, "%s\n", tag);
|
|
if (count_fail == 0) {
|
|
kfree(ssCompData.ix2_fm);
|
|
ssCompData.ix2_fm = NULL;
|
|
kfree(ssCompData.ix2_sn);
|
|
ssCompData.ix2_sn = NULL;
|
|
kfree(ssCompData.cx2_fm);
|
|
ssCompData.cx2_fm = NULL;
|
|
kfree(ssCompData.cx2_sn);
|
|
ssCompData.cx2_sn = NULL;
|
|
logError(0, "%s SS IX CX testes finished!........OK\n\n", tag);
|
|
ret = OK;
|
|
} else {
|
|
//print all kind of data in just one row for readability reason
|
|
print_frame_u8("SS Init Data Ix2_fm = ",
|
|
array1dTo2d_u8(ssCompData.ix2_fm,
|
|
ssCompData.header.force_node,
|
|
ssCompData.header.force_node),
|
|
1,
|
|
ssCompData.header.force_node);
|
|
print_frame_u8("SS Init Data Cx2_fm = ",
|
|
array1dTo2d_u8(ssCompData.cx2_fm,
|
|
ssCompData.header.force_node,
|
|
ssCompData.header.force_node),
|
|
1,
|
|
ssCompData.header.force_node);
|
|
print_frame_u8("SS Init Data Ix2_sn = ",
|
|
array1dTo2d_u8(ssCompData.ix2_sn,
|
|
ssCompData.header.sense_node,
|
|
ssCompData.header.sense_node),
|
|
1,
|
|
ssCompData.header.sense_node);
|
|
print_frame_u8("SS Init Data Cx2_sn = ",
|
|
array1dTo2d_u8(ssCompData.cx2_sn,
|
|
ssCompData.header.sense_node,
|
|
ssCompData.header.sense_node),
|
|
1,
|
|
ssCompData.header.sense_node);
|
|
logError(0, "%s SS IX CX testes finished!.................",
|
|
tag);
|
|
logError(0, "FAILED fails_count = %d\n\n", count_fail);
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(adjhor);
|
|
kfree(adjvert);
|
|
kfree(ix1_w);
|
|
kfree(ix2_w);
|
|
kfree(total_ix);
|
|
kfree(total_cx);
|
|
kfree(total_adjhor);
|
|
kfree(total_adjvert);
|
|
kfree(ssCompData.ix2_fm);
|
|
kfree(ssCompData.ix2_sn);
|
|
kfree(ssCompData.cx2_fm);
|
|
kfree(ssCompData.cx2_sn);
|
|
ret = (ERROR_TEST_CHECK_FAIL | ERROR_PROD_TEST_DATA);
|
|
}
|
|
return ret;
|
|
ERROR_LIMITS:
|
|
kfree(thresholds);
|
|
kfree(thresholds_min);
|
|
kfree(thresholds_max);
|
|
kfree(adjhor);
|
|
kfree(adjvert);
|
|
kfree(ix1_w);
|
|
kfree(ix2_w);
|
|
kfree(total_ix);
|
|
kfree(total_cx);
|
|
kfree(total_adjhor);
|
|
kfree(total_adjvert);
|
|
kfree(ssCompData.ix2_fm);
|
|
kfree(ssCompData.ix2_sn);
|
|
kfree(ssCompData.cx2_fm);
|
|
kfree(ssCompData.cx2_sn);
|
|
return ret;
|
|
}
|
|
|
|
int production_test_data(char *path_limits, int stop_on_fail,
|
|
struct TestToDo *todo)
|
|
{
|
|
int res = OK, ret;
|
|
|
|
if (todo == NULL) {
|
|
logError(0, "%s %s: ", tag, __func__);
|
|
logError(0, "No TestToDo specified!! ");
|
|
logError(0, "ERROR = %02X\n",
|
|
(ERROR_OP_NOT_ALLOW | ERROR_PROD_TEST_DATA));
|
|
return (ERROR_OP_NOT_ALLOW | ERROR_PROD_TEST_DATA);
|
|
}
|
|
|
|
logError(0, "%s DATA Production test is starting...\n", tag);
|
|
ret = production_test_ms_raw(path_limits, stop_on_fail, todo);
|
|
res |= ret;
|
|
if (ret < 0) {
|
|
logError(0, "%s %s: ", tag, __func__);
|
|
logError(0, "production_test_ms_raw failed... ");
|
|
logError(0, "ERROR = %02X\n", ret);
|
|
if (stop_on_fail == 1)
|
|
goto END;
|
|
}
|
|
|
|
ret = production_test_ms_cx(path_limits, stop_on_fail, todo);
|
|
res |= ret;
|
|
if (ret < 0) {
|
|
logError(0, "%s %s: ", tag, __func__);
|
|
logError(0, "production_test_ms_cx failed... ");
|
|
logError(0, "ERROR = %02X\n", ret);
|
|
if (stop_on_fail == 1)
|
|
goto END;
|
|
}
|
|
|
|
ret = production_test_ss_raw(path_limits, stop_on_fail, todo);
|
|
res |= ret;
|
|
if (ret < 0) {
|
|
logError(0, "%s %s: ", tag, __func__);
|
|
logError(0, "production_test_ss_raw failed... ");
|
|
logError(0, "ERROR = %02X\n", ret);
|
|
if (stop_on_fail == 1)
|
|
goto END;
|
|
}
|
|
|
|
ret = production_test_ss_ix_cx(path_limits, stop_on_fail, todo);
|
|
res |= ret;
|
|
if (ret < 0) {
|
|
logError(0, "%s %s: ", tag, __func__);
|
|
logError(0, "production_test_ss_ix_cx failed... ");
|
|
logError(0, "ERROR = %02X\n", ret);
|
|
if (stop_on_fail == 1)
|
|
goto END;
|
|
}
|
|
|
|
END:
|
|
if (res < OK)
|
|
logError(0, "%s DATA Production test failed!\n", tag);
|
|
else
|
|
logError(0, "%s DATA Production test finished!\n", tag);
|
|
return res;
|
|
}
|
|
|
|
|
|
int save_mp_flag(u32 signature)
|
|
{
|
|
int res = -1;
|
|
int i;
|
|
u8 cmd[6] = {FTS_CMD_WRITE_MP_FLAG, 0x00, 0x00, 0x00, 0x00, 0x00};
|
|
|
|
u32ToU8(signature, &cmd[2]);
|
|
|
|
logError(0, "%s Starting Saving Flag with signature = %08X ...\n",
|
|
tag, signature);
|
|
|
|
for (i = 0; i < SAVE_FLAG_RETRY && res < OK; i++) {
|
|
logError(0, "%s Attempt number %d to save mp flag !\n",
|
|
tag, i+1);
|
|
logError(0, "%s Command write flag sent...\n", tag);
|
|
res = fts_writeFwCmd(cmd, 6);
|
|
if (res >= OK)
|
|
res = save_cx_tuning();
|
|
}
|
|
|
|
if (res < OK) {
|
|
logError(1, "%s %s: ERROR %08X ...\n", tag, __func__, res);
|
|
} else {
|
|
logError(0, "%s Saving Flag DONE!\n", tag);
|
|
res = OK;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int parseProductionTestLimits(char *path, char *label,
|
|
int **data, int *row, int *column)
|
|
{
|
|
int find = 0;
|
|
char *token = NULL;
|
|
int i = 0;
|
|
int j = 0;
|
|
int z = 0;
|
|
|
|
char *line2 = NULL;
|
|
char line[800];
|
|
int fd = -1;
|
|
char *buf = NULL;
|
|
int n, size, pointer = 0, ret = OK;
|
|
char *data_file = NULL;
|
|
#ifndef LIMITS_H_FILE
|
|
const struct firmware *fw = NULL;
|
|
struct device *dev = NULL;
|
|
|
|
dev = getDev();
|
|
if (dev != NULL)
|
|
fd = request_firmware(&fw, path, dev);
|
|
#else
|
|
fd = 0;
|
|
#endif
|
|
|
|
if (fd != 0) {
|
|
logError(0, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_FILE_NOT_FOUND);
|
|
return ERROR_FILE_NOT_FOUND;
|
|
}
|
|
|
|
#ifndef LIMITS_H_FILE
|
|
size = fw->size;
|
|
data_file = (char *)fw->data;
|
|
logError(0, "%s Start to reading %s...\n", tag, path);
|
|
#else
|
|
size = LIMITS_SIZE_NAME;
|
|
data_file = (char *)(LIMITS_ARRAY_NAME);
|
|
#endif
|
|
logError(0, "%s The size of the limits file is %d bytes\n", tag, size);
|
|
|
|
while (find == 0) {
|
|
//start to look for the wanted label
|
|
if (readLine(&data_file[pointer], line, size-pointer, &n) < 0) {
|
|
find = -1;
|
|
break;
|
|
}
|
|
pointer += n;
|
|
//each header row start with
|
|
// *ex. *label, n_row, n_colum
|
|
if (line[0] != '*')
|
|
continue;
|
|
|
|
line2 = kstrdup(line, GFP_KERNEL);
|
|
if (line2 == NULL) {
|
|
logError(1, "%s %s:kstrdup ERR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
ret = ERROR_ALLOC;
|
|
goto END;
|
|
}
|
|
buf = line2;
|
|
line2 += 1;
|
|
token = strsep(&line2, ",");
|
|
//if the row is the wanted one i
|
|
//retrieve rows and columns info
|
|
if (strcmp(token, label) == 0) {
|
|
find = 1;
|
|
token = strsep(&line2, ",");
|
|
if (token != NULL) {
|
|
ret = kstrtoint(token, 10, row);
|
|
if (ret != 0)
|
|
return -EINVAL;
|
|
logError(0, "%s Row = %d\n", tag, *row);
|
|
} else {
|
|
logError(1, "%s %s 1:ERROR %02X\n",
|
|
tag, __func__, ERROR_FILE_PARSE);
|
|
//release_firmware(fw);
|
|
//return ERROR_FILE_PARSE;
|
|
ret = ERROR_FILE_PARSE;
|
|
goto END;
|
|
}
|
|
token = strsep(&line2, ",");
|
|
if (token != NULL) {
|
|
ret = kstrtoint(token, 10, column);
|
|
if (ret != 0)
|
|
return -EINVAL;
|
|
logError(0, "%s Column = %d\n", tag, *column);
|
|
} else {
|
|
logError(1, "%s %s 2: ERROR %02X\n",
|
|
tag, __func__, ERROR_FILE_PARSE);
|
|
//release_firmware(fw);
|
|
//return ERROR_FILE_PARSE;
|
|
ret = ERROR_FILE_PARSE;
|
|
goto END;
|
|
}
|
|
kfree(buf);
|
|
buf = NULL;
|
|
//allocate memory for containing data
|
|
*data = (int *)kmalloc_array(((*row) * (*column)),
|
|
sizeof(int), GFP_KERNEL);
|
|
j = 0;
|
|
if (*data == NULL) {
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_ALLOC);
|
|
//release_firmware(fw);
|
|
//return ERROR_ALLOC;
|
|
ret = ERROR_ALLOC;
|
|
goto END;
|
|
}
|
|
//start to read the data
|
|
for (i = 0; i < *row; i++) {
|
|
//line = buf;
|
|
if (readLine(&data_file[pointer], line,
|
|
size-pointer, &n) < 0) {
|
|
logError(1, "%s %s : ERROR %02X\n",
|
|
tag, __func__, ERROR_FILE_READ);
|
|
//release_firmware(fw);
|
|
//return ERROR_FILE_READ
|
|
ret = ERROR_FILE_READ;
|
|
goto END;
|
|
}
|
|
pointer += n;
|
|
line2 = kstrdup(line, GFP_KERNEL);
|
|
if (line2 == NULL) {
|
|
logError(1, "%s %s: kstrdup ",
|
|
tag, __func__);
|
|
logError(1, "ERROR %02X\n",
|
|
ERROR_ALLOC);
|
|
ret = ERROR_ALLOC;
|
|
goto END;
|
|
}
|
|
buf = line2;
|
|
token = strsep(&line2, ",");
|
|
for (z = 0;
|
|
(z < *column) && (token != NULL); z++) {
|
|
ret = kstrtoint(token,
|
|
10,
|
|
((*data) + j));
|
|
if (ret != 0)
|
|
return -EINVAL;
|
|
j++;
|
|
token = strsep(&line2, ",");
|
|
}
|
|
kfree(buf);
|
|
buf = NULL;
|
|
}
|
|
//check that all the data are read
|
|
if (j == ((*row) * (*column))) {
|
|
logError(0, "%s READ DONE!\n", tag);
|
|
//release_firmware(fw);
|
|
//return OK;
|
|
ret = OK;
|
|
goto END;
|
|
}
|
|
logError(1, "%s %s 3:ERROR %02X\n",
|
|
tag, __func__, ERROR_FILE_PARSE);
|
|
//release_firmware(fw);
|
|
//return ERROR_FILE_PARSE;
|
|
ret = ERROR_FILE_PARSE;
|
|
goto END;
|
|
}
|
|
kfree(buf);
|
|
buf = NULL;
|
|
|
|
}
|
|
logError(1, "%s %s: ERROR %02X\n",
|
|
tag, __func__, ERROR_LABEL_NOT_FOUND);
|
|
ret = ERROR_LABEL_NOT_FOUND;
|
|
END:
|
|
kfree(buf);
|
|
#ifndef LIMITS_H_FILE
|
|
release_firmware(fw);
|
|
#endif
|
|
return ret;
|
|
|
|
}
|
|
|
|
int readLine(char *data, char *line, int size, int *n)
|
|
{
|
|
int i = 0;
|
|
|
|
if (size < 1)
|
|
return -EINVAL;
|
|
|
|
while (data[i] != '\n' && i < size) {
|
|
line[i] = data[i];
|
|
i++;
|
|
}
|
|
*n = i + 1;
|
|
line[i] = '\0';
|
|
|
|
return OK;
|
|
}
|
|
|
|
|