OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:dn_list
(Results
1 - 13
of
13
) sorted by relevancy
/src/external/cddl/osnet/dist/lib/libdtrace/common/
dt_sugar.c
209
for (arg = dnp->dn_args; arg != NULL; arg = arg->
dn_list
)
222
while (ln->
dn_list
!= NULL) {
223
dt_sugar_visit_all(dp, ln->
dn_list
);
224
ln = ln->
dn_list
;
241
for (arg = dnp->dn_aggtup; arg != NULL; arg = arg->
dn_list
)
249
for (arg = dnp->dn_pdescs; arg != NULL; arg = arg->
dn_list
)
255
for (arg = dnp->dn_acts; arg != NULL; arg = arg->
dn_list
)
271
for (arg = dnp->dn_members; arg != NULL; arg = arg->
dn_list
)
276
for (arg = dnp->dn_probes; arg != NULL; arg = arg->
dn_list
)
281
for (arg = dnp->
dn_list
; arg != NULL; arg = arg->dn_list
[
all
...]
dt_pragma.c
91
dnp->
dn_list
== NULL || dnp->
dn_list
->dn_kind != DT_NODE_IDENT) {
101
dnp = dnp->
dn_list
;
105
dnp = dnp->
dn_list
;
108
dnp = dnp->
dn_list
;
173
dnp->
dn_list
== NULL || dnp->
dn_list
->dn_kind != DT_NODE_IDENT) {
183
name = dnp->
dn_list
->dn_string;
241
dt_node_t *nnp = cnp ? cnp->
dn_list
: NULL;
356
for (enp = dnp; enp != NULL; enp = enp->
dn_list
) {
[
all
...]
dt_cc.c
331
for (anp = dnp->dn_args; anp != NULL; anp = anp->
dn_list
)
374
for (anp = dnp->dn_args; anp != NULL; anp = anp->
dn_list
)
394
if ((normal = anp->
dn_list
) != NULL && !dt_node_is_scalar(normal)) {
436
for (anp = dnp->dn_args; anp != NULL; anp = anp->
dn_list
)
448
trunc = anp->
dn_list
;
503
for (anp = dnp->dn_args; anp != NULL; anp = anp->
dn_list
)
509
anp = dnp->dn_args->
dn_list
;
573
anp = anp->
dn_list
;
596
arg1 = dnp->dn_args->
dn_list
;
655
for (anp = arg1; anp != NULL; anp = anp->
dn_list
) {
[
all
...]
dt_parser.c
531
dnp->
dn_list
= NULL;
657
dt_node_list_free(&dnp->
dn_list
);
1653
for (; dnp != NULL; dnp = dnp->
dn_list
, argc++) {
1786
dnp->
dn_list
= NULL;
2327
for (pnp = ddp->dd_node; pnp != NULL; pnp = pnp->
dn_list
)
2344
pnp != NULL; pnp = pnp->
dn_list
, i++) {
2626
dnp->
dn_list
= lnp;
3881
dnp->
dn_list
= NULL;
3994
if (rp->
dn_list
!= NULL) {
4294
for (mnp = dnp->dn_members; mnp != NULL; mnp = mnp->
dn_list
) {
[
all
...]
dt_xlator.c
82
enp->dn_link->
dn_list
= mnp;
217
for (dnp = dxp->dx_members; dnp != NULL; dnp = dnp->
dn_list
) {
374
for (dnp = dxp->dx_members; dnp != NULL; dnp = dnp->
dn_list
) {
dt_ident.c
90
for (i = 0; i < arglimit; i++, args = args->
dn_list
) {
153
for (i = 0; i < argc; i++, args = args->
dn_list
) {
162
isp->dis_args[i].
dn_list
= &isp->dis_args[i + 1];
166
isp->dis_args[argc - 1].
dn_list
= NULL;
971
for (argp = args; argp != NULL; argp = argp->
dn_list
)
dt_parser.h
116
struct dt_node *
dn_list
; /* parse tree list link */
member in struct:dt_node
dt_provider.c
189
nnp = nnp->
dn_list
;
211
pnp->
dn_list
= dnp;
465
for (i = 0; i < xargc; i++, xargs = xargs->
dn_list
) {
483
for (i = 0; i < nargc; i++, nargs = nargs->
dn_list
)
dt_decl.c
292
for (dnp = flist; dnp != fnp && dnp != NULL; dnp = dnp->
dn_list
) {
318
for (dnp = plist; dnp != NULL; dnp = dnp->
dn_list
, i++) {
361
if (v != 0 && plist->
dn_list
!= NULL)
dt_dof.c
362
for (dnp = dxp->dx_members; dnp != NULL; dnp = dnp->
dn_list
, i++) {
416
for (dnp = prp->pr_nargs; dnp != NULL; dnp = dnp->
dn_list
) {
423
for (dnp = prp->pr_xargs; dnp != NULL; dnp = dnp->
dn_list
) {
dt_printf.c
1144
dnp = dnp->
dn_list
;
1173
dnp = dnp->
dn_list
;
1239
for (largc = 0; lproto != NULL; lproto = lproto->
dn_list
)
1242
for (rargc = 0; rproto != NULL; rproto = rproto->
dn_list
)
1259
for (argn = 1; lproto != NULL; argn++, lproto = lproto->
dn_list
,
1260
rproto = rproto->
dn_list
) {
dt_cg.c
548
for (dnp = args; dnp != NULL; dnp = dnp->
dn_list
)
553
for (dnp = args; dnp != NULL; dnp = dnp->
dn_list
, i++) {
1048
for (mnp = dxp->dx_members; mnp != NULL; mnp = mnp->
dn_list
) {
1240
assert(dnp->dn_args->
dn_list
== NULL);
1336
pnp != NULL; pnp = pnp->
dn_list
, i++) {
dt_program.c
426
for (dnp = prp->pr_nargs, i = 0; dnp != NULL; dnp = dnp->
dn_list
, i++) {
Completed in 55 milliseconds
Indexes created Tue Feb 24 08:35:24 UTC 2026