/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_linalg.h | 260 int back; local 261 back=0; 263 back+=(*f++)*(*g++); 265 return(back); 273 int back; local 274 back=0; 275 back+=(*f++)*(*g++); back+=(*f++)*(*g++); back+=(*f++)*(*g++); back+=(*f++)*(*g++); back+=(*f++)*(*g++) 295 int back; local 600 float back; local [all...] |
/cts/tests/tests/renderscript/src/android/renderscript/cts/refocus/ |
LayerInfo.java | 32 LayerInfo(int front, int back) { 34 backDepth = back;
|
/frameworks/rs/tests/java_api/Refocus/src/com/android/rs/test/ |
LayerInfo.java | 16 LayerInfo(int front, int back) { 18 backDepth = back;
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
ldrd-unpredictable.l | 4 [^:]*:8: Warning: source register same as write-back base 5 [^:]*:9: Warning: base register written back, and overlaps second transfer register 6 [^:]*:13: Warning: source register same as write-back base 7 [^:]*:14: Warning: base register written back, and overlaps second transfer register
|
thumb2_ldstd_unpredictable.l | 2 [^:]*:5: Warning: base register written back, and overlaps one of transfer registers 3 [^:]*:6: Warning: base register written back, and overlaps one of transfer registers 4 [^:]*:7: Warning: base register written back, and overlaps one of transfer registers 5 [^:]*:8: Warning: base register written back, and overlaps one of transfer registers 6 [^:]*:10: Warning: base register written back, and overlaps one of transfer registers 7 [^:]*:11: Warning: base register written back, and overlaps one of transfer registers 8 [^:]*:12: Warning: base register written back, and overlaps one of transfer registers 9 [^:]*:13: Warning: base register written back, and overlaps one of transfer registers
|
/external/slf4j/log4j-over-slf4j/src/test/java/org/apache/log4j/ |
NDCTest.java | 44 String back = NDC.pop(); local 45 assertEquals("a", back); 50 String back = NDC.peek(); local 51 assertEquals("peek", back);
|
/external/icu/icu4c/source/layoutex/ |
LXUtilities.cpp | 79 le_int32 front, back; local 81 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) { 84 array[front] = array[back]; 85 array[back] = swap; 91 le_int32 front, back; local 93 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
DebugLocStream.cpp | 17 if (Lists.back().EntryOffset == Entries.size()) { 24 Lists.back().Label = Asm.createTempSymbol("debug_loc"); 29 if (Entries.back().ByteOffset != DWARFBytes.size()) 33 Comments.erase(Comments.begin() + Entries.back().CommentOffset, 37 assert(Lists.back().EntryOffset <= Entries.size() &&
|
/external/swiftshader/third_party/LLVM/unittests/ADT/ |
ilistTest.cpp | 29 EXPECT_EQ(1, List.back().Value); 30 EXPECT_EQ(0, List.back().getPrevNode()); 31 EXPECT_EQ(0, List.back().getNextNode()); 34 EXPECT_EQ(2, List.back().Value); 36 EXPECT_EQ(1, List.back().getPrevNode()->Value); 39 EXPECT_EQ(2, ConstList.back().Value); 41 EXPECT_EQ(1, ConstList.back().getPrevNode()->Value);
|
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
Optimum.java | 42 void set1(int newPrice, int optCur, int back) { 45 backPrev = back; 52 void set2(int newPrice, int optCur, int back) { 55 backPrev = back; 64 void set3(int newPrice, int optCur, int back2, int len2, int back) { 67 backPrev = back;
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
push.pass.cpp | 23 assert(q.back() == 1); 27 assert(q.back() == 2); 31 assert(q.back() == 3);
|
emplace.pass.cpp | 31 assert(&r1 == &q.back()); 33 assert(&r2 == &q.back()); 35 assert(&r3 == &q.back()); 45 assert(q.back() == Emplaceable(3, 4.5));
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
push.pass.cpp | 23 assert(q.back() == 1); 27 assert(q.back() == 2); 31 assert(q.back() == 3);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.defn/ |
push.pass.cpp | 23 assert(q.back() == 1); 27 assert(q.back() == 2); 31 assert(q.back() == 3);
|
/external/libcxx/test/libcxx/containers/sequences/vector/ |
db_back.pass.cpp | 12 // Call back() on empty container. 32 assert(c.back() == 0); 34 assert(c.back() == 0); 42 assert(c.back() == 0); 44 assert(c.back() == 0);
|
/external/libcxx/test/std/strings/basic.string/string.access/ |
db_back.pass.cpp | 12 // Call back() on empty container. 31 assert(s.back() == 0); 33 assert(s.back() == 0); 40 assert(s.back() == 0); 42 assert(s.back() == 0);
|
back.pass.cpp | 12 // const charT& back() const; 13 // charT& back(); 29 assert(&cs.back() == &cs[cs.size()-1]); 30 assert(&s.back() == &s[cs.size()-1]); 31 s.back() = typename S::value_type('z'); 32 assert(s.back() == typename S::value_type('z')); 52 char c = s.back();
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/ |
db_back.pass.cpp | 12 // Call back() on empty container. 32 assert(c.back() == 0); 34 assert(c.back() == 0); 42 assert(c.back() == 0); 44 assert(c.back() == 0);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/ |
db_back.pass.cpp | 12 // Call back() on empty container. 32 assert(c.back() == 0); 34 assert(c.back() == 0); 42 assert(c.back() == 0); 44 assert(c.back() == 0);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.access/ |
db_back.pass.cpp | 12 // Call back() on empty container. 31 assert(s.back() == 0); 33 assert(s.back() == 0); 40 assert(s.back() == 0); 42 assert(s.back() == 0);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/containers/sequences/vector/ |
db_back.pass.cpp | 12 // Call back() on empty container. 32 assert(c.back() == 0); 34 assert(c.back() == 0); 42 assert(c.back() == 0); 44 assert(c.back() == 0);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/ |
db_back.pass.cpp | 12 // Call back() on empty container. 32 assert(c.back() == 0); 34 assert(c.back() == 0); 42 assert(c.back() == 0); 44 assert(c.back() == 0);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.access/ |
db_back.pass.cpp | 12 // Call back() on empty container. 31 assert(s.back() == 0); 33 assert(s.back() == 0); 40 assert(s.back() == 0); 42 assert(s.back() == 0);
|
/external/jline/src/src/test/java/jline/ |
TestEditLine.java | 107 b = b.left().right().back(); 109 b = b.left().left().left().right().left().back(); 118 assertBuffer("This is a est", b = b.back()); 119 assertBuffer("This is aest", b = b.back()); 120 assertBuffer("This is est", b = b.back()); 121 assertBuffer("This isest", b = b.back()); 122 assertBuffer("This iest", b = b.back()); 123 assertBuffer("This est", b = b.back()); 124 assertBuffer("Thisest", b = b.back()); 125 assertBuffer("Thiest", b = b.back()); [all...] |
/external/skia/gm/ |
convexpaths.cpp | 54 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, 56 fPaths.back().lineTo(0, 0); 59 fPaths.back().quadTo(50 * SK_Scalar1, 0, 61 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, 104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0); 107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide); 110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength); 113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide); 118 fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1); 119 fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1) [all...] |