Lines Matching refs:in
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
33 * Redistribution and use in source and binary forms, with or without
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
61 * used in conjunction with the ipfw package.
62 * Description of the data structures used is in ip_dummynet.h
95 #include <netinet/in.h>
110 * probably use an existing one ("softticks" in sys/kern/kern_timer.c)
221 * Increment size in blocks of 16 entries.
259 * Insert element in heap. Normally, p != NULL, we insert p in
261 * already in place, and key is the position where to start the
265 * If offset > 0 the position (index, int) of the element in the heap is
266 * also stored in the element itself at the given offset in bytes.
494 * contiguous in the first mbuf header. Insure this is true.
506 printf("dummynet: dropping bridged packet trapped in pipe\n");
523 * whole pipe p and hoping in the future we are more successful
535 /* hz is 100, which gives a granularity of 10ms in the old timer.
538 * in place but adjusted by a factor of 10 so that hz is functionally
574 * if there are leftover packets reinsert the pkt in the scheduler.
595 * the delay line (in p) computing output time.
611 * flushed the whole queue in the previous loop).
685 * update F and position in backlogged queue, then
686 * put flow in not_eligible_heap (we will fix this later).
697 * now compute V = max(V, min(S_i)). Remember that all elements in sch
779 /* make all time measurements in milliseconds (ms) -
818 /* check the heaps to see if there's still stuff in there, and
870 * Unconditionally expire empty queues in case of shortage.
936 * Given a flow_set and a pkt in last_pkt, find a matching queue
976 /* entry is idle and not in any heap, expire it */
990 if (q && prev != NULL) { /* found and not in front */
1013 * where q_size is the queue length (measured in bytes or * packets).
1026 /* queue in bytes or packets ? */
1146 * NULL in ip_input, destination interface in ip_output,
1147 * real_dst in bdg_forward
1148 * ro route parameter (only used in ip_output, NULL otherwise)
1150 * rule matching rule, in case of multiple passes
1151 * flags flags from the caller, only used in ip_output
1181 /* make all time measurements in milliseconds (ms) -
1315 * empty). If the flow is not eligible we just store it in the
1316 * not_eligible_heap. Otherwise, we store in the scheduler_heap
1319 * Note that for all flows in scheduler_heap (SCH), S_i <= V,
1320 * and for all flows in not_eligible_heap (NEH), S_i > V .
1321 * So when we need to compute max( V, min(S_i) ) forall i in SCH+NEH,
1381 * For the one in dn_pipe MUST also cleanup ready_heap...
1686 x->numbytes = 0; /* just in case... */
1800 * drain all queues. Called in case of severe mbuf shortage.
1912 * helper function used to copy data from kernel in DUMMYNET_GET
2005 * first field in dn_pipe and dn_flow_set. The correct
2045 /* Disallow sets in really-really secure mode. */