!9451 更新模型和修改Promise和Callback调用方式

Merge pull request !9451 from nierong/master

ai/mindspore/mindsporectest/src/ohos_common.cpp

@@ -165,11 +165,12 @@ bool allclose(float *a, float *b, uint64_t count, float rtol = 1e-05,
     if (i == count - 1) {
       printf("     ……\n");
       printf("\n *** Total fail_count: %u\n", fail_count);
-      printf("\n     fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
-             tol / fail_count);
-      printf("\n     fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
-      printf("\n     fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);
-
+      if (fail_count != 0) {
+        printf("\n     fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
+              tol / fail_count);
+        printf("\n     fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
+        printf("\n     fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);
+      }
       c = c + count;
       printf("\n     avg : %f\n", sum / count);
       printf("\n     min : %f\n", minimum);
@@ -254,10 +255,12 @@ bool allclose_int8(uint8_t *a, uint8_t *b, uint64_t count, float rtol = 1e-05,
     if (i == count - 1) {
       printf("     ……\n");
       printf("\n *** Total fail_count: %u\n", fail_count);
-      printf("\n     fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
-             tol / fail_count);
-      printf("\n     fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
-      printf("\n     fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);
+      if (fail_count != 0) {
+        printf("\n     fabs(a[i] - b[i])/(fabs(b[i])+1) : %f\n",
+              tol / fail_count);
+        printf("\n     fabs(a[i] - b[i]) : %f\n", tol1 / fail_count);
+        printf("\n     fabs(a[i] - b[i])/fabs(b[i]) : %f\n", tol2 / fail_count);
+      }
 
       c = c + count;
       printf("\n     avg : %f\n", sum / count);