+ /* RED parameters */
+#define SCALE_RED 16
+#define SCALE(x) ( (x) << SCALE_RED )
+#define SCALE_VAL(x) ( (x) >> SCALE_RED )
+#define SCALE_MUL(x, y) ( ( (x) * (y) ) >> SCALE_RED )
+ int w_q; /* queue weight (scaled) */
+ int max_th; /* maximum threshold for queue (scaled) */
+ int min_th; /* minimum threshold for queue (scaled) */
+ int max_p; /* maximum value for p_b (scaled) */
+ u_int c_1; /* max_p/(max_th-min_th) (scaled) */
+ u_int c_2; /* max_p*min_th/(max_th-min_th) (scaled) */
+ u_int c_3; /* for GRED, (1-max_p)/max_th (scaled) */
+ u_int c_4; /* for GRED, 1 - 2*max_p (scaled) */
+ user32_addr_t w_q_lookup; /* lookup table for computing (1-w_q)^t */
+ u_int lookup_depth; /* depth of lookup table */
+ int lookup_step; /* granularity inside the lookup table */
+ int lookup_weight; /* equal to (1-w_q)^t / (1-w_q)^(t+1) */
+ int avg_pkt_size; /* medium packet size */
+ int max_pkt_size; /* max packet size */
+};
+
+struct dn_pipe_32 { /* a pipe */
+ user32_addr_t next;
+
+ int pipe_nr; /* number */
+ int bandwidth; /* really, bytes/tick. */
+ int delay; /* really, ticks */
+
+ user32_addr_t head, tail; /* packets in delay line */
+
+ /* WF2Q+ */
+ struct dn_heap_32 scheduler_heap; /* top extract - key Finish time*/
+ struct dn_heap_32 not_eligible_heap; /* top extract- key Start time */
+ struct dn_heap_32 idle_heap; /* random extract - key Start=Finish time */
+
+ dn_key V; /* virtual time */
+ int sum; /* sum of weights of all active sessions */
+ int numbytes; /* bits I can transmit (more or less). */
+
+ dn_key sched_time; /* time pipe was scheduled in ready_heap */
+
+ /*
+ * When the tx clock come from an interface (if_name[0] != '\0'), its name
+ * is stored below, whereas the ifp is filled when the rule is configured.
+ */
+ char if_name[IFNAMSIZ];
+ user32_addr_t ifp;
+ int ready; /* set if ifp != NULL and we got a signal from it */
+
+ struct dn_flow_set_32 fs; /* used with fixed-rate flows */
+};
+#pragma pack()
+
+
+struct dn_heap_64 {
+ int size;
+ int elements;
+ int offset; /* XXX if > 0 this is the offset of direct ptr to obj */
+ user64_addr_t p; /* really an array of "size" entries */
+};
+
+
+struct dn_flow_queue_64 {
+ user64_addr_t next;
+ struct ip_flow_id id;
+
+ user64_addr_t head, tail; /* queue of packets */
+ u_int len;
+ u_int len_bytes;
+ u_int32_t numbytes; /* credit for transmission (dynamic queues) */
+
+ u_int64_t tot_pkts; /* statistics counters */
+ u_int64_t tot_bytes;
+ u_int32_t drops;
+
+ int hash_slot; /* debugging/diagnostic */
+
+ /* RED parameters */
+ int avg; /* average queue length est. (scaled) */
+ int count; /* arrivals since last RED drop */
+ int random; /* random value (scaled) */
+ u_int32_t q_time; /* start of queue idle time */
+
+ /* WF2Q+ support */
+ user64_addr_t fs; /* parent flow set */
+ int heap_pos; /* position (index) of struct in heap */
+ dn_key sched_time; /* current time when queue enters ready_heap */
+
+ dn_key S, F; /* start time, finish time */
+ /*
+ * Setting F < S means the timestamp is invalid. We only need
+ * to test this when the queue is empty.
+ */
+};
+
+struct dn_flow_set_64 {
+ user64_addr_t next; /* next flow set in all_flow_sets list */
+
+ u_short fs_nr; /* flow_set number */
+ u_short flags_fs;
+#define DN_HAVE_FLOW_MASK 0x0001
+#define DN_IS_RED 0x0002
+#define DN_IS_GENTLE_RED 0x0004
+#define DN_QSIZE_IS_BYTES 0x0008 /* queue size is measured in bytes */
+#define DN_NOERROR 0x0010 /* do not report ENOBUFS on drops */
+#define DN_IS_PIPE 0x4000
+#define DN_IS_QUEUE 0x8000
+
+ user64_addr_t pipe; /* pointer to parent pipe */
+ u_short parent_nr; /* parent pipe#, 0 if local to a pipe */
+
+ int weight; /* WFQ queue weight */
+ int qsize; /* queue size in slots or bytes */
+ int plr; /* pkt loss rate (2^31-1 means 100%) */
+
+ struct ip_flow_id flow_mask;
+
+ /* hash table of queues onto this flow_set */
+ int rq_size; /* number of slots */
+ int rq_elements; /* active elements */
+ user64_addr_t rq; /* array of rq_size entries */
+
+ u_int32_t last_expired; /* do not expire too frequently */
+ int backlogged; /* #active queues for this flowset */
+
+ /* RED parameters */
+#define SCALE_RED 16
+#define SCALE(x) ( (x) << SCALE_RED )
+#define SCALE_VAL(x) ( (x) >> SCALE_RED )
+#define SCALE_MUL(x, y) ( ( (x) * (y) ) >> SCALE_RED )
+ int w_q; /* queue weight (scaled) */
+ int max_th; /* maximum threshold for queue (scaled) */
+ int min_th; /* minimum threshold for queue (scaled) */
+ int max_p; /* maximum value for p_b (scaled) */
+ u_int c_1; /* max_p/(max_th-min_th) (scaled) */
+ u_int c_2; /* max_p*min_th/(max_th-min_th) (scaled) */
+ u_int c_3; /* for GRED, (1-max_p)/max_th (scaled) */
+ u_int c_4; /* for GRED, 1 - 2*max_p (scaled) */
+ user64_addr_t w_q_lookup; /* lookup table for computing (1-w_q)^t */
+ u_int lookup_depth; /* depth of lookup table */
+ int lookup_step; /* granularity inside the lookup table */
+ int lookup_weight; /* equal to (1-w_q)^t / (1-w_q)^(t+1) */
+ int avg_pkt_size; /* medium packet size */
+ int max_pkt_size; /* max packet size */
+};
+
+struct dn_pipe_64 { /* a pipe */
+ user64_addr_t next;
+
+ int pipe_nr; /* number */
+ int bandwidth; /* really, bytes/tick. */
+ int delay; /* really, ticks */
+
+ user64_addr_t head, tail; /* packets in delay line */
+
+ /* WF2Q+ */
+ struct dn_heap_64 scheduler_heap; /* top extract - key Finish time*/
+ struct dn_heap_64 not_eligible_heap; /* top extract- key Start time */
+ struct dn_heap_64 idle_heap; /* random extract - key Start=Finish time */
+
+ dn_key V; /* virtual time */
+ int sum; /* sum of weights of all active sessions */
+ int numbytes; /* bits I can transmit (more or less). */
+
+ dn_key sched_time; /* time pipe was scheduled in ready_heap */
+
+ /*
+ * When the tx clock come from an interface (if_name[0] != '\0'), its name
+ * is stored below, whereas the ifp is filled when the rule is configured.
+ */
+ char if_name[IFNAMSIZ];
+ user64_addr_t ifp;
+ int ready; /* set if ifp != NULL and we got a signal from it */
+
+ struct dn_flow_set_64 fs; /* used with fixed-rate flows */
+};
+
+#include <sys/eventhandler.h>
+/* Dummynet event handling declarations */
+extern struct eventhandler_lists_ctxt dummynet_evhdlr_ctxt;
+extern void dummynet_init(void);
+
+struct dn_pipe_mini_config {
+ uint32_t bandwidth;
+ uint32_t delay;
+ uint32_t plr;
+};
+
+struct dn_rule_mini_config {
+ uint32_t dir;
+ uint32_t af;
+ uint32_t proto;
+ /*
+ * XXX PF rules actually define ranges of ports and
+ * along with range goes an opcode ((not) equal to, less than
+ * greater than, etc.
+ * For now the following works assuming there's no port range
+ * and the rule is for specific port.
+ * Also the operation is assumed as equal to.
+ */
+ uint32_t src_port;
+ uint32_t dst_port;
+ char ifname[IFXNAMSIZ];
+};
+
+struct dummynet_event {
+ uint32_t dn_event_code;
+ union {
+ struct dn_pipe_mini_config _dnev_pipe_config;
+ struct dn_rule_mini_config _dnev_rule_config;
+ } dn_event;
+};
+
+#define dn_event_pipe_config dn_event._dnev_pipe_config
+#define dn_event_rule_config dn_event._dnev_rule_config
+
+extern void dummynet_event_enqueue_nwk_wq_entry(struct dummynet_event *);
+
+enum {
+ DUMMYNET_RULE_CONFIG,
+ DUMMYNET_RULE_DELETE,
+ DUMMYNET_PIPE_CONFIG,
+ DUMMYNET_PIPE_DELETE,
+ DUMMYNET_NLC_DISABLED,
+};
+
+enum { DN_INOUT, DN_IN, DN_OUT };
+/*
+ * The signature for the callback is:
+ * eventhandler_entry_arg __unused
+ * dummynet_event pointer to dummynet event object
+ */
+typedef void (*dummynet_event_fn) (struct eventhandler_entry_arg, struct dummynet_event *);
+EVENTHANDLER_DECLARE(dummynet_event, dummynet_event_fn);
+#endif /* BSD_KERNEL_PRIVATE */
+#endif /* PRIVATE */
projects / apple / xnu.git / blobdiff