| /dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libast/path/ |
| H A D | pathgetlink.c | 30 #ifdef UNIV_MAX
53 #ifdef UNIV_MAX in pathgetlink()
82 if (!match && t < &tmp[sizeof(tmp) - univ_size + 1]) for (n = 0; n < UNIV_MAX; n++) in pathgetlink()
|
| H A D | pathsetlink.c | 39 #ifdef UNIV_MAX in pathsetlink()
51 for (n = 0; n < UNIV_MAX; n++) in pathsetlink()
|
| /dports/shells/ksh93/ast-93u/src/lib/libast/path/ |
| H A D | pathgetlink.c | 30 #ifdef UNIV_MAX
53 #ifdef UNIV_MAX in pathgetlink()
82 if (!match && t < &tmp[sizeof(tmp) - univ_size + 1]) for (n = 0; n < UNIV_MAX; n++) in pathgetlink()
|
| H A D | pathsetlink.c | 39 #ifdef UNIV_MAX in pathsetlink()
51 for (n = 0; n < UNIV_MAX; n++) in pathsetlink()
|
| /dports/shells/ast-ksh/ast-ksh93v/src/lib/libast/path/ |
| H A D | pathgetlink.c | 30 #ifdef UNIV_MAX
53 #ifdef UNIV_MAX in pathgetlink()
82 if (!match && t < &tmp[sizeof(tmp) - univ_size + 1]) for (n = 0; n < UNIV_MAX; n++) in pathgetlink()
|
| H A D | pathsetlink.c | 39 #ifdef UNIV_MAX in pathsetlink()
51 for (n = 0; n < UNIV_MAX; n++) in pathsetlink()
|
| /dports/graphics/graphviz/graphviz-2.44.1/lib/ast/ |
| H A D | pathgetlink.c | 22 #ifdef UNIV_MAX
53 #ifdef UNIV_MAX in pathgetlink()
79 for (n = 0; n < UNIV_MAX; n++) { in pathgetlink()
|
| /dports/shells/ksh93/ast-93u/src/lib/libast/misc/ |
| H A D | univlib.h | 71 #define UNIV_MAX NUMUNIV macro
73 #define UNIV_MAX univ_max
|
| H A D | univdata.c | 32 #ifndef UNIV_MAX
|
| /dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libast/misc/ |
| H A D | univlib.h | 71 #define UNIV_MAX NUMUNIV macro
73 #define UNIV_MAX univ_max
|
| H A D | univdata.c | 32 #ifndef UNIV_MAX
|
| /dports/shells/ast-ksh/ast-ksh93v/src/lib/libast/misc/ |
| H A D | univlib.h | 71 #define UNIV_MAX NUMUNIV macro
73 #define UNIV_MAX univ_max
|
| H A D | univdata.c | 32 #ifndef UNIV_MAX
|
| /dports/sysutils/vector/vector-0.10.0/cargo-crates/regalloc-0.0.25/src/ |
| H A D | avl_tree.rs | 1021 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1022 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1028 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1036 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1047 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1059 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1063 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1064 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1069 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1081 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/regalloc/src/ |
| H A D | avl_tree.rs | 1018 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1019 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1025 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1033 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1044 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1056 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1060 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1061 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1066 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1078 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/regalloc/src/ |
| H A D | avl_tree.rs | 1133 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1134 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1140 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1148 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1159 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1171 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1175 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1176 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1181 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1193 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/www/firefox/firefox-99.0/third_party/rust/regalloc/src/ |
| H A D | avl_tree.rs | 1133 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1134 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1140 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1148 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1159 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1171 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1175 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1176 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1181 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1193 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/regalloc/src/ |
| H A D | avl_tree.rs | 1133 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1134 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1140 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1148 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1159 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1171 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1175 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1176 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1181 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1193 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/regalloc/src/ |
| H A D | avl_tree.rs | 1133 const UNIV_MAX: u32 = 5999; in test_avl_tree1() const
1134 const UNIV_SIZE: u32 = UNIV_MAX - UNIV_MIN + 1; in test_avl_tree1()
1140 for i in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1148 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1159 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1171 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1175 for ir in UNIV_MIN..UNIV_MAX { in test_avl_tree1()
1176 let i = UNIV_MIN + (UNIV_MAX - ir); in test_avl_tree1()
1181 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
1193 avl_tree_test_utils::check_tree(&tree, &should_be_in_tree, UNIV_MIN, UNIV_MAX); in test_avl_tree1()
|
| /dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libast/port/ |
| H A D | astconf.c | 743 #ifdef UNIV_MAX in format()
|
| /dports/shells/ksh93/ast-93u/src/lib/libast/port/ |
| H A D | astconf.c | 743 #ifdef UNIV_MAX in format()
|
| /dports/shells/ast-ksh/ast-ksh93v/src/lib/libast/port/ |
| H A D | astconf.c | 796 #ifdef UNIV_MAX in format()
|