diff options
| author | davidycchen <davidycchen@google.com> | 2019-09-27 09:29:55 +0800 |
|---|---|---|
| committer | David Chen <davidycchen@google.com> | 2019-10-05 02:16:09 +0000 |
| commit | f0b761ffa445e96049801c7b56c6f5ae88bf0000 (patch) | |
| tree | 07507c3048d2fe991f4dc3380ced302bf5ec0ce0 | |
| parent | 7f16a8546f252277caf6a0b45f908673dd07348f (diff) | |
| download | fts_touch_s5-f0b761ffa445e96049801c7b56c6f5ae88bf0000.tar.gz | |
touch:fts: print the sensor node while FATP test fail
Print the failed sensor routing node in the FATP ITO test
Bug: 141721123
Change-Id: I19f9d5908029bc01a1cafe3e367e567457a70922
Signed-off-by: davidycchen <davidycchen@google.com>
(cherry picked from commit 6873e1f341948d56875501d9208fd828e25f1f62)
| -rw-r--r-- | fts_lib/ftsTest.c | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/fts_lib/ftsTest.c b/fts_lib/ftsTest.c index 8c1acc8..0deb189 100644 --- a/fts_lib/ftsTest.c +++ b/fts_lib/ftsTest.c @@ -603,8 +603,8 @@ int checkLimitsMinMax(short *data, int row, int column, int min, int max) for (j = 0; j < column; j++) { if (data[i * column + j] < min || data[i * column + j] > max) { - pr_debug("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", - i, j, data[i * column + j], min, max); + pr_info("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", + __func__, i, j, data[i * column + j], min, max); count++; } } @@ -729,8 +729,8 @@ int checkLimitsMap(i8 *data, int row, int column, int *min, int *max) for (j = 0; j < column; j++) { if (data[i * column + j] < min[i * column + j] || data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", - i, j, data[i * column + j], + pr_info("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", + __func__, i, j, data[i * column + j], min[i * column + j], max[i * column + j]); count++; @@ -764,8 +764,8 @@ int checkLimitsMapTotal(short *data, int row, int column, int *min, int *max) for (j = 0; j < column; j++) { if (data[i * column + j] < min[i * column + j] || data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", - i, j, data[i * column + j], + pr_info("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", + __func__, i, j, data[i * column + j], min[i * column + j], max[i * column + j]); count++; @@ -799,8 +799,8 @@ int checkLimitsMapFromU(u8 *data, int row, int column, int *min, int *max) for (j = 0; j < column; j++) { if (data[i * column + j] < min[i * column + j] || data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", - i, j, data[i * column + j], + pr_info("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", + __func__, i, j, data[i * column + j], min[i * column + j], max[i * column + j]); count++; @@ -834,8 +834,8 @@ int checkLimitsMapTotalFromU(u16 *data, int row, int column, int *min, int *max) for (j = 0; j < column; j++) { if (data[i * column + j] < min[i * column + j] || data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", - i, j, data[i * column + j], + pr_info("%s: Node[%d,%d] = %d exceed limit [%d, %d]\n", + __func__, i, j, data[i * column + j], min[i * column + j], max[i * column + j]); count++; @@ -866,8 +866,8 @@ int checkLimitsMapAdj(u8 *data, int row, int column, int *max) for (i = 0; i < row; i++) { for (j = 0; j < column; j++) { if (data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit > %d\n", - i, j, + pr_info("%s: Node[%d,%d] = %d exceed limit > %d\n", + __func__, i, j, data[i * column + j], max[i * column + j]); count++; @@ -898,8 +898,8 @@ int checkLimitsMapAdjTotal(u16 *data, int row, int column, int *max) for (i = 0; i < row; i++) { for (j = 0; j < column; j++) { if (data[i * column + j] > max[i * column + j]) { - pr_debug("%s: Node[%d,%d] = %d exceed limit > %d\n", - i, j, + pr_info("%s: Node[%d,%d] = %d exceed limit > %d\n", + __func__, i, j, data[i * column + j], max[i * column + j]); count++; |