/external/llvm/lib/Fuzzer/test/ |
H A D | FullCoverageSetTest.cpp | 7 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 9 if (Size > 0 && Data[0] == 'F') bits |= 1; 10 if (Size > 1 && Data[1] == 'U') bits |= 2; 11 if (Size > 2 && Data[2] == 'Z') bits |= 4; 12 if (Size > 3 && Data[3] == 'Z') bits |= 8; 13 if (Size > 4 && Data[4] == 'E') bits |= 16; 14 if (Size > 5 && Data[5] == 'R') bits |= 32;
|
H A D | TimeoutTest.cpp | 9 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 10 if (Size > 0 && Data[0] == 'H') { 12 if (Size > 1 && Data[1] == 'i') { 14 if (Size > 2 && Data[2] == '!') {
|
H A D | StrncmpTest.cpp | 9 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 12 if (Size >= 8 && strncmp(S, "123", 8)) 14 if (Size >= 8 && strncmp(S, "01234567", 8) == 0) { 15 if (Size >= 12 && strncmp(S + 8, "ABCD", 4) == 0) { 16 if (Size >= 14 && strncmp(S + 12, "XY", 2) == 0) { 17 if (Size >= 16 && strncmp(S + 14, "KLM", 3) == 0) {
|
H A D | StrcmpTest.cpp | 8 bool Eq(const uint8_t *Data, size_t Size, const char *Str) { argument 11 if (Size < Len) return false; 19 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 20 if (Eq(Data, Size, "AAA") && 21 Size >= 3 && Eq(Data + 3, Size - 3, "BBBB") && 22 Size >= 7 && Eq(Data + 7, Size - 7, "CCCCCC") && 23 Size >= 14 && Data[13] == 42
|
H A D | FourIndependentBranchesTest.cpp | 7 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 9 if (Size > 0 && Data[0] == 'F') bits |= 1; 10 if (Size > 1 && Data[1] == 'U') bits |= 2; 11 if (Size > 2 && Data[2] == 'Z') bits |= 4; 12 if (Size > 3 && Data[3] == 'Z') bits |= 8;
|
H A D | MemcmpTest.cpp | 7 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 9 if (Size >= 8 && memcmp(Data, "01234567", 8) == 0) { 10 if (Size >= 12 && memcmp(Data + 8, "ABCD", 4) == 0) { 11 if (Size >= 14 && memcmp(Data + 12, "XY", 2) == 0) { 12 if (Size >= 16 && memcmp(Data + 14, "KLM", 3) == 0) {
|
H A D | NullDerefTest.cpp | 10 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 11 if (Size > 0 && Data[0] == 'H') { 13 if (Size > 1 && Data[1] == 'i') { 15 if (Size > 2 && Data[2] == '!') {
|
H A D | SimpleTest.cpp | 10 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 12 if (Size > 0 && Data[0] == 'H') { 14 if (Size > 1 && Data[1] == 'i') { 16 if (Size > 2 && Data[2] == '!') {
|
H A D | UninstrumentedTest.cpp | 5 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument
|
H A D | SwitchTest.cpp | 11 bool Switch(const uint8_t *Data, size_t Size) { argument 13 if (Size < sizeof(X)) return false; 28 bool ShortSwitch(const uint8_t *Data, size_t Size) { argument 30 if (Size < sizeof(short)) return false; 45 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 46 if (Size >= 4 && Switch<int>(Data, Size) && 47 Size >= 12 && Switch<uint64_t>(Data + 4, Size - 4) && 48 Size > [all...] |
H A D | SimpleCmpTest.cpp | 7 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 8 if (Size < 14) return 0; 14 memcpy(&y, Data + Size - 8, 8); 15 memcpy(&z, Data + Size / 2, sizeof(z)); 16 memcpy(&a, Data + Size / 2 + 4, sizeof(a)); 27 Size, x, y, z, a);
|
H A D | SimpleHashTest.cpp | 12 static uint32_t simple_hash(const uint8_t *Data, size_t Size) { argument 14 for (uint32_t i = 0; i < Size; i++) { 25 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 26 if (Size < 14) 29 uint32_t Hash = simple_hash(&Data[0], Size - 4); 30 uint32_t Want = reinterpret_cast<const uint32_t *>(&Data[Size - 4])[0];
|
H A D | CounterTest.cpp | 5 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { argument 7 for (size_t i = 0; i < Size; i++)
|
H A D | UserSuppliedFuzzerTest.cpp | 19 int TargetFunction(const uint8_t *Data, size_t Size) { argument 20 if (Size <= 10) return 0; 35 virtual size_t Mutate(uint8_t *Data, size_t Size, size_t MaxSize) { argument 37 if (Size < sizeof(kMagic)) 38 Size = sizeof(kMagic); 42 Data + sizeof(kMagic), Size - sizeof(kMagic), MaxSize - sizeof(kMagic));
|
/external/clang/test/Sema/ |
H A D | offsetof-64.c | 5 const unsigned long Size = (1l << 60); variable 8 char padding[Size]; 9 char more_padding[1][Size]; 16 char padding[Size][Size][Size]; // expected-error 2{{array is too large}}
|
/external/llvm/lib/Support/ |
H A D | LEB128.cpp | 21 unsigned Size = 0; local 24 Size += sizeof(int8_t); 26 return Size; 31 unsigned Size = 0; local 39 Size += sizeof(int8_t); 41 return Size;
|
H A D | raw_os_ostream.cpp | 26 void raw_os_ostream::write_impl(const char *Ptr, size_t Size) { argument 27 OS.write(Ptr, Size);
|
H A D | circular_raw_ostream.cpp | 18 void circular_raw_ostream::write_impl(const char *Ptr, size_t Size) { argument 20 TheStream->write(Ptr, Size); 25 while (Size != 0) { 27 std::min(unsigned(Size), unsigned(BufferSize - (Cur - BufferArray))); 29 Size -= Bytes;
|
H A D | FormattedStream.cpp | 24 static void UpdatePosition(std::pair<unsigned, unsigned> &Position, const char *Ptr, size_t Size) { argument 30 for (const char *End = Ptr + Size; Ptr != End; ++Ptr) { 48 void formatted_raw_ostream::ComputePosition(const char *Ptr, size_t Size) { argument 52 if (Ptr <= Scanned && Scanned <= Ptr + Size) 55 UpdatePosition(Position, Scanned, Size - (Scanned - Ptr)); 57 UpdatePosition(Position, Ptr, Size); 60 Scanned = Ptr + Size; 76 void formatted_raw_ostream::write_impl(const char *Ptr, size_t Size) { argument 78 ComputePosition(Ptr, Size); 82 TheStream->write(Ptr, Size); [all...] |
/external/deqp/framework/delibs/decpp/ |
H A D | deArrayUtil.hpp | 33 template <int LastElementIndex, int Size, typename Elem> 34 const Elem& getSizedArrayElement (const Elem (&array)[Size], typename de::meta::EnableIf<int, LastElementIndex==Size>::Type offset) 36 DE_ASSERT(inBounds(offset, 0, Size)); 41 template <int Size, typename Elem> 42 const Elem& getArrayElement (const Elem (&array)[Size], int offset) 44 DE_ASSERT(inBounds(offset, 0, Size));
|
/external/deqp/framework/common/ |
H A D | tcuVector.hpp | 36 template <typename T, int VecSize, int Size> 44 VecAccess& operator= (const Vector<T, Size>& v); 46 operator Vector<T, Size> (void) const; 50 int m_index[Size]; 53 template <typename T, int VecSize, int Size> 54 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y) 57 DE_STATIC_ASSERT(Size == 2); 62 template <typename T, int VecSize, int Size> 63 VecAccess<T, VecSize, Size>::VecAccess (Vector<T, VecSize>& v, int x, int y, int z) 66 DE_STATIC_ASSERT(Size [all...] |
H A D | tcuArray.hpp | 34 template <typename T, int Size> 48 T m_data[Size]; 52 template <typename T, int Size> 53 std::ostream& operator<< (std::ostream& stream, const Array<T, Size>& arr) 55 return stream << Format::Array<T*>(arr.getPtr(), arr.getPtr() + Size);
|
/external/clang/test/SemaCXX/ |
H A D | dependent-types.cpp | 5 template<typename T, int Size> void f() { 10 T x5[Size]; 11 int x6[Size];
|
/external/lzma/CPP/7zip/Common/ |
H A D | UniqBlocks.h | 22 if (Bufs.Size() == 0)
24 if (Bufs.Size() > 1)
26 return Bufs[0].Size() == 0;
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | VectorBlock.h | 54 template<int Size> 55 inline VectorBlock<Derived,Size> 59 return VectorBlock<Derived,Size>(derived(), 0); 64 template<int Size> 65 inline const VectorBlock<const Derived,Size> 69 return VectorBlock<const Derived,Size>(derived(), 0); 74 template<int Size> 75 inline VectorBlock<Derived,Size> 79 return VectorBlock<Derived, Size>(derived(), size() - Size); [all...] |