return 0;
}
-/* allocate new element */
+/* calloc or die function */
-element_t *newelement (func_t function, int nbops, int prio)
+void *callocordie (size_t count, size_t size)
{
- element_t *new = (element_t *) calloc (1, sizeof (element_t));
+ if (count * size == 0) {
+ return NULL;
+ }
+ void *new = calloc (count, size);
if (new == NULL) {
VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
exit (1);
}
+ return new;
+}
+
+/* allocate new element */
+
+element_t *newelement (func_t function, int nbops, int prio)
+{
+ element_t *new = (element_t *) callocordie (1, sizeof (element_t));
if (nbops) {
- new->ops = (element_t **) calloc (nbops, sizeof (element_t *));
- if (new->ops == NULL) {
- VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
- exit (1);
- }
+ new->ops = (element_t **) callocordie (nbops, sizeof (element_t *));
}
new->func = function;
new->nbops = nbops;
element_t *parser (char *str, char **next, int prio)
{
element_t *root = NULL;
+ char *string = str;
int i;
VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n"));
*next = str;
}
+ /* save string */
+ if (root != NULL) {
+ root->string = string;
+ }
+
return root;
}
double *tmp = NULL;
if (nb != storage_size) {
l = (nb < storage_size) ? nb : storage_size;
- tmp = (double *) calloc (nb, sizeof (double));
- if (tmp == NULL) {
- VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
- exit (1);
- }
+ tmp = (double *) callocordie (nb, sizeof (double));
for (i = 0; i < l; i++) {
tmp[i] = storage[i];
}
if (programs == NULL) {
/* initial memory allocation */
- programs = (workspace_t *) calloc (1, sizeof (workspace_t));
- if (programs == NULL) {
- VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
- exit (1);
- }
+ programs = (workspace_t *) callocordie (1, sizeof (workspace_t));
nb_programs = 1;
n = 0;
/* new program */
n = nb_programs++;
- programs = (workspace_t *) realloc (programs, nb_programs * sizeof (workspace_t));
+ workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t));
+ memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t));
+ free (programs);
+ programs = tmp;
} else {
/* clean old program */
if ((programs + n)->root) {
delelement ((programs + n)->root);
}
+ if ((programs + n)->string) {
+ free ((programs + n)->string);
+ (programs + n)->string = NULL;
+ }
}
}
/* set program */
(programs + n)->id = id;
(programs + n)->answer = 0;
- (programs + n)->storage = (double *) calloc (nbmems, sizeof (double));
- if ((programs + n)->storage == NULL) {
- VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
- exit (1);
- }
+ (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double));
(programs + n)->storage_size = nbmems;
- (programs + n)->root = root;
+ (programs + n)->root = dupelement (root);
}
-double call (int id, int nbobs, element_t **ops)
+double call (int id, int nbops, element_t **ops)
{
workspace_t tmp = {0};
int i, n = -1;
double ret = 0;
if (programs) {
+
+ /* look for program */
for (i = 0; i < nb_programs; i++) {
- if ((programs + i)->id == i) {
+ if ((programs + i)->id == id) {
n = i;
break;
}
}
+ }
+ if (n == -1) {
+ VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
+ return 0;
+ }
- if (n == -1) {
- VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
- return 0;
- }
-
- /* store context */
- tmp.answer = answer;
- tmp.storage = storage;
- tmp.storage_size = storage_size;
-
- /* change context */
- answer = 0;
- storage = (programs + i)->storage;
- storage_size = (programs + i)->storage_size;
- if (nbobs > storage_size) {
- storage = realloc (storage, nbobs * sizeof (double));
- storage_size = nbobs;
- }
- for (i = 0; i < nbobs; i++) {
- store (i + 1, evaluate_element (ops[i], 0));
- }
+ /* store context */
+ tmp.answer = answer;
+ tmp.storage = storage;
+ tmp.storage_size = storage_size;
+
+ /* change context */
+ answer = 0;
+ storage = (programs + n)->storage;
+ storage_size = (programs + n)->storage_size;
+ if (nbops > storage_size) {
+ double *tmp = (double *) callocordie (nbops, sizeof (double));
+ memcpy (tmp, storage, storage_size * sizeof (double));
+ free (storage);
+ storage = tmp;
+ storage_size = nbops;
+ }
+ for (i = 0; i < nbops; i++) {
+ double val = evaluate_element (ops[i], 0);
+ store (i + 1, val);
+ }
- /* evaluate program */
- element_t *element = dupelement ((programs + n)->root);
- ret = evaluate_element (element, 0);
+ /* evaluate program */
+ element_t *elements = dupelement ((programs + n)->root);
+ ret = evaluate_element (elements, 0);
- /* restore context */
- answer = tmp.answer;
- storage = tmp.storage;
- storage_size = tmp.storage_size;
- }
+ /* restore context */
+ answer = tmp.answer;
+ storage = tmp.storage;
+ storage_size = tmp.storage_size;
return ret;
}
void list ()
{
int i;
- if (programs != NULL) {
- fprintf (stdout, "programs:");
+ fprintf (stdout, "programs:");
+ for (i = 0; i < nb_programs; i++) {
+ fprintf (stdout, " %d", (programs + i)->id);
+ }
+ fprintf (stdout, "\n");
+}
+
+void edit (int id)
+{
+ int i, n = -1;
+
+ if (programs) {
+
+ /* look for program */
for (i = 0; i < nb_programs; i++) {
- fprintf (stdout, " %d", (programs + i)->id);
+ if ((programs + i)->id == id) {
+ n = i;
+ break;
+ }
}
- fprintf (stdout, "\n");
}
+ if (n == -1) {
+ VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
+ return;
+ }
+
+ /* set string program */
+ fprintf (stdout, "edit: %s\n", (programs + n)->string);
}
-void edit (int id)
-{ }
+void savestring (int id, char *string)
+{
+ int i, n = -1;
+
+ if (programs) {
+
+ /* look for program */
+ for (i = 0; i < nb_programs; i++) {
+ if ((programs + i)->id == id) {
+ n = i;
+ break;
+ }
+ }
+ }
+
+ /* unnecesary code */
+ //if (n == -1) {
+ // VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
+ // return;
+ //}
+ //if ((programs + n)->string) {
+ // free ((programs + n)->string);
+ //}
+
+ (programs + n)->string = strdup (string);
+}
void del (int id)
-{ }
+{
+ int i, j, n = -1;
+
+ if (programs) {
+
+ /* look for program */
+ for (i = 0; i < nb_programs; i++) {
+ if ((programs + i)->id == id) {
+ n = i;
+ break;
+ }
+ }
+ }
+ if (n == -1) {
+ VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
+ return;
+ }
+
+ /* clean program */
+ if ((programs + n)->storage) {
+ free ((programs + n)->storage);
+ }
+ if ((programs + n)->root) {
+ delelement ((programs + n)->root);
+ }
+ if ((programs + n)->string) {
+ free ((programs + n)->string);
+ }
+
+ /* remove entry */
+ workspace_t *tmp = (workspace_t *) callocordie (nb_programs - 1, sizeof (workspace_t));
+ for (i = 0, j = 0; i < nb_programs; i++) {
+ if (i != n) {
+ memcpy (tmp + j, programs + i, sizeof (workspace_t));
+ j++;
+ }
+ }
+ free (programs);
+ programs = tmp;
+ nb_programs--;
+}
/* help message */
{
double op0 = 0, op1 = 0;
char nextmask = mask;
+ int i, nb;
if ((root == NULL) || (root == ERROR_OP)) {
VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n"));
case Mem:
case Cond:
case Call:
- case List:
case Edit:
case Del:
if (root->ops[0]) {
case Pi:
case E:
case Code:
+ case List:
break;
case While:
if (root->ops[0] == NULL) {
case While: return while_do (root->ops[0], root->ops[1]);
case Code: return execute_code (root->ops, root->nbops);
case Print: return print (op0);
- case Prog: prog ((int)op0, (int)op1, root->ops[2]); break;
- case Call: return call ((int)op0, root->nbops + 1, root->ops + 1);
+ case Prog:
+ prog ((int)op0, (int)op1, root->ops[2]);
+ savestring ((int)op0, root->string);
+ break;
+ case Call:
+ for (i = 1, nb =0; i < root->nbops; i++) {
+ if (root->ops[i]) {
+ nb++;
+ }
+ }
+ return call ((int)op0, nb, root->ops + 1);
case List: list (); break;
case Edit: edit ((int)op0); break;
case Del: del ((int)op0); break;
char **generate_completion_list ()
{
int i, j, l = 0;
- char **list = (char **) calloc (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
- if (list == NULL) {
- VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n"));
- exit (1);
- }
+ char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *));
for (i = 0; i < NB_OPERATORS; i++) {
list[l] = strdup ((operators + i)->keyword);
Soft'N'Design Software / projects / calc.git / blobdiff