1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: clib/src/list.c $ */
/* */
/* OpenPOWER FFS Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2014,2015 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or */
/* implied. See the License for the specific language governing */
/* permissions and limitations under the License. */
/* */
/* IBM_PROLOG_END_TAG */
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <errno.h>
#include "assert.h"
#include "misc.h"
#include "list.h"
/* ======================================================================= */
void list_dump(list_t * self, FILE * out)
{
assert(self != NULL);
fprintf(out,
"===================================================================\n");
fprintf(out, "head: %8x node: %8x\n", (uint32_t) self,
(uint32_t) & self->node);
list_node_t *node = &self->node;
do {
fprintf(out, " node: %8x - prev: %8x - next: %8x\n",
(uint32_t) node, (uint32_t) node->prev,
(uint32_t) node->next);
node = node->next;
} while (node != &self->node);
fprintf(out,
"===================================================================\n");
}
|
