/* -*-c-*-
*
- * $Id: gfx-kmul.c,v 1.4 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Karatsuba's multiplication algorithm on binary polynomials
*
ok = 0;
}
- free(a); free(b); free(c); free(d); free(s);
+ xfree(a); xfree(b); xfree(c); xfree(d); xfree(s);
return (ok);
}
/* -*-c-*-
*
- * $Id: gfx-sqr.c,v 1.4 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Sqaring binary polynomials
*
ok = 0;
}
- free(a); free(b); free(d);
+ xfree(a); xfree(b); xfree(d);
return (ok);
}
/* -*-c-*-
*
- * $Id: gfx.c,v 1.2 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Low-level arithmetic on binary polynomials
*
ok = 0;
}
- free(a); free(b); free(c); free(d);
+ xfree(a); xfree(b); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(c); free(d);
+ xfree(a); xfree(b); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(r); free(q); free(qq);
+ xfree(a); xfree(b); xfree(r); xfree(q); xfree(qq);
return (ok);
}
/* -*-c-*-
*
- * $Id: hash.h,v 1.5 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Generic handling for message digest functions
*
putchar('\n'); \
ok = 0; \
} \
- free(p); \
+ xfree(p); \
dstr_destroy(&d); \
return (ok); \
} \
/* -*-c-*-
*
- * $Id: key-attr.c,v 1.5 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Key attribute manipulation
*
if (v) {
a = sym_find(&k->a, n, -1, sizeof(*a), &found);
if (found)
- free(a->p);
+ xfree(a->p);
a->p = xstrdup(v);
} else if ((a = sym_find(&k->a, n, -1, 0, 0)) != 0) {
- free(a->p);
+ xfree(a->p);
sym_remove(&k->a, a);
}
if (key_chkcomment(c))
return (KERR_BADCOMMENT);
if (k->c)
- free(k->c);
+ xfree(k->c);
if (c)
k->c = xstrdup(c);
else
kr = sym_find(&f->bytag, k->tag, -1, 0, 0);
assert(((void)"No bytag link", kr));
sym_remove(&f->bytag, kr);
- free(k->tag);
+ xfree(k->tag);
}
/* --- Done --- */
/* -*-c-*-
*
- * $Id: key-fetch.c,v 1.2 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Higher-level key unpacking
*
offsetof(key_packstruct, kp));
key_unpackdone(kp);
if (kps->name)
- free(kps);
+ xfree(kps);
}
/*----- That's all, folks -------------------------------------------------*/
/* -*-c-*-
*
- * $Id: key-pass.c,v 1.5 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Encrypting keys with passphrases
*
/* --- Done --- */
- free(p);
+ xfree(p);
return (0);
/* --- Tidy up if things went wrong --- */
fail:
BURN(b);
- free(p);
+ xfree(p);
return (-1);
}
/* -*-c-*-
*
- * $Id: lmem.c,v 1.6 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Locked memory allocation (Unix-specific)
*
if (lm->f & LF_LOCKED)
munmap(lm->p, lm->sz);
else
- free(lm->p);
+ free(lm->p); /*sic*/
}
/* --- @l_report@ --- *
/* -*-c-*-
*
- * $Id: mpcrt.c,v 1.6 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Chinese Remainder Theorem computations (Gauss's algorithm)
*
mp_drop(a);
mp_drop(b);
mpcrt_destroy(&c);
- free(m);
- free(r);
+ xfree(m);
+ xfree(r);
assert(mparena_count(MPARENA_GLOBAL) == 0);
return (ok);
}
/* -*-c-*-
*
- * $Id: mpx-kmul.c,v 1.10 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Karatsuba's multiplication algorithm
*
ok = 0;
}
- free(a); free(b); free(c); free(d); free(s);
+ xfree(a); xfree(b); xfree(c); xfree(d); xfree(s);
return (ok);
}
/* -*-c-*-
*
- * $Id: mpx-ksqr.c,v 1.8 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Karatsuba-based squaring algorithm
*
ok = 0;
}
- free(a); free(c); free(d); free(s);
+ xfree(a); xfree(c); xfree(d); xfree(s);
return (ok);
}
/* -*-c-*-
*
- * $Id: mpx.c,v 1.20 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Low-level multiprecision arithmetic
*
if (!ok)
dumpbits("input data", v->buf, v->len);
- free(m);
+ xfree(m);
dstr_destroy(&d);
return (ok);
}
dumpbits("neg", v[1].buf, v[1].len);
}
- free(m);
+ xfree(m);
dstr_destroy(&d);
return (ok);
dumpbits("neg", v[1].buf, v[1].len);
}
- free(m);
+ xfree(m);
dstr_destroy(&d);
return (ok);
ok = 0;
}
- free(a); free(c); free(d);
+ xfree(a); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(c); free(d);
+ xfree(a); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(c); free(d);
+ xfree(a); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(c); free(d);
+ xfree(a); xfree(b); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(c); free(d);
+ xfree(a); xfree(b); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(c); free(d);
+ xfree(a); xfree(b); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(c); free(d);
+ xfree(a); xfree(c); xfree(d);
return (ok);
}
ok = 0;
}
- free(a); free(b); free(r); free(q); free(s); free(qq);
+ xfree(a); xfree(b); xfree(r); xfree(q); xfree(s); xfree(qq);
return (ok);
}
/* -*-c-*-
*
- * $Id: pixie-client.c,v 1.3 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Simple passphrase pixie client (Unix-specific)
*
sun = pixie_address(sock, &sz);
if (connect(fd, (struct sockaddr *)sun, sz))
goto fail_1;
- free(sun);
+ xfree(sun);
return (fd);
/* --- Tidy up if things went wrong --- */
fail_1:
- free(sun);
+ xfree(sun);
close(fd);
fail_0:
return (-1);
/* -*-c-*-
*
- * $Id: pixie.c,v 1.14 2004/04/08 01:36:15 mdw Exp $
+ * $Id$
*
* Passphrase pixie for Catacomb
*
{
if (p->t)
sel_rmtimer(&p->timer);
- free(p->tag);
+ xfree(p->tag);
l_free(&lm, p->p);
p->next->prev = p->prev;
p->prev->next = p->next;