forked from Mirror/frr

I've spent the last several weeks working on stability fixes to bgpd. These patches fix all of the numerous crashes, assertion failures, memory leaks and memory stomping I could find. Valgrind was used extensively. Added new function bgp_exit() to help catch problems. If "debug bgp" is configured and bgpd exits with status of 0, statistics on remaining lib/memory.c allocations are printed to stderr. It is my hope that other developers will use this to stay on top of memory issues. Example questionable exit: bgpd: memstats: Current memory utilization in module LIB: bgpd: memstats: Link List : 6 bgpd: memstats: Link Node : 5 bgpd: memstats: Hash : 8 bgpd: memstats: Hash Bucket : 2 bgpd: memstats: Hash Index : 8 bgpd: memstats: Work queue : 3 bgpd: memstats: Work queue item : 2 bgpd: memstats: Work queue name string : 3 bgpd: memstats: Current memory utilization in module BGP: bgpd: memstats: BGP instance : 1 bgpd: memstats: BGP peer : 1 bgpd: memstats: BGP peer hostname : 1 bgpd: memstats: BGP attribute : 1 bgpd: memstats: BGP extra attributes : 1 bgpd: memstats: BGP aspath : 1 bgpd: memstats: BGP aspath str : 1 bgpd: memstats: BGP table : 24 bgpd: memstats: BGP node : 1 bgpd: memstats: BGP route : 1 bgpd: memstats: BGP synchronise : 8 bgpd: memstats: BGP Process queue : 1 bgpd: memstats: BGP node clear queue : 1 bgpd: memstats: NOTE: If configuration exists, utilization may be expected. Example clean exit: bgpd: memstats: No remaining tracked memory utilization. This patch fixes bug #397: "Invalid free in bgp_announce_check()". This patch fixes bug #492: "SIGBUS in bgpd/bgp_route.c: bgp_clear_route_node()". My apologies for not separating out these changes into individual patches. The complexity of doing so boggled what is left of my brain. I hope this is all still useful to the community. This code has been production tested, in non-route-server-client mode, on a linux 32-bit box and a 64-bit box. Release/reset functions, used by bgp_exit(), added to: bgpd/bgp_attr.c,h bgpd/bgp_community.c,h bgpd/bgp_dump.c,h bgpd/bgp_ecommunity.c,h bgpd/bgp_filter.c,h bgpd/bgp_nexthop.c,h bgpd/bgp_route.c,h lib/routemap.c,h File by file analysis: * bgpd/bgp_aspath.c: Prevent re-use of ashash after it is released. * bgpd/bgp_attr.c: #if removed uncalled cluster_dup(). * bgpd/bgp_clist.c,h: Allow community_list_terminate() to be called from bgp_exit(). * bgpd/bgp_filter.c: Fix aslist->name use without allocation check, and also fix memory leak. * bgpd/bgp_main.c: Created bgp_exit() exit routine. This function frees allocations made as part of bgpd initialization and, to some extent, configuration. If "debug bgp" is configured, memory stats are printed as described above. * bgpd/bgp_nexthop.c: zclient_new() already allocates stream for ibuf/obuf, so bgp_scan_init() shouldn't do it too. Also, made it so zlookup is global so bgp_exit() can use it. * bgpd/bgp_packet.c: bgp_capability_msg_parse() call to bgp_clear_route() adjusted to use new BGP_CLEAR_ROUTE_NORMAL flag. * bgpd/bgp_route.h: Correct reference counter "lock" to be signed. bgp_clear_route() now accepts a bgp_clear_route_type of either BGP_CLEAR_ROUTE_NORMAL or BGP_CLEAR_ROUTE_MY_RSCLIENT. * bgpd/bgp_route.c: - bgp_process_rsclient(): attr was being zero'ed and then bgp_attr_extra_free() was being called with it, even though it was never filled with valid data. - bgp_process_rsclient(): Make sure rsclient->group is not NULL before use. - bgp_processq_del(): Add call to bgp_table_unlock(). - bgp_process(): Add call to bgp_table_lock(). - bgp_update_rsclient(): memset clearing of new_attr not needed since declarationw with "= { 0 }" does it. memset was already commented out. - bgp_update_rsclient(): Fix screwed up misleading indentation. - bgp_withdraw_rsclient(): Fix screwed up misleading indentation. - bgp_clear_route_node(): Support BGP_CLEAR_ROUTE_MY_RSCLIENT. - bgp_clear_node_queue_del(): Add call to bgp_table_unlock() and also free struct bgp_clear_node_queue used for work item. - bgp_clear_node_complete(): Do peer_unlock() after BGP_EVENT_ADD() in case peer is released by peer_unlock() call. - bgp_clear_route_table(): Support BGP_CLEAR_ROUTE_MY_RSCLIENT. Use struct bgp_clear_node_queue to supply data to worker. Add call to bgp_table_lock(). - bgp_clear_route(): Add support for BGP_CLEAR_ROUTE_NORMAL or BGP_CLEAR_ROUTE_MY_RSCLIENT. - bgp_clear_route_all(): Use BGP_CLEAR_ROUTE_NORMAL. Bug 397 fixes: - bgp_default_originate() - bgp_announce_table() * bgpd/bgp_table.h: - struct bgp_table: Added reference count. Changed type of owner to be "struct peer *" rather than "void *". - struct bgp_node: Correct reference counter "lock" to be signed. * bgpd/bgp_table.c: - Added bgp_table reference counting. - bgp_table_free(): Fixed cleanup code. Call peer_unlock() on owner if set. - bgp_unlock_node(): Added assertion. - bgp_node_get(): Added call to bgp_lock_node() to code path that it was missing from. * bgpd/bgp_vty.c: - peer_rsclient_set_vty(): Call peer_lock() as part of peer assignment to owner. Handle failure gracefully. - peer_rsclient_unset_vty(): Add call to bgp_clear_route() with BGP_CLEAR_ROUTE_MY_RSCLIENT purpose. * bgpd/bgp_zebra.c: Made it so zclient is global so bgp_exit() can use it. * bgpd/bgpd.c: - peer_lock(): Allow to be called when status is "Deleted". - peer_deactivate(): Supply BGP_CLEAR_ROUTE_NORMAL purpose to bgp_clear_route() call. - peer_delete(): Common variable listnode pn. Fix bug in which rsclient was only dealt with if not part of a peer group. Call bgp_clear_route() for rsclient, if appropriate, and do so with BGP_CLEAR_ROUTE_MY_RSCLIENT purpose. - peer_group_get(): Use XSTRDUP() instead of strdup() for conf->host. - peer_group_bind(): Call bgp_clear_route() for rsclient, and do so with BGP_CLEAR_ROUTE_MY_RSCLIENT purpose. - bgp_create(): Use XSTRDUP() instead of strdup() for peer_self->host. - bgp_delete(): Delete peers before groups, rather than after. And then rather than deleting rsclients, verify that there are none at this point. - bgp_unlock(): Add assertion. - bgp_free(): Call bgp_table_finish() rather than doing XFREE() itself. * lib/command.c,h: Compiler warning fixes. Add cmd_terminate(). Fixed massive leak in install_element() in which cmd_make_descvec() was being called more than once for the same cmd->strvec/string/doc. * lib/log.c: Make closezlog() check fp before calling fclose(). * lib/memory.c: Catch when alloc count goes negative by using signed counts. Correct #endif comment. Add log_memstats_stderr(). * lib/memory.h: Add log_memstats_stderr(). * lib/thread.c: thread->funcname was being accessed in thread_call() after it had been freed. Rearranged things so that thread_call() frees funcname. Also made it so thread_master_free() cleans up cpu_record. * lib/vty.c,h: Use global command_cr. Add vty_terminate(). * lib/zclient.c,h: Re-enable zclient_free().
588 lines
14 KiB
C
588 lines
14 KiB
C
/*
|
||
* Memory management routine
|
||
* Copyright (C) 1998 Kunihiro Ishiguro
|
||
*
|
||
* This file is part of GNU Zebra.
|
||
*
|
||
* GNU Zebra is free software; you can redistribute it and/or modify it
|
||
* under the terms of the GNU General Public License as published by the
|
||
* Free Software Foundation; either version 2, or (at your option) any
|
||
* later version.
|
||
*
|
||
* GNU Zebra is distributed in the hope that it will be useful, but
|
||
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
* General Public License for more details.
|
||
*
|
||
* You should have received a copy of the GNU General Public License
|
||
* along with GNU Zebra; see the file COPYING. If not, write to the Free
|
||
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||
* 02111-1307, USA.
|
||
*/
|
||
|
||
#include <zebra.h>
|
||
/* malloc.h is generally obsolete, however GNU Libc mallinfo wants it. */
|
||
#if !defined(HAVE_STDLIB_H) || (defined(GNU_LINUX) && defined(HAVE_MALLINFO))
|
||
#include <malloc.h>
|
||
#endif /* !HAVE_STDLIB_H || HAVE_MALLINFO */
|
||
|
||
#include "log.h"
|
||
#include "memory.h"
|
||
|
||
static void alloc_inc (int);
|
||
static void alloc_dec (int);
|
||
static void log_memstats(int log_priority);
|
||
|
||
static const struct message mstr [] =
|
||
{
|
||
{ MTYPE_THREAD, "thread" },
|
||
{ MTYPE_THREAD_MASTER, "thread_master" },
|
||
{ MTYPE_VECTOR, "vector" },
|
||
{ MTYPE_VECTOR_INDEX, "vector_index" },
|
||
{ MTYPE_IF, "interface" },
|
||
{ 0, NULL },
|
||
};
|
||
|
||
/* Fatal memory allocation error occured. */
|
||
static void __attribute__ ((noreturn))
|
||
zerror (const char *fname, int type, size_t size)
|
||
{
|
||
zlog_err ("%s : can't allocate memory for `%s' size %d: %s\n",
|
||
fname, lookup (mstr, type), (int) size, safe_strerror(errno));
|
||
log_memstats(LOG_WARNING);
|
||
/* N.B. It might be preferable to call zlog_backtrace_sigsafe here, since
|
||
that function should definitely be safe in an OOM condition. But
|
||
unfortunately zlog_backtrace_sigsafe does not support syslog logging at
|
||
this time... */
|
||
zlog_backtrace(LOG_WARNING);
|
||
abort();
|
||
}
|
||
|
||
/* Memory allocation. */
|
||
void *
|
||
zmalloc (int type, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
memory = malloc (size);
|
||
|
||
if (memory == NULL)
|
||
zerror ("malloc", type, size);
|
||
|
||
alloc_inc (type);
|
||
|
||
return memory;
|
||
}
|
||
|
||
/* Memory allocation with num * size with cleared. */
|
||
void *
|
||
zcalloc (int type, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
memory = calloc (1, size);
|
||
|
||
if (memory == NULL)
|
||
zerror ("calloc", type, size);
|
||
|
||
alloc_inc (type);
|
||
|
||
return memory;
|
||
}
|
||
|
||
/* Memory reallocation. */
|
||
void *
|
||
zrealloc (int type, void *ptr, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
memory = realloc (ptr, size);
|
||
if (memory == NULL)
|
||
zerror ("realloc", type, size);
|
||
return memory;
|
||
}
|
||
|
||
/* Memory free. */
|
||
void
|
||
zfree (int type, void *ptr)
|
||
{
|
||
alloc_dec (type);
|
||
free (ptr);
|
||
}
|
||
|
||
/* String duplication. */
|
||
char *
|
||
zstrdup (int type, const char *str)
|
||
{
|
||
void *dup;
|
||
|
||
dup = strdup (str);
|
||
if (dup == NULL)
|
||
zerror ("strdup", type, strlen (str));
|
||
alloc_inc (type);
|
||
return dup;
|
||
}
|
||
|
||
#ifdef MEMORY_LOG
|
||
static struct
|
||
{
|
||
const char *name;
|
||
long alloc;
|
||
unsigned long t_malloc;
|
||
unsigned long c_malloc;
|
||
unsigned long t_calloc;
|
||
unsigned long c_calloc;
|
||
unsigned long t_realloc;
|
||
unsigned long t_free;
|
||
unsigned long c_strdup;
|
||
} mstat [MTYPE_MAX];
|
||
|
||
static void
|
||
mtype_log (char *func, void *memory, const char *file, int line, int type)
|
||
{
|
||
zlog_debug ("%s: %s %p %s %d", func, lookup (mstr, type), memory, file, line);
|
||
}
|
||
|
||
void *
|
||
mtype_zmalloc (const char *file, int line, int type, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
mstat[type].c_malloc++;
|
||
mstat[type].t_malloc++;
|
||
|
||
memory = zmalloc (type, size);
|
||
mtype_log ("zmalloc", memory, file, line, type);
|
||
|
||
return memory;
|
||
}
|
||
|
||
void *
|
||
mtype_zcalloc (const char *file, int line, int type, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
mstat[type].c_calloc++;
|
||
mstat[type].t_calloc++;
|
||
|
||
memory = zcalloc (type, size);
|
||
mtype_log ("xcalloc", memory, file, line, type);
|
||
|
||
return memory;
|
||
}
|
||
|
||
void *
|
||
mtype_zrealloc (const char *file, int line, int type, void *ptr, size_t size)
|
||
{
|
||
void *memory;
|
||
|
||
/* Realloc need before allocated pointer. */
|
||
mstat[type].t_realloc++;
|
||
|
||
memory = zrealloc (type, ptr, size);
|
||
|
||
mtype_log ("xrealloc", memory, file, line, type);
|
||
|
||
return memory;
|
||
}
|
||
|
||
/* Important function. */
|
||
void
|
||
mtype_zfree (const char *file, int line, int type, void *ptr)
|
||
{
|
||
mstat[type].t_free++;
|
||
|
||
mtype_log ("xfree", ptr, file, line, type);
|
||
|
||
zfree (type, ptr);
|
||
}
|
||
|
||
char *
|
||
mtype_zstrdup (const char *file, int line, int type, const char *str)
|
||
{
|
||
char *memory;
|
||
|
||
mstat[type].c_strdup++;
|
||
|
||
memory = zstrdup (type, str);
|
||
|
||
mtype_log ("xstrdup", memory, file, line, type);
|
||
|
||
return memory;
|
||
}
|
||
#else
|
||
static struct
|
||
{
|
||
char *name;
|
||
long alloc;
|
||
} mstat [MTYPE_MAX];
|
||
#endif /* MEMORY_LOG */
|
||
|
||
/* Increment allocation counter. */
|
||
static void
|
||
alloc_inc (int type)
|
||
{
|
||
mstat[type].alloc++;
|
||
}
|
||
|
||
/* Decrement allocation counter. */
|
||
static void
|
||
alloc_dec (int type)
|
||
{
|
||
mstat[type].alloc--;
|
||
}
|
||
|
||
/* Looking up memory status from vty interface. */
|
||
#include "vector.h"
|
||
#include "vty.h"
|
||
#include "command.h"
|
||
|
||
static void
|
||
log_memstats(int pri)
|
||
{
|
||
struct mlist *ml;
|
||
|
||
for (ml = mlists; ml->list; ml++)
|
||
{
|
||
struct memory_list *m;
|
||
|
||
zlog (NULL, pri, "Memory utilization in module %s:", ml->name);
|
||
for (m = ml->list; m->index >= 0; m++)
|
||
if (m->index && mstat[m->index].alloc)
|
||
zlog (NULL, pri, " %-30s: %10ld", m->format, mstat[m->index].alloc);
|
||
}
|
||
}
|
||
|
||
void
|
||
log_memstats_stderr (const char *prefix)
|
||
{
|
||
struct mlist *ml;
|
||
struct memory_list *m;
|
||
int i;
|
||
int j = 0;
|
||
|
||
for (ml = mlists; ml->list; ml++)
|
||
{
|
||
i = 0;
|
||
|
||
for (m = ml->list; m->index >= 0; m++)
|
||
if (m->index && mstat[m->index].alloc)
|
||
{
|
||
if (!i)
|
||
fprintf (stderr,
|
||
"%s: memstats: Current memory utilization in module %s:\n",
|
||
prefix,
|
||
ml->name);
|
||
fprintf (stderr,
|
||
"%s: memstats: %-30s: %10ld%s\n",
|
||
prefix,
|
||
m->format,
|
||
mstat[m->index].alloc,
|
||
mstat[m->index].alloc < 0 ? " (REPORT THIS BUG!)" : "");
|
||
i = j = 1;
|
||
}
|
||
}
|
||
|
||
if (j)
|
||
fprintf (stderr,
|
||
"%s: memstats: NOTE: If configuration exists, utilization may be "
|
||
"expected.\n",
|
||
prefix);
|
||
else
|
||
fprintf (stderr,
|
||
"%s: memstats: No remaining tracked memory utilization.\n",
|
||
prefix);
|
||
}
|
||
|
||
static void
|
||
show_separator(struct vty *vty)
|
||
{
|
||
vty_out (vty, "-----------------------------\r\n");
|
||
}
|
||
|
||
static int
|
||
show_memory_vty (struct vty *vty, struct memory_list *list)
|
||
{
|
||
struct memory_list *m;
|
||
int needsep = 0;
|
||
|
||
for (m = list; m->index >= 0; m++)
|
||
if (m->index == 0)
|
||
{
|
||
if (needsep)
|
||
{
|
||
show_separator (vty);
|
||
needsep = 0;
|
||
}
|
||
}
|
||
else if (mstat[m->index].alloc)
|
||
{
|
||
vty_out (vty, "%-30s: %10ld\r\n", m->format, mstat[m->index].alloc);
|
||
needsep = 1;
|
||
}
|
||
return needsep;
|
||
}
|
||
|
||
#ifdef HAVE_MALLINFO
|
||
static int
|
||
show_memory_mallinfo (struct vty *vty)
|
||
{
|
||
struct mallinfo minfo = mallinfo();
|
||
char buf[MTYPE_MEMSTR_LEN];
|
||
|
||
vty_out (vty, "System allocator statistics:%s", VTY_NEWLINE);
|
||
vty_out (vty, " Total heap allocated: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.arena),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Holding block headers: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.hblkhd),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Used small blocks: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.usmblks),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Used ordinary blocks: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.uordblks),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Free small blocks: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.fsmblks),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Free ordinary blocks: %s%s",
|
||
mtype_memstr (buf, MTYPE_MEMSTR_LEN, minfo.fordblks),
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Ordinary blocks: %ld%s",
|
||
(unsigned long)minfo.ordblks,
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Small blocks: %ld%s",
|
||
(unsigned long)minfo.smblks,
|
||
VTY_NEWLINE);
|
||
vty_out (vty, " Holding blocks: %ld%s",
|
||
(unsigned long)minfo.hblks,
|
||
VTY_NEWLINE);
|
||
vty_out (vty, "(see system documentation for 'mallinfo' for meaning)%s",
|
||
VTY_NEWLINE);
|
||
return 1;
|
||
}
|
||
#endif /* HAVE_MALLINFO */
|
||
|
||
DEFUN (show_memory_all,
|
||
show_memory_all_cmd,
|
||
"show memory all",
|
||
"Show running system information\n"
|
||
"Memory statistics\n"
|
||
"All memory statistics\n")
|
||
{
|
||
struct mlist *ml;
|
||
int needsep = 0;
|
||
|
||
#ifdef HAVE_MALLINFO
|
||
needsep = show_memory_mallinfo (vty);
|
||
#endif /* HAVE_MALLINFO */
|
||
|
||
for (ml = mlists; ml->list; ml++)
|
||
{
|
||
if (needsep)
|
||
show_separator (vty);
|
||
needsep = show_memory_vty (vty, ml->list);
|
||
}
|
||
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
ALIAS (show_memory_all,
|
||
show_memory_cmd,
|
||
"show memory",
|
||
"Show running system information\n"
|
||
"Memory statistics\n")
|
||
|
||
DEFUN (show_memory_lib,
|
||
show_memory_lib_cmd,
|
||
"show memory lib",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"Library memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_lib);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_zebra,
|
||
show_memory_zebra_cmd,
|
||
"show memory zebra",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"Zebra memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_zebra);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_rip,
|
||
show_memory_rip_cmd,
|
||
"show memory rip",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"RIP memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_rip);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_ripng,
|
||
show_memory_ripng_cmd,
|
||
"show memory ripng",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"RIPng memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_ripng);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_bgp,
|
||
show_memory_bgp_cmd,
|
||
"show memory bgp",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"BGP memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_bgp);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_ospf,
|
||
show_memory_ospf_cmd,
|
||
"show memory ospf",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"OSPF memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_ospf);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_ospf6,
|
||
show_memory_ospf6_cmd,
|
||
"show memory ospf6",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"OSPF6 memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_ospf6);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
DEFUN (show_memory_isis,
|
||
show_memory_isis_cmd,
|
||
"show memory isis",
|
||
SHOW_STR
|
||
"Memory statistics\n"
|
||
"ISIS memory\n")
|
||
{
|
||
show_memory_vty (vty, memory_list_isis);
|
||
return CMD_SUCCESS;
|
||
}
|
||
|
||
void
|
||
memory_init (void)
|
||
{
|
||
install_element (RESTRICTED_NODE, &show_memory_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_all_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_lib_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_rip_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_ripng_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_bgp_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_ospf_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_ospf6_cmd);
|
||
install_element (RESTRICTED_NODE, &show_memory_isis_cmd);
|
||
|
||
install_element (VIEW_NODE, &show_memory_cmd);
|
||
install_element (VIEW_NODE, &show_memory_all_cmd);
|
||
install_element (VIEW_NODE, &show_memory_lib_cmd);
|
||
install_element (VIEW_NODE, &show_memory_rip_cmd);
|
||
install_element (VIEW_NODE, &show_memory_ripng_cmd);
|
||
install_element (VIEW_NODE, &show_memory_bgp_cmd);
|
||
install_element (VIEW_NODE, &show_memory_ospf_cmd);
|
||
install_element (VIEW_NODE, &show_memory_ospf6_cmd);
|
||
install_element (VIEW_NODE, &show_memory_isis_cmd);
|
||
|
||
install_element (ENABLE_NODE, &show_memory_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_all_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_lib_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_zebra_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_rip_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_ripng_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_bgp_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_ospf_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_ospf6_cmd);
|
||
install_element (ENABLE_NODE, &show_memory_isis_cmd);
|
||
}
|
||
|
||
/* Stats querying from users */
|
||
/* Return a pointer to a human friendly string describing
|
||
* the byte count passed in. E.g:
|
||
* "0 bytes", "2048 bytes", "110kB", "500MiB", "11GiB", etc.
|
||
* Up to 4 significant figures will be given.
|
||
* The pointer returned may be NULL (indicating an error)
|
||
* or point to the given buffer, or point to static storage.
|
||
*/
|
||
const char *
|
||
mtype_memstr (char *buf, size_t len, unsigned long bytes)
|
||
{
|
||
unsigned int t, g, m, k;
|
||
|
||
/* easy cases */
|
||
if (!bytes)
|
||
return "0 bytes";
|
||
if (bytes == 1)
|
||
return "1 byte";
|
||
|
||
if (sizeof (unsigned long) >= 8)
|
||
/* Hacked to make it not warn on ILP32 machines
|
||
* Shift will always be 40 at runtime. See below too */
|
||
t = bytes >> (sizeof (unsigned long) >= 8 ? 40 : 0);
|
||
else
|
||
t = 0;
|
||
g = bytes >> 30;
|
||
m = bytes >> 20;
|
||
k = bytes >> 10;
|
||
|
||
if (t > 10)
|
||
{
|
||
/* The shift will always be 39 at runtime.
|
||
* Just hacked to make it not warn on 'smaller' machines.
|
||
* Static compiler analysis should mean no extra code
|
||
*/
|
||
if (bytes & (1UL << (sizeof (unsigned long) >= 8 ? 39 : 0)))
|
||
t++;
|
||
snprintf (buf, len, "%4d TiB", t);
|
||
}
|
||
else if (g > 10)
|
||
{
|
||
if (bytes & (1 << 29))
|
||
g++;
|
||
snprintf (buf, len, "%d GiB", g);
|
||
}
|
||
else if (m > 10)
|
||
{
|
||
if (bytes & (1 << 19))
|
||
m++;
|
||
snprintf (buf, len, "%d MiB", m);
|
||
}
|
||
else if (k > 10)
|
||
{
|
||
if (bytes & (1 << 9))
|
||
k++;
|
||
snprintf (buf, len, "%d KiB", k);
|
||
}
|
||
else
|
||
snprintf (buf, len, "%ld bytes", bytes);
|
||
|
||
return buf;
|
||
}
|
||
|
||
unsigned long
|
||
mtype_stats_alloc (int type)
|
||
{
|
||
return mstat[type].alloc;
|
||
}
|