Rev 5201 | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
431 | serge | 1 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
2 | ;; ;; |
||
5565 | serge | 3 | ;; Copyright (C) KolibriOS team 2004-2015. All rights reserved. ;; |
431 | serge | 4 | ;; Distributed under terms of the GNU General Public License ;; |
5 | ;; ;; |
||
3555 | Serge | 6 | ;; queue.inc ;; |
431 | serge | 7 | ;; ;; |
3555 | Serge | 8 | ;; Written by hidnplayr@kolibrios.org ;; |
431 | serge | 9 | ;; ;; |
3555 | Serge | 10 | ;; GNU GENERAL PUBLIC LICENSE ;; |
11 | ;; Version 2, June 1991 ;; |
||
431 | serge | 12 | ;; ;; |
13 | ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; |
||
1 | ha | 14 | |
593 | mikedld | 15 | $Revision: 5565 $ |
1 | ha | 16 | |
3555 | Serge | 17 | ; The Queues implemented by these macros form a ring-buffer. |
18 | ; The data to these queue's always looks like this: |
||
1 | ha | 19 | ; |
3555 | Serge | 20 | ; At top, you have the queue struct, wich has the size (number of currently queued packets, read and write pointers. |
21 | ; This struct is followed by a number of slots wich you can read and write to using the macros. |
||
22 | ; How these slots look like is up to you to chose, normally they should have at least a pointer to where the real data is. |
||
23 | ; (you can see some examples below) |
||
1 | ha | 24 | |
25 | |||
3725 | Serge | 26 | struct queue |
1 | ha | 27 | |
3725 | Serge | 28 | size dd ? ; number of queued packets in this queue |
29 | w_ptr dd ? ; current writing pointer in queue |
||
30 | r_ptr dd ? ; current reading pointer |
||
1 | ha | 31 | |
3555 | Serge | 32 | ends |
1 | ha | 33 | |
3555 | Serge | 34 | ; The following macros share these inputs: |
1 | ha | 35 | |
3555 | Serge | 36 | ; ptr = pointer to where the queue data is located |
37 | ; size = number of slots/entrys in the queue |
||
38 | ; entry_size = size of one slot, in bytes |
||
39 | ; failaddr = the address where macro will jump to when there is no data in the queue |
||
1 | ha | 40 | |
3555 | Serge | 41 | ; additionally, add_to_queue requires you to set esi to the data wich you want to queue |
42 | ; get_from_queue on the other hand will return a pointer in esi, to the entry you're interessed in |
||
43 | ; PS: macros WILL destroy ecx and edi |
||
1 | ha | 44 | |
3555 | Serge | 45 | macro add_to_queue ptr, size, entry_size, failaddr { |
1 | ha | 46 | |
3725 | Serge | 47 | local .ok, .no_wrap |
1 | ha | 48 | |
5201 | serge | 49 | spin_lock_irqsave |
1 | ha | 50 | |
3725 | Serge | 51 | cmp [ptr + queue.size], size ; Check if queue isnt full |
52 | jb .ok |
||
1 | ha | 53 | |
5201 | serge | 54 | spin_unlock_irqrestore |
3725 | Serge | 55 | jmp failaddr |
1 | ha | 56 | |
3725 | Serge | 57 | .ok: |
58 | inc [ptr + queue.size] ; if not full, queue one more |
||
1 | ha | 59 | |
3725 | Serge | 60 | mov edi, [ptr + queue.w_ptr] ; Current write pointer (FIFO!) |
61 | mov ecx, entry_size/4 ; Write the queue entry |
||
62 | rep movsd ; |
||
63 | |||
64 | lea ecx, [size*entry_size+ptr+sizeof.queue] |
||
65 | cmp edi, ecx ; entry size |
||
66 | jb .no_wrap |
||
67 | |||
68 | sub edi, size*entry_size |
||
3555 | Serge | 69 | .no_wrap: |
3725 | Serge | 70 | mov [ptr + queue.w_ptr], edi |
1 | ha | 71 | |
5201 | serge | 72 | spin_unlock_irqrestore |
3725 | Serge | 73 | |
3555 | Serge | 74 | } |
1 | ha | 75 | |
76 | |||
77 | |||
3555 | Serge | 78 | macro get_from_queue ptr, size, entry_size, failaddr { |
1 | ha | 79 | |
3725 | Serge | 80 | local .ok, .no_wrap |
1 | ha | 81 | |
5201 | serge | 82 | spin_lock_irqsave |
1 | ha | 83 | |
3725 | Serge | 84 | cmp [ptr + queue.size], 0 ; any packets queued? |
85 | ja .ok |
||
1 | ha | 86 | |
5201 | serge | 87 | spin_unlock_irqrestore |
3725 | Serge | 88 | jmp failaddr |
1 | ha | 89 | |
3725 | Serge | 90 | .ok: |
91 | dec [ptr + queue.size] ; if so, dequeue one |
||
1 | ha | 92 | |
3725 | Serge | 93 | mov esi, [ptr + queue.r_ptr] |
94 | push esi |
||
1 | ha | 95 | |
3725 | Serge | 96 | add esi, entry_size |
97 | |||
98 | lea ecx, [size*entry_size+ptr+sizeof.queue] |
||
99 | cmp esi, ecx ; entry size |
||
100 | jb .no_wrap |
||
101 | |||
102 | sub esi, size*entry_size |
||
103 | |||
3555 | Serge | 104 | .no_wrap: |
3725 | Serge | 105 | mov dword [ptr + queue.r_ptr], esi |
1 | ha | 106 | |
3725 | Serge | 107 | pop esi |
1 | ha | 108 | |
5201 | serge | 109 | spin_unlock_irqrestore |
3725 | Serge | 110 | |
3555 | Serge | 111 | } |
1 | ha | 112 | |
3555 | Serge | 113 | macro init_queue ptr { |
1 | ha | 114 | |
3725 | Serge | 115 | mov [ptr + queue.size] , 0 |
116 | lea edi, [ptr + sizeof.queue] |
||
117 | mov [ptr + queue.w_ptr], edi |
||
118 | mov [ptr + queue.r_ptr], edi |
||
119 | |||
3555 | Serge | 120 | } |