看代码猜意思

一、根据一定的策略和算法插入链表

  walk=&sg_timer_list.mount_list;
    while(*walk) {
        if((*walk)->run_time>node->run_time) {
            node->next=(*walk);
            break;
        }
        walk=&(*walk)->next;
    }

  *walk=node;

二、初始化空闲链表

  while(i<MAX_TIMER_NODE) {
        sg_timer_list.NODE_MEM[i].next=sg_timer_list.free_list;
        sg_timer_list.free_list=&sg_timer_list.NODE_MEM[i];
        i++;
    }