1<html><head><meta http-equiv="Content-Type" content="text/html; charset=ANSI_X3.4-1968"><title>cpupri_find</title><meta name="generator" content="DocBook XSL Stylesheets V1.78.1"><link rel="home" href="index.html" title="Linux Device Drivers"><link rel="up" href="ch01s03.html" title="Delaying, scheduling, and timer routines"><link rel="prev" href="API-yield-to.html" title="yield_to"><link rel="next" href="API-cpupri-set.html" title="cpupri_set"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"><span class="phrase">cpupri_find</span></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="API-yield-to.html">Prev</a>&#160;</td><th width="60%" align="center">Delaying, scheduling, and timer routines</th><td width="20%" align="right">&#160;<a accesskey="n" href="API-cpupri-set.html">Next</a></td></tr></table><hr></div><div class="refentry"><a name="API-cpupri-find"></a><div class="titlepage"></div><div class="refnamediv"><h2>Name</h2><p>cpupri_find &#8212; 
2  find the best (lowest-pri) CPU in the system
3 </p></div><div class="refsynopsisdiv"><h2>Synopsis</h2><div class="funcsynopsis"><table border="0" class="funcprototype-table" summary="Function synopsis" style="cellspacing: 0; cellpadding: 0;"><tr><td><code class="funcdef">int <b class="fsfunc">cpupri_find </b>(</code></td><td>struct cpupri * <var class="pdparam">cp</var>, </td></tr><tr><td>&#160;</td><td>struct task_struct * <var class="pdparam">p</var>, </td></tr><tr><td>&#160;</td><td>struct cpumask * <var class="pdparam">lowest_mask</var><code>)</code>;</td></tr></table><div class="funcprototype-spacer">&#160;</div></div></div><div class="refsect1"><a name="idp1106800796"></a><h2>Arguments</h2><div class="variablelist"><dl class="variablelist"><dt><span class="term"><em class="parameter"><code>cp</code></em></span></dt><dd><p>
4     The cpupri context
5    </p></dd><dt><span class="term"><em class="parameter"><code>p</code></em></span></dt><dd><p>
6     The task
7    </p></dd><dt><span class="term"><em class="parameter"><code>lowest_mask</code></em></span></dt><dd><p>
8     A mask to fill in with selected CPUs (or NULL)
9    </p></dd></dl></div></div><div class="refsect1"><a name="idp1106804332"></a><h2>Note</h2><p>
10   This function returns the recommended CPUs as calculated during the
11   current invocation.  By the time the call returns, the CPUs may have in
12   fact changed priorities any number of times.  While not ideal, it is not
13   an issue of correctness since the normal rebalancer logic will correct
14   any discrepancies created by racing against the uncertainty of the current
15   priority configuration.
16</p></div><div class="refsect1"><a name="idp1106805316"></a><h2>Return</h2><p>
17   (int)bool - CPUs were found
18</p></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="API-yield-to.html">Prev</a>&#160;</td><td width="20%" align="center"><a accesskey="u" href="ch01s03.html">Up</a></td><td width="40%" align="right">&#160;<a accesskey="n" href="API-cpupri-set.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top"><span class="phrase">yield_to</span>&#160;</td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top">&#160;<span class="phrase">cpupri_set</span></td></tr></table></div></body></html>
19