| <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> |
| |
| <html lang="en"> |
| |
| <head> |
| <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> |
| <title>LCOV - skiboot.info - core/pool.c</title> |
| <link rel="stylesheet" type="text/css" href="../gcov.css"> |
| </head> |
| |
| <body> |
| |
| <table width="100%" border=0 cellspacing=0 cellpadding=0> |
| <tr><td class="title">LCOV - code coverage report</td></tr> |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| |
| <tr> |
| <td width="100%"> |
| <table cellpadding=1 border=0 width="100%"> |
| <tr> |
| <td width="10%" class="headerItem">Current view:</td> |
| <td width="10%" class="headerValue"><a href="../index.html">top level</a> - <a href="index.html">core</a> - pool.c<span style="font-size: 80%;"> (source / <a href="pool.c.func-c.html">functions</a>)</span></td> |
| <td width="5%"></td> |
| <td width="5%"></td> |
| <td width="5%" class="headerCovTableHead">Coverage</td> |
| <td width="5%" class="headerCovTableHead" title="Covered + Uncovered code">Total</td> |
| <td width="5%" class="headerCovTableHead" title="Exercised code only">Hit</td> |
| </tr> |
| <tr> |
| <td class="headerItem">Test:</td> |
| <td class="headerValue">skiboot.info</td> |
| <td></td> |
| <td class="headerItem">Lines:</td> |
| <td class="headerCovTableEntryHi">96.3 %</td> |
| <td class="headerCovTableEntry">27</td> |
| <td class="headerCovTableEntry">26</td> |
| </tr> |
| <tr> |
| <td class="headerItem">Test Date:</td> |
| <td class="headerValue">2025-06-27 16:54:26</td> |
| <td></td> |
| <td class="headerItem">Functions:</td> |
| <td class="headerCovTableEntryHi">100.0 %</td> |
| <td class="headerCovTableEntry">3</td> |
| <td class="headerCovTableEntry">3</td> |
| </tr> |
| <tr> |
| <td></td> |
| <td></td> |
| <td></td> |
| <td class="headerItem">Branches:</td> |
| <td class="headerCovTableEntryHi">-</td> |
| <td class="headerCovTableEntry">0</td> |
| <td class="headerCovTableEntry">0</td> |
| </tr> |
| <tr><td><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| </td> |
| </tr> |
| |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| </table> |
| |
| <table cellpadding=0 cellspacing=0 border=0> |
| <tr> |
| <td><br></td> |
| </tr> |
| <tr> |
| <td> |
| <pre class="sourceHeading"> Branch data Line data Source code</pre> |
| <pre class="source"> |
| <span id="L1"><span class="lineNum"> 1</span> : : // SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later</span> |
| <span id="L2"><span class="lineNum"> 2</span> : : /*</span> |
| <span id="L3"><span class="lineNum"> 3</span> : : * This file provides some functions to manage a pool of pre-allocated</span> |
| <span id="L4"><span class="lineNum"> 4</span> : : * objects. It also provides a method to reserve a pre-defined number</span> |
| <span id="L5"><span class="lineNum"> 5</span> : : * of objects for higher priorty requests. The allocations follow the</span> |
| <span id="L6"><span class="lineNum"> 6</span> : : * following rules:</span> |
| <span id="L7"><span class="lineNum"> 7</span> : : *</span> |
| <span id="L8"><span class="lineNum"> 8</span> : : * 1. An allocation will succeed at any priority if there is more than</span> |
| <span id="L9"><span class="lineNum"> 9</span> : : * the reserved number of objects free.</span> |
| <span id="L10"><span class="lineNum"> 10</span> : : * 2. Only high priority allocations will succeed when there are less</span> |
| <span id="L11"><span class="lineNum"> 11</span> : : * than the reserved number of objects free.</span> |
| <span id="L12"><span class="lineNum"> 12</span> : : * 3. When an allocation is freed it is always added to the high priority</span> |
| <span id="L13"><span class="lineNum"> 13</span> : : * pool if there are less than the reserved number of allocations</span> |
| <span id="L14"><span class="lineNum"> 14</span> : : * available.</span> |
| <span id="L15"><span class="lineNum"> 15</span> : : *</span> |
| <span id="L16"><span class="lineNum"> 16</span> : : * Copyright 2013-2014 IBM Corp.</span> |
| <span id="L17"><span class="lineNum"> 17</span> : : */</span> |
| <span id="L18"><span class="lineNum"> 18</span> : : </span> |
| <span id="L19"><span class="lineNum"> 19</span> : : #include <pool.h></span> |
| <span id="L20"><span class="lineNum"> 20</span> : : #include <string.h></span> |
| <span id="L21"><span class="lineNum"> 21</span> : : #include <stdlib.h></span> |
| <span id="L22"><span class="lineNum"> 22</span> : : #include <ccan/list/list.h></span> |
| <span id="L23"><span class="lineNum"> 23</span> : : </span> |
| <span id="L24"><span class="lineNum"> 24</span> :<span class="tlaGNC tlaBgGNC"> 13 : void* pool_get(struct pool *pool, enum pool_priority priority)</span></span> |
| <span id="L25"><span class="lineNum"> 25</span> : : {</span> |
| <span id="L26"><span class="lineNum"> 26</span> : : void *obj;</span> |
| <span id="L27"><span class="lineNum"> 27</span> : : </span> |
| <span id="L28"><span class="lineNum"> 28</span> :<span class="tlaGNC"> 13 : if (!pool->free_count ||</span></span> |
| <span id="L29"><span class="lineNum"> 29</span> :<span class="tlaGNC"> 13 : ((pool->free_count <= pool->reserved) && priority == POOL_NORMAL))</span></span> |
| <span id="L30"><span class="lineNum"> 30</span> :<span class="tlaGNC"> 1 : return NULL;</span></span> |
| <span id="L31"><span class="lineNum"> 31</span> : : </span> |
| <span id="L32"><span class="lineNum"> 32</span> :<span class="tlaGNC"> 12 : pool->free_count--;</span></span> |
| <span id="L33"><span class="lineNum"> 33</span> :<span class="tlaGNC"> 12 : obj = (void *) list_pop_(&pool->free_list, 0);</span></span> |
| <span id="L34"><span class="lineNum"> 34</span> :<span class="tlaGNC"> 12 : assert(obj);</span></span> |
| <span id="L35"><span class="lineNum"> 35</span> :<span class="tlaGNC"> 12 : memset(obj, 0, pool->obj_size);</span></span> |
| <span id="L36"><span class="lineNum"> 36</span> :<span class="tlaGNC"> 12 : return obj;</span></span> |
| <span id="L37"><span class="lineNum"> 37</span> : : }</span> |
| <span id="L38"><span class="lineNum"> 38</span> : : </span> |
| <span id="L39"><span class="lineNum"> 39</span> :<span class="tlaGNC"> 2 : void pool_free_object(struct pool *pool, void *obj)</span></span> |
| <span id="L40"><span class="lineNum"> 40</span> : : {</span> |
| <span id="L41"><span class="lineNum"> 41</span> :<span class="tlaGNC"> 2 : pool->free_count++;</span></span> |
| <span id="L42"><span class="lineNum"> 42</span> :<span class="tlaGNC"> 2 : list_add_tail(&pool->free_list,</span></span> |
| <span id="L43"><span class="lineNum"> 43</span> : : (struct list_node *) (obj));</span> |
| <span id="L44"><span class="lineNum"> 44</span> :<span class="tlaGNC"> 2 : }</span></span> |
| <span id="L45"><span class="lineNum"> 45</span> : : </span> |
| <span id="L46"><span class="lineNum"> 46</span> :<span class="tlaGNC"> 1 : int pool_init(struct pool *pool, size_t obj_size, int count, int reserved)</span></span> |
| <span id="L47"><span class="lineNum"> 47</span> : : {</span> |
| <span id="L48"><span class="lineNum"> 48</span> : : int i;</span> |
| <span id="L49"><span class="lineNum"> 49</span> : : </span> |
| <span id="L50"><span class="lineNum"> 50</span> :<span class="tlaGNC"> 1 : if (obj_size < sizeof(struct list_node))</span></span> |
| <span id="L51"><span class="lineNum"> 51</span> :<span class="tlaGNC"> 1 : obj_size = sizeof(struct list_node);</span></span> |
| <span id="L52"><span class="lineNum"> 52</span> : : </span> |
| <span id="L53"><span class="lineNum"> 53</span> :<span class="tlaGNC"> 1 : assert(count >= reserved);</span></span> |
| <span id="L54"><span class="lineNum"> 54</span> :<span class="tlaGNC"> 1 : pool->buf = malloc(obj_size*count);</span></span> |
| <span id="L55"><span class="lineNum"> 55</span> :<span class="tlaGNC"> 1 : if (!pool->buf)</span></span> |
| <span id="L56"><span class="lineNum"> 56</span> :<span class="tlaUNC tlaBgUNC"> 0 : return -1;</span></span> |
| <span id="L57"><span class="lineNum"> 57</span> : : </span> |
| <span id="L58"><span class="lineNum"> 58</span> :<span class="tlaGNC tlaBgGNC"> 1 : pool->obj_size = obj_size;</span></span> |
| <span id="L59"><span class="lineNum"> 59</span> :<span class="tlaGNC"> 1 : pool->free_count = count;</span></span> |
| <span id="L60"><span class="lineNum"> 60</span> :<span class="tlaGNC"> 1 : pool->reserved = reserved;</span></span> |
| <span id="L61"><span class="lineNum"> 61</span> :<span class="tlaGNC"> 1 : list_head_init(&pool->free_list);</span></span> |
| <span id="L62"><span class="lineNum"> 62</span> : : </span> |
| <span id="L63"><span class="lineNum"> 63</span> :<span class="tlaGNC"> 11 : for(i = 0; i < count; i++)</span></span> |
| <span id="L64"><span class="lineNum"> 64</span> :<span class="tlaGNC"> 10 : list_add_tail(&pool->free_list,</span></span> |
| <span id="L65"><span class="lineNum"> 65</span> : : (struct list_node *) (pool->buf + obj_size*i));</span> |
| <span id="L66"><span class="lineNum"> 66</span> : : </span> |
| <span id="L67"><span class="lineNum"> 67</span> :<span class="tlaGNC"> 1 : return 0;</span></span> |
| <span id="L68"><span class="lineNum"> 68</span> : : }</span> |
| </pre> |
| </td> |
| </tr> |
| </table> |
| <br> |
| |
| <table width="100%" border=0 cellspacing=0 cellpadding=0> |
| <tr><td class="ruler"><img src="../glass.png" width=3 height=3 alt=""></td></tr> |
| <tr><td class="versionInfo">Generated by: <a href="https://github.com//linux-test-project/lcov" target="_parent">LCOV version 2.0-1</a></td></tr> |
| </table> |
| <br> |
| |
| </body> |
| </html> |
