vm_pswpin;
vm_pswpout;
vminfo;
- xalloc_err_handler;
- xcalloc;
- xmalloc;
- xrealloc;
- xstrdup;
local:
*;
};
format_node *p_end = &pfn;
format_node *t_end = &tfn;
while(walk){
- format_node *new = xmalloc(sizeof(format_node));
+ format_node *new = malloc(sizeof(format_node));
memcpy(new,walk,sizeof(format_node));
p_end->next = walk;
t_end->next = new;
if(!sort_list) { /* assume start time order */
incoming = search_format_array("start_time");
if(!incoming) { fprintf(stderr, "Could not find start_time!\n"); exit(1); }
- tmp_list = xmalloc(sizeof(sort_node));
+ tmp_list = malloc(sizeof(sort_node));
tmp_list->reverse = 0;
tmp_list->typecode = '?'; /* what was this for? */
tmp_list->sr = incoming->sr;
/* this is required for the forest option */
incoming = search_format_array("ppid");
if(!incoming) { fprintf(stderr, "Could not find ppid!\n"); exit(1); }
- tmp_list = xmalloc(sizeof(sort_node));
+ tmp_list = malloc(sizeof(sort_node));
tmp_list->reverse = 0;
tmp_list->typecode = '?'; /* what was this for? */
tmp_list->sr = incoming->sr;
#include "common.h"
#include <sys/sysmacros.h>
-#include "../proc/alloc.h"
#include "../proc/wchan.h"
#include "../proc/version.h"
#include "../proc/sysinfo.h"
if(sl > 15) return "Environment specified an unknown personality.";
strncpy(buf, s, sl);
buf[sl] = '\0';
- saved_personality_text = xstrdup(buf);
+ if ((saved_personality_text = strdup(buf))==NULL) {
+ fprintf(stderr, "Cannot strdup() personality text.\n");
+ exit(EXIT_FAILURE);
+ }
found = bsearch(&findme, personality_table, personality_table_count,
sizeof(personality_table_struct), compare_personality_table_structs
int need_item;
const char *err; /* error code that could or did happen */
/*** prepare to operate ***/
- node = xmalloc(sizeof(selection_node));
- node->u = xmalloc(strlen(arg)*sizeof(sel_union)); /* waste is insignificant */
+ node = malloc(sizeof(selection_node));
+ node->u = malloc(strlen(arg)*sizeof(sel_union)); /* waste is insignificant */
node->n = 0;
- buf = xstrdup(arg);
+ buf = strdup(arg);
/*** sanity check and count items ***/
need_item = 1; /* true */
items = 0;
/* put our tty on a tiny list */
{
selection_node *node;
- node = xmalloc(sizeof(selection_node));
- node->u = xmalloc(sizeof(sel_union));
+ node = malloc(sizeof(selection_node));
+ node->u = malloc(sizeof(sel_union));
node->u[0].tty = cached_tty;
node->typecode = SEL_TTY;
node->n = 1;
if(!arg){
/* Wow, obsolete BSD syntax. Put our tty on a tiny list. */
selection_node *node;
- node = xmalloc(sizeof(selection_node));
- node->u = xmalloc(sizeof(sel_union));
+ node = malloc(sizeof(selection_node));
+ node->u = malloc(sizeof(sel_union));
node->u[0].tty = cached_tty;
node->typecode = SEL_TTY;
node->n = 1;
argp = ps_argv + thisarg;
thisarg = ps_argc - 1; /* we must be at the end now */
- pidnode = xmalloc(sizeof(selection_node));
- pidnode->u = xmalloc(i*sizeof(sel_union)); /* waste is insignificant */
+ pidnode = malloc(sizeof(selection_node));
+ pidnode->u = malloc(i*sizeof(sel_union)); /* waste is insignificant */
pidnode->n = 0;
- grpnode = xmalloc(sizeof(selection_node));
- grpnode->u = xmalloc(i*sizeof(sel_union)); /* waste is insignificant */
+ grpnode = malloc(sizeof(selection_node));
+ grpnode->u = malloc(i*sizeof(sel_union)); /* waste is insignificant */
grpnode->n = 0;
- sidnode = xmalloc(sizeof(selection_node));
- sidnode->u = xmalloc(i*sizeof(sel_union)); /* waste is insignificant */
+ sidnode = malloc(sizeof(selection_node));
+ sidnode->u = malloc(i*sizeof(sel_union)); /* waste is insignificant */
sidnode->n = 0;
while(i--){
#include <pwd.h>
#include <grp.h>
-#include "../proc/alloc.h"
#include "../proc/readproc.h"
#include "../proc/sysinfo.h"
#include "common.h"
if(fs){
int w1, w2;
format_node *thisnode;
- thisnode = xmalloc(sizeof(format_node));
+ thisnode = malloc(sizeof(format_node));
if(fs->flags & CF_PIDMAX){
w1 = (int)get_pid_digits();
w2 = strlen(fs->head);
if(override){
w2 = strlen(override);
thisnode->width = (w1>w2)?w1:w2;
- thisnode->name = xstrdup(override);
+ thisnode->name = strdup(override);
}else{
thisnode->width = w1;
- thisnode->name = xstrdup(fs->head);
+ thisnode->name = strdup(fs->head);
}
thisnode->pr = fs->pr;
thisnode->need = fs->need;
}
/*** sanity check passed ***/
- buf = xstrdup(sfn->sf);
+ buf = strdup(sfn->sf);
walk = sfn->sf;
while(items--){
}
buf[len] = '\0';
walk += len;
- fnode = xmalloc(sizeof(format_node));
+ fnode = malloc(sizeof(format_node));
fnode->width = len;
- fnode->name = xstrdup(buf);
+ fnode->name = strdup(buf);
fnode->pr = NULL; /* checked for */
fnode->need = 0;
fnode->vendor = AIX;
static char errbuf[80]; /* for variable-text error message */
/*** prepare to operate ***/
- buf = xstrdup(sfn->sf);
+ buf = strdup(sfn->sf);
/*** sanity check and count items ***/
need_item = 1; /* true */
fs = search_format_array(spec);
if(fs){
sort_node *thisnode;
- thisnode = xmalloc(sizeof(sort_node));
+ thisnode = malloc(sizeof(sort_node));
thisnode->sr = fs->sr;
thisnode->need = fs->need;
thisnode->reverse = reverse;
int need_item;
/*** prepare to operate ***/
- buf = xstrdup(sfn->sf);
+ buf = strdup(sfn->sf);
/*** sanity check and count items ***/
need_item = 1; /* true */
const format_struct *fs;
int need_item = 1;
- sfn = xmalloc(sizeof(sf_node));
- sfn->sf = xstrdup(arg);
+ sfn = malloc(sizeof(sf_node));
+ sfn->sf = strdup(arg);
sfn->sf_code = source;
sfn->s_cooked = NULL;
sfn->f_cooked = NULL;
if( (format_flags & FF_Ul) && !(format_modifiers & FM_y) ){
if(personality & PER_IRIX_l){ /* add "rss" then ':' here */
PUSH("sgi_rss");
- fn = xmalloc(sizeof(format_node));
+ fn = malloc(sizeof(format_node));
fn->width = 1;
- fn->name = xstrdup(":");
+ fn->name = strdup(":");
fn->pr = NULL; /* checked for */
fn->need = 0;
fn->vendor = AIX; /* yes, for SGI weirdness */
#include <unistd.h>
#include <values.h>
-#include "proc/alloc.h"
#include "proc/devname.h"
#include "proc/procps.h"
#include "proc/readproc.h"
// we'll only grow our Pseudo_screen, never shrink it
if (pseudo_max < Pseudo_size) {
pseudo_max = Pseudo_size;
- Pseudo_screen = xrealloc(Pseudo_screen, pseudo_max);
+ Pseudo_screen = realloc(Pseudo_screen, pseudo_max);
}
PSU_CLREOS(0);
if (Frames_resize) putp(Cap_clr_scr);
/* note: we allocate one more CPU_t than Cpu_tot so that the last slot
can hold tics representing the /proc/stat cpu summary (the first
line read) -- that slot supports our View_CPUSUM toggle */
- cpus = xcalloc((1 + Cpu_tot) * sizeof(CPU_t));
+ if ((cpus = calloc((1 + Cpu_tot),sizeof(CPU_t)))==NULL)
+ error_exit(fmtmk("failed to allocate memory for CPU_t"));
}
rewind(fp);
fflush(fp);
if (Frame_maxtask+1 >= HHist_siz) {
HHist_siz = HHist_siz * 5 / 4 + 100;
- PHist_sav = xrealloc(PHist_sav, sizeof(HST_t) * HHist_siz);
- PHist_new = xrealloc(PHist_new, sizeof(HST_t) * HHist_siz);
+ PHist_sav = realloc(PHist_sav, sizeof(HST_t) * HHist_siz);
+ PHist_new = realloc(PHist_new, sizeof(HST_t) * HHist_siz);
}
/* calculate time in this process; the sum of user time (utime) and
for (;;) {
if (n_used == n_alloc) {
n_alloc = 10 + ((n_alloc * 5) / 4); // grow by over 25%
- private_ppt = xrealloc(private_ppt, sizeof(proc_t*) * n_alloc);
+ private_ppt = realloc(private_ppt, sizeof(proc_t*) * n_alloc);
// ensure NULL pointers for the additional memory just acquired
memset(private_ppt + n_used, 0, sizeof(proc_t*) * (n_alloc - n_used));
}
else {
n_saved = n_alloc;
for (i = 0; i < GROUPSMAX; i++) {
- Winstk[i].ppt = xrealloc(Winstk[i].ppt, sizeof(proc_t*) * n_alloc);
+ Winstk[i].ppt = realloc(Winstk[i].ppt, sizeof(proc_t*) * n_alloc);
memcpy(Winstk[i].ppt, private_ppt, sizeof(proc_t*) * n_used);
}
}
// setup our program name and library error message handler -- big!
Myname = strrchr(me, '/');
if (Myname) ++Myname; else Myname = me;
- xalloc_err_handler = library_err;
// establish cpu particulars -- even bigger!
#ifdef PRETEND4CPUS
qsort(Seed_ppt, Frame_maxtask, sizeof(proc_t*), Fieldstab[P_PPD].sort);
if (hwmsav < Frame_maxtask) { // grow, but never shrink
hwmsav = Frame_maxtask;
- Tree_ppt = xrealloc(Tree_ppt, sizeof(proc_t*) * hwmsav);
+ Tree_ppt = realloc(Tree_ppt, sizeof(proc_t*) * hwmsav);
}
while (0 == Seed_ppt[i]->ppid) // identify trees (expect 2)
forest_add(i++, 1); // add parent plus children