OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:two
(Results
226 - 250
of
1983
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-cris/
stabs1.s
23
;# a.out expects it to be of
two
parts, like the construct at
tls-ldgde-14.d
13
# Check that we have proper NPTL/TLS markings and GOT for
two
14
# R_CRIS_16_GOT_GD and
two
R_CRIS_16_DTPRELs against different
tls-ldgdex-14.d
11
# Check that we have proper NPTL/TLS markings and GOT for
two
12
# R_CRIS_16_GOT_GD and
two
R_CRIS_16_DTPRELs against different
tls-ldgdex-15.d
11
# Check that we have proper NPTL/TLS markings and GOT for
two
12
# R_CRIS_32_GOT_GD and
two
R_CRIS_32_DTPRELs against different
tls-ldgdx-14.d
10
# Check that we have proper NPTL/TLS markings and GOT for
two
11
# R_CRIS_16_GOT_GD and
two
R_CRIS_16_DTPRELs against different
tls-ldgdx-15.d
10
# Check that we have proper NPTL/TLS markings and GOT for
two
11
# R_CRIS_32_GOT_GD and
two
R_CRIS_32_DTPRELs against different
tls-legd-16.d
14
# executable with
two
R_CRIS_32_TPREL and
two
R_CRIS_32_GD, different
tls-legdx-16.d
12
# executable with
two
R_CRIS_32_TPREL and
two
R_CRIS_32_GD, different
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
RewriteCardinalityException.js
6
* This signifies a case where the cardinality of
two
or more elements
/external/libcxx/test/std/utilities/function.objects/refwrap/
weak_result.pass.cpp
50
struct
two
{char _; char __;};
struct in struct:has_result_type
51
template <class U> static
two
test(...);
/external/libcxx/test/std/utilities/utility/forward/
forward.pass.cpp
23
struct
two
{one _[2];};
struct
28
two
test(const A&);
/external/toybox/tests/
grep.test
23
testing "grep -e -e" "grep -e one -e
two
-e three input" \
24
"
two
\ntwo\nthree\none\n" "
two
\ntwo\nthree\nand\none\n" ""
54
testing "grep -n
two
inputs" "grep -hn def - input" "2:def\n2:def\n" \
72
testing "grep -vo" "grep -vo one input" "
two
\nthree\n" "onetwoonethreeone\n" ""
81
echo -e "three\ntwo\none" > sub/
two
83
testing "grep -r file" "grep -r three sub/
two
" "three\n" "" ""
84
testing "grep -r dir" "grep -r one sub | sort" "sub/one:one\nsub/
two
:one\n" \
96
testing "grep -w '' 2" "grep -w '' input" "one
two
\n" "one
two
\n" "
[
all
...]
/external/v8/test/mjsunit/regress/
regress-4380.js
14
bar([, '
two
', 'three']);
/libcore/luni/src/test/java/libcore/java/lang/
OldAndroidInstanceofTest.java
58
InterfaceTwo
two
= mTwo;
local
60
assertFalse("m_two should not be a ChildOfAFive",
two
instanceof ChildOfAFive);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/refwrap/
weak_result.pass.cpp
50
struct
two
{char _; char __;};
struct in struct:has_result_type
51
template <class U> static
two
test(...);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/utility/forward/
forward.pass.cpp
23
struct
two
{one _[2];};
struct
28
two
test(const A&);
/packages/apps/ContactsCommon/tests/src/com/android/contacts/common/model/
RawContactTest.java
65
final RawContact
two
= buildRawContact2();
local
66
assertFalse(one.equals(
two
));
/prebuilts/go/darwin-x86/misc/cgo/test/
issue3775.go
20
// there are
two
levels of internal runtime lock
/prebuilts/go/darwin-x86/test/fixedbugs/
bug200.go
10
// 6g used to compile these as
two
different
/prebuilts/go/linux-x86/misc/cgo/test/
issue3775.go
20
// there are
two
levels of internal runtime lock
/prebuilts/go/linux-x86/test/fixedbugs/
bug200.go
10
// 6g used to compile these as
two
different
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
operand-err-1.s
15
; These
two
could be seen useful in extreme cases, but those
26
; These
two
are valid instructions, though not recognized by
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/mmix/
two-op-r.d
3
# source:
two
-op.s
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-discard/
extern.d
9
# this has
two
problems: 1) It does not include the name of the linker
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-mmix/
bpo-10.d
8
# Check that GC removes all (
two
) BPO:s when all are collected.
Completed in 328 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>