HomeSort by: relevance | last modified time | path
    Searched refs:suffixes (Results 1 - 25 of 27) sorted by relevancy

1 2

  /src/usr.bin/make/unit-tests/
deptgt-suffixes.exp 0 #*** Suffixes:
30 : Making deptgt-suffixes.src-left out of nothing.
31 : Making deptgt-suffixes.tgt-right from deptgt-suffixes.src-left.
32 : Making deptgt-suffixes.src-right out of nothing.
33 : Making deptgt-suffixes.tgt-left from deptgt-suffixes.src-right.
deptgt-suffixes.mk 1 # $NetBSD: deptgt-suffixes.mk,v 1.4 2020/11/21 21:54:42 rillig Exp $
3 # Tests for the special target .SUFFIXES in dependency declarations.
13 .SUFFIXES: .custom-null
19 # The order in which the suffixes are listed doesn't matter.
22 .SUFFIXES: .src-left .tgt-right
23 deptgt-suffixes.src-left:
27 all: deptgt-suffixes.tgt-right
30 .SUFFIXES: .tgt-left .src-right
31 deptgt-suffixes.src-right:
35 all: deptgt-suffixes.tgt-lef
    [all...]
suff-rebuild.mk 4 # by POSIX) when all suffixes are deleted.
10 .SUFFIXES:
12 .SUFFIXES: .a .b .c
25 # possible to delete the suffixes in the middle of the makefile, add back
26 # the suffixes from before, and have the transformation rules preserved.
40 #.SUFFIXES:
42 # Add the suffixes back. It should not matter that the order of the suffixes
44 .SUFFIXES: .c .b .a
suff-add-later.mk 4 # Adding more suffixes does not turn existing rules into suffix rules.
10 .SUFFIXES: .c
17 # Adding .d and .e as suffixes should turn the above regular rules into
19 .SUFFIXES: .d .e
30 # XXX: The suffixes .c and .e both have the number 2.
suff-main-several.mk 4 # suffixes are not known at the point of declaration.
19 .SUFFIXES: .1 .2 .3 .4
24 .SUFFIXES: # clear all
29 # Define and undefine the suffixes, changing their order.
31 # For some reason, mentioning the suffixes in reverse order disables them.
32 .SUFFIXES: .4 .3 .2 .1
33 .SUFFIXES: # none
34 .SUFFIXES: .1 .2 .3 .4
35 .SUFFIXES: # none
36 .SUFFIXES: .4 .3 .2 .
    [all...]
suff-main.mk 4 # suffixes are not known at the point of declaration.
18 # Declaring both '.1' and '.2' as suffixes turns the '.1.2' target into an
22 .SUFFIXES: .1 .2
opt-raw.mk 8 # are no predefined suffixes and no predefined tools.
suff-clear-single.mk 4 # Single suffix rules remain active after .SUFFIXES is cleared.
11 .SUFFIXES: .a .b .c
16 .SUFFIXES:
suff-clear-regular.mk 4 # Suffix rules do not become regular rules when .SUFFIXES is cleared.
8 .SUFFIXES: .a .b .c
10 # At this point, .a and .b are known suffixes, therefore the following
15 # The empty .SUFFIXES discards all previous suffixes.
17 .SUFFIXES:
suff-lookup.mk 3 # Demonstrate name resolution for suffixes.
12 .SUFFIXES: .c .cc .ccc
17 .SUFFIXES: .short .sho .dead-end
37 # Deleting all suffixes and adding them again rebuilds all of the above
39 .SUFFIXES:
40 .SUFFIXES: .c .cc .ccc .short .sho .dead-end
varname-dot-suffixes.mk 1 # $NetBSD: varname-dot-suffixes.mk,v 1.5 2023/12/20 09:03:09 rillig Exp $
3 # Tests for the special "variable" .SUFFIXES, which lists the suffixes that
4 # have been registered for use in suffix transformation rules. Suffixes are
7 # The name '.SUFFIXES' does not refer to a real variable, instead it can be
8 # used as a starting "variable name" for expressions like ${.SUFFIXES} or
9 # ${.SUFFIXES:M*o}.
12 .if ${.SUFFIXES} != ""
15 # There is no actual variable named '.SUFFIXES', it is all made up.
16 .if defined(.SUFFIXES)
    [all...]
