bmake_malloc
ar = bmake_malloc(sizeof *ar);
struct ar_hdr *cached_hdr = bmake_malloc(
ar->fnametab = bmake_malloc(size);
buf->data = bmake_malloc(cap);
cond_states = bmake_malloc(
guard = bmake_malloc(sizeof(*guard));
guard = bmake_malloc(sizeof(*guard));
CachedDir *dir = bmake_malloc(sizeof *dir);
cst = bmake_malloc(sizeof *cst);
char *s = bmake_malloc(s_len + 1);
ForLoop *f = bmake_malloc(sizeof *f);
HashEntry **buckets = bmake_malloc(sizeof *buckets * n);
HashEntry **newBuckets = bmake_malloc(sizeof *newBuckets * newSize);
he = bmake_malloc(sizeof *he + (size_t)(keyEnd - key));
job_table = bmake_malloc((size_t)opts.maxJobs * sizeof *job_table);
fds = bmake_malloc(sizeof *fds * nfds);
jobByFdIndex = bmake_malloc(sizeof *jobByFdIndex * nfds);
shell = bmake_malloc(sizeof *shell);
char *esc = bmake_malloc(strlen(cmd) * 2 + 1);
v->items = bmake_malloc(v->cap * v->itemSize);
ListNode *ln = bmake_malloc(sizeof *ln);
exploded = bmake_malloc((size_t)(p - flags) * 3 + 1);
fname = bmake_malloc(len + 20);
SearchPath *path = bmake_malloc(sizeof *path);
p = bmake_malloc(size);
char *p = bmake_malloc(len + 1);
void *bmake_malloc(size_t) MAKE_ATTR_USE;
buf = bmake_malloc(bufsz);
List *list = bmake_malloc(sizeof *list);
words_buf = bmake_malloc(str_len + 1);
words = bmake_malloc((words_cap + 1) * sizeof(words[0]));
words.words = bmake_malloc((swords.len + 1) * sizeof(words.words[0]));
char *result = bmake_malloc(len1 + len2 + 1);
char *result = bmake_malloc(len1 + len2 + len3 + 1);
buf->data = bmake_malloc(buf->cap);
Suffix *suff = bmake_malloc(sizeof *suff);
Candidate *cand = bmake_malloc(sizeof *cand);
gn = bmake_malloc(sizeof *gn);
char *errbuf = bmake_malloc(errlen);
words.words = bmake_malloc(sizeof(words.words[0]));
buf = bmake_malloc(9);
pattern = bmake_malloc((size_t)(endpat - (mod + 1)) + 1);
char *res = bmake_malloc(n);
char *res = bmake_malloc(n);
char *res = bmake_malloc(n);
Var *var = bmake_malloc(sizeof *var);
newenv = bmake_malloc(2 * sizeof(char *));