/** \file base64.c
 \brief Base64 encoding and decoding functions
 */
#include "base64.h"
#include <assert.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include "sstring.h"

static const unsigned char *b64alpha = (unsigned char *)
  "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
#define B64PAD ((unsigned char) '=')

/**
 * decode base64 string to plain text
 *
 * @param in base64 text
 * @param l length of in
 * @param out string to store decoded string (memory will be malloced)
 * @return -1 on error (errno will be set), 0 on success, 1 on parse error
 */
int
b64decode(const unsigned char *in, size_t l, string *out)
{
	size_t i, j;
	unsigned char a[4];
	unsigned char b[3];
	char *s;

	if (l == 0) {
		STREMPTY(*out);
		return 0;
	}

	assert(in != NULL);

	out->s = malloc(l + 3);
	if (!out->s) {
		return -1;
	}
	s = out->s;

	for (i = 0; i < l; i += 4) {
		for (j = 0; j < 4; j++) {
			if (((i + j) < l) && (in[i + j] != B64PAD)) {
				unsigned char *c;

				if (in[i + j] == '\r') {
					if (i + j + 1 == l)
						return 1;
					i++;
					if (in[i + j] != '\n')
						return 1;
					i++;
				}

				c = strchr(b64alpha, in[i + j]);
		
				if (!c) {
					return 1;
				}
				a[j] = c - b64alpha;
			} else {
				a[j] = 0;
			}
		}

		b[0] = (a[0] << 2) | (a[1] >> 4);
		b[1] = (a[1] << 4) | (a[2] >> 2);
		b[2] = (a[2] << 6) | (a[3]);

		*s++ = b[0];

		if (in[i + 1] == B64PAD)
			break;
		*s++ = b[1];

		if (in[i + 2] == B64PAD)
			break;
		*s++ = b[2];
	}
	out->len = s - out->s;
	*s = '\0';
	while (out->len && !out->s[out->len - 1])
		--out->len; /* XXX avoid? */
	return 0;
}

/**
 * encode plain text string to Base64
 *
 * @param in plain text string
 * @param out string to store Base64 string (memory will be malloced)
 * @return -1 on error, 0 on success
 */
int
b64encode(const string *in, string *out)
{
	unsigned char a, b, c;
	size_t i;
	char *s;
	unsigned int oline = 0;

	if (in->len == 0) {
		STREMPTY(*out);
		return 0;
	}

	/* how many output characters we need for the input stream */
	i = in->len / 3 * 4;
	/* add one CRLF every 76 characters and some space at the end for padding */
	out->s = malloc(i + (i / 76) * 2 + 5);
	if (!out->s) {
		return -1;
	}
	s = out->s;

	for (i = 0; i < in->len; i += 3) {
		a = in->s[i];
		b = (i + 1 < in->len) ? in->s[i + 1] : 0;
		c = (i + 2 < in->len) ? in->s[i + 2] : 0;

		*s++ = b64alpha[a >> 2];
		*s++ = b64alpha[((a & 3 ) << 4) | (b >> 4)];
		oline += 2;

		if (i + 1 >= in->len) {
			*s++ = B64PAD;
		} else {
			*s++ = b64alpha[((b & 15) << 2) | (c >> 6)];
			oline++;
		}

		if (i + 2 >= in->len) {
			*s++ = B64PAD;
		} else {
			*s++ = b64alpha[c & 63];
			if (oline >= 76) {
				*s++ = '\r';
				*s++ = '\n';
				oline = 0;
			} else {
				oline++;
			}
		}
	}
	out->len = s - out->s;
	*s = '\0';

	return 0;
}