Wrong implementation of 'q_delete_dup'

This modification is used to analysis error and
performance of wrong implementation of 'q_delete_dup'.

Change-Id: Ida368515871e9535eaa0bf4898c1ab435f021b7a

Author: PoChuan994

queue.c

@@ -160,33 +160,26 @@ bool q_delete_dup(struct list_head *head)
     // https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
     volatile struct list_head *dummy = head;
     (void) dummy;
-
     if (!head || list_empty(head)) /* input validation */
         return false;
 
+    bool flag = false;
     element_t *curr_entry = list_first_entry(head, element_t, list);
+    element_t *next_entry;
     while (&curr_entry->list != head) {
-        struct list_head *next = curr_entry->list.next;
-        element_t *next_entry = list_entry(next, element_t, list);
-
-        /* check if there is duplicate element */
-        bool check = false;
+        next_entry = list_entry(curr_entry->list.next, element_t, list);
         while (&next_entry->list != head &&
                !strcmp(curr_entry->value, next_entry->value)) {
-            struct list_head *tmp = next_entry->list.next;
             list_del(&next_entry->list);
             q_release_element(next_entry);
-            next_entry = list_entry(tmp, element_t, list);
-            check = true;
+            /* update next pointer */
+            next_entry = list_entry(curr_entry->list.next, element_t, list);
+            flag = true;
         }
-
-        if (check) {
-            struct list_head *tmp = curr_entry->list.next;
+        if (flag) { /*need remove current node*/
             list_del(&curr_entry->list);
             q_release_element(curr_entry);
-            curr_entry = list_entry(tmp, element_t, list);
-        } else {
-            curr_entry = next_entry;
+            flag = false;
         }
     }
     return true;