193 lines
6.5 KiB
C
193 lines
6.5 KiB
C
|
/**
|
||
|
|
* @file PacketPassPriorityQueue.h
|
||
|
|
* @author Ambroz Bizjak <ambrop7@gmail.com>
|
||
|
|
*
|
||
|
|
* @section LICENSE
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
* 3. Neither the name of the author nor the
|
||
|
|
* names of its contributors may be used to endorse or promote products
|
||
|
|
* derived from this software without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
|
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
||
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* @section DESCRIPTION
|
||
|
|
*
|
||
|
|
* Priority queue using {@link PacketPassInterface}.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef BADVPN_FLOW_PACKETPASSPRIORITYQUEUE_H
|
||
|
|
#define BADVPN_FLOW_PACKETPASSPRIORITYQUEUE_H
|
||
|
|
|
||
|
|
#include <stdint.h>
|
||
|
|
|
||
|
|
#include <misc/debugcounter.h>
|
||
|
|
#include <structure/SAvl.h>
|
||
|
|
#include <base/DebugObject.h>
|
||
|
|
#include <base/BPending.h>
|
||
|
|
#include <flow/PacketPassInterface.h>
|
||
|
|
|
||
|
|
typedef void (*PacketPassPriorityQueue_handler_busy) (void *user);
|
||
|
|
|
||
|
|
struct PacketPassPriorityQueueFlow_s;
|
||
|
|
|
||
|
|
#include "PacketPassPriorityQueue_tree.h"
|
||
|
|
#include <structure/SAvl_decl.h>
|
||
|
|
|
||
|
|
typedef struct PacketPassPriorityQueueFlow_s {
|
||
|
|
struct PacketPassPriorityQueue_s *m;
|
||
|
|
int priority;
|
||
|
|
PacketPassPriorityQueue_handler_busy handler_busy;
|
||
|
|
void *user;
|
||
|
|
PacketPassInterface input;
|
||
|
|
int is_queued;
|
||
|
|
struct {
|
||
|
|
PacketPassPriorityQueue__TreeNode tree_node;
|
||
|
|
uint8_t *data;
|
||
|
|
int data_len;
|
||
|
|
} queued;
|
||
|
|
DebugObject d_obj;
|
||
|
|
} PacketPassPriorityQueueFlow;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Priority queue using {@link PacketPassInterface}.
|
||
|
|
*/
|
||
|
|
typedef struct PacketPassPriorityQueue_s {
|
||
|
|
PacketPassInterface *output;
|
||
|
|
BPendingGroup *pg;
|
||
|
|
int use_cancel;
|
||
|
|
struct PacketPassPriorityQueueFlow_s *sending_flow;
|
||
|
|
PacketPassPriorityQueue__Tree queued_tree;
|
||
|
|
int freeing;
|
||
|
|
BPending schedule_job;
|
||
|
|
DebugObject d_obj;
|
||
|
|
DebugCounter d_ctr;
|
||
|
|
} PacketPassPriorityQueue;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Initializes the queue.
|
||
|
|
*
|
||
|
|
* @param m the object
|
||
|
|
* @param output output interface
|
||
|
|
* @param pg pending group
|
||
|
|
* @param use_cancel whether cancel functionality is required. Must be 0 or 1.
|
||
|
|
* If 1, output must support cancel functionality.
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueue_Init (PacketPassPriorityQueue *m, PacketPassInterface *output, BPendingGroup *pg, int use_cancel);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Frees the queue.
|
||
|
|
* All flows must have been freed.
|
||
|
|
*
|
||
|
|
* @param m the object
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueue_Free (PacketPassPriorityQueue *m);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Prepares for freeing the entire queue. Must be called to allow freeing
|
||
|
|
* the flows in the process of freeing the entire queue.
|
||
|
|
* After this function is called, flows and the queue must be freed
|
||
|
|
* before any further I/O.
|
||
|
|
* May be called multiple times.
|
||
|
|
* The queue enters freeing state.
|
||
|
|
*
|
||
|
|
* @param m the object
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueue_PrepareFree (PacketPassPriorityQueue *m);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Returns the MTU of the queue.
|
||
|
|
*
|
||
|
|
* @param m the object
|
||
|
|
*/
|
||
|
|
int PacketPassPriorityQueue_GetMTU (PacketPassPriorityQueue *m);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Initializes a queue flow.
|
||
|
|
* Queue must not be in freeing state.
|
||
|
|
* Must not be called from queue calls to output.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
* @param m queue to attach to
|
||
|
|
* @param priority flow priority. Lower value means higher priority.
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueueFlow_Init (PacketPassPriorityQueueFlow *flow, PacketPassPriorityQueue *m, int priority);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Frees a queue flow.
|
||
|
|
* Unless the queue is in freeing state:
|
||
|
|
* - The flow must not be busy as indicated by {@link PacketPassPriorityQueueFlow_IsBusy}.
|
||
|
|
* - Must not be called from queue calls to output.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueueFlow_Free (PacketPassPriorityQueueFlow *flow);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Does nothing.
|
||
|
|
* It must be possible to free the flow (see {@link PacketPassPriorityQueueFlow}).
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueueFlow_AssertFree (PacketPassPriorityQueueFlow *flow);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Determines if the flow is busy. If the flow is considered busy, it must not
|
||
|
|
* be freed. At any given time, at most one flow will be indicated as busy.
|
||
|
|
* Queue must not be in freeing state.
|
||
|
|
* Must not be called from queue calls to output.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
* @return 0 if not busy, 1 is busy
|
||
|
|
*/
|
||
|
|
int PacketPassPriorityQueueFlow_IsBusy (PacketPassPriorityQueueFlow *flow);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Requests the output to stop processing the current packet as soon as possible.
|
||
|
|
* Cancel functionality must be enabled for the queue.
|
||
|
|
* The flow must be busy as indicated by {@link PacketPassPriorityQueueFlow_IsBusy}.
|
||
|
|
* Queue must not be in freeing state.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueueFlow_RequestCancel (PacketPassPriorityQueueFlow *flow);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Sets up a callback to be called when the flow is no longer busy.
|
||
|
|
* The handler will be called as soon as the flow is no longer busy, i.e. it is not
|
||
|
|
* possible that this flow is no longer busy before the handler is called.
|
||
|
|
* The flow must be busy as indicated by {@link PacketPassPriorityQueueFlow_IsBusy}.
|
||
|
|
* Queue must not be in freeing state.
|
||
|
|
* Must not be called from queue calls to output.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
* @param handler callback function. NULL to disable.
|
||
|
|
* @param user value passed to callback function. Ignored if handler is NULL.
|
||
|
|
*/
|
||
|
|
void PacketPassPriorityQueueFlow_SetBusyHandler (PacketPassPriorityQueueFlow *flow, PacketPassPriorityQueue_handler_busy handler, void *user);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Returns the input interface of the flow.
|
||
|
|
*
|
||
|
|
* @param flow the object
|
||
|
|
* @return input interface
|
||
|
|
*/
|
||
|
|
PacketPassInterface * PacketPassPriorityQueueFlow_GetInput (PacketPassPriorityQueueFlow *flow);
|
||
|
|
|
||
|
|
#endif
|