From 3d403fed8fd8a8ba9b10aac4a1959fa26789c4d0 Mon Sep 17 00:00:00 2001
From: Martin Budden <mjbudden@gmail.com>
Date: Wed, 20 Jan 2016 16:23:57 +0000
Subject: [PATCH] Minor optimisation: only inclued queueContains if it is
 required.

---
 src/main/scheduler.c | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/src/main/scheduler.c b/src/main/scheduler.c
index f706b38328..dbed742b29 100755
--- a/src/main/scheduler.c
+++ b/src/main/scheduler.c
@@ -49,8 +49,11 @@ uint16_t averageSystemLoadPercent = 0;
 static int taskQueuePos = 0;
 static int taskQueueSize = 0;
 // No need for a linked list for the queue, since items are only inserted at startup
+#ifdef UNIT_TEST
 STATIC_UNIT_TESTED cfTask_t* taskQueueArray[TASK_COUNT + 1]; // 1 extra space so test code can check for buffer overruns
-
+#else
+static cfTask_t* taskQueueArray[TASK_COUNT];
+#endif
 STATIC_UNIT_TESTED void queueClear(void)
 {
     memset(taskQueueArray, 0, (int)(sizeof(taskQueueArray)));
@@ -65,6 +68,7 @@ STATIC_UNIT_TESTED int queueSize(void)
 }
 #endif
 
+#if !defined(SKIP_TASK_STATISTICS) || defined(UNIT_TEST)
 STATIC_UNIT_TESTED bool queueContains(cfTask_t *task)
 {
     for (int ii = 0; ii < taskQueueSize; ++ii) {
@@ -74,6 +78,7 @@ STATIC_UNIT_TESTED bool queueContains(cfTask_t *task)
     }
     return false;
 }
+#endif
 
 STATIC_UNIT_TESTED void queueAdd(cfTask_t *task)
 {