Lines Matching refs:this

12 	  disciplines, several different algorithms for how to do this
52 	  into a tree-like hierarchy of classes; the leaves of this tree are
61 	  To compile this code as a module, choose M here: the
75 	  To compile this code as a module, choose M here: the
84 	  To compile this code as a module, choose M here: the
93 	  select classes of this queuing discipline.  Each class maps
98 	  To compile this code as a module, choose M here: the
107 	  To compile this code as a module, choose M here: the
116 	  To compile this code as a module, choose M here: the
127 	  To compile this code as a module, choose M here: the
138 	  To compile this code as a module, choose M here: the
149 	  To compile this code as a module, choose M here: the
161 	  To compile this code as a module, choose M here: the
172 	  To compile this code as a module, choose M here: the
183 	  To compile this code as a module, choose M here: the
191 	  Technical information on this method, with pointers to associated
194 	  To compile this code as a module, choose M here: the
204 	  To compile this driver as a module, choose M here: the module
215 	  To compile this driver as a module, choose M here: the module
227 	  To compile this driver as a module, choose M here: the module will
240 	  To compile this code as a module, choose M here: the
249 	  To compile this driver as a module, choose M here: the module
260 	  To compile this driver as a module, choose M here: the module
271 	  To compile this driver as a module, choose M here: the module
285 	  To compile this driver as a module, choose M here: the module
296 	  To compile this driver as a module, choose M here: the module
307 	  To compile this driver as a module, choose M here: the module
319 	  To compile this code as a module, choose M here: the
336 	  The Remus HA project uses this module to enable speculative execution
342 	  Say Y here if you are using this kernel for Xen dom0 and
345 	  To compile this code as a module, choose M here: the
360 	  To compile this code as a module, choose M here: the
368 	  traffic control indices. You will want this feature if you want
371 	  To compile this code as a module, choose M here: the
383 	  To compile this code as a module, choose M here: the
393 	  To compile this code as a module, choose M here: the
403 	  To compile this code as a module, choose M here: the
424 	  request a minimum and maximum data flow rate for a connection; this
430 	  To compile this code as a module, choose M here: the
438 	  request a minimum and maximum data flow rate for a connection; this
444 	  To compile this code as a module, choose M here: the
455 	  To compile this code as a module, choose M here: the
467 	  To compile this code as a module, choose M here: the
477 	  To compile this code as a module, choose M here: the module will
510 	  To compile this code as a module, choose M here: the
520 	  To compile this code as a module, choose M here: the
530 	  To compile this code as a module, choose M here: the
541 	  To compile this code as a module, choose M here: the
555 	  To compile this code as a module, choose M here: the
565 	  To compile this code as a module, choose M here: the
575 	  To compile this code as a module, choose M here: the
597 	  To compile this code as a module, choose M here: the
607 	  To compile this code as a module, choose M here: the
623 	  To compile this code as a module, choose M here: the
633 	  To compile this code as a module, choose M here: the
643 	  To compile this code as a module, choose M here: the
652 	  To compile this code as a module, choose M here: the
666 	  To compile this code as a module, choose M here: the
677 	  To compile this code as a module, choose M here: the
687 	  To compile this code as a module, choose M here: the
698 	  To compile this code as a module, choose M here: the
710 	  To compile this code as a module, choose M here: the
722 	  To compile this code as a module, choose M here: the