2 * Copyright (C) 1994-1997, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.12 1997-11-18 10:03:24 adam
8 * Member num_children removed from data1_node.
10 * Revision 1.11 1997/11/06 11:41:01 adam
11 * Implemented "begin variant" for the sgml.regx filter.
13 * Revision 1.10 1997/10/31 12:36:12 adam
14 * Minor change that avoids compiler warning.
16 * Revision 1.9 1997/09/29 09:02:49 adam
17 * Fixed small bug (introduced by previous commit).
19 * Revision 1.8 1997/09/17 12:19:22 adam
20 * Zebra version corresponds to YAZ version 1.4.
21 * Changed Zebra server so that it doesn't depend on global common_resource.
23 * Revision 1.7 1997/07/15 16:33:07 adam
24 * Check for zero length in execData.
26 * Revision 1.6 1997/02/24 10:41:51 adam
27 * Cleanup of code and commented out the "end element-end-record" code.
29 * Revision 1.5 1997/02/19 16:22:33 adam
30 * Fixed "end element" to terminate record in outer-most level.
32 * Revision 1.4 1997/02/12 20:42:58 adam
33 * Changed some log messages.
35 * Revision 1.3 1996/11/08 14:05:33 adam
36 * Bug fix: data1 node member u.tag.get_bytes weren't initialized.
38 * Revision 1.2 1996/10/29 14:02:09 adam
39 * Doesn't use the global data1_tabpath (from YAZ). Instead the function
40 * data1_get_tabpath is used.
42 * Revision 1.1 1996/10/11 10:57:30 adam
43 * New module recctrl. Used to manage records (extract/retrieval).
45 * Revision 1.24 1996/06/17 14:25:31 adam
46 * Removed LOG_DEBUG logs; can still be enabled by setting REGX_DEBUG.
48 * Revision 1.23 1996/06/04 10:19:00 adam
49 * Minor changes - removed include of ctype.h.
51 * Revision 1.22 1996/06/03 15:23:13 adam
52 * Bug fix: /../ BODY /../ - pattern didn't match EOF.
54 * Revision 1.21 1996/05/14 16:58:38 adam
57 * Revision 1.20 1996/05/01 13:46:36 adam
58 * First work on multiple records in one file.
59 * New option, -offset, to the "unread" command in the filter module.
61 * Revision 1.19 1996/02/12 16:18:20 adam
62 * Yet another bug fix in implementation of unread command.
64 * Revision 1.18 1996/02/12 16:07:54 adam
65 * Bug fix in new unread command.
67 * Revision 1.17 1996/02/12 15:56:11 adam
68 * New code command: unread.
70 * Revision 1.16 1996/01/17 14:57:51 adam
71 * Prototype changed for reader functions in extract/retrieve. File
72 * is identified by 'void *' instead of 'int.
74 * Revision 1.15 1996/01/08 19:15:47 adam
75 * New input filter that works!
77 * Revision 1.14 1996/01/08 09:10:38 adam
78 * Yet another complete rework on this module.
80 * Revision 1.13 1995/12/15 17:21:50 adam
81 * This version is able to set data.formatted_text in data1-nodes.
83 * Revision 1.12 1995/12/15 16:20:10 adam
84 * The filter files (*.flt) are read from the path given by data1_tabpath.
86 * Revision 1.11 1995/12/15 12:35:16 adam
89 * Revision 1.10 1995/12/15 10:35:36 adam
92 * Revision 1.9 1995/12/14 16:38:48 adam
93 * Completely new attempt to make regular expression parsing.
95 * Revision 1.8 1995/12/13 17:16:59 adam
98 * Revision 1.7 1995/12/13 16:51:58 adam
99 * Modified to set last_child in data1_nodes.
100 * Uses destroy handler to free up data text nodes.
102 * Revision 1.6 1995/12/13 13:45:37 quinn
103 * Changed data1 to use nmem.
105 * Revision 1.5 1995/12/11 09:12:52 adam
106 * The rec_get function returns NULL if record doesn't exist - will
107 * happen in the server if the result set records have been deleted since
108 * the creation of the set (i.e. the search).
109 * The server saves a result temporarily if it is 'volatile', i.e. the
110 * set is register dependent.
112 * Revision 1.4 1995/12/05 16:57:40 adam
113 * More work on regular patterns.
115 * Revision 1.3 1995/12/05 09:37:09 adam
116 * One malloc was renamed to xmalloc.
118 * Revision 1.2 1995/12/04 17:59:24 adam
119 * More work on regular expression conversion.
121 * Revision 1.1 1995/12/04 14:25:30 adam
122 * Started work on regular expression parsed input to structured records.
130 #include <zebrautl.h>
136 #define F_WIN_EOF 2000000000
140 #define REGX_PATTERN 1
150 struct lexRuleAction {
154 struct DFA *dfa; /* REGX_PATTERN */
157 struct regxCode *code; /* REGX_CODE */
159 struct lexRuleAction *next;
164 struct lexRuleAction *actionList;
168 struct lexRuleInfo info;
169 struct lexRule *next;
174 struct lexRule *rules;
175 struct lexRuleInfo **fastRule;
181 struct lexTrans trans;
186 void (*f_win_ef)(void *, off_t);
192 int (*f_win_rf)(void *, char *, size_t);
193 off_t (*f_win_sf)(void *, off_t);
195 struct lexRuleAction *beginActionList;
196 struct lexRuleAction *endActionList;
200 static char *f_win_get (struct lexSpec *spec, off_t start_pos, off_t end_pos,
205 if (start_pos < spec->f_win_start || start_pos >= spec->f_win_end)
207 (*spec->f_win_sf)(spec->f_win_fh, start_pos);
208 spec->f_win_start = start_pos;
210 if (!spec->f_win_buf)
211 spec->f_win_buf = xmalloc (spec->f_win_size);
212 *size = (*spec->f_win_rf)(spec->f_win_fh, spec->f_win_buf,
214 spec->f_win_end = spec->f_win_start + *size;
216 if (*size > end_pos - start_pos)
217 *size = end_pos - start_pos;
218 return spec->f_win_buf;
220 if (end_pos <= spec->f_win_end)
222 *size = end_pos - start_pos;
223 return spec->f_win_buf + (start_pos - spec->f_win_start);
225 off = start_pos - spec->f_win_start;
226 for (i = 0; i<spec->f_win_end - start_pos; i++)
227 spec->f_win_buf[i] = spec->f_win_buf[i + off];
228 r = (*spec->f_win_rf)(spec->f_win_fh,
230 spec->f_win_size - i);
231 spec->f_win_start = start_pos;
232 spec->f_win_end += r;
234 if (*size > end_pos - start_pos)
235 *size = end_pos - start_pos;
236 return spec->f_win_buf;
239 static int f_win_advance (struct lexSpec *spec, int *pos)
244 if (*pos >= spec->f_win_start && *pos < spec->f_win_end)
245 return spec->f_win_buf[(*pos)++ - spec->f_win_start];
246 if (*pos == F_WIN_EOF)
248 buf = f_win_get (spec, *pos, *pos+1, &size);
258 static void regxCodeDel (struct regxCode **pp)
260 struct regxCode *p = *pp;
269 static void regxCodeMk (struct regxCode **pp, const char *buf, int len)
273 p = xmalloc (sizeof(*p));
274 p->str = xmalloc (len+1);
275 memcpy (p->str, buf, len);
280 static struct DFA *lexSpecDFA (void)
285 dfa_parse_cmap_del (dfa, ' ');
286 dfa_parse_cmap_del (dfa, '\t');
287 dfa_parse_cmap_add (dfa, '/', 0);
291 static struct lexSpec *lexSpecMk (const char *name)
295 p = xmalloc (sizeof(*p));
296 p->name = xmalloc (strlen(name)+1);
297 strcpy (p->name, name);
298 p->trans.dfa = lexSpecDFA ();
299 p->trans.rules = NULL;
300 p->trans.fastRule = NULL;
301 p->beginActionList = NULL;
302 p->endActionList = NULL;
307 static void actionListDel (struct lexRuleAction **rap)
309 struct lexRuleAction *ra1, *ra;
311 for (ra = *rap; ra; ra = ra1)
317 dfa_delete (&ra->u.pattern.dfa);
320 regxCodeDel (&ra->u.code);
328 static void lexSpecDel (struct lexSpec **pp)
331 struct lexRule *rp, *rp1;
337 dfa_delete (&p->trans.dfa);
339 xfree (p->trans.fastRule);
340 for (rp = p->trans.rules; rp; rp = rp1)
342 actionListDel (&rp->info.actionList);
345 actionListDel (&p->beginActionList);
346 actionListDel (&p->endActionList);
347 xfree (p->f_win_buf);
352 static int readParseToken (const char **cpp, int *len)
354 const char *cp = *cpp;
358 while (*cp == ' ' || *cp == '\t' || *cp == '\n')
387 if (*cp >= 'a' && *cp <= 'z')
389 else if (*cp >= 'A' && *cp <= 'Z')
390 cmd[i] = *cp + 'a' - 'A';
393 if (i > sizeof(cmd)-2)
401 logf (LOG_WARN, "bad character %d %c", *cp, *cp);
403 while (*cp && *cp != ' ' && *cp != '\t' && *cp != '\n')
409 if (!strcmp (cmd, "begin"))
411 else if (!strcmp (cmd, "end"))
413 else if (!strcmp (cmd, "body"))
417 logf (LOG_WARN, "bad command %s", cmd);
423 static int actionListMk (struct lexSpec *spec, const char *s,
424 struct lexRuleAction **ap)
429 while ((tok = readParseToken (&s, &len)))
437 *ap = xmalloc (sizeof(**ap));
439 regxCodeMk (&(*ap)->u.code, s, len);
443 *ap = xmalloc (sizeof(**ap));
445 (*ap)->u.pattern.body = bodyMark;
447 (*ap)->u.pattern.dfa = lexSpecDFA ();
448 r = dfa_parse ((*ap)->u.pattern.dfa, &s);
453 logf (LOG_WARN, "regular expression error. r=%d", r);
456 dfa_mkstate ((*ap)->u.pattern.dfa);
460 logf (LOG_WARN, "cannot use begin here");
463 *ap = xmalloc (sizeof(**ap));
473 int readOneSpec (struct lexSpec *spec, const char *s)
477 tok = readParseToken (&s, &len);
478 if (tok == REGX_BEGIN)
480 actionListDel (&spec->beginActionList);
481 actionListMk (spec, s, &spec->beginActionList);
483 else if (tok == REGX_END)
485 actionListDel (&spec->endActionList);
486 actionListMk (spec, s, &spec->endActionList);
488 else if (tok == REGX_PATTERN)
492 r = dfa_parse (spec->trans.dfa, &s);
495 logf (LOG_WARN, "regular expression error. r=%d", r);
500 logf (LOG_WARN, "expects / at end of pattern. got %c", *s);
504 rp = xmalloc (sizeof(*rp));
505 rp->info.no = spec->trans.ruleNo++;
506 rp->next = spec->trans.rules;
507 spec->trans.rules = rp;
508 actionListMk (spec, s, &rp->info.actionList);
513 int readFileSpec (struct lexSpec *spec)
518 int c, i, errors = 0;
521 lineBuf = xmalloc (1+lineSize);
522 logf (LOG_LOG, "reading regx filter %s.flt", spec->name);
523 sprintf (lineBuf, "%s.flt", spec->name);
524 if (!(spec_inf = yaz_path_fopen (data1_get_tabpath(spec->dh),
527 logf (LOG_ERRNO|LOG_WARN, "cannot read spec file %s", spec->name);
532 spec->trans.ruleNo = 1;
537 if (c == '#' || c == '\n' || c == ' ' || c == '\t')
539 while (c != '\n' && c != EOF)
558 if (c != ' ' && c != '\t')
567 readOneSpec (spec, lineBuf);
568 spec->lineNo += addLine;
573 spec->trans.fastRule = xmalloc (sizeof(*spec->trans.fastRule) *
575 for (i = 0; i<spec->trans.ruleNo; i++)
576 spec->trans.fastRule[i] = NULL;
577 for (rp = spec->trans.rules; rp; rp = rp->next)
578 spec->trans.fastRule[rp->info.no] = &rp->info;
584 debug_dfa_followpos = 1;
587 dfa_mkstate (spec->trans.dfa);
591 static struct lexSpec *curLexSpec = NULL;
593 static void destroy_data (struct data1_node *n)
595 assert (n->which == DATA1N_data);
596 xfree (n->u.data.data);
599 static void execData (struct lexSpec *spec,
600 data1_node **d1_stack, int *d1_level,
601 const char *ebuf, int elen, int formatted_text)
603 struct data1_node *res, *parent;
605 if (elen == 0) /* shouldn't happen, but it does! */
609 logf (LOG_DEBUG, "execData %.15s ... %.*s", ebuf, 15, ebuf + elen-15);
611 logf (LOG_DEBUG, "execData %.*s", elen, ebuf);
613 logf (LOG_DEBUG, "execData len=%d", elen);
619 parent = d1_stack[*d1_level -1];
621 if ((res=d1_stack[*d1_level]) && res->which == DATA1N_data)
623 if (elen + res->u.data.len <= DATA1_LOCALDATA)
624 memcpy (res->u.data.data + res->u.data.len, ebuf, elen);
627 char *nb = xmalloc (elen + res->u.data.len);
628 memcpy (nb, res->u.data.data, res->u.data.len);
629 memcpy (nb + res->u.data.len, ebuf, elen);
630 if (res->u.data.len > DATA1_LOCALDATA)
631 xfree (res->u.data.data);
632 res->u.data.data = nb;
633 res->destroy = destroy_data;
635 res->u.data.len += elen;
639 res = data1_mk_node (spec->dh, spec->m);
640 res->parent = parent;
641 res->which = DATA1N_data;
642 res->u.data.what = DATA1I_text;
643 res->u.data.len = elen;
644 res->u.data.formatted_text = formatted_text;
645 if (elen > DATA1_LOCALDATA)
647 res->u.data.data = xmalloc (elen);
648 res->destroy = destroy_data;
651 res->u.data.data = res->lbuf;
652 memcpy (res->u.data.data, ebuf, elen);
653 res->root = parent->root;
655 parent->last_child = res;
656 if (d1_stack[*d1_level])
657 d1_stack[*d1_level]->next = res;
660 d1_stack[*d1_level] = res;
664 static void execDataP (struct lexSpec *spec,
665 data1_node **d1_stack, int *d1_level,
666 const char *ebuf, int elen, int formatted_text)
668 execData (spec, d1_stack, d1_level, ebuf, elen, formatted_text);
671 static void variantBegin (struct lexSpec *spec,
672 data1_node **d1_stack, int *d1_level,
673 const char *class_str, int class_len,
674 const char *type_str, int type_len,
675 const char *value_str, int value_len)
677 struct data1_node *parent = d1_stack[*d1_level -1];
678 char tclass[DATA1_MAX_SYMBOL], ttype[DATA1_MAX_SYMBOL];
685 logf (LOG_WARN, "in variant begin. No record type defined");
688 if (class_len >= DATA1_MAX_SYMBOL)
689 class_len = DATA1_MAX_SYMBOL-1;
690 memcpy (tclass, class_str, class_len);
691 tclass[class_len] = '\0';
693 if (type_len >= DATA1_MAX_SYMBOL)
694 type_len = DATA1_MAX_SYMBOL-1;
695 memcpy (ttype, type_str, type_len);
696 ttype[type_len] = '\0';
699 logf (LOG_DEBUG, "variant begin %s %s (%d)", tclass, ttype, *d1_level);
703 data1_getvartypebyct(spec->dh, parent->root->u.root.absyn->varset,
707 if (parent->which != DATA1N_variant)
709 res = data1_mk_node (spec->dh, spec->m);
710 res->parent = parent;
711 res->which = DATA1N_variant;
712 res->u.variant.type = 0;
713 res->u.variant.value = 0;
714 res->root = parent->root;
716 parent->last_child = res;
717 if (d1_stack[*d1_level])
718 d1_stack[*d1_level]->next = res;
721 d1_stack[*d1_level] = res;
722 d1_stack[++(*d1_level)] = NULL;
724 for (i = *d1_level-1; d1_stack[i]->which == DATA1N_variant; i--)
725 if (d1_stack[i]->u.variant.type == tp)
732 logf (LOG_DEBUG, "variant node (%d)", *d1_level);
734 parent = d1_stack[*d1_level-1];
735 res = data1_mk_node (spec->dh, spec->m);
736 res->parent = parent;
737 res->which = DATA1N_variant;
738 res->root = parent->root;
739 res->u.variant.type = tp;
741 if (value_len >= DATA1_LOCALDATA)
742 value_len =DATA1_LOCALDATA-1;
743 memcpy (res->lbuf, value_str, value_len);
744 res->lbuf[value_len] = '\0';
746 res->u.variant.value = res->lbuf;
748 parent->last_child = res;
749 if (d1_stack[*d1_level])
750 d1_stack[*d1_level]->next = res;
753 d1_stack[*d1_level] = res;
754 d1_stack[++(*d1_level)] = NULL;
757 static void tagBegin (struct lexSpec *spec,
758 data1_node **d1_stack, int *d1_level,
759 const char *tag, int len)
761 struct data1_node *parent = d1_stack[*d1_level -1];
762 data1_element *elem = NULL;
763 data1_node *partag = get_parent_tag(spec->dh, parent);
765 data1_element *e = NULL;
770 logf (LOG_WARN, "in element begin. No record type defined");
774 res = data1_mk_node (spec->dh, spec->m);
775 res->parent = parent;
776 res->which = DATA1N_tag;
777 res->u.tag.tag = res->lbuf;
778 res->u.tag.get_bytes = -1;
780 if (len >= DATA1_LOCALDATA)
781 len = DATA1_LOCALDATA-1;
783 memcpy (res->u.tag.tag, tag, len);
784 res->u.tag.tag[len] = '\0';
787 logf (LOG_DEBUG, "tag begin %s (%d)", res->u.tag.tag, *d1_level);
789 if (parent->which == DATA1N_variant)
792 if (!(e = partag->u.tag.element))
795 elem = data1_getelementbytagname (spec->dh, d1_stack[0]->u.root.absyn,
797 res->u.tag.element = elem;
798 res->u.tag.node_selected = 0;
799 res->u.tag.make_variantlist = 0;
800 res->u.tag.no_data_requested = 0;
801 res->root = parent->root;
803 parent->last_child = res;
804 if (d1_stack[*d1_level])
805 d1_stack[*d1_level]->next = res;
808 d1_stack[*d1_level] = res;
809 d1_stack[++(*d1_level)] = NULL;
812 static void tagEnd (struct lexSpec *spec,
813 data1_node **d1_stack, int *d1_level,
814 const char *tag, int len)
816 while (*d1_level > 1)
819 if ((d1_stack[*d1_level]->which == DATA1N_tag) &&
821 (strlen(d1_stack[*d1_level]->u.tag.tag) == (size_t) len &&
822 !memcmp (d1_stack[*d1_level]->u.tag.tag, tag, len))))
826 logf (LOG_DEBUG, "tag end (%d)", *d1_level);
831 static int tryMatch (struct lexSpec *spec, int *pptr, int *mptr,
834 struct DFA_state *state = dfa->states[0];
837 unsigned char c_prev = 0;
839 int start_ptr = *pptr;
846 c = f_win_advance (spec, &ptr);
847 if (ptr == F_WIN_EOF)
864 *mptr = start_ptr; /* match starts here */
865 *pptr = last_ptr; /* match end here (+1) */
868 state = dfa->states[0];
873 else if (c >= t->ch[0] && c <= t->ch[1])
875 state = dfa->states[t->to];
880 last_rule = state->rule_no;
885 last_rule = state->rule_nno;
897 static int execTok (struct lexSpec *spec, const char **src,
898 int arg_no, int *arg_start, int *arg_end,
899 const char **tokBuf, int *tokLen)
901 const char *s = *src;
903 while (*s == ' ' || *s == '\t')
907 if (*s == '$' && s[1] >= '0' && s[1] <= '9')
911 while (*s >= '0' && *s <= '9')
912 n = n*10 + (*s++ -'0');
922 *tokBuf = f_win_get (spec, arg_start[n], arg_end[n], tokLen);
928 while (*s && *s != '\"')
930 *tokLen = s - *tokBuf;
935 else if (*s == '\n' || *s == ';')
943 while (*s && *s != ' ' && *s != '\t' && *s != '\n' && *s != ';')
945 *tokLen = s - *tokBuf;
952 while (*s && *s != ' ' && *s != '\t' && *s != '\n' && *s != ';')
954 *tokLen = s - *tokBuf;
960 static char *regxStrz (const char *src, int len)
966 memcpy (str, src, len);
971 static int execCode (struct lexSpec *spec,
972 int arg_no, int *arg_start, int *arg_end, int *pptr,
973 struct regxCode *code,
974 data1_node **d1_stack, int *d1_level)
976 const char *s = code->str;
981 r = execTok (spec, &s, arg_no, arg_start, arg_end, &cmd_str, &cmd_len);
988 r = execTok (spec, &s, arg_no, arg_start, arg_end,
992 p = regxStrz (cmd_str, cmd_len);
993 if (!strcmp (p, "begin"))
995 r = execTok (spec, &s, arg_no, arg_start, arg_end,
999 p = regxStrz (cmd_str, cmd_len);
1000 if (!strcmp (p, "record"))
1002 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1003 &cmd_str, &cmd_len);
1008 static char absynName[64];
1013 memcpy (absynName, cmd_str, cmd_len);
1014 absynName[cmd_len] = '\0';
1017 logf (LOG_DEBUG, "begin record %s", absynName);
1019 if (!(absyn = data1_get_absyn (spec->dh, absynName)))
1020 logf (LOG_WARN, "Unknown tagset: %s", absynName);
1025 res = data1_mk_node (spec->dh, spec->m);
1026 res->which = DATA1N_root;
1027 res->u.root.type = absynName;
1028 res->u.root.absyn = absyn;
1031 d1_stack[*d1_level] = res;
1032 d1_stack[++(*d1_level)] = NULL;
1035 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1036 &cmd_str, &cmd_len);
1038 else if (!strcmp (p, "element"))
1040 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1041 &cmd_str, &cmd_len);
1044 tagBegin (spec, d1_stack, d1_level, cmd_str, cmd_len);
1045 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1046 &cmd_str, &cmd_len);
1048 else if (!strcmp (p, "variant"))
1051 const char *class_str = NULL;
1053 const char *type_str = NULL;
1055 const char *value_str = NULL;
1056 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1057 &cmd_str, &cmd_len);
1060 class_str = cmd_str;
1061 class_len = cmd_len;
1062 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1063 &cmd_str, &cmd_len);
1069 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1070 &cmd_str, &cmd_len);
1073 value_str = cmd_str;
1074 value_len = cmd_len;
1076 variantBegin (spec, d1_stack, d1_level, class_str, class_len,
1077 type_str, type_len, value_str, value_len);
1080 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1081 &cmd_str, &cmd_len);
1084 else if (!strcmp (p, "end"))
1086 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1087 &cmd_str, &cmd_len);
1090 p = regxStrz (cmd_str, cmd_len);
1091 if (!strcmp (p, "record"))
1094 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1095 &cmd_str, &cmd_len);
1097 logf (LOG_DEBUG, "end record");
1101 else if (!strcmp (p, "element"))
1103 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1104 &cmd_str, &cmd_len);
1114 tagEnd (spec, d1_stack, d1_level, cmd_str, cmd_len);
1115 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1116 &cmd_str, &cmd_len);
1119 tagEnd (spec, d1_stack, d1_level, NULL, 0);
1122 logf (LOG_WARN, "missing record/element/variant");
1125 logf (LOG_WARN, "missing record/element/variant");
1127 else if (!strcmp (p, "data"))
1131 const char *element_str = NULL;
1133 while ((r = execTok (spec, &s, arg_no, arg_start, arg_end,
1134 &cmd_str, &cmd_len)) == 3)
1136 if (cmd_len==5 && !memcmp ("-text", cmd_str, cmd_len))
1138 else if (cmd_len==8 && !memcmp ("-element", cmd_str, cmd_len))
1140 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1141 &element_str, &element_len);
1146 logf (LOG_WARN, "bad data option: %.*s",
1151 logf (LOG_WARN, "missing data item after data");
1155 tagBegin (spec, d1_stack, d1_level, element_str, element_len);
1158 execData (spec, d1_stack, d1_level, cmd_str, cmd_len,
1160 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1161 &cmd_str, &cmd_len);
1164 tagEnd (spec, d1_stack, d1_level, NULL, 0);
1166 else if (!strcmp (p, "unread"))
1169 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1170 &cmd_str, &cmd_len);
1171 if (r==3 && cmd_len == 7 && !memcmp ("-offset", cmd_str, cmd_len))
1173 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1174 &cmd_str, &cmd_len);
1177 logf (LOG_WARN, "missing number after -offset");
1180 p = regxStrz (cmd_str, cmd_len);
1182 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1183 &cmd_str, &cmd_len);
1189 logf (LOG_WARN, "missing index after unread command");
1192 if (cmd_len != 1 || *cmd_str < '0' || *cmd_str > '9')
1194 logf (LOG_WARN, "bad index after unread command");
1199 no = *cmd_str - '0';
1202 *pptr = arg_start[no] + offset;
1204 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1205 &cmd_str, &cmd_len);
1209 logf (LOG_WARN, "unknown code command: %.*s", cmd_len, cmd_str);
1210 r = execTok (spec, &s, arg_no, arg_start, arg_end,
1211 &cmd_str, &cmd_len);
1216 logf (LOG_WARN, "ignoring token %.*s", cmd_len, cmd_str);
1218 r = execTok (spec, &s, arg_no, arg_start, arg_end, &cmd_str,
1227 static int execAction (struct lexSpec *spec, struct lexRuleAction *ap,
1228 data1_node **d1_stack, int *d1_level,
1229 int start_ptr, int *pptr)
1236 arg_start[0] = start_ptr;
1244 if (ap->u.pattern.body)
1246 arg_start[arg_no] = *pptr;
1247 if (!tryMatch (spec, pptr, &sptr, ap->u.pattern.dfa))
1249 arg_end[arg_no] = F_WIN_EOF;
1251 arg_start[arg_no] = F_WIN_EOF;
1252 arg_end[arg_no] = F_WIN_EOF;
1257 arg_end[arg_no] = sptr;
1259 arg_start[arg_no] = sptr;
1260 arg_end[arg_no] = *pptr;
1265 arg_start[arg_no] = *pptr;
1266 if (!tryMatch (spec, pptr, &sptr, ap->u.pattern.dfa))
1268 if (sptr != arg_start[arg_no])
1270 arg_end[arg_no] = *pptr;
1275 if (!execCode (spec, arg_no, arg_start, arg_end, pptr,
1276 ap->u.code, d1_stack, d1_level))
1280 arg_start[arg_no] = *pptr;
1281 arg_end[arg_no] = F_WIN_EOF;
1290 static int execRule (struct lexSpec *spec, struct lexTrans *trans,
1291 data1_node **d1_stack, int *d1_level,
1292 int ruleNo, int start_ptr, int *pptr)
1295 logf (LOG_DEBUG, "execRule %d", ruleNo);
1297 return execAction (spec, trans->fastRule[ruleNo]->actionList,
1298 d1_stack, d1_level, start_ptr, pptr);
1301 data1_node *lexNode (struct lexSpec *spec, struct lexTrans *trans,
1302 data1_node **d1_stack, int *d1_level,
1305 struct DFA_state *state = trans->dfa->states[0];
1308 unsigned char c_prev = '\n';
1311 int last_ptr = *ptr;
1312 int start_ptr = *ptr;
1313 int skip_ptr = *ptr;
1317 c = f_win_advance (spec, ptr);
1318 if (*ptr == F_WIN_EOF)
1322 if (skip_ptr < start_ptr)
1326 buf = f_win_get (spec, skip_ptr, start_ptr, &size);
1327 execDataP (spec, d1_stack, d1_level, buf, size, 0);
1330 if (!execRule (spec, trans, d1_stack, d1_level, last_rule,
1336 else if (skip_ptr < *ptr)
1340 buf = f_win_get (spec, skip_ptr, *ptr, &size);
1341 execDataP (spec, d1_stack, d1_level, buf, size, 0);
1343 if (*ptr == F_WIN_EOF)
1350 { /* no transition for character c ... */
1353 if (skip_ptr < start_ptr)
1357 buf = f_win_get (spec, skip_ptr, start_ptr, &size);
1358 execDataP (spec, d1_stack, d1_level, buf, size, 0);
1361 if (!execRule (spec, trans, d1_stack, d1_level, last_rule,
1364 if (spec->f_win_ef && *ptr != F_WIN_EOF)
1367 logf (LOG_DEBUG, "regx: endf ptr=%d", *ptr);
1369 (*spec->f_win_ef)(spec->f_win_fh, *ptr);
1379 c_prev = f_win_advance (spec, &start_ptr);
1384 c_prev = f_win_advance (spec, &start_ptr);
1387 state = trans->dfa->states[0];
1390 else if (c >= t->ch[0] && c <= t->ch[1])
1391 { /* transition ... */
1392 state = trans->dfa->states[t->to];
1397 last_rule = state->rule_no;
1400 else if (state->rule_nno)
1402 last_rule = state->rule_nno;
1414 static data1_node *lexRoot (struct lexSpec *spec, off_t offset)
1416 data1_node *d1_stack[512];
1420 d1_stack[d1_level] = NULL;
1421 if (spec->beginActionList)
1422 execAction (spec, spec->beginActionList,
1423 d1_stack, &d1_level, 0, &ptr);
1424 lexNode (spec, &spec->trans, d1_stack, &d1_level, &ptr);
1425 if (spec->endActionList)
1426 execAction (spec, spec->endActionList,
1427 d1_stack, &d1_level, ptr, &ptr);
1431 data1_node *grs_read_regx (struct grs_read_info *p)
1437 logf (LOG_DEBUG, "grs_read_regx");
1439 if (!curLexSpec || strcmp (curLexSpec->name, p->type))
1442 lexSpecDel (&curLexSpec);
1443 curLexSpec = lexSpecMk (p->type);
1444 curLexSpec->dh = p->dh;
1445 res = readFileSpec (curLexSpec);
1448 lexSpecDel (&curLexSpec);
1454 curLexSpec->f_win_start = 0;
1455 curLexSpec->f_win_end = 0;
1456 curLexSpec->f_win_rf = p->readf;
1457 curLexSpec->f_win_sf = p->seekf;
1458 curLexSpec->f_win_fh = p->fh;
1459 curLexSpec->f_win_ef = p->endf;
1460 curLexSpec->f_win_size = 500000;
1462 curLexSpec->m = p->mem;
1463 n = lexRoot (curLexSpec, p->offset);