+static struct ccl_rpn_node *split_recur(CCL_parser cclp, ccl_qualifier_t *qa,
+ struct ccl_rpn_node *parent,
+ struct ccl_token **ar, size_t sz)
+{
+ size_t l;
+ struct ccl_rpn_node *p_top = 0;
+ assert(sz > 0);
+ for (l = 1; l <= sz; l++)
+ {
+ struct ccl_rpn_node *p1;
+ struct ccl_rpn_node *p2 = ccl_term_one_use(cclp, ar[0],
+ /* attr_use */0,
+ qa, l,
+ l > 1,
+ /* auto_group */0);
+ if (!p2)
+ return 0;
+ if (parent)
+ {
+ struct ccl_rpn_node *tmp = ccl_rpn_node_create(CCL_RPN_AND);
+ tmp->u.p[0] = l > 1 ? ccl_rpn_dup(parent) : parent;
+ tmp->u.p[1] = p2;
+ p2 = tmp;
+ }
+ if (sz > l)
+ p1 = split_recur(cclp, qa, p2, ar + l, sz - l);
+ else
+ p1 = p2;
+ if (p_top)
+ {
+ struct ccl_rpn_node *tmp = ccl_rpn_node_create(CCL_RPN_OR);
+ tmp->u.p[0] = p_top;
+ tmp->u.p[1] = p1;
+ p_top = tmp;
+ }
+ else
+ p_top = p1;
+ }
+ assert(p_top);
+ return p_top;
+}
+
+static struct ccl_rpn_node *search_term_split_list(CCL_parser cclp,
+ ccl_qualifier_t *qa,
+ int *term_list, int multi)
+{
+ struct ccl_rpn_node *p;
+ struct ccl_token **ar;
+ struct ccl_token *lookahead = cclp->look_token;
+ size_t i, sz;
+ for (sz = 0; is_term_ok(lookahead->kind, term_list); sz++)
+ lookahead = lookahead->next;
+ if (sz == 0)
+ {
+ cclp->error_code = CCL_ERR_TERM_EXPECTED;
+ return 0;
+ }
+ ar = (struct ccl_token **) xmalloc(sizeof(*lookahead) * sz);
+ lookahead = cclp->look_token;
+ for (i = 0; is_term_ok(lookahead->kind, term_list); i++)
+ {
+ ar[i] = lookahead;
+ lookahead = lookahead->next;
+ }
+ p = split_recur(cclp, qa, 0, ar, sz);
+ xfree(ar);
+ for (i = 0; i < sz; i++)
+ ADVANCE;
+ return p;
+}
+