#include <stdio.h>
#include <string.h>
#include <pcre.h>
+#include <ctype.h>
#include "cond.tab.h"
#include "brum.h"
unsigned char* p = name;
while (*p != '\0'){
- n = n * MAGIC + *p++;
+ n = n * MAGIC + toupper(*p++);
}
n %= HASHSIZE;
n = get_bucket_number(name);
p = hash[n];
- while(p && strcmp(p->name,name))
- p = p->next;
+
+ if (isupper(*name)){
+ while(p && strcasecmp(p->name,name))
+ p = p->next;
+ } else {
+ while(p && strcmp(p->name,name))
+ p = p->next;
+ }
if (p && value){
free(p->value);
p->value = value;
- } else {
+ p->modified = 1;
+ } else if (p && !value)
+ return p;
+ else {
p = xmalloc(sizeof(struct variable));
p->next = hash[n];
hash[n] = p;
- p->name = xstrdup(name);
+ p->name = name;
p->value = (value? value:xstrdup(""));
+ p->modified = 1;
}
return p;
printf("%*s ->\n", ind, "");
if (t->pt.arrow.kw_right)
printf("%*s%s\n", ind+1, "", t->pt.arrow.kw_right);
- print_tree(t->pt.arrow.s,ind+1);
+ if (t->pt.arrow.s)
+ print_tree(t->pt.arrow.s,ind+1);
break;
case ST_OP:
print_tree(t->pt.op.left, ind+1);
}
}
+// FIXME: we would like to be able also do things like ($a & $b) == $c
+int
+interp_cond(struct tree* t, struct variable** hash)
+{
+ if (t->st != ST_COND)
+ die("Muhehehechlemst?");
+
+ if (t->pt.cond.type == OP_REL){
+ if (t->pt.cond.left->st != ST_LEAF || t->pt.cond.right->st != ST_LEAF)
+ die("Chlemst");
+
+ char* left = (t->pt.cond.left->pt.leaf.type == L_VAR ? find_var(t->pt.cond.left->pt.leaf.value,NULL,hash)->value : t->pt.cond.left->pt.leaf.value);
+ char* right = (t->pt.cond.right->pt.leaf.type == L_VAR ? find_var(t->pt.cond.right->pt.leaf.value,NULL,hash)->value : t->pt.cond.right->pt.leaf.value);
+ switch (t->pt.cond.op){
+ case CC('=','='):
+ return !strcmp(left,right);
+ case CC('!','='):
+ return strcmp(left,right);
+ case CC('~','~'):
+ return regex_cmp(left,right);
+ case CC('!','~'):
+ return !regex_cmp(left,right);
+ } //TODO: add numbers
+
+ } else {
+ int left = interp_cond(t->pt.cond.left, hash);
+ int right;
+
+ if (t->pt.cond.op != '!')
+ right = interp_cond(t->pt.cond.right, hash);
+
+ switch (t->pt.cond.op){
+ case '&':
+ return left && right;
+ case '|':
+ return left || right;
+ case '^':
+ return (left || right) && !(left && right);
+ case '!':
+ return !left;
+ }
+ }
+}
+
+static void
+modify_headers(struct hlist* headers, struct variable** hash)
+{
+ struct hlist* p;
+ struct hlist* last = NULL;
+ struct variable* pv;
+ int i;
+
+ for(p = headers; p; p = p->next){
+ pv = find_var(p->name,NULL,hash);
+ if (pv->modified){
+ pv->modified = 0;
+ free(pv->value);
+ pv->value = xstrdup(p->value); //FIXME: fold it
+ }
+ last = p;
+ }
+
+ /* find new headers */
+ for (i = 0; i < HASHSIZE; i++){
+ for(pv = hash[i]; pv; pv = pv->next){
+ if (isupper(pv->name[0]) && pv->modified){
+ pv->modified = 0;
+ p = xmalloc(sizeof(struct hlist));
+
+ last->next = p; //FIXME
+ p->next = NULL;
+ p->name = xstrdup(pv->name);
+ p->value = xstrdup(pv->value);
+ }
+ }
+ }
+}
+
+static struct hlist*
+copy_headers(struct hlist* orig)
+{
+ struct hlist* new = NULL;
+ struct hlist* po, * pn = NULL;
+
+ for (po = orig; po; po = po->next){
+ if (!pn)
+ pn = xmalloc(sizeof(struct hlist));
+ pn->next = xmalloc(sizeof(struct hlist));
+ pn = pn->next;
+ pn->next = NULL;
+ pn->name = xstrdup(po->name);
+ pn->value = xstrdup(po->value);
+ if (!new)
+ new = pn;
+ }
+
+ return new;
+}
+
+static void
+new_action(char* l, char* r, char* s, struct variable** hash)
+{
+ struct action* a;
+
+ a = xmalloc(sizeof(struct action));
+
+ modify_headers(current_headers, hash);
+ a->e.headers = copy_headers(current_headers);
+ a->l = l;
+ a->r = r;
+ a->s = s;
+
+ do_action(a);
+}
+
void
interp(struct tree* t, struct variable** hash)
{
case ST_BLOCK:
interp(t->pt.block.head, hash);
interp(t->pt.block.tail, hash);
- break;
+ break;
case ST_ASS:
find_var(t->pt.ass.left->pt.leaf.value, interp_ass_right(t->pt.ass.right, hash), hash);
- break;
+ break;
+ case ST_IF:
+ if (interp_cond(t->pt.tif.c, hash))
+ interp(t->pt.tif.i, hash);
+ else
+ interp(t->pt.tif.e, hash);
+ break;
+ case ST_ARROW:
+ new_action(t->pt.arrow.kw_left, t->pt.arrow.kw_right, interp_ass_right(t->pt.arrow.s, hash),hash);
+ break;
+ case ST_EMPTY:
+ break;
default:
die("interp: got to default");
}
-};
+}
+
+void
+print_vars(struct variable** hash)
+{
+ int i;
+ struct variable* p;
+
+ for (i=0; i<HASHSIZE; i++){
+ p = hash[i];
+ while(p){
+ printf("%s=%s\n",p->name, p->value);
+ p = p->next;
+ }
+ }
+}
+
+static char*
+unfold(char* u)
+{
+ char* new;
+ char* pu = u;
+ char* pn;
+
+ new = xmalloc(strlen(u)+1);
+ pn = new;
+
+#define IS_WHITE(c) ((c) == '\t' || (c)==' ' || c=='\n')
+
+ while (IS_WHITE(*pu))
+ pu++;
+
+ while (*pu != 0){
+ if (IS_WHITE(*pu)){
+ while (IS_WHITE(*pu))
+ pu++;
+ if (*pu != 0)
+ *pn++ = ' ';
+ } else
+ *pn++ = *pu++;
+ }
+ *pn = 0;
+
+ return new;
+}
+
+void
+save_current_headers(struct variable** hash)
+{
+ struct hlist* p;
+ struct variable* pv;
+ char* u;
+
+ for (p = current_headers;p;p = p->next){
+ u = unfold(p->value);
+ pv = find_var(p->name,u,hash);
+ pv->modified = 0;
+ }
+
+}
projects / umpf.git / blobdiff