diff options
Diffstat (limited to 'coverage-report/ccan/list/list.h.gcov.html')
| -rw-r--r-- | coverage-report/ccan/list/list.h.gcov.html | 58 |
1 files changed, 29 insertions, 29 deletions
diff --git a/coverage-report/ccan/list/list.h.gcov.html b/coverage-report/ccan/list/list.h.gcov.html index fbd538b..bba56d2 100644 --- a/coverage-report/ccan/list/list.h.gcov.html +++ b/coverage-report/ccan/list/list.h.gcov.html @@ -37,7 +37,7 @@ </tr> <tr> <td class="headerItem">Date:</td> - <td class="headerValue">2022-05-24 17:20:14</td> + <td class="headerValue">2022-06-13 14:57:12</td> <td></td> <td class="headerItem">Functions:</td> <td class="headerCovTableEntry">20</td> @@ -246,17 +246,17 @@ <a name="175"><span class="lineNum"> 175 </span> : : * list_add_after(&h, &c1.list, &c2.list);</a> <a name="176"><span class="lineNum"> 176 </span> : : */</a> <a name="177"><span class="lineNum"> 177 </span> : : #define list_add_after(h, p, n) list_add_after_(h, p, n, LIST_LOC)</a> -<a name="178"><span class="lineNum"> 178 </span> :<span class="lineCov"> 14755 : static inline void list_add_after_(struct list_head *h,</span></a> +<a name="178"><span class="lineNum"> 178 </span> :<span class="lineCov"> 14757 : static inline void list_add_after_(struct list_head *h,</span></a> <a name="179"><span class="lineNum"> 179 </span> : : struct list_node *p,</a> <a name="180"><span class="lineNum"> 180 </span> : : struct list_node *n,</a> <a name="181"><span class="lineNum"> 181 </span> : : const char *abortstr)</a> <a name="182"><span class="lineNum"> 182 </span> : : {</a> -<a name="183"><span class="lineNum"> 183 </span> :<span class="lineCov"> 14755 : n->next = p->next;</span></a> -<a name="184"><span class="lineNum"> 184 </span> :<span class="lineCov"> 14755 : n->prev = p;</span></a> -<a name="185"><span class="lineNum"> 185 </span> :<span class="lineCov"> 14755 : p->next->prev = n;</span></a> -<a name="186"><span class="lineNum"> 186 </span> :<span class="lineCov"> 14755 : p->next = n;</span></a> -<a name="187"><span class="lineNum"> 187 </span> :<span class="lineCov"> 14755 : (void)list_debug(h, abortstr);</span></a> -<a name="188"><span class="lineNum"> 188 </span> :<span class="lineCov"> 14755 : }</span></a> +<a name="183"><span class="lineNum"> 183 </span> :<span class="lineCov"> 14757 : n->next = p->next;</span></a> +<a name="184"><span class="lineNum"> 184 </span> :<span class="lineCov"> 14757 : n->prev = p;</span></a> +<a name="185"><span class="lineNum"> 185 </span> :<span class="lineCov"> 14757 : p->next->prev = n;</span></a> +<a name="186"><span class="lineNum"> 186 </span> :<span class="lineCov"> 14757 : p->next = n;</span></a> +<a name="187"><span class="lineNum"> 187 </span> :<span class="lineCov"> 14757 : (void)list_debug(h, abortstr);</span></a> +<a name="188"><span class="lineNum"> 188 </span> :<span class="lineCov"> 14757 : }</span></a> <a name="189"><span class="lineNum"> 189 </span> : : </a> <a name="190"><span class="lineNum"> 190 </span> : : /**</a> <a name="191"><span class="lineNum"> 191 </span> : : * list_add - add an entry at the start of a linked list.</a> @@ -272,12 +272,12 @@ <a name="201"><span class="lineNum"> 201 </span> : : * parent->num_children++;</a> <a name="202"><span class="lineNum"> 202 </span> : : */</a> <a name="203"><span class="lineNum"> 203 </span> : : #define list_add(h, n) list_add_(h, n, LIST_LOC)</a> -<a name="204"><span class="lineNum"> 204 </span> :<span class="lineCov"> 14690 : static inline void list_add_(struct list_head *h,</span></a> +<a name="204"><span class="lineNum"> 204 </span> :<span class="lineCov"> 14692 : static inline void list_add_(struct list_head *h,</span></a> <a name="205"><span class="lineNum"> 205 </span> : : struct list_node *n,</a> <a name="206"><span class="lineNum"> 206 </span> : : const char *abortstr)</a> <a name="207"><span class="lineNum"> 207 </span> : : {</a> -<a name="208"><span class="lineNum"> 208 </span> :<span class="lineCov"> 14690 : list_add_after_(h, &h->n, n, abortstr);</span></a> -<a name="209"><span class="lineNum"> 209 </span> :<span class="lineCov"> 14690 : }</span></a> +<a name="208"><span class="lineNum"> 208 </span> :<span class="lineCov"> 14692 : list_add_after_(h, &h->n, n, abortstr);</span></a> +<a name="209"><span class="lineNum"> 209 </span> :<span class="lineCov"> 14692 : }</span></a> <a name="210"><span class="lineNum"> 210 </span> : : </a> <a name="211"><span class="lineNum"> 211 </span> : : /**</a> <a name="212"><span class="lineNum"> 212 </span> : : * list_add_before - add an entry before an existing node in a linked list</a> @@ -335,10 +335,10 @@ <a name="264"><span class="lineNum"> 264 </span> : : * assert(list_empty(&parent->children) == (parent->num_children == 0));</a> <a name="265"><span class="lineNum"> 265 </span> : : */</a> <a name="266"><span class="lineNum"> 266 </span> : : #define list_empty(h) list_empty_(h, LIST_LOC)</a> -<a name="267"><span class="lineNum"> 267 </span> :<span class="lineCov"> 164538 : static inline bool list_empty_(const struct list_head *h, const char* abortstr)</span></a> +<a name="267"><span class="lineNum"> 267 </span> :<span class="lineCov"> 164540 : static inline bool list_empty_(const struct list_head *h, const char* abortstr)</span></a> <a name="268"><span class="lineNum"> 268 </span> : : {</a> -<a name="269"><span class="lineNum"> 269 </span> :<span class="lineCov"> 164538 : (void)list_debug(h, abortstr);</span></a> -<a name="270"><span class="lineNum"> 270 </span> :<span class="lineCov"> 164528 : return h->n.next == &h->n;</span></a> +<a name="269"><span class="lineNum"> 269 </span> :<span class="lineCov"> 164540 : (void)list_debug(h, abortstr);</span></a> +<a name="270"><span class="lineNum"> 270 </span> :<span class="lineCov"> 164530 : return h->n.next == &h->n;</span></a> <a name="271"><span class="lineNum"> 271 </span> : : }</a> <a name="272"><span class="lineNum"> 272 </span> : : </a> <a name="273"><span class="lineNum"> 273 </span> : : /**</a> @@ -392,16 +392,16 @@ <a name="321"><span class="lineNum"> 321 </span> : : * parent->num_children--;</a> <a name="322"><span class="lineNum"> 322 </span> : : */</a> <a name="323"><span class="lineNum"> 323 </span> : : #define list_del(n) list_del_(n, LIST_LOC)</a> -<a name="324"><span class="lineNum"> 324 </span> :<span class="lineCov"> 20515 : static inline void list_del_(struct list_node *n, const char* abortstr)</span></a> +<a name="324"><span class="lineNum"> 324 </span> :<span class="lineCov"> 20517 : static inline void list_del_(struct list_node *n, const char* abortstr)</span></a> <a name="325"><span class="lineNum"> 325 </span> : : {</a> -<a name="326"><span class="lineNum"> 326 </span> :<span class="lineCov"> 20515 : (void)list_debug_node(n, abortstr);</span></a> -<a name="327"><span class="lineNum"> 327 </span> :<span class="lineCov"> 20515 : n->next->prev = n->prev;</span></a> -<a name="328"><span class="lineNum"> 328 </span> :<span class="lineCov"> 20515 : n->prev->next = n->next;</span></a> +<a name="326"><span class="lineNum"> 326 </span> :<span class="lineCov"> 20517 : (void)list_debug_node(n, abortstr);</span></a> +<a name="327"><span class="lineNum"> 327 </span> :<span class="lineCov"> 20517 : n->next->prev = n->prev;</span></a> +<a name="328"><span class="lineNum"> 328 </span> :<span class="lineCov"> 20517 : n->prev->next = n->next;</span></a> <a name="329"><span class="lineNum"> 329 </span> : : #ifdef CCAN_LIST_DEBUG</a> <a name="330"><span class="lineNum"> 330 </span> : : /* Catch use-after-del. */</a> -<a name="331"><span class="lineNum"> 331 </span> :<span class="lineCov"> 20515 : n->next = n->prev = NULL;</span></a> +<a name="331"><span class="lineNum"> 331 </span> :<span class="lineCov"> 20517 : n->next = n->prev = NULL;</span></a> <a name="332"><span class="lineNum"> 332 </span> : : #endif</a> -<a name="333"><span class="lineNum"> 333 </span> :<span class="lineCov"> 20515 : }</span></a> +<a name="333"><span class="lineNum"> 333 </span> :<span class="lineCov"> 20517 : }</span></a> <a name="334"><span class="lineNum"> 334 </span> : : </a> <a name="335"><span class="lineNum"> 335 </span> : : /**</a> <a name="336"><span class="lineNum"> 336 </span> : : * list_del_init - delete a node, and reset it so it can be deleted again.</a> @@ -438,21 +438,21 @@ <a name="367"><span class="lineNum"> 367 </span> : : * list_del_from(&parent->children, &child->list);</a> <a name="368"><span class="lineNum"> 368 </span> : : * parent->num_children--;</a> <a name="369"><span class="lineNum"> 369 </span> : : */</a> -<a name="370"><span class="lineNum"> 370 </span> :<span class="lineCov"> 15305 : static inline void list_del_from(struct list_head *h, struct list_node *n)</span></a> +<a name="370"><span class="lineNum"> 370 </span> :<span class="lineCov"> 15307 : static inline void list_del_from(struct list_head *h, struct list_node *n)</span></a> <a name="371"><span class="lineNum"> 371 </span> : : {</a> <a name="372"><span class="lineNum"> 372 </span> : : #ifdef CCAN_LIST_DEBUG</a> <a name="373"><span class="lineNum"> 373 </span> : : {</a> <a name="374"><span class="lineNum"> 374 </span> : : /* Thorough check: make sure it was in list! */</a> <a name="375"><span class="lineNum"> 375 </span> : : struct list_node *i;</a> -<a name="376"><span class="lineNum"> 376 </span> :<span class="lineCov"> 17064 : for (i = h->n.next; i != n; i = i->next)</span></a> +<a name="376"><span class="lineNum"> 376 </span> :<span class="lineCov"> 17066 : for (i = h->n.next; i != n; i = i->next)</span></a> <a name="377"><span class="lineNum"> 377 </span> :<span class="lineCov"> 1759 : assert(i != &h->n);</span></a> <a name="378"><span class="lineNum"> 378 </span> : : }</a> <a name="379"><span class="lineNum"> 379 </span> : : #endif /* CCAN_LIST_DEBUG */</a> <a name="380"><span class="lineNum"> 380 </span> : : </a> <a name="381"><span class="lineNum"> 381 </span> : : /* Quick test that catches a surprising number of bugs. */</a> -<a name="382"><span class="lineNum"> 382 </span> :<span class="lineCov"> 15305 : assert(!list_empty(h));</span></a> -<a name="383"><span class="lineNum"> 383 </span> :<span class="lineCov"> 15305 : list_del(n);</span></a> -<a name="384"><span class="lineNum"> 384 </span> :<span class="lineCov"> 15305 : }</span></a> +<a name="382"><span class="lineNum"> 382 </span> :<span class="lineCov"> 15307 : assert(!list_empty(h));</span></a> +<a name="383"><span class="lineNum"> 383 </span> :<span class="lineCov"> 15307 : list_del(n);</span></a> +<a name="384"><span class="lineNum"> 384 </span> :<span class="lineCov"> 15307 : }</span></a> <a name="385"><span class="lineNum"> 385 </span> : : </a> <a name="386"><span class="lineNum"> 386 </span> : : /**</a> <a name="387"><span class="lineNum"> 387 </span> : : * list_swap - swap out an entry from an (unknown) linked list for a new one.</a> @@ -877,13 +877,13 @@ <a name="806"><span class="lineNum"> 806 </span> : : list_del_from(h, list_node_from_off_((n), (off)))</a> <a name="807"><span class="lineNum"> 807 </span> : : </a> <a name="808"><span class="lineNum"> 808 </span> : : /* Offset helper functions so we only single-evaluate. */</a> -<a name="809"><span class="lineNum"> 809 </span> :<span class="lineCov"> 378033 : static inline void *list_node_to_off_(struct list_node *node, size_t off)</span></a> +<a name="809"><span class="lineNum"> 809 </span> :<span class="lineCov"> 378039 : static inline void *list_node_to_off_(struct list_node *node, size_t off)</span></a> <a name="810"><span class="lineNum"> 810 </span> : : {</a> -<a name="811"><span class="lineNum"> 811 </span> :<span class="lineCov"> 378033 : return (void *)((char *)node - off);</span></a> +<a name="811"><span class="lineNum"> 811 </span> :<span class="lineCov"> 378039 : return (void *)((char *)node - off);</span></a> <a name="812"><span class="lineNum"> 812 </span> : : }</a> -<a name="813"><span class="lineNum"> 813 </span> :<span class="lineCov"> 605728 : static inline struct list_node *list_node_from_off_(void *ptr, size_t off)</span></a> +<a name="813"><span class="lineNum"> 813 </span> :<span class="lineCov"> 605737 : static inline struct list_node *list_node_from_off_(void *ptr, size_t off)</span></a> <a name="814"><span class="lineNum"> 814 </span> : : {</a> -<a name="815"><span class="lineNum"> 815 </span> :<span class="lineCov"> 605728 : return (struct list_node *)((char *)ptr + off);</span></a> +<a name="815"><span class="lineNum"> 815 </span> :<span class="lineCov"> 605737 : return (struct list_node *)((char *)ptr + off);</span></a> <a name="816"><span class="lineNum"> 816 </span> : : }</a> <a name="817"><span class="lineNum"> 817 </span> : : </a> <a name="818"><span class="lineNum"> 818 </span> : : /* Get the offset of the member, but make sure it's a list_node. */</a> |