Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2 | pj | 1 | /* |
2 | * Project: S.Ha.R.K. |
||
3 | * |
||
4 | * Coordinators: |
||
5 | * Giorgio Buttazzo <giorgio@sssup.it> |
||
6 | * Paolo Gai <pj@gandalf.sssup.it> |
||
7 | * |
||
8 | * Authors : |
||
9 | * Paolo Gai <pj@gandalf.sssup.it> |
||
10 | * (see the web pages for full authors list) |
||
11 | * |
||
12 | * ReTiS Lab (Scuola Superiore S.Anna - Pisa - Italy) |
||
13 | * |
||
14 | * http://www.sssup.it |
||
15 | * http://retis.sssup.it |
||
16 | * http://shark.sssup.it |
||
17 | */ |
||
18 | |||
19 | /** |
||
20 | ------------ |
||
21 | CVS : $Id: stats.c,v 1.1.1.1 2002-03-29 14:12:52 pj Exp $ |
||
22 | |||
23 | File: $File$ |
||
24 | Revision: $Revision: 1.1.1.1 $ |
||
25 | Last update: $Date: 2002-03-29 14:12:52 $ |
||
26 | ------------ |
||
27 | |||
28 | this code is from: |
||
29 | List-based Memory Management, from OsKit. |
||
30 | |||
31 | **/ |
||
32 | |||
33 | /* |
||
34 | * Copyright (C) 2000 Paolo Gai |
||
35 | * |
||
36 | * This program is free software; you can redistribute it and/or modify |
||
37 | * it under the terms of the GNU General Public License as published by |
||
38 | * the Free Software Foundation; either version 2 of the License, or |
||
39 | * (at your option) any later version. |
||
40 | * |
||
41 | * This program is distributed in the hope that it will be useful, |
||
42 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
||
43 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||
44 | * GNU General Public License for more details. |
||
45 | * |
||
46 | * You should have received a copy of the GNU General Public License |
||
47 | * along with this program; if not, write to the Free Software |
||
48 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||
49 | * |
||
50 | */ |
||
51 | /* |
||
52 | * Copyright (c) 1995, 1998-1999 University of Utah and the Flux Group. |
||
53 | * All rights reserved. |
||
54 | * |
||
55 | * This file is part of the Flux OSKit. The OSKit is free software, also known |
||
56 | * as "open source;" you can redistribute it and/or modify it under the terms |
||
57 | * of the GNU General Public License (GPL), version 2, as published by the Free |
||
58 | * Software Foundation (FSF). To explore alternate licensing terms, contact |
||
59 | * the University of Utah at csl-dist@cs.utah.edu or +1-801-585-3271. |
||
60 | * |
||
61 | * The OSKit is distributed in the hope that it will be useful, but WITHOUT ANY |
||
62 | * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
||
63 | * FOR A PARTICULAR PURPOSE. See the GPL for more details. You should have |
||
64 | * received a copy of the GPL along with the OSKit; see the file COPYING. If |
||
65 | * not, write to the FSF, 59 Temple Place #330, Boston, MA 02111-1307, USA. |
||
66 | */ |
||
67 | /* |
||
68 | * Debugging routine: |
||
69 | * dump a summary of LMM memory pool usage. |
||
70 | */ |
||
71 | |||
72 | #ifndef DEBUG |
||
73 | #define DEBUG |
||
74 | #endif |
||
75 | |||
76 | #include <ll/stdio.h> |
||
77 | #include <kernel/func.h> |
||
78 | |||
79 | #include <kernel/lmm.h> |
||
80 | #define assert(test) assertk(test) |
||
81 | |||
82 | void lmm_stats(lmm_t *lmm) |
||
83 | { |
||
84 | struct lmm_region *reg; |
||
85 | unsigned int regions, nodes, memfree; |
||
86 | |||
87 | regions = nodes = memfree = 0; |
||
88 | for (reg = lmm->regions; reg; reg = reg->next) |
||
89 | { |
||
90 | struct lmm_node *node; |
||
91 | size_t free_check; |
||
92 | |||
93 | CHECKREGPTR(reg); |
||
94 | |||
95 | regions++; |
||
96 | |||
97 | free_check = 0; |
||
98 | for (node = reg->nodes; node; node = node->next) |
||
99 | { |
||
100 | assert(((DWORD)node & ALIGN_MASK) == 0); |
||
101 | assert((node->size & ALIGN_MASK) == 0); |
||
102 | assert(node->size >= sizeof(*node)); |
||
103 | assert((node->next == 0) || (node->next > node)); |
||
104 | assert((DWORD)node < reg->max); |
||
105 | |||
106 | nodes++; |
||
107 | |||
108 | free_check += node->size; |
||
109 | } |
||
110 | assert(reg->free == free_check); |
||
111 | |||
112 | memfree += reg->free; |
||
113 | } |
||
114 | |||
115 | kern_printf("LMM=%p: %u bytes in %u regions, %d nodes\n", |
||
116 | lmm, memfree, regions, nodes); |
||
117 | } |
||
118 |