da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/***********************************************************************
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* This software is part of the ast package *
3e14f97f673e8a630f076077de35afdd43dc1587Roger A. Faulkner* Copyright (c) 1985-2010 AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* and is licensed under the *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Common Public License, Version 1.0 *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* by AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* A copy of the License is available at *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Information and Software Systems Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* AT&T Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Florham Park NJ *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Glenn Fowler <gsf@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* David Korn <dgk@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Phong Vo <kpv@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin***********************************************************************/
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/* Set a view path from dict to view.
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin** Written by Kiem-Phong Vo (5/25/96)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinstatic Void_t* dtvsearch(Dt_t* dt, reg Void_t* obj, reg int type)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin /* these operations only happen at the top level */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if((type&(DT_MATCH|DT_SEARCH)) || /* order sets first/last done below */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin ((type&(DT_FIRST|DT_LAST)) && !(dt->meth->type&(DT_OBAG|DT_OSET)) ) )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if(n) /* get the right one among all dictionaries */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin else /* looks good for now */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin /* non-ordered methods */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if(!dt->walk || obj != _DTOBJ(dt->walk->data->here, dt->walk->disc->link) )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if(!(obj = o) )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin for(d = dt->walk, obj = (*d->meth->searchf)(d, obj, type);; )
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin { while(obj) /* keep moving until finding an uncovered object */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin { if(p == d) /* adjacent object is uncovered */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if(!(d = dt->walk = d->view) ) /* move on to next dictionary */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin else obj = (*(d->meth->searchf))(d,NIL(Void_t*),DT_LAST);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if(view->meth != dt->meth) /* must use the same method */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin /* make sure there won't be a cycle */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin /* no more viewing lower dictionary */