From c8348999636a02c518bc38ed58adbc8a4ced0b2a Mon Sep 17 00:00:00 2001
From: Kevin Wasserman <kevin.wasserman@painless-security.com>
Date: Tue, 28 Jun 2011 13:07:27 -0400
Subject: [PATCH] Added vasprintf.c

For systems (e.g. windows) lacking native vasprintf.  Cribbed from krb5 with minor modification.
---
 moonshot/mech_eap/vasprintf.c | 110 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 110 insertions(+)
 create mode 100644 moonshot/mech_eap/vasprintf.c

diff --git a/moonshot/mech_eap/vasprintf.c b/moonshot/mech_eap/vasprintf.c
new file mode 100644
index 0000000..8048382
--- /dev/null
+++ b/moonshot/mech_eap/vasprintf.c
@@ -0,0 +1,110 @@
+/* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
+/*
+ * printf.c
+ *
+ * Copyright 2003, 2004, 2005, 2007, 2008 Massachusetts Institute of Technology.
+ * All Rights Reserved.
+ *
+ * Export of this software from the United States of America may
+ *   require a specific license from the United States Government.
+ *   It is the responsibility of any person or organization contemplating
+ *   export to obtain such a license before exporting.
+ *
+ * WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
+ * distribute this software and its documentation for any purpose and
+ * without fee is hereby granted, provided that the above copyright
+ * notice appear in all copies and that both that copyright notice and
+ * this permission notice appear in supporting documentation, and that
+ * the name of M.I.T. not be used in advertising or publicity pertaining
+ * to distribution of the software without specific, written prior
+ * permission.  Furthermore if you modify this software you must label
+ * your software as modified software and not distribute it in such a
+ * fashion that it might be confused with the original M.I.T. software.
+ * M.I.T. makes no representations about the suitability of
+ * this software for any purpose.  It is provided "as is" without express
+ * or implied warranty.
+ *
+ *
+ * Provide {,v}asprintf for platforms that don't have them.
+ */
+
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <malloc.h>
+
+#ifndef SIZE_MAX
+# define SIZE_MAX ((size_t)((size_t)0 - 1))
+#endif
+#if defined(HAS_VA_COPY) || defined(va_copy)
+/* Do nothing.  */
+#elif defined(CAN_COPY_VA_LIST)
+#define va_copy(dest, src)      ((dest) = (src))
+#else
+/* Assume array type, but still simply copyable.
+
+   There is, theoretically, the possibility that va_start will
+   allocate some storage pointed to by the va_list, and in that case
+   we'll just lose.  If anyone cares, we could try to devise a test
+   for that case.  */
+#define va_copy(dest, src)      memcmp(dest, src, sizeof(va_list))
+#endif
+
+/* On error: BSD: Set *ret to NULL.  GNU: *ret is undefined.
+
+   Since we want to be able to use the GNU version directly, we need
+   provide only the weaker guarantee in this version.  */
+int
+vasprintf(char **ret, const char *format, va_list ap)
+{
+    va_list ap2;
+    char *str = NULL, *nstr;
+    size_t len = 80;
+    int len2;
+
+    while (1) {
+        if (len >= SIZE_MAX || len == 0)
+            goto fail;
+        nstr = realloc(str, len);
+        if (nstr == NULL)
+            goto fail;
+        str = nstr;
+        va_copy(ap2, ap);
+        len2 = vsnprintf(str, len, format, ap2);
+        va_end(ap2);
+        /* ISO C vsnprintf returns the needed length.  Some old
+           vsnprintf implementations return -1 on truncation.  */
+        if (len2 < 0) {
+            /* Don't know how much space we need, just that we didn't
+               supply enough; get a bigger buffer and try again.  */
+            if (len <= SIZE_MAX/2)
+                len *= 2;
+            else if (len < SIZE_MAX)
+                len = SIZE_MAX;
+            else
+                goto fail;
+        } else if ((unsigned int) len2 >= SIZE_MAX) {
+            /* Need more space than we can request.  */
+            goto fail;
+        } else if ((size_t) len2 >= len) {
+            /* Need more space, but we know how much.  */
+            len = (size_t) len2 + 1;
+        } else {
+            /* Success!  */
+            break;
+        }
+    }
+    /* We might've allocated more than we need, if we're still using
+       the initial guess, or we got here by doubling.  */
+    if ((size_t) len2 < len - 1) {
+        nstr = realloc(str, (size_t) len2 + 1);
+        if (nstr)
+            str = nstr;
+    }
+    *ret = str;
+    return len2;
+
+fail:
+    free(str);
+    return -1;
+}
-- 
2.1.4