pike.git/src/pike_memory.h:1cbf48e9f209ab723f36b84f5f4a68ebb47e4d60

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 /*\ ||| This file a part of Pike, and is copyright by Fredrik Hubinette ||| Pike is distributed as GPL (General Public License) ||| See the files COPYING and DISCLAIMER for more information. \*/ /* * $Id: pike_memory.h,v 1.30 2001/10/03 18:18:51 mast Exp $ */ #ifndef MEMORY_H #define MEMORY_H #include "global.h" #include "stralloc.h" #define MEMSEARCH_LINKS 512 struct link { struct link *next; INT32 key; ptrdiff_t offset; }; enum methods { no_search, use_memchr, memchr_and_memcmp, hubbe_search, boyer_moore }; struct mem_searcher { enum methods method; char *needle; size_t needlelen; size_t hsize, max; struct link links[MEMSEARCH_LINKS]; struct link *set[MEMSEARCH_LINKS]; }; #if 1 /* use new searching stuff */ #include "pike_search.h" #else struct generic_mem_searcher { char needle_shift; char haystack_shift; union data_u { struct mem_searcher eightbit; struct other_search_s { enum methods method; void *needle; size_t needlelen; int first_char; } other; } data; }; #endif #include "block_alloc_h.h" #define MEMCHR0 MEMCHR /* Note to self: Prototypes must be updated manually /Hubbe */ PMOD_EXPORT ptrdiff_t pcharp_memcmp(PCHARP a, PCHARP b, int sz); PMOD_EXPORT long pcharp_strlen(PCHARP a); PMOD_EXPORT INLINE p_wchar1 *MEMCHR1(p_wchar1 *p, p_wchar2 c, ptrdiff_t e); PMOD_EXPORT INLINE p_wchar2 *MEMCHR2(p_wchar2 *p, p_wchar2 c, ptrdiff_t e); PMOD_EXPORT void swap(char *a, char *b, size_t size); PMOD_EXPORT void reverse(char *memory, size_t nitems, size_t size); PMOD_EXPORT void reorder(char *memory, INT32 nitems, INT32 size,INT32 *order); PMOD_EXPORT size_t hashmem(const unsigned char *a, size_t len, size_t mlen); PMOD_EXPORT size_t hashstr(const unsigned char *str, ptrdiff_t maxn); PMOD_EXPORT size_t simple_hashmem(const unsigned char *str, ptrdiff_t len, ptrdiff_t maxn); PMOD_EXPORT void init_memsearch(struct mem_searcher *s, char *needle, size_t needlelen, size_t max_haystacklen); PMOD_EXPORT char *memory_search(struct mem_searcher *s, char *haystack, size_t haystacklen); PMOD_EXPORT void init_generic_memsearcher(struct generic_mem_searcher *s, void *needle, size_t needlelen, char needle_shift, size_t estimated_haystack, char haystack_shift); PMOD_EXPORT void *generic_memory_search(struct generic_mem_searcher *s, void *haystack, size_t haystacklen, char haystack_shift); PMOD_EXPORT char *my_memmem(char *needle, size_t needlelen, char *haystack, size_t haystacklen); PMOD_EXPORT void memfill(char *to, INT32 tolen, char *from, INT32 fromlen, INT32 offset); PMOD_EXPORT void *debug_xalloc(size_t size); PMOD_EXPORT void *debug_xmalloc(size_t s); PMOD_EXPORT void debug_xfree(void *mem); PMOD_EXPORT void *debug_xrealloc(void *m, size_t s); PMOD_EXPORT void *debug_xcalloc(size_t n, size_t s); #undef BLOCK_ALLOC #ifdef HANDLES_UNALIGNED_MEMORY_ACCESS #define DO_IF_ELSE_UNALIGNED_MEMORY_ACCESS(IF, ELSE) IF #else /* !HANDLES_UNALIGNED_MEMORY_ACCESS */ #define DO_IF_ELSE_UNALIGNED_MEMORY_ACCESS(IF, ELSE) ELSE #endif /* HANDLES_UNALIGNED_MEMORY_ACCESS */ #if SIZEOF_CHAR_P == 4 #define DIVIDE_BY_2_CHAR_P(X) (X >>= 3) #else /* sizeof(char *) != 4 */ #if SIZEOF_CHAR_P == 8 #define DIVIDE_BY_2_CHAR_P(X) (X >>= 4) #else /* sizeof(char *) != 8 */ #define DIVIDE_BY_2_CHAR_P(X) (X /= 2*sizeof(size_t)) #endif /* sizeof(char *) == 8 */ #endif /* sizeof(char *) == 4 */ /* NB: RET should be an lvalue of type size_t. */ #define DO_HASHMEM(RET, A, LEN, MLEN) \ do { \ const unsigned char *a = A; \ size_t len = LEN; \ size_t mlen = MLEN; \ size_t ret; \ \ ret = 9248339*len; \ if(len<mlen) \ mlen=len; \ else \ { \ switch(len-mlen) \ { \ default: ret^=(ret<<6) + a[len-7]; \ case 7: \ case 6: ret^=(ret<<7) + a[len-5]; \ case 5: \ case 4: ret^=(ret<<4) + a[len-4]; \ case 3: ret^=(ret<<3) + a[len-3]; \ case 2: ret^=(ret<<3) + a[len-2]; \ case 1: ret^=(ret<<3) + a[len-1]; \ } \ } \ a += mlen & 7; \ switch(mlen&7) \ { \ case 7: ret^=a[-7]; \ case 6: ret^=(ret<<4)+a[-6]; \ case 5: ret^=(ret<<7)+a[-5]; \ case 4: ret^=(ret<<6)+a[-4]; \ case 3: ret^=(ret<<3)+a[-3]; \ case 2: ret^=(ret<<7)+a[-2]; \ case 1: ret^=(ret<<5)+a[-1]; \ } \ \ DO_IF_ELSE_UNALIGNED_MEMORY_ACCESS( \ { \ size_t *b; \ b=(size_t *)a; \ \ for(DIVIDE_BY_2_CHAR_P(mlen);mlen--;) \ { \ ret^=(ret<<7)+*(b++); \ ret^=(ret>>6)+*(b++); \ } \ } \ , \ for(mlen >>= 3; mlen--;) \ { \ register size_t t1; \ register size_t t2; \ t1= a[0]; \ t2= a[1]; \ t1=(t1<<5) + a[2]; \ t2=(t2<<4) + a[3]; \ t1=(t1<<7) + a[4]; \ t2=(t2<<5) + a[5]; \ t1=(t1<<3) + a[6]; \ t2=(t2<<4) + a[7]; \ a += 8; \ ret^=(ret<<7) + (ret>>6) + t1 + (t2<<6); \ } \ ) \ \ RET = ret; \ } while(0) #endif

pike.git/ src/ pike_memory.h > 1cbf48e9f209ab723f36b84f5f4a68ebb47e4d60 [Annotate]