Lines Matching refs:search
603 memorystatus_node *node, *search;
652 /* Higher priority value (ie less important) - search backwards */
653 search = TAILQ_PREV(node, memorystatus_list_head, link);
657 while (search && (search->priority <= node->priority)) {
658 search = TAILQ_PREV(search, memorystatus_list_head, link);
660 if (search) {
661 TAILQ_INSERT_AFTER(&memorystatus_list, search, node, link);
666 /* Lower priority value (ie more important) - search forwards */
667 search = TAILQ_NEXT(node, link);
671 while (search && (search->priority >= node->priority)) {
672 search = TAILQ_NEXT(search, link);
674 if (search) {
675 TAILQ_INSERT_BEFORE(search, node, link);
711 /* If not, search the main list */