Searched defs:dt (Results 1 - 25 of 74) sorted by relevance

123

/illumos-gate/usr/src/lib/libast/common/cdt/
H A Ddtclose.c29 int dtclose(reg Dt_t* dt) argument
31 int dtclose(dt)
32 reg Dt_t* dt;
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
[all...]
H A Ddtextract.c30 Dtlink_t* dtextract(reg Dt_t* dt) argument
32 Dtlink_t* dtextract(dt)
33 reg Dt_t* dt;
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)
45 else /*if(dt
[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
[all...]
H A Ddtsize.c39 int dtsize(Dt_t* dt) argument
41 int dtsize(dt)
42 Dt_t* dt;
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
[all...]
H A Ddtflatten.c31 Dtlink_t* dtflatten(Dt_t* dt) argument
33 Dtlink_t* dtflatten(dt)
34 Dt_t* dt;
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
[all...]
H A Ddtrenew.c31 Void_t* dtrenew(Dt_t* dt, reg Void_t* obj) argument
33 Void_t* dtrenew(dt, obj)
34 Dt_t* dt;
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
[all...]
H A Ddtrestore.c32 int dtrestore(reg Dt_t* dt, reg Dtlink_t* list) argument
34 int dtrestore(dt, list)
35 reg Dt_t* dt;
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
[all...]
H A Ddttreeset.c53 int dttreeset(Dt_t* dt, int minp, int balance) argument
55 int dttreeset(dt, minp, balance)
56 Dt_t* dt;
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) argument
33 int dtwalk(dt,userf,data)
34 reg Dt_t* dt;
43 for(obj = dtfirst(dt); obj; )
44 { if(!(walk = dt->walk) )
45 walk = dt;
46 next = dtnext(dt,obj);
H A Ddtdisc.c25 ** dt : dictionary
32 static Void_t* dtmemory(Dt_t* dt,Void_t* addr,size_t size,Dtdisc_t* disc) argument
34 static Void_t* dtmemory(dt, addr, size, disc)
35 Dt_t* dt; /* dictionary */
52 Dtdisc_t* dtdisc(Dt_t* dt, Dtdisc_t* disc, int type) argument
54 Dtdisc_t* dtdisc(dt,disc,type)
55 Dt_t* dt;
65 if(!(old = dt->disc) ) /* initialization call from dtopen() */
66 { dt->disc = disc;
67 if(!(dt
[all...]
H A Ddtmethod.c30 Dtmethod_t* dtmethod(Dt_t* dt, Dtmethod_t* meth) argument
32 Dtmethod_t* dtmethod(dt, meth)
33 Dt_t* dt;
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
[all...]
H A Ddtlist.c30 static Void_t* dtlist(reg Dt_t* dt, reg Void_t* obj, reg int type) argument
32 static Void_t* dtlist(dt, obj, type)
33 reg Dt_t* dt;
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
[all...]
H A Ddtnew.c28 #include <dt.h>
38 eventf(Dt_t* dt, int op, void* data, Dtdisc_t* disc) argument
43 if (dc->odisc->eventf && (r = (*dc->odisc->eventf)(dt, op, data, dc->odisc)))
49 memoryf(Dt_t* dt, void* addr, size_t size, Dtdisc_t* disc) argument
61 Dt_t* dt; local
70 if (dt = dtopen(&dc.ndisc, meth))
71 dtdisc(dt, disc, DT_SAMECMP|DT_SAMEHASH);
72 return dt;
H A Ddtstat.c76 int dtstat(reg Dt_t* dt, Dtstat_t* ds, int all) argument
78 int dtstat(dt, ds, all)
79 reg Dt_t* dt;
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
[all...]
H A Ddtview.c31 static Void_t* dtvsearch(Dt_t* dt, reg Void_t* obj, reg int type) argument
33 static Void_t* dtvsearch(dt,obj,type)
34 Dt_t* dt;
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;
118 dtview(reg Dt_t* dt, reg Dt_t* view) argument
[all...]
H A Ddthash.c25 ** dt: dictionary
34 static void dthtab(Dt_t* dt) argument
36 static void dthtab(dt)
37 Dt_t* dt;
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
100 dthash(Dt_t* dt, reg Void_t* obj, int type) argument
[all...]
H A Ddttree.c25 ** dt: dictionary being searched
33 static Void_t* dttree(Dt_t* dt, Void_t* obj, int type) argument
35 static Void_t* dttree(dt,obj,type)
36 Dt_t* dt;
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
[all...]
/illumos-gate/usr/src/lib/librstp/common/
H A Dportinfo.c219 register int eff_age, dm, dt; local
231 dt = hello3;
233 dt = dm;
234 port->rcvdInfoWhile = dt;
236 stp_trace ("ma=%d eff_age=%d dm=%d dt=%d p=%s",
238 (int) eff_age, (int) dm, (int) dt, port->port_name);
/illumos-gate/usr/src/lib/libm/common/complex/
H A Dcsqrtf.c42 double dt, dx, dy; local
79 dt = sqrt(0.5 * (sqrt(dx * dx + dy * dy) + dx));
80 t = (float) dt;
81 w = (float) (dy / (dt + dt));
H A Dcatanf.c49 double dx, dy, dt; local
125 dt = dy - 1.0;
127 (dx * dx + dt * dt)));
H A Dcpowf.c57 double dx, dy, du, dv, dt, dc, ds, dp, dq, dr; local
110 dt = (hx >= 0)? 0.25 : 0.75;
112 dt = -dt;
114 sincospi(dt * du, &ds, &dc);
152 dt = dhalf * log1p((dx - 1.0) * (dx + 1.0) + dy * dy);
154 dt = dhalf * log1p((dy - 1.0) * (dy + 1.0) + dx * dx);
156 dt = dhalf * log(dx * dx + dy * dy);
159 dr = exp(du * dt);
162 dr = exp(du * dt
[all...]
/illumos-gate/usr/src/uts/common/io/scsi/adapters/scsi_vhci/fops/
H A Dsym.c79 char **dt; local
82 for (dt = symmetric_dev_table; *dt; dt++)
83 if (strncmp(stdinq->inq_vid, *dt, strlen(*dt)) == 0)
/illumos-gate/usr/src/lib/libast/common/comp/
H A Dhsearch.c69 static void hashfree(Dt_t* dt, Void_t* obj, Dtdisc_t* disc) argument
71 static void hashfree(dt, obj, disc)
72 Dt_t* dt;
H A Dtsearch.c75 static int treecompare(Dt_t* dt, char* one, char* two, Dtdisc_t* disc) argument
77 static int treecompare(dt, one, two, disc)
78 Dt_t* dt;
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
172 reg Dt_t* dt; local
[all...]
/illumos-gate/usr/src/cmd/isns/isnsd/
H A Dsched.c152 * dt - Time interval of the indexed-list.
161 uint32_t dt,
172 if (du < 1 || dt < 1 || nlim < 1) {
177 DT = dt;
159 el_init( uint32_t du, uint32_t dt, uint32_t nlim ) argument

Completed in 560 milliseconds

123