/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/types/ |
H A D | tst.enum.d | 42 three,
|
/freebsd-11-stable/contrib/bmake/unit-tests/ |
H A D | modorder.exp | 1 LIST = one two three four five six seven eight nine ten 2 LIST:O = eight five four nine one seven six ten three two
|
H A D | varcmd.mk | 21 @${.MAKE} -f ${MAKEFILE} three 23 three: show
|
H A D | forloop.mk | 5 LIST = one "two and three" four "five"
|
H A D | varcmd.exp | 5 three FU=<v>bar</v> FOO=<v>goo</v> VAR=<v></v>
|
H A D | modorder.mk | 3 LIST= one two three four five six seven eight nine ten
|
H A D | modts.mk | 2 LIST= one two three
|
H A D | escape.exp | 83 echo take three\\ 84 take three\
|
H A D | modword.mk | 7 LIST= one two three
|
H A D | escape.mk | 231 echo take three\\
|
/freebsd-11-stable/tools/tools/iso/ |
H A D | check-iso3166.pl | 31 my $three = $2; 36 $old{$two}{three} = $three; 61 my $three = $3; 66 $new1{$two}{three} = $three; 102 print "In old but not new1: $old{$two}{two}\t$old{$two}{three}\t$old{$two}{number}\t$old{$two}{name}\n"; 117 print "In new1 but not old: $new1{$two}{two}\t$new1{$two}{three}\t$new1{$two}{number}\t$new1{$two}{name}\n"; 138 $old{$two}{three} ne $new1{$two}{three} || [all...] |
/freebsd-11-stable/contrib/dialog/samples/ |
H A D | treeview2 | 20 tag3:three:on:2 28 tag13:1three:on:2 36 tag23:2three:on:2
|
H A D | treeview | 12 tag3 three on 2 \
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/llquantize/ |
H A D | tst.bases.d | 32 @three = llquantize(i, 3, 0, 1, 9);
|
/freebsd-11-stable/contrib/libxo/tests/xo/ |
H A D | xo_01.sh | 19 for i in one:1:red two:2:blue three:3:green four:4:yellow ; do
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/aggs/ |
H A D | tst.lquantzero.d | 57 @three[i] = lquantize(0, 0, 20, 1, incr); 76 printa(@three);
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/usdt/ |
H A D | tst.linkpriv.ksh | 48 DTRACE_PROBE3(test_prov, three, 4, 5, 7); 59 probe three(uintptr_t, uintptr_t, uintptr_t);
|
H A D | tst.linkunpriv.ksh | 50 DTRACE_PROBE3(test_prov, three, 4, 5, 7); 61 probe three(uintptr_t, uintptr_t, uintptr_t);
|
/freebsd-11-stable/contrib/ntp/lib/isc/tests/ |
H A D | queue_test.c | 57 item_t one, two, three, four, five; local 66 item_init(&three, 3); 98 ATF_CHECK(! ISC_QLINK_LINKED(&three, qlink)); 99 ISC_QUEUE_PUSH(queue, &three, qlink); 100 ATF_CHECK(ISC_QLINK_LINKED(&three, qlink));
|
/freebsd-11-stable/sys/contrib/octeon-sdk/ |
H A D | cvmx-nand.h | 193 uint64_t three : 4; member in struct:__anon8642 203 uint64_t three : 4; member in struct:__anon8643
|
/freebsd-11-stable/contrib/gcc/doc/ |
H A D | makefile.texi | 88 for @command{make} is to do a full three-stage bootstrap. This means 89 that GCC is built three times---once with the native compiler, once with 97 and ``bubble'' up the change through the three stages. Each stage 118 Performs only the first two stages of bootstrap. Unlike a three-stage
|
/freebsd-11-stable/crypto/heimdal/lib/asn1/ |
H A D | check-gen.c | 892 COMPARE_INTEGER(aa,ab,three); 942 c1.three = 3; 947 c2.three = 3; 952 c3.three = 4; 1065 "three too short" },
|
/freebsd-11-stable/sys/crypto/skein/amd64/ |
H A D | skein_block_asm.s | 14 _MASK_ALL_ = (256+512+1024) #all three algorithm bits
|
/freebsd-11-stable/contrib/dtc/Documentation/ |
H A D | dtc-paper.tex | 210 containing the device tree. It has three sections of variable size: 213 version and the locations of the three sections, plus a handful of 395 representations. It can take its input in one of three different 410 In addition, \dtc can output the tree in one of three different 448 of three forms:
|
/freebsd-11-stable/contrib/ntp/scripts/update-leap/ |
H A D | update-leap.in | 449 three weeks.
|