Lines Matching defs:epname
66 * for example, if the epname of an event is "c/d" and the path "a/b/c/d"
68 * matching is done, epname is temporarily replaced with the concatenation
69 * of ewname and epname.
76 struct node *oldepname; /* epname without the wildcard part */
88 struct node *epname, struct config *ncp, struct node *nextnp, int rematch);
265 struct node *epname;
271 * let oldepname be a subset of epname. return the subsection of epname
276 tname_dup_to_epname(struct node *oldepname, struct node *epname)
282 if (epname == NULL)
286 * search for the longest path in epname which contains
287 * oldnode->u.event.epname. set npend to point to just past the
291 for (npref = epname; npref; npref = npref->u.name.next) {
312 * if oldepname could not be found in epname, return a
320 * dup (epname -- npend). all children should be T_NUMs.
322 for (npref = epname;
361 * restriction: oldnode->u.event.epname has to be equivalent to or a subset
362 * of epname
365 tevent_dup_to_epname(struct node *oldnode, struct node *epname)
371 ret->u.event.epname = tname_dup_to_epname(oldnode->u.event.epname,
372 epname);
391 nrhs->u.stmt.np = tevent_dup_to_epname(orhs, pd->epname);
392 nrhs->u.stmt.lutp = props2instance(orhs, pd->epname);
409 nrhs = tname_dup_to_epname(orhs, pd->epname);
413 nrhs = tevent_dup_to_epname(orhs, pd->epname);
432 props2instance(struct node *eventnp, struct node *epname)
437 pd.epname = epname;
515 searchevent.ipp = ipath(np->u.event.epname);
527 ret->props = props2instance(np, np->u.event.epname);
564 * Need to set ewname, epname for correct node as is
569 saved_epname = eventnp->u.event.epname;
595 * Now create correct epname by duping new ewname
603 eventnp->u.event.epname = ewfp;
608 eventnp->u.event.epname);
627 eventnp->u.event.epname = saved_epname;
650 hmatch_event(struct info *infop, struct node *eventnp, struct node *epname,
653 if (epname == NULL) {
686 ASSERTeq(epname->t, T_NAME, ptree_nodetype2str);
688 if (epname->u.name.cp == NULL)
693 * instanced epname in it already. so we first recurse
698 if (epname->u.name.it == IT_HORIZONTAL || rematch) {
700 struct config *ocp = epname->u.name.cp;
708 if (epname->u.name.it != IT_HORIZONTAL) {
715 iters = epname->u.name.child->u.name.s;
725 iterinfop->np = epname;
744 if (epname == eventnp->u.event.oldepname &&
745 epname->u.name.it == IT_HORIZONTAL) {
750 hmatch_full_config(infop, eventnp, epname,
761 if (cp_s == epname->u.name.s) {
766 epname->u.name.cp = cp;
768 epname->u.name.next, config_child(cp),
772 epname->u.name.cp = ocp;
776 hmatch_event(infop, eventnp, epname->u.name.next,
814 hmatch_event(infop, np, np->u.event.epname,
886 pcp = config_parent(wcp->nptop->u.event.epname->u.name.cp);
925 wcp->nptop->u.event.epname = ewfp;
930 wcp->nptop->u.event.epname = wcp->oldepname;
1026 if (np == wcp->nptop->u.event.epname)
1056 if (G.matched && np == wcp->nptop->u.event.epname &&
1099 if (np == wcp->nptop->u.event.epname)
1111 } else if (np == wcp->nptop->u.event.epname) {
1242 for (np1 = oldepname, np2 = np->u.event.epname;
1267 oldepname = np->u.event.epname;
1268 np->u.event.epname = oldnptop->u.event.epname;
1272 np->u.event.epname = oldepname;
1283 for (np1 = oldepname, np2 = np->u.event.epname;
1290 wcp->oldepname = np->u.event.epname;
1312 wcp->oldepname = np->u.event.epname;
1317 np->u.event.epname, lnp, anp, wcp);
1379 cp_reset(np->u.event.epname);
1452 searchevent.ipp = ipath_dummy(np->u.event.epname, (struct ipath *)ipp);
1453 ipp_un = ipath_for_usednames(np->u.event.epname);