bsd/netinet/ip_dummynet.c

234 static void cp_flow_set_to_64_user(struct dn_flow_set *set, struct dn_flow_set_64 *fs_bp);
237 static char* dn_copy_set_64(struct dn_flow_set *set, char *bp);
240 static void cp_flow_set_to_32_user(struct dn_flow_set *set, struct dn_flow_set_32 *fs_bp);
243 static char* dn_copy_set_32(struct dn_flow_set *set, char *bp);
359 cp_flow_set_to_32_user(struct dn_flow_set *set, struct dn_flow_set_32 *fs_bp)
361 	fs_bp->fs_nr = set->fs_nr;
362 	fs_bp->flags_fs = set->flags_fs ;
363 	fs_bp->parent_nr = set->parent_nr ;
364 	fs_bp->weight = set->weight ;
365 	fs_bp->qsize = set->qsize ;
366 	fs_bp->plr = set->plr ;
367 	fs_bp->flow_mask = set->flow_mask ;
368 	fs_bp->rq_size = set->rq_size ;
369 	fs_bp->rq_elements = set->rq_elements ;
370 	fs_bp->last_expired = set->last_expired ;
371 	fs_bp->backlogged = set->backlogged ;
372 	fs_bp->w_q = set->w_q ;
373 	fs_bp->max_th = set->max_th ;
374 	fs_bp->min_th = set->min_th ;
375 	fs_bp->max_p = set->max_p ;
376 	fs_bp->c_1 = set->c_1 ;
377 	fs_bp->c_2 = set->c_2 ;
378 	fs_bp->c_3 = set->c_3 ;
379 	fs_bp->c_4 = set->c_4 ;
380 	fs_bp->w_q_lookup = CAST_DOWN_EXPLICIT(user32_addr_t, set->w_q_lookup) ;
381 	fs_bp->lookup_depth = set->lookup_depth ;
382 	fs_bp->lookup_step = set->lookup_step ;
383 	fs_bp->lookup_weight = set->lookup_weight ;
384 	fs_bp->avg_pkt_size = set->avg_pkt_size ;
385 	fs_bp->max_pkt_size = set->max_pkt_size ;
389 cp_flow_set_to_64_user(struct dn_flow_set *set, struct dn_flow_set_64 *fs_bp)
391 	fs_bp->fs_nr = set->fs_nr;
392 	fs_bp->flags_fs = set->flags_fs ;
393 	fs_bp->parent_nr = set->parent_nr ;
394 	fs_bp->weight = set->weight ;
395 	fs_bp->qsize = set->qsize ;
396 	fs_bp->plr = set->plr ;
397 	fs_bp->flow_mask = set->flow_mask ;
398 	fs_bp->rq_size = set->rq_size ;
399 	fs_bp->rq_elements = set->rq_elements ;
400 	fs_bp->last_expired = set->last_expired ;
401 	fs_bp->backlogged = set->backlogged ;
402 	fs_bp->w_q = set->w_q ;
403 	fs_bp->max_th = set->max_th ;
404 	fs_bp->min_th = set->min_th ;
405 	fs_bp->max_p = set->max_p ;
406 	fs_bp->c_1 = set->c_1 ;
407 	fs_bp->c_2 = set->c_2 ;
408 	fs_bp->c_3 = set->c_3 ;
409 	fs_bp->c_4 = set->c_4 ;
410 	fs_bp->w_q_lookup = CAST_DOWN(user64_addr_t, set->w_q_lookup) ;
411 	fs_bp->lookup_depth = set->lookup_depth ;
412 	fs_bp->lookup_step = set->lookup_step ;
413 	fs_bp->lookup_weight = set->lookup_weight ;
414 	fs_bp->avg_pkt_size = set->avg_pkt_size ;
415 	fs_bp->max_pkt_size = set->max_pkt_size ;
591     if (p == NULL)	/* data already there, set starting point */
1068 	 * only set the timer if there are packets to process
1073 		if (h->elements > 0) { // set the timer
1392      * If q_size == 0, we compute the idle time for the link, and set
1724 	 * set S to the virtual time V for the controlling pipe, and update
1726 	 * idle_heap and set S to max(F,V).
1774 	/* start the timer and set global if not already set */
1954      * the flow set, otherwise scan pipes. Should do either, but doing
2320 	/* locate set */
2354 char* dn_copy_set_32(struct dn_flow_set *set, char *bp)
2362     for (i = 0 ; i <= set->rq_size ; i++)
2363 		for (q = set->rq[i] ; q ; q = q->next, qp++ ) {
2367 			if (q->fs != set)
2369 					   i, q->fs, set);
2377     if (copied != set->rq_elements)
2379 			   copied, set->rq_elements);
2384 char* dn_copy_set_64(struct dn_flow_set *set, char *bp)
2392     for (i = 0 ; i <= set->rq_size ; i++)
2393 		for (q = set->rq[i] ; q ; q = q->next, qp++ ) {
2397 			if (q->fs != set)
2399 					   i, q->fs, set);
2408     if (copied != set->rq_elements)
2410 			   copied, set->rq_elements);
2417     struct dn_flow_set *set ;
2443 	SLIST_FOREACH(set, &flowsethash[i], next)
2444 		size += sizeof (*set) +
2445 		    set->rq_elements * sizeof(struct dn_flow_queue);
2455     struct dn_flow_set *set ;
2502 	SLIST_FOREACH(set, &flowsethash[i], next) {
2504 		cp_flow_set_to_64_user(set, fs_bp);
2510 		bp = dn_copy_set_64( set, bp );
2597 	default_rule.set = RESVD_SET;