suff-transform-expand.mk 14 .SUFFIXES: .h .i .j
suff-main-several.exp 8 Parsing suff-main-several.mk:19: .SUFFIXES: .1 .2 .3 .4
9 ParseDependency(.SUFFIXES: .1 .2 .3 .4)
29 Parsing suff-main-several.mk:24: .SUFFIXES:
30 ParseDependency(.SUFFIXES:)
31 Clearing all suffixes
32 Parsing suff-main-several.mk:32: .SUFFIXES: .4 .3 .2 .1
33 ParseDependency(.SUFFIXES: .4 .3 .2 .1)
38 Parsing suff-main-several.mk:33: .SUFFIXES:
39 ParseDependency(.SUFFIXES:)
40 Clearing all suffixes
    [all...]
suff-transform-endless.mk 18 .SUFFIXES: .c .d .e .f
29 # XXX: The suffixes .d and .f both have the number 3.
varmod-order-numeric.mk 53 # The measurement units for suffixes are k, M, G, but not T.
suff-incomplete.exp 1 Parsing suff-incomplete.mk:9: .SUFFIXES:
2 ParseDependency(.SUFFIXES:)
3 Clearing all suffixes
4 Parsing suff-incomplete.mk:11: .SUFFIXES: .a .b .c
5 ParseDependency(.SUFFIXES: .a .b .c)
suff-lookup.exp 27 Clearing all suffixes
suff-rebuild.exp 1 Parsing suff-rebuild.mk:10: .SUFFIXES:
2 ParseDependency(.SUFFIXES:)
3 Clearing all suffixes
4 Parsing suff-rebuild.mk:12: .SUFFIXES: .a .b .c
5 ParseDependency(.SUFFIXES: .a .b .c)
33 Parsing suff-rebuild.mk:44: .SUFFIXES: .c .b .a
35 ParseDependency(.SUFFIXES: .c .b .a)
posix1.mk 3 # Keep the default suffixes from interfering, just in case.
4 .SUFFIXES:
112 .SUFFIXES: .c .o .a
Makefile 168 TESTS+= deptgt-suffixes
457 TESTS+= varname-dot-suffixes
588 POSTPROC.deptgt-suffixes= awk '/^\#\*\*\* Suffixes/,/^never-stop/'
689 CLEANFILES+= issue* .[ab]* # suffixes.mk
726 .SUFFIXES: .mk .rawout .out
  /src/tests/usr.bin/mkdep/
t_mkdep.sh 44 atf_test_case suffixes
46 atf_set "descr" "Test suffixes list"
68 atf_set "descr" "Test the combination of a prefix and suffixes"
81 atf_add_test_case suffixes
  /src/usr.bin/ftp/
progressbar.c 88 * List of order of magnitude suffixes, per IEC 60027-2.
91 static const char * const suffixes[] = { variable in typeref:typename:const char * const[]
105 #define NSUFFIXES (int)(sizeof(suffixes) / sizeof(suffixes[0]))
244 suffixes[i]);
261 suffixes[i]);
354 suffixes[i]);
  /src/usr.bin/mkdep/
mkdep.c 89 "usage: %s [-aDdiopqv] [-f file] [-P prefix] [-s suffixes] "
224 const char *suffixes = NULL, *s; local in function:main
273 suffixes = "";
282 suffixes = optarg;
301 if (suffixes != NULL) {
302 if (*suffixes) {
303 for (s = suffixes; (sz = strcspn(s, ", ")) != 0;) {
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_linux_test.cc 232 const char *suffixes[] = { "", "-linux", ".1.2", "-linux.1.2" }; local in function:__sanitizer::TEST
236 for (uptr j = 0; j < ARRAY_SIZE(suffixes); j++) {
239 paths[i], base_names[k], suffixes[j]);
  /src/usr.bin/gzip/
gzip.c 149 static suffixes_t suffixes[] = { variable in typeref:typename:suffixes_t[]
176 #define NUM_SUFFIXES (sizeof suffixes / sizeof suffixes[0])
401 suffixes[0].zipped = optarg;
402 suffixes[0].ziplen = len;
404 suffixes[NUM_SUFFIXES - 1].zipped = "";
405 suffixes[NUM_SUFFIXES - 1].ziplen = 0;
1280 for (s = suffixes; s != suffixes + NUM_SUFFIXES; s++) {
1345 file, suffixes[0].zipped) >= outsize
    [all...]

Completed in 18 milliseconds

1 2