[Beignet] [PATCH] Provide more possible candidate of load/store as possible.

[yan.wang at linux.intel.com]

From: Yan Wang <yan.wang at linux.intel.com>

Avoid search range too small in same case like vector of float.
It will lead more load/store merged for improving perforamnce.

Signed-off-by: Yan Wang <yan.wang at linux.intel.com>
---
 backend/src/llvm/llvm_loadstore_optimization.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/backend/src/llvm/llvm_loadstore_optimization.cpp b/backend/src/llvm/llvm_loadstore_optimization.cpp
index e797e98..e569a8e 100644
--- a/backend/src/llvm/llvm_loadstore_optimization.cpp
+++ b/backend/src/llvm/llvm_loadstore_optimization.cpp
@@ -180,7 +180,7 @@ namespace gbe {
     BasicBlock::iterator J = start;
     ++J;
 
-    unsigned maxLimit = maxVecSize * 8;
+    unsigned maxLimit = std::max(maxVecSize * 8, 150u);
     bool reordered = false;
 
     for(unsigned ss = 0; J != E && ss <= maxLimit; ++ss, ++J) {
-- 
2.7.4