| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mach-o/ |
| subsect-via-symbols.s | 1 # just set subsections by symbols
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| elf-rel25.s | 5 .set noreorder
7 .set reorder
|
| macro-warn-4.s | 1 .set noreorder
2 .set nomacro
|
| mips-jalx-2.s | 5 .set mips16
8 .set nomips16
|
| ase-errors-2.s | 1 .set nomicromips
2 .set mips64r2
3 .set dsp # OK
7 .set mips64 # ERROR: too low
11 .set nodsp
16 .set mips64r2
17 .set dspr2 # OK
21 .set mips64 # ERROR: too low
25 .set nodspr2
30 .set mips64r
[all...] |
| ase-errors-1.s | 1 .set nomicromips
2 .set mips32r2
3 .set fp=64
4 .set dsp # OK
8 .set fp=32 # OK
9 .set mips32 # ERROR: too low
13 .set nodsp
18 .set mips32r2
19 .set fp=64
20 .set dspr2 # O
[all...] |
| mips16-intermix.s | 4 .set nomips16
10 .set noreorder
11 .set nomacro
16 .set macro
17 .set reorder
22 .set mips16
28 .set noreorder
29 .set nomacro
32 .set macro
33 .set reorde
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mmix/ |
| set.d | 8 4: c1394300 set \$57,\$67
9 8: c14e1f00 set \$78,\$31
11 10: c1754300 set \$117,\$67
12 14: c1751f00 set \$117,\$31
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-nios2/ |
| imm5_symbol.s | 4 .set imm5, 31
|
| /external/harfbuzz_ng/src/ |
| hb-set.h | 54 hb_set_reference (hb_set_t *set);
57 hb_set_destroy (hb_set_t *set);
60 hb_set_set_user_data (hb_set_t *set,
67 hb_set_get_user_data (hb_set_t *set,
73 hb_set_allocation_successful (const hb_set_t *set);
76 hb_set_clear (hb_set_t *set);
79 hb_set_is_empty (const hb_set_t *set);
82 hb_set_has (const hb_set_t *set,
88 hb_set_add (hb_set_t *set,
92 hb_set_add_range (hb_set_t *set,
[all...] |
| /external/llvm/test/MC/Mips/ |
| set-arch.s | 5 .set arch=mips1
7 .set arch=mips2
9 .set arch=mips3
11 .set arch=mips4
13 .set arch=mips5
15 .set arch=mips32
17 .set arch=mips32r2
19 .set arch=mips32
20 .set arch=mips32r3
22 .set arch=mips3
[all...] |
| set-mips0-directive.s | 7 .set mips32r6
9 .set mips0
12 .set mips3
14 .set mips0
19 # CHECK: .set mips32r6
21 # CHECK: .set mips0
24 # CHECK: .set mips3
26 # CHECK: .set mips0
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| flatset_test.cc | 31 // Returns true iff set has an entry for k.
33 bool Has(const NumSet& set, int64 k) {
34 auto iter = set.find(k);
35 if (iter == set.end()) {
36 EXPECT_EQ(set.count(k), 0);
39 EXPECT_EQ(set.count(k), 1);
45 // Return contents of set as a sorted list of numbers.
47 NumSetContents Contents(const NumSet& set) {
48 NumSetContents result(set.begin(), set.end())
61 NumSet set; local
71 NumSet set; local
88 NumSet set; local
98 NumSet set; local
120 NumSet set; local
129 NumSet set; local
138 NumSet set; local
152 NumSet set; local
161 NumSet set; local
175 NumSet set; local
187 NumSet set; local
204 NumSet set; local
227 NumSet set; local
237 NumSet set; local
341 NumSet set; local
360 const NumSet set = tmp; local
375 NumSet set; local
396 FlatSet<NA, HashNA> set; local
488 FlatSet<string> set; local
527 FlatSet<CustomCmpKey, HashA, EqA> set; local
546 UniqSet set; local
570 UniqSet set; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/psdk_inc/ |
| _fd_types.h | 38 #define FD_CLR(fd,set) \
41 for(__i = 0; __i < ((fd_set *)(set))->fd_count; __i++) { \
42 if (((fd_set *)(set))->fd_array[__i] == fd) { \
43 while (__i < ((fd_set *)(set))->fd_count - 1) { \
44 ((fd_set *)(set))->fd_array[__i] = \
45 ((fd_set *)(set))->fd_array[__i + 1]; \
48 ((fd_set *)(set))->fd_count--; \
56 #define FD_ZERO(set) (((fd_set *)(set))->fd_count = 0)
60 #define FD_ISSET(fd,set) __WSAFDIsSet((SOCKET)(fd),(fd_set *)(set)
[all...] |
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| ListIntSetTest.java | 24 ListIntSet set = new ListIntSet(); local
26 assertEquals(0, set.elements());
28 set.add(31);
29 set.add(0);
30 set.add(1);
32 assertTrue(set.has(0));
33 assertTrue(set.has(1));
34 assertTrue(set.has(31));
36 assertEquals(3, set.elements());
38 assertFalse(set.has(2))
44 ListIntSet set = new ListIntSet(); local
73 ListIntSet set = new ListIntSet(); local
81 ListIntSet set = new ListIntSet(); local
185 ListIntSet set = new ListIntSet(); local
[all...] |
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-mips-elf/ |
| mips16-intermix-2.s | 4 .set nomips16
10 .set noreorder
11 .set nomacro
16 .set macro
17 .set reorder
22 .set mips16
28 .set noreorder
29 .set nomacro
32 .set macro
33 .set reorde
[all...] |
| /external/libcxx/test/libcxx/containers/associative/set/ |
| version.pass.cpp | 10 // <set>
12 #include <set>
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| empty.fail.cpp | 11 // <set>
20 #include <set>
|
| /external/libogg/win32/VS6/ |
| build_ogg_dynamic.bat | 4 if .%SRCROOT%==. set SRCROOT=i:\xiph
6 set OLDPATH=%PATH%
7 set OLDINCLUDE=%INCLUDE%
8 set OLDLIB=%LIB%
12 set INCLUDE=%INCLUDE%;%SRCROOT%\ogg\include
16 set PATH=%OLDPATH%
17 set INCLUDE=%OLDINCLUDE%
18 set LIB=%OLDLIB%
|
| build_ogg_dynamic_debug.bat | 4 if .%SRCROOT%==. set SRCROOT=i:\xiph
6 set OLDPATH=%PATH%
7 set OLDINCLUDE=%INCLUDE%
8 set OLDLIB=%LIB%
12 set INCLUDE=%INCLUDE%;%SRCROOT%\ogg\include
16 set PATH=%OLDPATH%
17 set INCLUDE=%OLDINCLUDE%
18 set LIB=%OLDLIB%
|
| build_ogg_static.bat | 4 if .%SRCROOT%==. set SRCROOT=i:\xiph
6 set OLDPATH=%PATH%
7 set OLDINCLUDE=%INCLUDE%
8 set OLDLIB=%LIB%
12 set INCLUDE=%INCLUDE%;%SRCROOT%\ogg\include
16 set PATH=%OLDPATH%
17 set INCLUDE=%OLDINCLUDE%
18 set LIB=%OLDLIB%
|
| build_ogg_static_debug.bat | 4 if .%SRCROOT%==. set SRCROOT=i:\xiph
6 set OLDPATH=%PATH%
7 set OLDINCLUDE=%INCLUDE%
8 set OLDLIB=%LIB%
12 set INCLUDE=%INCLUDE%;%SRCROOT%\ogg\include
16 set PATH=%OLDPATH%
17 set INCLUDE=%OLDINCLUDE%
18 set LIB=%OLDLIB%
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| DenseSetTest.cpp | 21 // Test hashing with a set of only two entries.
23 llvm::DenseSet<unsigned> set(2);
24 set.insert(0);
25 set.insert(1);
27 EXPECT_EQ(0, set.count(2));
|
| /frameworks/base/core/java/android/util/ |
| SparseSetArray.java | 34 ArraySet<T> set = mData.get(n); local
35 if (set == null) {
36 set = new ArraySet<>();
37 mData.put(n, set);
39 if (set.contains(value)) {
42 set.add(value);
50 final ArraySet<T> set = mData.get(n); local
51 if (set == null) {
54 return set.contains(value);
62 final ArraySet<T> set = mData.get(n) local
88 final ArraySet<T> set = mData.valueAt(index); local
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/containers/associative/set/ |
| version.pass.cpp | 10 // <set>
12 #include <set>
|
