85     ListNode *match;  in OH_ListAddWithOrder()  local
91     match = head->next;  in OH_ListAddWithOrder()
92     while ((match != NULL) && (match != head)) {  in OH_ListAddWithOrder()
93         if (compareProc(match, item) > 0) {  in OH_ListAddWithOrder()
96         match = match->next;  in OH_ListAddWithOrder()
98     if (match == NULL) {  in OH_ListAddWithOrder()
103     item->next = match;  in OH_ListAddWithOrder()
104     item->prev = match->prev;  in OH_ListAddWithOrder()
105     match->prev->next = item;  in OH_ListAddWithOrder()
106     match->prev = item;  in OH_ListAddWithOrder()
119     ListNode *match;  in OH_ListFind()  local
124     match = head->next;  in OH_ListFind()
125     while ((match != NULL) && (match != head)) {  in OH_ListFind()
126         if (compareProc(match, data) == 0) {  in OH_ListFind()
127             return match;  in OH_ListFind()
129         match = match->next;  in OH_ListFind()
154     ListNode *match;  in OH_ListTraversal()  local
162         match = head->prev;  in OH_ListTraversal()
164         match = head->next;  in OH_ListTraversal()
166     while ((match != NULL) && (match != head)) {  in OH_ListTraversal()
168             next = match->prev;  in OH_ListTraversal()
170             next = match->next;  in OH_ListTraversal()
172         int ret = traversalProc(match, data);  in OH_ListTraversal()
176         match = next;  in OH_ListTraversal()