Home
last modified time | relevance | path

Searched full:shortest (Results 1 – 25 of 151) sorted by relevance

1234567

/freebsd/contrib/ofed/opensm/man/
H A Dopensm.8895 (SL) to provide deadlock-free shortest-path routing while also
914 single-source-shortest-path routing, which uses the SSSP algorithm
918 9. SSSP unicast routing algorithm - a single-source-shortest-path routing
1161 LASH is an acronym for LAyered SHortest Path Routing. It is a
1162 deterministic shortest path routing algorithm that enables topology
1166 topology for the shortest-path routes between all pairs of sources /
1176 1) LASH determines the shortest-path between all pairs of source /
1204 related to a root node and always routes shortest-path.
1233 algorithm and so uses shortest paths. Instead of spreading traffic
1234 out across different paths with the same shortest distance, it chooses
[all …]
/freebsd/crypto/krb5/src/lib/crypto/krb/
H A Denctype_util.c130 krb5_enctype_to_name(krb5_enctype enctype, krb5_boolean shortest, in krb5_enctype_to_name() argument
149 if (shortest) { in krb5_enctype_to_name()
/freebsd/sys/contrib/device-tree/Bindings/mfd/
H A Drohm,bd71847-pmic.yaml65 # Shortest being 10ms, next 500ms and then multiple of 500ms up to 7,5s
67 # Shortest being 10ms, next 1000ms and then multiple of 1000ms up to 15s
H A Drohm,bd71837-pmic.yaml65 # Shortest being 10ms, next 500ms and then multiple of 500ms up to 7,5s
67 # Shortest being 10ms, next 1000ms and then multiple of 1000ms up to 15s
/freebsd/sys/contrib/zstd/
H A DMakefile88 ## shortest: same as `make check`
89 .PHONY: shortest
90 shortest: target
95 check: shortest
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp254 // where Dist is the length of the shortest path between two nodes. This in findAugmentingPath()
258 // search, as the path is the shortest since Dist[Source, Target] >= 0; in findAugmentingPath()
260 // process node V, as it is guaranteed _not_ to be on a shortest path in findAugmentingPath()
496 /// Identify candidate (shortest) edges for augmentation.
505 // Decide which edges are on a shortest path from Source to Target in identifyShortestEdges()
564 /// Whether the edge is currently on a shortest path from Source to Target.
589 /// find the shortest from the entry to an exit passing through the component,
665 /// Find the shortest path from the entry block to an exit block passing
680 /// Apply the Dijkstra algorithm to find the shortest path from a given
/freebsd/contrib/googletest/googletest/test/
H A Dgoogletest-output-test.py125 # *? means "find the shortest string that matches".
134 # *? means "find the shortest string that matches".
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dwrite_escaped.h86 // hex-digit-sequence is the shortest hexadecimal representation of C using
96 // hex-digit-sequence is the shortest hexadecimal representation of U using
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsAnalyzeImmediate.h55 /// GetShortestSeq - Find the shortest instruction sequence in SeqLs and
/freebsd/usr.bin/fortune/strfile/
H A Dstrfile.h43 uint32_t str_shortlen; /* length of shortest string */
H A Dstrfile.8116 uint32_t str_shortlen; /* length of shortest string */
/freebsd/crypto/krb5/src/lib/krb5/os/
H A Dt_trace.ref43 krb5_enctype, display shortest name of enctype: aes128-cts
/freebsd/usr.bin/write/
H A Dwrite.177 select one of the terminals \- it will pick the one with the shortest
/freebsd/lib/libc/locale/
H A Dutf8.570 0x00; 0xC0 0x80; 0xE0 0x80 0x80) the shortest representation is always
H A Dutf8.c125 * detect redundant, non-"shortest form" encodings. For in _UTF8_mbrtowc()
311 * We always output the shortest sequence possible. Also specify the in _UTF8_wcrtomb()
/freebsd/contrib/googletest/googletest/src/
H A Dgtest-printers.cc493 return false; // trail byte or non-shortest form in IsValidUTF8()
498 // check for non-shortest form and surrogate in IsValidUTF8()
505 // check for non-shortest form in IsValidUTF8()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DOptionalDiagnostic.h54 // APFloat::toString would automatically print the shortest
/freebsd/contrib/nvi/common/
H A Dmultibyte.h21 * UCHAR_T The shortest unified character type (8-bit clean).
/freebsd/share/man/man4/
H A Dh_ertt.498 The shortest RTT measurement that has been taken.
H A Dpim.461 and optionally creates shortest-path trees per source.
/freebsd/sys/contrib/zlib/
H A Dinftrees.c30 longest code or if it is less than the shortest code.
76 for the first code of the shortest length, and the codes are integer in inflate_table()
/freebsd/usr.bin/w/
H A Dproc_compare.c48 * 3) The sleeper with the shortest sleep time is next. With ties,
/freebsd/contrib/ofed/opensm/include/opensm/
H A Dosm_switch.h367 * [in] LID (host order) for which to retrieve the shortest hop count.
398 * retrieve the shortest hop count.
448 * [in] LID (host order) for which to retrieve the shortest hop count.
/freebsd/contrib/unbound/util/data/
H A Ddname.c79 return 0; /* too short, shortest is '0' root label */ in dname_valid()
795 * shortest is first.
810 /* equal, see who is shortest */ in memcanoncmp()
/freebsd/contrib/llvm-project/lld/tools/lld/
H A Dlld.cpp93 // Not running in lit tests, just take the shortest codepath with global

1234567