260 lines
4.9 KiB
C
260 lines
4.9 KiB
C
/*
|
|
* This file is part of libdice.
|
|
*
|
|
* Copyright (C) 2018 Florian Stinglmayr <florian@n0la.org>
|
|
*
|
|
* libdice is free software: you can redistribute it and/or modify it
|
|
* under the terms of the GNU Lesser General Public License as
|
|
* published by the Free Software Foundation, either version 3 of the
|
|
* License, or (at your option) any later version.
|
|
*
|
|
* libdice is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with libdice. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "dice.h"
|
|
#include "dice_parse.h"
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
|
|
#include "config.h"
|
|
|
|
#ifndef HAVE_ARC4RANDOM_UNIFORM
|
|
#include <bsd/stdlib.h>
|
|
#endif
|
|
|
|
extern int yylex_init_extra(void *extra, void **state);
|
|
extern int yylex_destroy(void *state);
|
|
extern void yylex(void *state);
|
|
extern void yy_switch_to_buffer(void *buffer, void *scanner);
|
|
extern void *yy_scan_string(char const *s, void *scanner);
|
|
extern void yy_delete_buffer(void *b, void *scanner);
|
|
|
|
struct dice_
|
|
{
|
|
int consumed;
|
|
bool fudge;
|
|
|
|
uint32_t amount;
|
|
uint32_t sides;
|
|
|
|
char *error;
|
|
};
|
|
|
|
dice_t dice_new(void)
|
|
{
|
|
dice_t tmp = calloc(1, sizeof(struct dice_));
|
|
|
|
if (tmp == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
return tmp;
|
|
}
|
|
|
|
void dice_free(dice_t t)
|
|
{
|
|
if (t == NULL) {
|
|
return;
|
|
}
|
|
|
|
free(t->error);
|
|
free(t);
|
|
}
|
|
|
|
void dice_result_free(dice_result_t *r)
|
|
{
|
|
if (r == NULL) {
|
|
return;
|
|
}
|
|
|
|
free(r);
|
|
}
|
|
|
|
void dice_result_freev(dice_result_t *r, size_t len)
|
|
{
|
|
if (r == NULL || len == 0) {
|
|
return;
|
|
}
|
|
|
|
free(r);
|
|
}
|
|
|
|
dice_t dice_simple(uint32_t amount, uint32_t sides)
|
|
{
|
|
dice_t tmp = dice_new();
|
|
|
|
if (amount == 0 || sides == 0) {
|
|
return NULL;
|
|
}
|
|
|
|
if (tmp == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
tmp->amount = amount;
|
|
tmp->sides = sides;
|
|
|
|
return tmp;
|
|
}
|
|
|
|
bool dice_parse(dice_t d, char const *s)
|
|
{
|
|
void *scanner = NULL;
|
|
void *buffer = NULL;
|
|
int ret = 0;
|
|
|
|
if (d == NULL || s == NULL) {
|
|
return false;
|
|
}
|
|
|
|
yylex_init_extra(d, &scanner);
|
|
buffer = yy_scan_string(s, scanner);
|
|
yy_switch_to_buffer(buffer, scanner);
|
|
|
|
ret = yyparse(scanner, d);
|
|
|
|
yy_delete_buffer(buffer, scanner);
|
|
yylex_destroy(scanner);
|
|
|
|
if (ret) {
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool dice_set(dice_t d, dice_option_t opt, ...)
|
|
{
|
|
va_list lst;
|
|
|
|
va_start(lst, opt);
|
|
switch (opt) {
|
|
case DICEOPTION_AMOUNT: d->amount = va_arg(lst, uint32_t); break;
|
|
case DICEOPTION_SIDES: d->sides = va_arg(lst, uint32_t); break;
|
|
case DICEOPTION_FUDGE: d->fudge = va_arg(lst, uint32_t); break;
|
|
case DICEOPTION_ERROR:
|
|
{
|
|
char const *err = va_arg(lst, char const *);
|
|
free(d->error);
|
|
d->error = strdup(err);
|
|
} break;
|
|
|
|
default: return false;
|
|
}
|
|
va_end(lst);
|
|
|
|
return true;
|
|
}
|
|
|
|
bool dice_get(dice_t d, dice_option_t opt, ...)
|
|
{
|
|
va_list lst;
|
|
|
|
va_start(lst, opt);
|
|
switch (opt) {
|
|
case DICEOPTION_AMOUNT:
|
|
{
|
|
uint32_t *ptr = va_arg(lst, uint32_t*);
|
|
*ptr = d->amount;
|
|
} break;
|
|
|
|
case DICEOPTION_SIDES:
|
|
{
|
|
uint32_t *ptr = va_arg(lst, uint32_t*);
|
|
*ptr = d->sides;
|
|
} break;
|
|
|
|
case DICEOPTION_ERROR:
|
|
{
|
|
char **ptr = va_arg(lst, char **);
|
|
*ptr = d->error;
|
|
} break;
|
|
|
|
case DICEOPTION_FUDGE:
|
|
{
|
|
uint32_t *ptr = va_arg(lst, uint32_t*);
|
|
*ptr = d->fudge;
|
|
} break;
|
|
|
|
default: return false;
|
|
}
|
|
va_end(lst);
|
|
|
|
return true;
|
|
}
|
|
|
|
static int dice_roll_fudge(void)
|
|
{
|
|
static int results[6] = {-1, -1, 0, 0, +1, +1};
|
|
int idx = arc4random_uniform(sizeof(results)/sizeof(int)) + 1;
|
|
return results[idx];
|
|
}
|
|
|
|
int64_t dice_roll(dice_t d)
|
|
{
|
|
int64_t result = 0;
|
|
uint32_t i = 0;
|
|
|
|
for (i = 0; i < d->amount; i++) {
|
|
if (!d->fudge) {
|
|
result += arc4random_uniform(d->sides) + 1;
|
|
} else {
|
|
result += dice_roll_fudge();
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
bool dice_evaluate(dice_t d, dice_result_t **res, size_t *reslen)
|
|
{
|
|
size_t len = 0;
|
|
dice_result_t *r = NULL;
|
|
uint32_t i = 0;
|
|
|
|
if (d == NULL || d->amount <= 0 || d->sides <= 0) {
|
|
return false;
|
|
}
|
|
|
|
len = d->amount;
|
|
r = calloc(len, sizeof(dice_result_t));
|
|
if (r == NULL) {
|
|
return NULL;
|
|
}
|
|
|
|
for (i = 0; i < d->amount; i++) {
|
|
if (!d->fudge) {
|
|
r[i].result = arc4random_uniform(d->sides) + 1;
|
|
} else {
|
|
r[i].result = dice_roll_fudge();
|
|
}
|
|
}
|
|
|
|
*reslen = len;
|
|
*res = r;
|
|
|
|
return true;
|
|
}
|
|
|
|
void dice_update_consumed(dice_t d, int offset)
|
|
{
|
|
d->consumed += offset;
|
|
}
|
|
|
|
int dice_consumed(dice_t d)
|
|
{
|
|
if (d == NULL) {
|
|
return 0;
|
|
}
|
|
|
|
return d->consumed;
|
|
}
|