Searched refs:parentp (Results 1 - 8 of 8) sorted by relevance
| /freebsd-current/usr.bin/gprof/ |
| H A D | dfn.c | 60 dfn(nltype *parentp) argument
67 printname( parentp );
74 if ( dfn_numbered( parentp ) ) {
80 if ( dfn_busy( parentp ) ) {
81 dfn_findcycle( parentp );
87 dfn_pre_visit( parentp );
91 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
99 dfn_post_visit( parentp );
106 dfn_pre_visit(nltype *parentp) argument
112 dfn_stack[ dfn_depth ].nlentryp = parentp;
259 dfn_self_cycle(nltype *parentp) argument
280 dfn_post_visit(nltype *parentp) argument
[all...] |
| H A D | arcs.c | 49 addarc(nltype *parentp, nltype *childp, long count) argument
56 count , parentp -> name , childp -> name );
59 arcp = arclookup( parentp , childp );
76 arcp -> arc_parentp = parentp;
82 arcp -> arc_childlist = parentp -> children;
83 parentp -> children = arcp;
113 nltype *parentp, **timesortnlp; local
124 for ( parentp = nl ; parentp < npe ; parentp
260 timepropagate(nltype *parentp) argument
883 nltype *parentp; local
[all...] |
| H A D | lookup.c | 86 arclookup(nltype *parentp, nltype *childp) argument
90 if ( parentp == 0 || childp == 0 ) {
91 fprintf( stderr, "[arclookup] parentp == 0 || childp == 0\n" );
97 parentp -> name , childp -> name );
100 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
|
| H A D | printgprof.c | 218 nltype *parentp; local
225 parentp = timesortnlp[ idx ];
227 parentp -> ncall == 0 &&
228 parentp -> selfcalls == 0 &&
229 parentp -> propself == 0 &&
230 parentp -> propchild == 0 ) {
233 if ( ! parentp -> printflag ) {
236 if ( parentp -> name == 0 && parentp -> cycleno != 0 ) {
240 printcycle( parentp );
299 nltype *parentp; local
341 printchildren(nltype *parentp) argument
401 sortchildren(nltype *parentp) argument
[all...] |
| H A D | gprof.c | 308 nltype *parentp; local
311 parentp = nllookup( rawp -> raw_frompc );
313 if ( parentp == 0 || childp == 0 )
316 && onlist( kfromlist , parentp -> name )
324 parentp -> name , childp -> name , rawp -> raw_count );
327 addarc( parentp , childp , rawp -> raw_count );
|
| /freebsd-current/sys/sys/ |
| H A D | pctrie.h | 80 void *parentp; \
83 parentp = pctrie_insert_lookup(ptree, val); \
84 if (parentp == NULL) \
89 pctrie_insert_node(parentp, parent, val); \
159 void pctrie_insert_node(void *parentp,
|
| /freebsd-current/sys/kern/ |
| H A D | subr_pctrie.c | 318 pctrie_insert_node(void *parentp, struct pctrie_node *parent, uint64_t *val) argument
341 node = pctrie_node_load(parentp, NULL, PCTRIE_UNSERIALIZED);
362 pctrie_node_store(parentp, parent, PCTRIE_LOCKED);
|
| /freebsd-current/sys/contrib/openzfs/module/zfs/ |
| H A D | dbuf.c | 3136 * parentp will not be updated if the dnode does not have dn_dbuf filled in;
3143 dmu_buf_impl_t **parentp, blkptr_t **bpp)
3145 *parentp = NULL;
3158 *parentp = dn->dn_dbuf;
3199 blkid >> epbs, fail_sparse, FALSE, NULL, parentp);
3203 err = dbuf_read(*parentp, NULL,
3206 dbuf_rele(*parentp, NULL);
3207 *parentp = NULL;
3210 rw_enter(&(*parentp)->db_rwlock, RW_READER);
3211 *bpp = ((blkptr_t *)(*parentp)
3142 dbuf_findbp(dnode_t *dn, int level, uint64_t blkid, int fail_sparse, dmu_buf_impl_t **parentp, blkptr_t **bpp) argument
[all...] |
Completed in 88 milliseconds