[Beignet] [PATCH] GBE: reorder the condition to avoid array overflow.
Yang Rong
rong.r.yang at intel.com
Fri Jul 1 09:40:42 UTC 2016
Signed-off-by: Yang Rong <rong.r.yang at 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 95c69e0..e797e98 100644
--- a/backend/src/llvm/llvm_loadstore_optimization.cpp
+++ b/backend/src/llvm/llvm_loadstore_optimization.cpp
@@ -257,7 +257,7 @@ namespace gbe {
unsigned size = toBeDeleted.size();
if (reorder) {
unsigned i = 0;
- while (toBeDeleted[i] == &*safe && i < size) {
+ while (i < size && toBeDeleted[i] == &*safe) {
++i;
++safe;
}
--
2.1.4
More information about the Beignet
mailing list