// Copyright (c) 2014-2022, The Monero Project // // All rights reserved. // // Redistribution and use in source and binary forms, with or without modification, are // permitted provided that the following conditions are met: // // 1. Redistributions of source code must retain the above copyright notice, this list of // conditions and the following disclaimer. // // 2. Redistributions in binary form must reproduce the above copyright notice, this list // of conditions and the following disclaimer in the documentation and/or other // materials provided with the distribution. // // 3. Neither the name of the copyright holder nor the names of its contributors may be // used to endorse or promote products derived from this software without specific // prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers #include #include #include #include #include #include "gtest/gtest.h" // OS X, FreeBSD, and OpenBSD don't need malloc.h #if !defined(__APPLE__) && !defined(__FreeBSD__) && !defined(__OpenBSD__) && \ !defined(__DragonFly__) #include #endif //#define TEST_ORIGINAL //#define VERBOSE #ifdef TEST_ORIGINAL size_t slow_memmem_original(void* start_buff, size_t buflen,void* pat,size_t patlen) { void* buf = start_buff; void* end=(char*)buf+buflen-patlen; while((buf=memchr(buf,((char*)pat)[0],buflen))) { if(buf>end) return 0; if(memcmp(buf,pat,patlen)==0) return (char*)buf - (char*)start_buff; buf=(char*)buf+1; } return 0; } #define slow_memmem slow_memmem_original #else namespace cryptonote { size_t slow_memmem(const void* start_buff, size_t buflen,const void* pat,size_t patlen); } using namespace cryptonote; #endif static const struct { size_t buflen; const char *buf; size_t patlen; const char *pat; size_t res; } T[]={ {0,"",0,"",0}, {1,"",0,"",0}, {0,"",1,"",0}, {1,"x",1,"x",0}, {2,"x",1,"",1}, {1,"x",1,"",0}, {1,"x",2,"x",0}, {2,"ax",2,"x",0}, {1,"xx",2,"xx",0}, {4,"abcd",3,"abc",0}, {4,"abcd",3,"bcd",1}, {4,"abcd",4,"abcd",0}, {4,"abcd",1,"d",3}, {4,"abcd",1,"c",2}, {4,"abcd",1,"bc",1}, {4,"abcd",1,"",0}, {3,"abcd",1,"d",0}, {5,"aaaab",2,"ab",3}, {7,"aaaabab",2,"ab",3}, {7,"aaaabab",3,"abc",0}, {4,"abcd",2,"cd",2}, {3,"abcd",2,"cd",0}, {3,"a\0b",1,"",1}, {3,"a\0b",2,"\0b",1}, {8,"xxxxxxab",3,"xyz",0}, {8,"xxxxxxab",6,"abcdef",0}, {9,"\0xxxxxab",3,"ab",6}, {4,"\0\0a",3,"\0a",1}, // }; TEST(slowmem,Success) { size_t n; for (n=0;n