static int scan_it ( )

static

Definition at line 661 of file dtq.c.

References dll_get_next(), dll_remove(), Memory::free(), i, MAX_TIMER_QUEUES, QUEUE_ENT::queue_head, queue_id, rem_deleted_entries(), QUEUE_ENT::remove_entries, SPECIAL_QUEUE, timer_entry::tag, timer_entry::time, timer_entry::time_left, timer_entry::user_routine, and WRITE_QUEUE.

Referenced by alrm_sig_handler(), and dim_dtq_stop().

{
        int queue_id, i, n = 0;
        static int curr_queue_id = 0;
        static TIMR_ENT *curr_entry = 0;
        TIMR_ENT *auxp, *prevp, *queue_head;
        TIMR_ENT *done[1024];

        DISABLE_AST
        queue_head = timer_queues[WRITE_QUEUE].queue_head;
        if(!queue_head)
        {
                ENABLE_AST
                return(0);
        }
        auxp = queue_head;
        while( (auxp = (TIMR_ENT *)dll_get_next((DLL *)queue_head,(DLL *)auxp)) )
        {       
                done[n++] = auxp;
                if(n == 1000)
                        break;
        }
        ENABLE_AST
        for(i = 0; i < n; i++)
        {
                auxp = done[i];
                auxp->user_routine( auxp->tag );
        }
        {
                DISABLE_AST
                for(i = 0; i < n; i++)
                {
                        auxp = done[i];
                        dll_remove(auxp);
                        free(auxp);
                }
                if(n == 1000)
                {
                        ENABLE_AST
                        return(1);
                }
                ENABLE_AST
        }
        {
        DISABLE_AST
        queue_head = timer_queues[SPECIAL_QUEUE].queue_head;
        auxp = queue_head;
        prevp = auxp;
        while( (auxp = (TIMR_ENT *)dll_get_next((DLL *)queue_head,(DLL *)auxp)) )
        {       
                if(auxp->time_left <= 0)
                {
                        dll_remove(auxp);
                        auxp->user_routine( auxp->tag );
                        free(auxp);
                        auxp = prevp;
                        n++;
                        if(n == 100)
                        {
                                ENABLE_AST
                                return(1);
                        }
                }
                else
                        prevp = auxp;
        }
        for( queue_id = curr_queue_id; queue_id < MAX_TIMER_QUEUES; queue_id++ ) 
        {
                if( (queue_head = timer_queues[queue_id].queue_head) == NULL )
                        continue;
                Inside_ast = 1;
                if((curr_entry) && (queue_id == curr_queue_id))
                        auxp = curr_entry;
                else
                        auxp = queue_head;
                while( (auxp = (TIMR_ENT *)dll_get_next((DLL *)queue_head,(DLL *)auxp)) )
                {       
                        if(auxp->time_left <= 0)
                        {
                                auxp->user_routine( auxp->tag );
                                auxp->time_left = auxp->time; /*restart clock*/
                                n++;
                                if(n == 100)
                                {
                                        curr_queue_id = queue_id;
                                        curr_entry = auxp;
                                        ENABLE_AST
                                        return(1);
                                }
                        }
                }
                Inside_ast = 0;
                if( timer_queues[queue_id].remove_entries ) {
                        rem_deleted_entries( queue_id );
                        timer_queues[queue_id].remove_entries = 0;
                }
        }
        curr_queue_id = 0;
        curr_entry = 0;
        ENABLE_AST
        }
        return(0);
}

Here is the call graph for this function:

Here is the caller graph for this function: