/*

 * Copyright (c) 2020 Red Hat, Inc.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 2

 * of the License, or (at your option) any later version.

 * 

 * 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.

 * 

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA

 * 02110-1301, USA. 

 *

 * $Id: //eng/vdo-releases/aluminum/src/c++/vdo/kernel/deadlockQueue.c#1 $

 */

#include "deadlockQueue.h"

/**********************************************************************/

void initializeDeadlockQueue(DeadlockQueue *queue)

{

  spin_lock_init(&queue->lock);

  bio_list_init(&queue->list);

}

/**********************************************************************/

void addToDeadlockQueue(DeadlockQueue *queue, BIO *bio, Jiffies arrivalTime)

{

  spin_lock(&queue->lock);

  if (bio_list_empty(&queue->list)) {

    /*

     * If we get more than one pending at once, this will be inaccurate for

     * some of them. Oh well. If we've gotten here, we're trying to avoid a

     * deadlock; stats are a secondary concern.

     */

    queue->arrivalTime = arrivalTime;

  }

  bio_list_add(&queue->list, bio);

  spin_unlock(&queue->lock);

}