osfmk/man/policy_rr_info.html

   1 <h2>policy_rr_info</h2>
   2 <hr>
   3 <p>
   4 <strong>Structure</strong> - Specifies information associated with the system's Round Robin scheduling policy.
   5 <h3>SYNOPSIS</h3>
   6 <pre>
   7 <strong>struct policy_rr_limit</strong>
   8 <strong>{</strong>
   9        <strong>int</strong>          <var>max_priority</var><strong>;</strong>
  10 <strong>};</strong>
  11
  12 <strong>struct policy_rr_base</strong>
  13 <strong>{</strong>
  14        <strong>int</strong>         <var>base_priority</var><strong>;</strong>
  15        <strong>int</strong>               <var>quantum</var><strong>;</strong>
  16 <strong>};</strong>
  17
  18 <strong>struct policy_rr_info</strong>
  19 <strong>{</strong>
  20        <strong>int</strong>          <var>max_priority</var><strong>;</strong>
  21        <strong>int</strong>         <var>base_priority</var><strong>;</strong>
  22        <strong>int</strong>               <var>quantum</var><strong>;</strong>
  23        <strong>boolean_t</strong>       <var>depressed</var><strong>;</strong>
  24        <strong>int</strong>      <var>depress_priority</var><strong>;</strong>
  25 <strong>};</strong>
  26 </pre>
  27 <h3>FIELDS</h3>
  28 <dl>
  29 <dt> <var>max_priority</var>
  30 <dd>
  31 Maximum scheduling priority
  32 <p>
  33 <dt> <var>base_priority</var>
  34 <dd>
  35 Scheduling priority
  36 <p>
  37 <dt> <var>quantum</var>
  38 <dd>
  39 Scheduling quantum (in milliseconds)
  40 <p>
  41 <dt> <var>depressed</var>
  42 <dd>
  43 True if scheduling priority is depressed
  44 <p>
  45 <dt> <var>depress_priority</var>
  46 <dd>
  47 Scheduling priority from which depressed
  48 </dl>
  49 <h3>DESCRIPTION</h3>
  50 <p>
  51 The <strong>policy_rr_info</strong> structure defines the round-robin
  52 scheduling policy information.
  53 Round-robin threads have two priorities associated with them by the system:
  54 <ul>
  55   <p>
  56 <li>
  57 A maximum priority value which can be raised only via privileged operation
  58 so that users may not unfairly compete with other users in their processor
  59 set.  Newly created threads obtain their maximum priority from that of their
  60 assigned processor set.
  61      <p>
  62 <li>
  63 A priority value which can be set by the thread to any value up to a
  64 maximum priority.  Newly created threads obtain their priority from their task.
  65 </ul>
  66 <h3>RELATED INFORMATION</h3>
  67 <p>
  68 Functions:
  69 <a href="thread_info.html"><strong>thread_info</strong></a>,
  70 <a href="task_info.html"><strong>task_info</strong></a>,
  71 <a href="processor_set_info.html"><strong>processor_set_info</strong></a>,
  72 <a href="P_set_policy_control.html"><strong>processor_set_policy_control</strong></a>,
  73 <a href="P_set_policy_disable.html"><strong>processor_set_policy_disable</strong></a>,
  74 <a href="P_set_policy_enable.html"><strong>processor_set_policy_enable</strong></a>,
  75 <a href="task_policy.html"><strong>task_policy</strong></a>,
  76 <a href="thread_policy.html"><strong>thread_policy</strong></a>,
  77 <a href="thread_set_policy.html"><strong>thread_set_policy</strong></a>.
  78 <p>
  79 Data Structures:
  80 <a href="policy_fifo_info.html"><strong>policy_fifo_info</strong></a>,
  81 <a href="policy_timeshare_info.html"><strong>policy_timeshare_info</strong></a>.