Merge pull request #3080 from ERGO-Code/hipo-blas-def

Check BLAS used in HiPO at runtime

Author: filikat

highs/ipm/hipo/ipm/FactorHiGHSSolver.cpp

@@ -1,5 +1,6 @@
 #include "FactorHiGHSSolver.h"
 
+#include <cstring>
 #include <limits>
 
 #include "HighsExternalApi.h"
@@ -572,6 +573,10 @@ Int FactorHiGHSSolver::setNla() {
   return kStatusOk;
 }
 
+static bool usingAppleBlas() {
+  return strstr(HighsExtras::blas::getInfo()->provider, "Apple") != nullptr;
+}
+
 void FactorHiGHSSolver::setParallel() {
   // Set parallel options
   bool parallel_tree = false;
@@ -597,35 +602,35 @@ void FactorHiGHSSolver::setParallel() {
       assert(1 == 0);
 
   } else if (options_.parallel == kHighsChooseString) {
-#ifdef HIPO_USES_APPLE_BLAS
-    // Blas on Apple do not work well with parallel_node, but parallel_tree
-    // seems to always be beneficial.
-    parallel_node = false;
-    parallel_tree = true;
-#else
-    // Otherwise, parallel_node is active because it is triggered only if the
-    // frontal matrix is large enough anyway.
-    parallel_node = true;
-
-    // parallel_tree instead is chosen with a heuristic
-
-    double tree_speedup = S_.flops() / S_.critops();
-    double sn_size = (double)S_.size() / S_.sn();
-
-    bool enough_sn = S_.sn() > kMinNumberSn;
-    bool enough_flops = S_.flops() > kLargeFlopsThresh;
-    bool speedup_is_large = tree_speedup > kLargeSpeedupThresh;
-    bool sn_are_large = sn_size > kLargeSnThresh;
-    bool sn_are_not_small = sn_size > kSmallSnThresh;
-
-    // parallel_tree is active if the supernodes are large, or if there is a
-    // large expected speedup and the supernodes are not too small, provided
-    // that the number of flops and supernodes is not too small.
-    if (enough_sn && enough_flops &&
-        (sn_are_large || (speedup_is_large && sn_are_not_small))) {
+    if (usingAppleBlas()) {
+      // Blas on Apple do not work well with parallel_node, but parallel_tree
+      // seems to always be beneficial.
+      parallel_node = false;
       parallel_tree = true;
+    } else {
+      // Otherwise, parallel_node is active because it is triggered only if the
+      // frontal matrix is large enough anyway.
+      parallel_node = true;
+
+      // parallel_tree instead is chosen with a heuristic
+
+      double tree_speedup = S_.flops() / S_.critops();
+      double sn_size = (double)S_.size() / S_.sn();
+
+      bool enough_sn = S_.sn() > kMinNumberSn;
+      bool enough_flops = S_.flops() > kLargeFlopsThresh;
+      bool speedup_is_large = tree_speedup > kLargeSpeedupThresh;
+      bool sn_are_large = sn_size > kLargeSnThresh;
+      bool sn_are_not_small = sn_size > kSmallSnThresh;
+
+      // parallel_tree is active if the supernodes are large, or if there is a
+      // large expected speedup and the supernodes are not too small, provided
+      // that the number of flops and supernodes is not too small.
+      if (enough_sn && enough_flops &&
+          (sn_are_large || (speedup_is_large && sn_are_not_small))) {
+        parallel_tree = true;
+      }
     }
-#endif
 
     // If serial memory is too large, switch off tree parallelism to avoid
     // running out of memory