Home
last modified time | relevance | path

Searched refs:shortest (Results 1 – 25 of 88) sorted by relevance

1234

/netbsd-src/external/gpl2/texinfo/dist/info/
H A Decho-area.c1242 long shortest = 100000; in build_completions() local
1256 if (shortest > j) in build_completions()
1257 shortest = j; in build_completions()
1261 LCD_reference.label = (char *)xmalloc (1 + shortest); in build_completions()
1281 strncpy (LCD_reference.label, completions_found[i]->label, shortest); in build_completions()
1282 LCD_reference.label[shortest] = '\0'; in build_completions()
/netbsd-src/external/gpl2/groff/dist/src/include/
H A Dindex.h34 int shortest; member
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Danalyzer.texi331 We thus want to find the shortest feasible path through the exploded
333 saved. Unfortunately, if we simply find the shortest such path and
340 We attempt to find the shortest feasible path to each diagnostic by
351 target node is the shortest possible path. Hence we start by trying the
352 shortest possible path, but if that fails, we explore progressively
358 order of shortest path until we either find a feasible path to the
365 @option{-fno-analyzer-feasibility}, which simply uses the shortest path,
368 The above gives us a shortest feasible @code{exploded_path} through the
/netbsd-src/external/lgpl3/gmp/dist/mpn/x86_64/fastsse/
H A Dcopyi-palignr.asm72 C movaps, since it has the shortest coding.
H A Dcom-palignr.asm71 C movaps, since it has the shortest coding.
/netbsd-src/external/gpl2/groff/dist/src/libs/libbib/
H A Dindex.cpp472 if (len < header.shortest) in search1()
593 if (key_len >= header.shortest) { in read_common_words_file()
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/rt/
H A Dminfo.d75 void shortest(size_t start, size_t target) in genCyclePath()
148 shortest(srcidx, targetidx); in genCyclePath()
150 shortest(targetidx, srcidx); in genCyclePath()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/
H A Dminfo.d75 void shortest(size_t start, size_t target) in genCyclePath()
148 shortest(srcidx, targetidx); in genCyclePath()
150 shortest(targetidx, srcidx); in genCyclePath()
/netbsd-src/external/mpl/bind/dist/lib/dns/
H A Ddnssec.c2202 dns_ttl_t shortest = 0; in dns_dnssec_syncdelete()
2209 (shortest == 0 || thisttl < shortest)) in dns_dnssec_syncdelete()
2211 shortest = thisttl; in dns_dnssec_syncdelete()
2215 if (shortest != 0) { in dns_dnssec_syncdelete()
2216 ttl = shortest; in dns_dnssec_syncdelete()
2294 dns_ttl_t shortest = 0; global() variable
/netbsd-src/external/mpl/dhcp/bind/dist/lib/dns/
H A Ddnssec.c2283 dns_ttl_t shortest = 0; in dns_dnssec_updatekeys() local
2290 (shortest == 0 || thisttl < shortest)) in dns_dnssec_updatekeys()
2292 shortest = thisttl; in dns_dnssec_updatekeys()
2296 if (shortest != 0) { in dns_dnssec_updatekeys()
2297 ttl = shortest; in dns_dnssec_updatekeys()
/netbsd-src/usr.bin/sed/TEST/
H A Dhanoi.sed17 # say :ce:b:ax: and it will give the shortest procedure for moving them all
/netbsd-src/external/gpl2/rcs/dist/
H A Drcs_func.ms89 differences are compressed into the shortest possible form.
/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Danalyzer.texi343 each duplicate warning's shortest path is feasible, rejecting any
344 warnings for which the shortest path is infeasible (which could lead to
347 We use the shortest feasible @code{exploded_path} through the
/netbsd-src/external/bsd/unbound/dist/testdata/
H A Dsubnet_max_source.crpl20 SCENARIO_BEGIN Test shortest source prefix-length
/netbsd-src/external/gpl2/groff/dist/src/utils/indxbib/
H A Dindxbib.cpp767 h.shortest = shortest_len; in write_hash_table()
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/range/
H A Dpackage.d4410 private StoppingPolicy stoppingPolicy = StoppingPolicy.shortest;
4416 this(R rs, StoppingPolicy s = StoppingPolicy.shortest)
4443 case StoppingPolicy.shortest:
4593 case StoppingPolicy.shortest:
4628 case StoppingPolicy.shortest:
4669 if (stoppingPolicy == StoppingPolicy.shortest)
4870 shortest,
4888 auto shortest = zip(StoppingPolicy.shortest, a, b);
4889 assert(shortest.equal([
4909 Non-public. Like $(LREF Zip) with `StoppingPolicy.shortest`
[all …]
/netbsd-src/external/bsd/openldap/dist/servers/slapd/schema/
H A Djava.schema206 # first address being numbered 0. It is represented by its shortest
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
H A DREADME_ALTIVEC.txt296 shortest instruction sequence for implementing a shufflevector operation on
/netbsd-src/external/bsd/tre/dist/
H A DREADME.md246 * A REG_SHORTEST regexec() flag for returning the shortest match
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtimevar.def336 DEFTIMEVAR (TV_ANALYZER_SHORTEST_PATHS, "analyzer: shortest paths")
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/range/
H A Dpackage.d3958 private StoppingPolicy stoppingPolicy = StoppingPolicy.shortest;
3964 this(R rs, StoppingPolicy s = StoppingPolicy.shortest)
3991 case StoppingPolicy.shortest: in empty()
4141 case StoppingPolicy.shortest: in popFront()
4176 case StoppingPolicy.shortest: in popBack()
4217 if (stoppingPolicy == StoppingPolicy.shortest) in length()
4365 shortest, enumerator
4677 this(R ranges, StoppingPolicy sp = StoppingPolicy.shortest)
4876 auto stuff = lockstep([1,2,3,4,5], StoppingPolicy.shortest);
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtimevar.def343 DEFTIMEVAR (TV_ANALYZER_SHORTEST_PATHS, "analyzer: shortest paths")
/netbsd-src/external/gpl3/binutils.old/dist/gas/doc/
H A Dc-vax.texi207 instructions. They expand to the shortest branch instruction that
/netbsd-src/external/gpl3/binutils/dist/gas/doc/
H A Dc-vax.texi207 instructions. They expand to the shortest branch instruction that
H A Dc-cris.texi156 shortest fitting instruction of @code{addoq}, @code{addo.w} and

1234