Home
last modified time | relevance | path

Searched refs:traverse (Results 1 – 25 of 29) sorted by relevance

12

/mirbsd/src/usr.bin/tsort/
Dtsort.c108 struct link *traverse; /* Next link to traverse when backtracking. */ member
221 n->traverse = NULL; in new_node()
614 if (n->traverse) in find_cycle_from()
615 n->traverse = n->traverse->next; in find_cycle_from()
617 n->traverse = n->arcs; in find_cycle_from()
619 while (n->traverse && n->traverse->node->refs == 0) in find_cycle_from()
620 n->traverse = n->traverse->next; in find_cycle_from()
621 if (n->traverse) { in find_cycle_from()
622 struct node *go = n->traverse->node; in find_cycle_from()
689 if (n->traverse) in traverse_node()
[all …]
/mirbsd/src/bin/ls/
Dls.c60 static void traverse(int, char **, int);
302 traverse(argc, argv, fts_options); in ls_main()
304 traverse(1, dotav, fts_options); in ls_main()
317 traverse(int argc, char *argv[], int options) in traverse() function
/mirbsd/src/usr.bin/yacc/
Dlalr.c75 void traverse(int);
621 traverse(i); in digraph()
630 traverse(int i) in traverse() function
653 traverse(j); in traverse()
/mirbsd/src/sbin/dump/
DMakefile16 SRCS= dumprmt.c itime.c main.c optr.c tape.c traverse.c
/mirbsd/src/lib/libssl/src/doc/crypto/
DBIO_find_type.pod52 BIO_next() returns the next BIO in a chain. It can be used to traverse all BIOs
68 BIO_next() was added to OpenSSL 0.9.6 to provide a 'clean' way to traverse a BIO
/mirbsd/src/gnu/usr.bin/binutils/bfd/doc/
Dhash.texi6 entry for it, and to traverse a hash table. There is
92 The function @code{bfd_hash_traverse} may be used to traverse a
Dlinker.texi321 The @code{_bfd_final_link} routine must also traverse the global
325 but it is still necessary to traverse the hash table since the
/mirbsd/src/sbin/routed/
Dradix.c387 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
405 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
/mirbsd/src/sys/net/
Dradix.c391 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
409 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
/mirbsd/src/bin/pax/.linked/
Dstrlfun.inc150 /* traverse rest of src */
/mirbsd/src/usr.bin/sudo/
DTODO103 traverse the tree to the root doing this.
/mirbsd/src/gnu/usr.bin/perl/ext/SDBM_File/sdbm/
DREADME119 dbm/ndbm implementations use the hash value to traverse
/mirbsd/src/gnu/usr.bin/perl/lib/Memoize/
DTODO121 otherwise traverse them.
/mirbsd/src/gnu/usr.bin/perl/lib/Net/
DlibnetFAQ.pod171 still use Net::FTP to traverse these firewalls, but a more manual approach
/mirbsd/src/gnu/usr.bin/perl/pod/
Dperlhack.pod1140 "routes" through it, two orders in which you can traverse the tree.
1226 executes the code. We can traverse the tree in this order using
Dperltoot.pod1085 class "is" another one without having to traverse the hierarchy yourself:
Dperlfaq4.pod1278 (which returns the number of items that passed its condition) to traverse the
Dperlguts.pod426 /* Prepares starting point to traverse hash table */
Dperlglossary.pod92 the name of both the L</filehandle> used to traverse the arguments and
Dperlapi.pod1292 Prepares a starting point to traverse a hash table. Returns the number of
/mirbsd/src/share/dict/
Dweb2a65271 toll traverse
66491 traverse board
66492 traverse circle
66493 traverse drill
66494 traverse feed
66495 traverse flute
66496 traverse jury
66497 traverse rail
66498 traverse rod
66499 traverse sailing
[all …]
Dwords23586 traverse
/mirbsd/src/gnu/usr.bin/cvs/
DFAQ1489 - Presumably there would also be a tool to traverse the link tree and
3093 s/he can't traverse the tree. (If you enable the world execute bit
3094 (mode 2771) on directories, users can traverse the tree and the user
7222 line, it will traverse the directory and waste a bit of time, but if
/mirbsd/src/lib/libncurses/src/doc/
Dncurses-intro.doc2010 It is also possible to traverse the fields as if they had been sorted
/mirbsd/src/lib/libssl/src/doc/
Dssleay.txt768 populated it with X509_NAME_ENTRYs, you should then traverse the X509_NAME

12