include/net/irda/irqueue.h

   1 /*********************************************************************
   2  *
   3  * Filename:      irqueue.h
   4  * Version:       0.3
   5  * Description:   General queue implementation
   6  * Status:        Experimental.
   7  * Author:        Dag Brattli <dagb@cs.uit.no>
   8  * Created at:    Tue Jun  9 13:26:50 1998
   9  * Modified at:   Thu Jul  1 10:18:21 1999
  10  * Modified by:   Dag Brattli <dagb@cs.uit.no>
  11  *
  12  *     Copyright (C) 1998-1999, Aage Kvalnes <aage@cs.uit.no>
  13  *     Copyright (c) 1998, Dag Brattli
  14  *     All Rights Reserved.
  15  *
  16  *     This code is taken from the Vortex Operating System written by Aage
  17  *     Kvalnes and has been ported to Linux and Linux/IR by Dag Brattli
  18  *
  19  *     This program is free software; you can redistribute it and/or
  20  *     modify it under the terms of the GNU General Public License as
  21  *     published by the Free Software Foundation; either version 2 of
  22  *     the License, or (at your option) any later version.
  23  *
  24  *     Neither Dag Brattli nor University of Tromsø admit liability nor
  25  *     provide warranty for any of this software. This material is
  26  *     provided "AS-IS" and at no charge.
  27  *
  28  ********************************************************************/
  29
  30 #include <linux/types.h>
  31 #include <linux/spinlock.h>
  32
  33 #ifndef QUEUE_H
  34 #define QUEUE_H
  35
  36 #define NAME_SIZE      32
  37
  38 /*
  39  * Hash types
  40  */
  41 #define HB_NOLOCK      0
  42 #define HB_GLOBAL      1
  43 #define HB_LOCAL       2
  44 #define HB_SORTED      4
  45
  46 /*
  47  * Hash defines
  48  */
  49 #define HASHBIN_SIZE   8
  50 #define HASHBIN_MASK   0x7
  51
  52 #ifndef ALIGN
  53 #define ALIGN __attribute__((aligned))
  54 #endif
  55
  56 typedef void (*FREE_FUNC)( void *arg);
  57
  58 /*
  59  * Hashbin
  60  */
  61 #define GET_HASHBIN(x) ( x & HASHBIN_MASK )
  62
  63 #define QUEUE struct queue_t
  64 struct queue_t {
  65         QUEUE* q_next;
  66         QUEUE* q_prev;
  67
  68         char   q_name[ NAME_SIZE];
  69         __u32  q_hash;
  70 };
  71
  72 typedef struct hashbin_t {
  73         __u32      magic;
  74         int        hb_type;
  75         int        hb_size;
  76         spinlock_t hb_mutex[ HASHBIN_SIZE ] ALIGN;
  77         QUEUE*     hb_queue[ HASHBIN_SIZE ] ALIGN;
  78
  79         QUEUE* hb_current;
  80 } hashbin_t;
  81
  82 hashbin_t *hashbin_new(int type);
  83 int      hashbin_delete(hashbin_t* hashbin, FREE_FUNC func);
  84 int      hashbin_clear(hashbin_t* hashbin, FREE_FUNC free_func);
  85 void     hashbin_insert(hashbin_t* hashbin, QUEUE* entry, __u32 hashv,
  86                         char* name);
  87 void*    hashbin_find(hashbin_t* hashbin, __u32 hashv, char* name);
  88 void*    hashbin_remove(hashbin_t* hashbin, __u32 hashv, char* name);
  89 void*    hashbin_remove_first(hashbin_t *hashbin);
  90 QUEUE   *hashbin_get_first(hashbin_t *hashbin);
  91 QUEUE   *hashbin_get_next(hashbin_t *hashbin);
  92
  93 void enqueue_last(QUEUE **queue, QUEUE* element);
  94 void enqueue_first(QUEUE **queue, QUEUE* element);
  95 QUEUE *dequeue_first(QUEUE **queue);
  96
  97 /*
  98  * Function hashbin_get_size (hashbin)
  99  *
 100  *    Returns the number of elements in the hashbin
 101  *
 102  */
 103 extern __inline__ int  hashbin_get_size(hashbin_t* hashbin)
 104 {
 105         return hashbin->hb_size;
 106 }
 107
 108 #endif