Home
last modified time | relevance | path

Searched refs:dt (Results 1 – 25 of 146) sorted by relevance

123456

/titanic_41/usr/src/lib/libast/common/cdt/
H A Ddthash.c34 static void dthtab(Dt_t* dt) in dthtab() argument
36 static void dthtab(dt) in dthtab()
37 Dt_t* dt; in dthtab()
43 if(dt->data->minp > 0 && dt->data->ntab > 0) /* fixed table size */
45 dt->data->minp = 0;
47 n = dt->data->ntab;
48 if(dt->disc && dt->disc->eventf &&
49 (*dt->disc->eventf)(dt, DT_HASHSIZE, &n, dt->disc) > 0 )
51 { dt->data->minp = 1;
52 if(dt->data->ntab > 0 )
[all …]
H A Ddtclose.c29 int dtclose(reg Dt_t* dt) in dtclose() argument
31 int dtclose(dt) in dtclose()
32 reg Dt_t* dt; in dtclose()
38 if(!dt || dt->nview > 0 ) /* can't close if being viewed */
42 disc = dt->disc;
44 (ev = (*disc->eventf)(dt,DT_CLOSE,NIL(Void_t*),disc)) < 0)
47 if(dt->view) /* turn off viewing */
48 dtview(dt,NIL(Dt_t*));
51 { (void)(*(dt->meth->searchf))(dt,NIL(Void_t*),DT_CLEAR);
52 if(dtsize(dt) > 0)
[all …]
H A Ddtopen.c38 Dt_t* dt = (Dt_t*)Version; /* shut-up unuse warning */ local
46 if(!(dt = (Dt_t*) malloc(sizeof(Dt_t))))
50 dt->searchf = NIL(Dtsearch_f);
51 dt->meth = NIL(Dtmethod_t*);
52 dt->disc = NIL(Dtdisc_t*);
53 dtdisc(dt,disc,0);
54 dt->type = DT_MALLOC;
55 dt->nview = 0;
56 dt->view = dt->walk = NIL(Dt_t*);
57 dt->user = NIL(Void_t*);
[all …]
H A Ddtlist.c30 static Void_t* dtlist(reg Dt_t* dt, reg Void_t* obj, reg int type) in dtlist() argument
32 static Void_t* dtlist(dt, obj, type) in dtlist()
33 reg Dt_t* dt; in dtlist()
44 UNFLATTEN(dt);
45 disc = dt->disc; _DTDSC(disc,ky,sz,lk,cmpf);
46 dt->type &= ~DT_FOUND;
50 { if((r = dt->data->head) )
53 dt->data->here = r;
58 { if((dt->data->type&DT_LIST) || !(r = dt->data->head))
64 { for(r = dt->data->head; r; r = t)
[all …]
H A Ddtmethod.c30 Dtmethod_t* dtmethod(Dt_t* dt, Dtmethod_t* meth) in dtmethod() argument
32 Dtmethod_t* dtmethod(dt, meth) in dtmethod()
33 Dt_t* dt; in dtmethod()
38 reg Dtdisc_t* disc = dt->disc;
39 reg Dtmethod_t* oldmeth = dt->meth;
45 (*disc->eventf)(dt,DT_METH,(Void_t*)meth,disc) < 0)
48 dt->data->minp = 0;
51 list = dtflatten(dt);
53 if(dt->data->type&(DT_LIST|DT_STACK|DT_QUEUE) )
54 dt->data->head = NIL(Dtlink_t*);
[all …]
H A Ddtdisc.c32 static Void_t* dtmemory(Dt_t* dt,Void_t* addr,size_t size,Dtdisc_t* disc) in dtmemory() argument
34 static Void_t* dtmemory(dt, addr, size, disc) in dtmemory()
35 Dt_t* dt; /* dictionary */ in dtmemory()
52 Dtdisc_t* dtdisc(Dt_t* dt, Dtdisc_t* disc, int type) in dtdisc() argument
54 Dtdisc_t* dtdisc(dt,disc,type) in dtdisc()
55 Dt_t* dt; in dtdisc()
65 if(!(old = dt->disc) ) /* initialization call from dtopen() */
66 { dt->disc = disc;
67 if(!(dt->memoryf = disc->memoryf) )
68 dt->memoryf = dtmemory;
[all …]
H A Ddtview.c31 static Void_t* dtvsearch(Dt_t* dt, reg Void_t* obj, reg int type) in dtvsearch() argument
33 static Void_t* dtvsearch(dt,obj,type) in dtvsearch()
34 Dt_t* dt; in dtvsearch()
46 return (*(dt->meth->searchf))(dt,obj,type);
49 ((type&(DT_FIRST|DT_LAST)) && !(dt->meth->type&(DT_OBAG|DT_OSET)) ) )
50 { for(d = dt; d; d = d->view)
53 dt->walk = d;
57 if(dt->meth->type & (DT_OBAG|DT_OSET) )
62 for(d = dt; d; d = d->view)
81 dt->walk = p;
[all …]
H A Ddtrestore.c32 int dtrestore(reg Dt_t* dt, reg Dtlink_t* list) in dtrestore() argument
34 int dtrestore(dt, list) in dtrestore()
35 reg Dt_t* dt; in dtrestore()
41 reg Dtsearch_f searchf = dt->meth->searchf;
43 type = dt->data->type&DT_FLATTEN;
47 list = dt->data->here;
50 { if(dt->data->size != 0)
54 dt->data->type &= ~DT_FLATTEN;
56 if(dt->data->type&(DT_SET|DT_BAG))
57 { dt->data->here = NIL(Dtlink_t*);
[all …]
H A Ddtextract.c30 Dtlink_t* dtextract(reg Dt_t* dt) in dtextract() argument
32 Dtlink_t* dtextract(dt) in dtextract()
33 reg Dt_t* dt; in dtextract()
38 if(dt->data->type&(DT_OSET|DT_OBAG) )
39 list = dt->data->here;
40 else if(dt->data->type&(DT_SET|DT_BAG))
41 { list = dtflatten(dt);
42 for(ends = (s = dt->data->htab) + dt->data->ntab; s < ends; ++s)
46 { list = dt->data->head;
47 dt->data->head = NIL(Dtlink_t*);
[all …]
H A Ddtrenew.c31 Void_t* dtrenew(Dt_t* dt, reg Void_t* obj) in dtrenew() argument
33 Void_t* dtrenew(dt, obj) in dtrenew()
34 Dt_t* dt; in dtrenew()
40 reg Dtdisc_t* disc = dt->disc;
42 UNFLATTEN(dt);
44 if(!(e = dt->data->here) || _DTOBJ(e,disc->link) != obj)
47 if(dt->data->type&(DT_STACK|DT_QUEUE|DT_LIST))
49 else if(dt->data->type&(DT_OSET|DT_OBAG) )
51 dt->data->here = e->left;
53 { dt->data->here = e->right;
[all …]
H A Ddttree.c33 static Void_t* dttree(Dt_t* dt, Void_t* obj, int type) in dttree() argument
35 static Void_t* dttree(dt,obj,type) in dttree()
36 Dt_t* dt; in dttree()
49 UNFLATTEN(dt);
50 disc = dt->disc; _DTDSC(disc,ky,sz,lk,cmpf);
51 dt->type &= ~DT_FOUND;
53 root = dt->data->here;
65 (*disc->freef)(dt,_DTOBJ(root,lk),disc);
67 (*dt->memoryf)(dt,(Void_t*)root,0,disc);
71 dt->data->size = 0;
[all …]
H A Ddtsize.c39 int dtsize(Dt_t* dt) in dtsize() argument
41 int dtsize(dt) in dtsize()
42 Dt_t* dt; in dtsize()
48 UNFLATTEN(dt);
50 if(dt->data->size < 0) /* !(dt->data->type&(DT_SET|DT_BAG)) */
51 { if(dt->data->type&(DT_OSET|DT_OBAG))
52 dt->data->size = treecount(dt->data->here);
53 else if(dt->data->type&(DT_LIST|DT_STACK|DT_QUEUE))
54 { for(size = 0, t = dt->data->head; t; t = t->right)
56 dt->data->size = size;
[all …]
H A Ddtflatten.c31 Dtlink_t* dtflatten(Dt_t* dt) in dtflatten() argument
33 Dtlink_t* dtflatten(dt) in dtflatten()
34 Dt_t* dt; in dtflatten()
40 if(dt->data->type&DT_FLATTEN )
41 return dt->data->here;
44 if(dt->data->type&(DT_SET|DT_BAG))
45 { for(ends = (s = dt->data->htab) + dt->data->ntab; s < ends; ++s)
56 else if(dt->data->type&(DT_LIST|DT_STACK|DT_QUEUE) )
57 list = dt->data->head;
58 else if((r = dt->data->here) ) /*if(dt->data->type&(DT_OSET|DT_OBAG))*/
[all …]
H A Ddtstat.c76 int dtstat(reg Dt_t* dt, Dtstat_t* ds, int all) in dtstat() argument
78 int dtstat(dt, ds, all) in dtstat()
79 reg Dt_t* dt; in dtstat()
87 UNFLATTEN(dt);
91 ds->dt_size = dtsize(dt);
92 ds->dt_meth = dt->data->type&DT_METHODS;
97 if(dt->data->type&(DT_SET|DT_BAG))
98 { dthstat(dt->data,ds,NIL(int*));
108 dthstat(dt->data,ds,Count);
110 else if(dt->data->type&(DT_OSET|DT_OBAG))
[all …]
H A Ddttreeset.c53 int dttreeset(Dt_t* dt, int minp, int balance) in dttreeset() argument
55 int dttreeset(dt, minp, balance) in dttreeset()
56 Dt_t* dt; in dttreeset()
63 if(dt->meth->type != DT_OSET)
66 size = dtsize(dt);
76 if((dt->data->minp = minp + (minp%2)) > DT_MINP)
77 dt->data->minp = DT_MINP;
80 dt->data->here = treebalance(dtflatten(dt), size);
H A Ddtwalk.c31 int dtwalk(reg Dt_t* dt, int (*userf)(Dt_t*, Void_t*, Void_t*), Void_t* data) in dtwalk() argument
33 int dtwalk(dt,userf,data) in dtwalk()
34 reg Dt_t* dt; in dtwalk()
43 for(obj = dtfirst(dt); obj; )
44 { if(!(walk = dt->walk) )
45 walk = dt;
46 next = dtnext(dt,obj);
H A Ddtnew.c38 eventf(Dt_t* dt, int op, void* data, Dtdisc_t* disc) in eventf() argument
43 if (dc->odisc->eventf && (r = (*dc->odisc->eventf)(dt, op, data, dc->odisc))) in eventf()
49 memoryf(Dt_t* dt, void* addr, size_t size, Dtdisc_t* disc) in memoryf() argument
61 Dt_t* dt; in dtnew() local
70 if (dt = dtopen(&dc.ndisc, meth)) in dtnew()
71 dtdisc(dt, disc, DT_SAMECMP|DT_SAMEHASH); in dtnew()
72 return dt; in dtnew()
/titanic_41/usr/src/common/bignum/
H A Dmont_mulf.c72 cleanup(double *dt, int from, int tlen) in cleanup() argument
80 x = dt[i]; in cleanup()
81 x1 = dt[i + 1]; in cleanup()
82 dt[i] = lower32(x, Zero) + tmp; in cleanup()
83 dt[i + 1] = lower32(x1, Zero) + tmp1; in cleanup()
242 double *dm1, double *dm2, double *dt, in mont_mulf_noconv() argument
257 dt[i] = Zero; in mont_mulf_noconv()
258 a = dt[0] = pdm1[0] * pdm2[0]; in mont_mulf_noconv()
261 pdtj = &(dt[0]); in mont_mulf_noconv()
273 cleanup(dt, j / 2 + 1, 2 * nlen + 1); in mont_mulf_noconv()
[all …]
/titanic_41/usr/src/lib/libast/common/comp/
H A Dtsearch.c75 static int treecompare(Dt_t* dt, char* one, char* two, Dtdisc_t* disc) in treecompare() argument
77 static int treecompare(dt, one, two, disc) in treecompare()
78 Dt_t* dt; in treecompare()
110 reg Dt_t* dt; local
114 (!(dt = *((Dt_t**)rootp)) && !(dt = dtopen((Dtdisc_t*)(&Treedisc),Dtorder))) )
120 if(!(o = (Tree_t*)dtmatch(dt,key)) )
124 dtinsert(dt,o);
128 *rootp = (Void_t*)dt;
130 dtclose(dt);
146 reg Dt_t* dt; local
[all …]
/titanic_41/usr/src/lib/libm/common/complex/
H A Dcpowf.c57 double dx, dy, du, dv, dt, dc, ds, dp, dq, dr; in cpowf() local
110 dt = (hx >= 0)? 0.25 : 0.75; in cpowf()
112 dt = -dt; in cpowf()
114 sincospi(dt * du, &ds, &dc); in cpowf()
152 dt = dhalf * log1p((dx - 1.0) * (dx + 1.0) + dy * dy); in cpowf()
154 dt = dhalf * log1p((dy - 1.0) * (dy + 1.0) + dx * dx); in cpowf()
156 dt = dhalf * log(dx * dx + dy * dy); in cpowf()
159 dr = exp(du * dt); in cpowf()
162 dr = exp(du * dt - dv * dp * dpi); in cpowf()
163 dq = du * dp + dv * dt * dinvpi; in cpowf()
/titanic_41/usr/src/lib/libshell/common/sh/
H A Denv.c41 Dt_t *dt; member
61 static int compare(Dt_t *dt, Void_t* key1, Void_t* key2, Dtdisc_t* disc) in compare() argument
103 for(vp=(Evar_t*)dtfirst(ep->dt);vp; vp=(Evar_t*)dtnext(ep->dt,vp)) in env_get()
122 Evar_t *vp = (Evar_t*)dtmatch(ep->dt,(void*)str); in env_add()
149 if(!(vp=dtinsert(ep->dt,vp))) in env_add()
168 Evar_t *vp = (Evar_t*)dtmatch(ep->dt,(void*)str); in env_delete()
174 dtdelete(ep->dt,vp); in env_delete()
197 if(!(ep->dt = dtopen(&env_disc,Dtoset))) in env_open()
235 for(vp=(Evar_t*)dtfirst(ep->dt);vp; vp=vpnext) in env_close()
237 vpnext = (Evar_t*)dtnext(ep->dt,vp); in env_close()
[all …]
/titanic_41/usr/src/lib/libast/amd64/include/ast/
H A Dcdt.h217 extern Dtdisc_t* dtdisc _ARG_((Dt_t* dt, Dtdisc_t*, int));
243 #define _DT(dt) ((Dt_t*)(dt)) argument
250 #define _DTCMP(dt,k1,k2,dc,cmpf,sz) \ argument
251 ((cmpf) ? (*cmpf)(dt,k1,k2,dc) : \
253 #define _DTHSH(dt,ky,dc,sz) ((dc)->hashf ? (*(dc)->hashf)(dt,ky,dc) : dtstrhash(0,ky,sz) ) argument
256 #define _DTMTCH(dt,key,action) \ argument
259 _dc = (dt)->disc; _DTDSC(_dc, _ky, _sz, _lk, _cmpf); \
261 for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
263 if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
269 #define _DTSRCH(dt,obj,action) \ argument
[all …]
/titanic_41/usr/src/lib/libast/common/include/
H A Dcdt.h217 extern Dtdisc_t* dtdisc _ARG_((Dt_t* dt, Dtdisc_t*, int));
243 #define _DT(dt) ((Dt_t*)(dt)) argument
250 #define _DTCMP(dt,k1,k2,dc,cmpf,sz) \ argument
251 ((cmpf) ? (*cmpf)(dt,k1,k2,dc) : \
253 #define _DTHSH(dt,ky,dc,sz) ((dc)->hashf ? (*(dc)->hashf)(dt,ky,dc) : dtstrhash(0,ky,sz) ) argument
256 #define _DTMTCH(dt,key,action) \ argument
259 _dc = (dt)->disc; _DTDSC(_dc, _ky, _sz, _lk, _cmpf); \
261 for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
263 if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
269 #define _DTSRCH(dt,obj,action) \ argument
[all …]
/titanic_41/usr/src/lib/libast/sparcv9/include/ast/
H A Dcdt.h217 extern Dtdisc_t* dtdisc _ARG_((Dt_t* dt, Dtdisc_t*, int));
243 #define _DT(dt) ((Dt_t*)(dt)) argument
250 #define _DTCMP(dt,k1,k2,dc,cmpf,sz) \ argument
251 ((cmpf) ? (*cmpf)(dt,k1,k2,dc) : \
253 #define _DTHSH(dt,ky,dc,sz) ((dc)->hashf ? (*(dc)->hashf)(dt,ky,dc) : dtstrhash(0,ky,sz) ) argument
256 #define _DTMTCH(dt,key,action) \ argument
259 _dc = (dt)->disc; _DTDSC(_dc, _ky, _sz, _lk, _cmpf); \
261 for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
263 if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
269 #define _DTSRCH(dt,obj,action) \ argument
[all …]
/titanic_41/usr/src/lib/libast/i386/include/ast/
H A Dcdt.h217 extern Dtdisc_t* dtdisc _ARG_((Dt_t* dt, Dtdisc_t*, int));
243 #define _DT(dt) ((Dt_t*)(dt)) argument
250 #define _DTCMP(dt,k1,k2,dc,cmpf,sz) \ argument
251 ((cmpf) ? (*cmpf)(dt,k1,k2,dc) : \
253 #define _DTHSH(dt,ky,dc,sz) ((dc)->hashf ? (*(dc)->hashf)(dt,ky,dc) : dtstrhash(0,ky,sz) ) argument
256 #define _DTMTCH(dt,key,action) \ argument
259 _dc = (dt)->disc; _DTDSC(_dc, _ky, _sz, _lk, _cmpf); \
261 for(_e = (dt)->data->here; _e; _e = _cmp < 0 ? _e->hl._left : _e->right) \
263 if((_cmp = _DTCMP((dt), _key, _k, _dc, _cmpf, _sz)) == 0) \
269 #define _DTSRCH(dt,obj,action) \ argument
[all …]

123456