You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
91 lines
2.0 KiB
91 lines
2.0 KiB
15 years ago
|
/*
|
||
|
|
* Copyright (c) 2005-2009 Brocade Communications Systems, Inc.
|
||
|
|
* All rights reserved
|
||
|
|
* www.brocade.com
|
||
|
|
*
|
||
|
|
* Linux driver for Brocade Fibre Channel Host Bus Adapter.
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or modify it
|
||
|
|
* under the terms of the GNU General Public License (GPL) Version 2 as
|
||
|
|
* published by the Free Software Foundation
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful, but
|
||
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
|
|
* General Public License for more details.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <bfa_timer.h>
|
||
|
|
#include <cs/bfa_debug.h>
|
||
|
|
|
||
|
|
void
|
||
|
|
bfa_timer_init(struct bfa_timer_mod_s *mod)
|
||
|
|
{
|
||
|
|
INIT_LIST_HEAD(&mod->timer_q);
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
bfa_timer_beat(struct bfa_timer_mod_s *mod)
|
||
|
|
{
|
||
|
|
struct list_head *qh = &mod->timer_q;
|
||
|
|
struct list_head *qe, *qe_next;
|
||
|
|
struct bfa_timer_s *elem;
|
||
|
|
struct list_head timedout_q;
|
||
|
|
|
||
|
|
INIT_LIST_HEAD(&timedout_q);
|
||
|
|
|
||
|
|
qe = bfa_q_next(qh);
|
||
|
|
|
||
|
|
while (qe != qh) {
|
||
|
|
qe_next = bfa_q_next(qe);
|
||
|
|
|
||
|
|
elem = (struct bfa_timer_s *) qe;
|
||
|
|
if (elem->timeout <= BFA_TIMER_FREQ) {
|
||
|
|
elem->timeout = 0;
|
||
|
|
list_del(&elem->qe);
|
||
|
|
list_add_tail(&elem->qe, &timedout_q);
|
||
|
|
} else {
|
||
|
|
elem->timeout -= BFA_TIMER_FREQ;
|
||
|
|
}
|
||
|
|
|
||
|
|
qe = qe_next; /* go to next elem */
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Pop all the timeout entries
|
||
|
|
*/
|
||
|
|
while (!list_empty(&timedout_q)) {
|
||
|
|
bfa_q_deq(&timedout_q, &elem);
|
||
|
|
elem->timercb(elem->arg);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Should be called with lock protection
|
||
|
|
*/
|
||
|
|
void
|
||
|
|
bfa_timer_begin(struct bfa_timer_mod_s *mod, struct bfa_timer_s *timer,
|
||
|
|
void (*timercb) (void *), void *arg, unsigned int timeout)
|
||
|
|
{
|
||
|
|
|
||
|
|
bfa_assert(timercb != NULL);
|
||
|
|
bfa_assert(!bfa_q_is_on_q(&mod->timer_q, timer));
|
||
|
|
|
||
|
|
timer->timeout = timeout;
|
||
|
|
timer->timercb = timercb;
|
||
|
|
timer->arg = arg;
|
||
|
|
|
||
|
|
list_add_tail(&timer->qe, &mod->timer_q);
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Should be called with lock protection
|
||
|
|
*/
|
||
|
|
void
|
||
|
|
bfa_timer_stop(struct bfa_timer_s *timer)
|
||
|
|
{
|
||
|
|
bfa_assert(!list_empty(&timer->qe));
|
||
|
|
|
||
|
|
list_del(&timer->qe);
|
||
|
|
}
|