├── .gitignore ├── Makefile ├── README.md ├── Symbolicator.h ├── Symbolicator.mm ├── Symbolicator.plist ├── Tweak.xm ├── layout ├── DEBIAN │ └── control └── Library │ └── PreferenceLoader │ └── Preferences │ └── Symbolicator.plist ├── theos ├── utarray.h ├── uthash.h ├── utlist.h └── utstring.h /.gitignore: -------------------------------------------------------------------------------- 1 | theos 2 | .theos 3 | *.deb 4 | 5 | Package/DEBIAN/control 6 | 7 | Package/Library/MobileSubstrate/DynamicLibraries/Symbolicator.dylib 8 | 9 | Package/Library/MobileSubstrate/DynamicLibraries/Symbolicator.plist 10 | 11 | PackageVersion.plist 12 | 13 | Symbolicator-Prefix.pch 14 | 15 | Tweak.mm 16 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | TARGET = iphone:7.1:2.0 2 | ARCHS = arm64 armv7 3 | CFLAGS = -Wno-error 4 | GO_EASY_ON_ME = 1 5 | 6 | include theos/makefiles/common.mk 7 | 8 | TWEAK_NAME = Symbolicator 9 | Symbolicator_FILES = Tweak.xm Symbolicator.mm 10 | Symbolicator_PRIVATE_FRAMEWORKS = Symbolication 11 | 12 | include $(THEOS_MAKE_PATH)/tweak.mk 13 | 14 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | Symbolicator 2 | ============ 3 | 4 | Now supports both ARM64 and ARM7! 5 | 6 | Symbolicator for iOS 6 and iOS 7 - it's a Cydia Substrate library that reveals "<redacted>" symbol names at runtime in calls made to +[NSThread callStackSymbols] or -[NSException callStackSymbols], by making use of Symbolicator.framework and the ObjC runtime 7 | 8 | Useful when debugging without the need to crash the application, or when reverse engineering some application or framework. This was the usual in iOS 5 and older, but starting in iOS 6 all of their frameworks symbols are hidden (which you can later symbolicate in XCode with a CrashReport, but this is not possible to do at runtime), probably due to the different format found on dyld_shared_cache 9 | 10 | ### Installing ###### 11 | 12 | You require theos to compile the sources, or you can skip that step and just install a precompiled binary from this deb package: 13 | 14 | http://eric.cast.ro/debs/ro.cast.eric.Symbolicator_0.0.1-1_iphoneos-arm.deb 15 | 16 | The included filter plist hooks into SpringBoard only - you can manually modify it to suit your needs but... (read below) 17 | 18 | ### Important ###### 19 | **Do NOT inject this library into all processes**. Choose the ones you will work with in your filter plist, because current version also uses the ObjC runtime to load all class and method names and while optimized, it is still very expensive. If you load it in every process, system will be likely to crash. 20 | 21 | Before: 22 | ============ 23 | ![Before](http://i.imgur.com/ZwDPXU0.png) 24 | 25 | After: 26 | ============ 27 | ![After](http://i.imgur.com/6Tnhorv.png) 28 | -------------------------------------------------------------------------------- /Symbolicator.h: -------------------------------------------------------------------------------- 1 | // 2 | // Symbolicator.h 3 | // Symbolicator 4 | // 5 | // Created by Eric Castro on 13/02/13. 6 | // 7 | // 8 | 9 | #import 10 | #import 11 | 12 | #include "uthash.h" 13 | 14 | struct MethodEntry { 15 | int imp; /* we'll use this field as the key */ 16 | char name[192]; 17 | UT_hash_handle hh; /* makes this structure hashable */ 18 | }; 19 | 20 | @class CPDistributedMessagingCenter; 21 | 22 | @interface Symbolicator : NSObject 23 | { 24 | VMUSymbolicator *_symbolicator; 25 | VMUProcessDescription *_processInfo; 26 | VMUMachTaskContainer *_machContainer; 27 | 28 | struct MethodEntry *_methodList; 29 | 30 | unsigned int _maxAddress; 31 | unsigned int _minAddress; 32 | 33 | } 34 | 35 | - (NSDictionary *)symbolicateAddresses:(NSArray *)addresses; 36 | - (NSString *)findMethod:(NSNumber *)address slide:(unsigned)slide; 37 | - (unsigned)slideForAddress:(unsigned long long)address; 38 | 39 | @end 40 | 41 | @interface SCCallStackArray : NSArray 42 | { 43 | NSMutableArray *_descriptions; 44 | } 45 | 46 | + (id)arrayWithCallStack:(NSArray *)array; 47 | - (id)initWithCallStack:(NSArray *)array; 48 | - (void)loadSymbols:(NSDictionary *)symbols; 49 | 50 | @end -------------------------------------------------------------------------------- /Symbolicator.mm: -------------------------------------------------------------------------------- 1 | // 2 | // Symbolicator.m 3 | // Symbolicator 4 | // 5 | // Created by Eric Castro on 13/02/13. 6 | // 7 | // 8 | 9 | #include 10 | #include 11 | #include 12 | 13 | #import "Symbolicator.h" 14 | 15 | #ifdef __arm64__ 16 | #define ADDRESS_FORMAT "0x%016lx" 17 | #else 18 | #define ADDRESS_FORMAT "0x%08x" 19 | #endif 20 | 21 | MethodEntry *createMethodEntry(NSUInteger imp, const char *className,const char *methodName, BOOL isClassMethod) 22 | { 23 | MethodEntry *entry = (MethodEntry *)malloc(sizeof(MethodEntry)); 24 | entry->imp = imp; 25 | entry->name[0] = NO ? '+' : '-'; 26 | entry->name[1] = '['; 27 | strcpy(entry->name+2,className); 28 | entry->name[strlen(className)+2] = ' '; 29 | strcpy(entry->name+strlen(className)+3,methodName); 30 | strcpy(entry->name+strlen(className)+strlen(methodName)+3,"]"); 31 | 32 | return entry; 33 | } 34 | 35 | @implementation Symbolicator 36 | 37 | - (id)init 38 | { 39 | self = [super init]; 40 | if (self) { 41 | 42 | _symbolicator = [[VMUSymbolicator symbolicatorForTask:mach_task_self()] retain]; 43 | _processInfo = [[VMUProcessDescription alloc] initWithPid:0 orTask:mach_task_self()]; 44 | _machContainer = [[VMUMachTaskContainer machTaskContainerWithTask:mach_task_self()] retain]; 45 | 46 | //dispatch_async(dispatch_get_global_queue( DISPATCH_QUEUE_PRIORITY_DEFAULT, 0), ^{ 47 | [self load]; 48 | //}); 49 | 50 | } 51 | return self; 52 | } 53 | 54 | - (void) load 55 | { 56 | NSLog(@"Symbolicator: Loading all methods addresses from objc runtime"); 57 | 58 | unsigned int numClasses; 59 | unsigned int numInstanceMethods; 60 | unsigned int numClassMethods; 61 | Class * classes = NULL; 62 | Method * instanceMethods = NULL; 63 | Method * classMethods = NULL; 64 | 65 | classes = NULL; 66 | char className[128]; 67 | numClasses = objc_getClassList(NULL, 0); 68 | 69 | NSUInteger imp; 70 | 71 | _maxAddress = 0; 72 | _minAddress = 2^32; 73 | 74 | timeval time1, time2; 75 | gettimeofday(&time1, NULL); 76 | long millis1 = (time1.tv_sec * 1000) + (time1.tv_usec / 1000); 77 | 78 | MethodEntry *entry; 79 | if (numClasses > 0) 80 | { 81 | classes = (Class *)malloc(sizeof(Class) * numClasses); 82 | numClasses = objc_getClassList(classes, numClasses); 83 | 84 | for (int i=0;i _maxAddress) _maxAddress = imp; 96 | if (imp < _minAddress) _minAddress = imp; 97 | } 98 | 99 | for (int j=0; j _maxAddress) _maxAddress = imp; 106 | if (imp < _minAddress) _minAddress = imp; 107 | } 108 | 109 | free(classMethods); 110 | free(instanceMethods); 111 | } 112 | 113 | free(classes); 114 | } 115 | 116 | gettimeofday(&time2, NULL); 117 | long millis2 = (time2.tv_sec * 1000) + (time2.tv_usec / 1000); 118 | 119 | NSLog(@"Symbolicator: All addresses loaded and sorted %ld milliseconds",millis2-millis1); 120 | 121 | } 122 | 123 | - (NSDictionary *)symbolicateAddresses:(NSArray *)addresses 124 | { 125 | NSMutableDictionary *response = [NSMutableDictionary dictionaryWithCapacity:addresses.count]; 126 | 127 | NSString *hexAddress; 128 | 129 | NSString *methodName; 130 | NSUInteger longLongAddress; 131 | 132 | // Try to get the symbols for all requested addresses 133 | for (NSNumber *address in addresses) 134 | { 135 | longLongAddress = [address unsignedIntegerValue]; 136 | hexAddress = [NSString stringWithFormat:@""ADDRESS_FORMAT,longLongAddress]; 137 | 138 | 139 | methodName = [self findMethod:address slide:[self slideForAddress:longLongAddress]]; 140 | if (methodName) 141 | { 142 | response[hexAddress] = methodName; 143 | continue; 144 | } 145 | 146 | VMUSymbol *symbol = [_symbolicator symbolForAddress:longLongAddress]; 147 | 148 | if ([symbol name]) 149 | response[hexAddress] = [symbol name]; 150 | 151 | } 152 | 153 | return response; 154 | } 155 | 156 | - (NSString *)findMethod:(NSNumber *)address slide:(NSUInteger)slide 157 | { 158 | NSUInteger newAddress = [address unsignedIntegerValue]; 159 | unsigned searchCount = 0; 160 | 161 | struct MethodEntry *entry; 162 | 163 | do { 164 | 165 | entry = NULL; 166 | HASH_FIND_INT( _methodList, &newAddress, entry ); 167 | 168 | if (entry) 169 | return [NSString stringWithFormat:@"("ADDRESS_FORMAT"): %s", newAddress-slide-1, entry->name]; 170 | 171 | searchCount++; 172 | 173 | 174 | if (searchCount > 8096) 175 | return [NSString stringWithFormat:@"("ADDRESS_FORMAT"): ", [address unsignedIntegerValue]-slide-1]; 176 | 177 | newAddress = newAddress-1; 178 | 179 | } while (newAddress!=_minAddress); 180 | 181 | return nil; 182 | } 183 | 184 | - (NSUInteger)slideForAddress:(NSUInteger)address 185 | { 186 | VMUMemory_NonContiguousTask *memory; 187 | VMUMachOHeader *header; 188 | VMURange range; 189 | NSUInteger textStart; 190 | 191 | for (NSDictionary *image in _processInfo.binaryImages) 192 | { 193 | range.location = [image[@"StartAddress"] unsignedIntegerValue]; 194 | range.length = [image[@"Size"] unsignedIntegerValue]; 195 | 196 | if (address >= range.location && 197 | address <= range.location+range.length) 198 | { 199 | memory = [VMUMemory_NonContiguousTask memoryWithMachTaskContainer:_machContainer addressRange:range architecture:[VMUArchitecture currentArchitecture]]; 200 | header = [VMUMachOHeader headerWithMemory:memory address:range.location name:image[@"Identifier"] path:image[@"ExecutablePath"] timestamp:[NSDate date]]; 201 | textStart = [[header segmentNamed:@"__TEXT"] vmaddr]; 202 | 203 | return range.location-textStart; 204 | } 205 | } 206 | return 0; 207 | } 208 | 209 | 210 | 211 | @end 212 | 213 | // Replacement for _NSCallStackArray - imitates the exact same output when printed with NSLog 214 | 215 | @implementation SCCallStackArray 216 | 217 | + (id)arrayWithCallStack:(NSArray *)array 218 | { 219 | return [[[SCCallStackArray alloc] initWithCallStack:array] autorelease]; 220 | } 221 | 222 | - (id)initWithCallStack:(NSArray *)array 223 | { 224 | self = [super init]; 225 | if (self) { 226 | _descriptions = [[NSMutableArray alloc] initWithCapacity:[array count]]; 227 | 228 | NSString *pos, *nextpos; 229 | 230 | for (int i=0;i<[array count];i++) //fugly stuff - must eliminate first line (that's Symbolicator's call you don't need) and preserve the numbers with the correct spacing 231 | { 232 | // pos = [array[i] componentsSeparatedByString:@" "][0]; 233 | // nextpos = [array[i+1] componentsSeparatedByString:@" "][0]; 234 | // _descriptions[i] = [NSString stringWithFormat:@"%@ %@",pos,[array[i+1] substringFromIndex:[nextpos length]]]; 235 | 236 | _descriptions[i] = array[i]; 237 | } 238 | } 239 | 240 | return self; 241 | } 242 | 243 | - (NSUInteger)count 244 | { 245 | return [_descriptions count]; 246 | } 247 | 248 | - (id)objectAtIndex:(NSUInteger)index 249 | { 250 | return _descriptions[index]; 251 | } 252 | 253 | - (id)descriptionWithLocale:(id)locale indent:(NSUInteger)level 254 | { 255 | NSString *indentation = [@"" stringByPaddingToLength:level withString:@" " startingAtIndex:0]; 256 | 257 | NSMutableString *output = [NSMutableString stringWithCapacity:4096]; 258 | [output appendString:indentation]; 259 | [output appendString:@"(\n"]; 260 | for (NSString *line in _descriptions) 261 | [output appendFormat:@"%@\t%@\n",indentation,line]; 262 | [output appendString:indentation]; 263 | [output appendString:@")"]; 264 | return [NSString stringWithString:output]; 265 | } 266 | 267 | 268 | - (void) loadSymbols:(NSDictionary *)symbols // Replace all strings with actual symbol names 269 | { 270 | for (int i=0;i<[_descriptions count];i++) 271 | for (NSString *hexAddress in [symbols allKeys]) 272 | _descriptions[i] = [[_descriptions[i] stringByReplacingOccurrencesOfString:[NSString stringWithFormat:@"%@",hexAddress] withString:[NSString stringWithFormat:@"%@ %@",hexAddress,symbols[hexAddress]]] stringByReplacingOccurrencesOfString:@"" withString:@""]; 273 | } 274 | 275 | - (void)dealloc 276 | { 277 | [_descriptions release]; 278 | [super dealloc]; 279 | } 280 | 281 | @end 282 | -------------------------------------------------------------------------------- /Symbolicator.plist: -------------------------------------------------------------------------------- 1 | { 2 | Filter = { 3 | Bundles = ( 4 | "com.apple.UIKit", 5 | ); 6 | }; 7 | } -------------------------------------------------------------------------------- /Tweak.xm: -------------------------------------------------------------------------------- 1 | // 2 | // Tweak.xm 3 | // Symbolicator 4 | // 5 | // Created by Eric Castro on 13/02/13. 6 | // 7 | // 8 | 9 | #import "Symbolicator.h" 10 | 11 | static NSString *preferenceFilePath = @"/private/var/mobile/Library/Preferences/ro.cast.eric.Symbolicator.plist"; 12 | static Symbolicator *theSymbolicator = nil; 13 | 14 | %hook NSThread 15 | 16 | + (NSArray *) callStackSymbols 17 | { 18 | NSArray *addresses = [NSThread callStackReturnAddresses]; 19 | 20 | NSDictionary *symbols = [theSymbolicator symbolicateAddresses:addresses]; // where the magic happens 21 | SCCallStackArray *callStackSymbols = [SCCallStackArray arrayWithCallStack:%orig]; 22 | [callStackSymbols loadSymbols:symbols]; 23 | 24 | return callStackSymbols; 25 | } 26 | 27 | %end 28 | 29 | %hook NSException 30 | 31 | - (NSArray *) callStackSymbols 32 | { 33 | NSArray *addresses = [self callStackReturnAddresses]; 34 | 35 | NSDictionary *symbols = [theSymbolicator symbolicateAddresses:addresses]; // where the magic happens 36 | SCCallStackArray *callStackSymbols = [SCCallStackArray arrayWithCallStack:%orig]; 37 | [callStackSymbols loadSymbols:symbols]; 38 | 39 | return callStackSymbols; 40 | } 41 | 42 | %end 43 | 44 | %ctor 45 | { 46 | @autoreleasepool 47 | { 48 | 49 | // Load preferences 50 | NSMutableDictionary *preferences = [[NSMutableDictionary alloc] initWithContentsOfFile:preferenceFilePath]; 51 | // Only inject into Apps the user has selected in the settings panel 52 | NSString *appId = [[NSBundle mainBundle] bundleIdentifier]; 53 | id shouldHook = [preferences objectForKey:appId]; 54 | [preferences release]; 55 | 56 | if ((shouldHook == nil) || (![shouldHook boolValue])) 57 | { 58 | // Don't load Symbolicator 59 | } 60 | else 61 | { 62 | NSLog(@"Symbolicator loaded"); 63 | theSymbolicator = [[Symbolicator alloc] init]; 64 | } 65 | } 66 | } 67 | -------------------------------------------------------------------------------- /layout/DEBIAN/control: -------------------------------------------------------------------------------- 1 | Package: ro.cast.eric.Symbolicator 2 | Name: Symbolicator 3 | Depends: mobilesubstrate, preferenceloader, applist 4 | Version: 0.0.1 5 | Architecture: iphoneos-arm 6 | Description: An awesome MobileSubstrate tweak! 7 | Maintainer: Eric Castro 8 | Author: Eric Castro 9 | Section: Tweaks 10 | -------------------------------------------------------------------------------- /layout/Library/PreferenceLoader/Preferences/Symbolicator.plist: -------------------------------------------------------------------------------- 1 | { 2 | entry = { 3 | bundle = AppList; 4 | cell = PSLinkCell; 5 | isController = 1; 6 | label = Symbolicator; 7 | ALSettingsPath = "/var/mobile/Library/Preferences/ro.cast.eric.Symbolicator.plist"; 8 | ALSettingsKeyPrefix = ""; 9 | ALChangeNotification = "ro.cast.eric.Symbolicator"; 10 | ALAllowsSelection = 1; 11 | ALSectionDescriptors = ( 12 | { 13 | title = "System Applications"; 14 | predicate = "isSystemApplication = TRUE"; 15 | "cell-class-name" = ALSwitchCell; 16 | "icon-size" = 29; 17 | "suppress-hidden-apps" = 1; 18 | }, 19 | { 20 | title = "User Applications"; 21 | predicate = "isSystemApplication = FALSE"; 22 | "cell-class-name" = ALSwitchCell; 23 | "icon-size" = 29; 24 | "suppress-hidden-apps" = 1; 25 | }, 26 | ); 27 | }; 28 | } -------------------------------------------------------------------------------- /theos: -------------------------------------------------------------------------------- 1 | /Users/nabla/theos-rpetrich/ -------------------------------------------------------------------------------- /utarray.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2008-2013, Troy D. Hanson http://troydhanson.github.com/uthash/ 3 | All rights reserved. 4 | 5 | Redistribution and use in source and binary forms, with or without 6 | modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | 11 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 12 | IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 13 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 14 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 15 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 16 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 17 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 18 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 19 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 20 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 22 | */ 23 | 24 | /* a dynamic array implementation using macros 25 | */ 26 | #ifndef UTARRAY_H 27 | #define UTARRAY_H 28 | 29 | #define UTARRAY_VERSION 1.9.8 30 | 31 | #ifdef __GNUC__ 32 | #define _UNUSED_ __attribute__ ((__unused__)) 33 | #else 34 | #define _UNUSED_ 35 | #endif 36 | 37 | #include /* size_t */ 38 | #include /* memset, etc */ 39 | #include /* exit */ 40 | 41 | #define oom() exit(-1) 42 | 43 | typedef void (ctor_f)(void *dst, const void *src); 44 | typedef void (dtor_f)(void *elt); 45 | typedef void (init_f)(void *elt); 46 | typedef struct { 47 | size_t sz; 48 | init_f *init; 49 | ctor_f *copy; 50 | dtor_f *dtor; 51 | } UT_icd; 52 | 53 | typedef struct { 54 | unsigned i,n;/* i: index of next available slot, n: num slots */ 55 | UT_icd icd; /* initializer, copy and destructor functions */ 56 | char *d; /* n slots of size icd->sz*/ 57 | } UT_array; 58 | 59 | #define utarray_init(a,_icd) do { \ 60 | memset(a,0,sizeof(UT_array)); \ 61 | (a)->icd=*_icd; \ 62 | } while(0) 63 | 64 | #define utarray_done(a) do { \ 65 | if ((a)->n) { \ 66 | if ((a)->icd.dtor) { \ 67 | size_t _ut_i; \ 68 | for(_ut_i=0; _ut_i < (a)->i; _ut_i++) { \ 69 | (a)->icd.dtor(utarray_eltptr(a,_ut_i)); \ 70 | } \ 71 | } \ 72 | free((a)->d); \ 73 | } \ 74 | (a)->n=0; \ 75 | } while(0) 76 | 77 | #define utarray_new(a,_icd) do { \ 78 | a=(UT_array*)malloc(sizeof(UT_array)); \ 79 | utarray_init(a,_icd); \ 80 | } while(0) 81 | 82 | #define utarray_free(a) do { \ 83 | utarray_done(a); \ 84 | free(a); \ 85 | } while(0) 86 | 87 | #define utarray_reserve(a,by) do { \ 88 | if (((a)->i+by) > ((a)->n)) { \ 89 | while(((a)->i+by) > ((a)->n)) { (a)->n = ((a)->n ? (2*(a)->n) : 8); } \ 90 | if ( ((a)->d=(char*)realloc((a)->d, (a)->n*(a)->icd.sz)) == NULL) oom(); \ 91 | } \ 92 | } while(0) 93 | 94 | #define utarray_push_back(a,p) do { \ 95 | utarray_reserve(a,1); \ 96 | if ((a)->icd.copy) { (a)->icd.copy( _utarray_eltptr(a,(a)->i++), p); } \ 97 | else { memcpy(_utarray_eltptr(a,(a)->i++), p, (a)->icd.sz); }; \ 98 | } while(0) 99 | 100 | #define utarray_pop_back(a) do { \ 101 | if ((a)->icd.dtor) { (a)->icd.dtor( _utarray_eltptr(a,--((a)->i))); } \ 102 | else { (a)->i--; } \ 103 | } while(0) 104 | 105 | #define utarray_extend_back(a) do { \ 106 | utarray_reserve(a,1); \ 107 | if ((a)->icd.init) { (a)->icd.init(_utarray_eltptr(a,(a)->i)); } \ 108 | else { memset(_utarray_eltptr(a,(a)->i),0,(a)->icd.sz); } \ 109 | (a)->i++; \ 110 | } while(0) 111 | 112 | #define utarray_len(a) ((a)->i) 113 | 114 | #define utarray_eltptr(a,j) (((j) < (a)->i) ? _utarray_eltptr(a,j) : NULL) 115 | #define _utarray_eltptr(a,j) ((char*)((a)->d + ((a)->icd.sz*(j) ))) 116 | 117 | #define utarray_insert(a,p,j) do { \ 118 | if (j > (a)->i) utarray_resize(a,j); \ 119 | utarray_reserve(a,1); \ 120 | if ((j) < (a)->i) { \ 121 | memmove( _utarray_eltptr(a,(j)+1), _utarray_eltptr(a,j), \ 122 | ((a)->i - (j))*((a)->icd.sz)); \ 123 | } \ 124 | if ((a)->icd.copy) { (a)->icd.copy( _utarray_eltptr(a,j), p); } \ 125 | else { memcpy(_utarray_eltptr(a,j), p, (a)->icd.sz); }; \ 126 | (a)->i++; \ 127 | } while(0) 128 | 129 | #define utarray_inserta(a,w,j) do { \ 130 | if (utarray_len(w) == 0) break; \ 131 | if (j > (a)->i) utarray_resize(a,j); \ 132 | utarray_reserve(a,utarray_len(w)); \ 133 | if ((j) < (a)->i) { \ 134 | memmove(_utarray_eltptr(a,(j)+utarray_len(w)), \ 135 | _utarray_eltptr(a,j), \ 136 | ((a)->i - (j))*((a)->icd.sz)); \ 137 | } \ 138 | if ((a)->icd.copy) { \ 139 | size_t _ut_i; \ 140 | for(_ut_i=0;_ut_i<(w)->i;_ut_i++) { \ 141 | (a)->icd.copy(_utarray_eltptr(a,j+_ut_i), _utarray_eltptr(w,_ut_i)); \ 142 | } \ 143 | } else { \ 144 | memcpy(_utarray_eltptr(a,j), _utarray_eltptr(w,0), \ 145 | utarray_len(w)*((a)->icd.sz)); \ 146 | } \ 147 | (a)->i += utarray_len(w); \ 148 | } while(0) 149 | 150 | #define utarray_resize(dst,num) do { \ 151 | size_t _ut_i; \ 152 | if (dst->i > (size_t)(num)) { \ 153 | if ((dst)->icd.dtor) { \ 154 | for(_ut_i=num; _ut_i < dst->i; _ut_i++) { \ 155 | (dst)->icd.dtor(utarray_eltptr(dst,_ut_i)); \ 156 | } \ 157 | } \ 158 | } else if (dst->i < (size_t)(num)) { \ 159 | utarray_reserve(dst,num-dst->i); \ 160 | if ((dst)->icd.init) { \ 161 | for(_ut_i=dst->i; _ut_i < num; _ut_i++) { \ 162 | (dst)->icd.init(utarray_eltptr(dst,_ut_i)); \ 163 | } \ 164 | } else { \ 165 | memset(_utarray_eltptr(dst,dst->i),0,(dst)->icd.sz*(num-dst->i)); \ 166 | } \ 167 | } \ 168 | dst->i = num; \ 169 | } while(0) 170 | 171 | #define utarray_concat(dst,src) do { \ 172 | utarray_inserta((dst),(src),utarray_len(dst)); \ 173 | } while(0) 174 | 175 | #define utarray_erase(a,pos,len) do { \ 176 | if ((a)->icd.dtor) { \ 177 | size_t _ut_i; \ 178 | for(_ut_i=0; _ut_i < len; _ut_i++) { \ 179 | (a)->icd.dtor(utarray_eltptr((a),pos+_ut_i)); \ 180 | } \ 181 | } \ 182 | if ((a)->i > (pos+len)) { \ 183 | memmove( _utarray_eltptr((a),pos), _utarray_eltptr((a),pos+len), \ 184 | (((a)->i)-(pos+len))*((a)->icd.sz)); \ 185 | } \ 186 | (a)->i -= (len); \ 187 | } while(0) 188 | 189 | #define utarray_renew(a,u) do { \ 190 | if (a) utarray_clear(a); \ 191 | else utarray_new((a),(u)); \ 192 | } while(0) 193 | 194 | #define utarray_clear(a) do { \ 195 | if ((a)->i > 0) { \ 196 | if ((a)->icd.dtor) { \ 197 | size_t _ut_i; \ 198 | for(_ut_i=0; _ut_i < (a)->i; _ut_i++) { \ 199 | (a)->icd.dtor(utarray_eltptr(a,_ut_i)); \ 200 | } \ 201 | } \ 202 | (a)->i = 0; \ 203 | } \ 204 | } while(0) 205 | 206 | #define utarray_sort(a,cmp) do { \ 207 | qsort((a)->d, (a)->i, (a)->icd.sz, cmp); \ 208 | } while(0) 209 | 210 | #define utarray_find(a,v,cmp) bsearch((v),(a)->d,(a)->i,(a)->icd.sz,cmp) 211 | 212 | #define utarray_front(a) (((a)->i) ? (_utarray_eltptr(a,0)) : NULL) 213 | #define utarray_next(a,e) (((e)==NULL) ? utarray_front(a) : ((((a)->i) > (utarray_eltidx(a,e)+1)) ? _utarray_eltptr(a,utarray_eltidx(a,e)+1) : NULL)) 214 | #define utarray_prev(a,e) (((e)==NULL) ? utarray_back(a) : ((utarray_eltidx(a,e) > 0) ? _utarray_eltptr(a,utarray_eltidx(a,e)-1) : NULL)) 215 | #define utarray_back(a) (((a)->i) ? (_utarray_eltptr(a,(a)->i-1)) : NULL) 216 | #define utarray_eltidx(a,e) (((char*)(e) >= (char*)((a)->d)) ? (((char*)(e) - (char*)((a)->d))/(ssize_t)(a)->icd.sz) : -1) 217 | 218 | /* last we pre-define a few icd for common utarrays of ints and strings */ 219 | static void utarray_str_cpy(void *dst, const void *src) { 220 | char **_src = (char**)src, **_dst = (char**)dst; 221 | *_dst = (*_src == NULL) ? NULL : strdup(*_src); 222 | } 223 | static void utarray_str_dtor(void *elt) { 224 | char **eltc = (char**)elt; 225 | if (*eltc) free(*eltc); 226 | } 227 | static const UT_icd ut_str_icd _UNUSED_ = {sizeof(char*),NULL,utarray_str_cpy,utarray_str_dtor}; 228 | static const UT_icd ut_int_icd _UNUSED_ = {sizeof(int),NULL,NULL,NULL}; 229 | static const UT_icd ut_ptr_icd _UNUSED_ = {sizeof(void*),NULL,NULL,NULL}; 230 | 231 | 232 | #endif /* UTARRAY_H */ 233 | -------------------------------------------------------------------------------- /uthash.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2003-2013, Troy D. Hanson http://troydhanson.github.com/uthash/ 3 | All rights reserved. 4 | 5 | Redistribution and use in source and binary forms, with or without 6 | modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | 11 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 12 | IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 13 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 14 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 15 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 16 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 17 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 18 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 19 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 20 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 22 | */ 23 | 24 | #ifndef UTHASH_H 25 | #define UTHASH_H 26 | 27 | #include /* memcmp,strlen */ 28 | #include /* ptrdiff_t */ 29 | #include /* exit() */ 30 | 31 | /* These macros use decltype or the earlier __typeof GNU extension. 32 | As decltype is only available in newer compilers (VS2010 or gcc 4.3+ 33 | when compiling c++ source) this code uses whatever method is needed 34 | or, for VS2008 where neither is available, uses casting workarounds. */ 35 | #ifdef _MSC_VER /* MS compiler */ 36 | #if _MSC_VER >= 1600 && defined(__cplusplus) /* VS2010 or newer in C++ mode */ 37 | #define DECLTYPE(x) (decltype(x)) 38 | #else /* VS2008 or older (or VS2010 in C mode) */ 39 | #define NO_DECLTYPE 40 | #define DECLTYPE(x) 41 | #endif 42 | #else /* GNU, Sun and other compilers */ 43 | #define DECLTYPE(x) (__typeof(x)) 44 | #endif 45 | 46 | #ifdef NO_DECLTYPE 47 | #define DECLTYPE_ASSIGN(dst,src) \ 48 | do { \ 49 | char **_da_dst = (char**)(&(dst)); \ 50 | *_da_dst = (char*)(src); \ 51 | } while(0) 52 | #else 53 | #define DECLTYPE_ASSIGN(dst,src) \ 54 | do { \ 55 | (dst) = DECLTYPE(dst)(src); \ 56 | } while(0) 57 | #endif 58 | 59 | /* a number of the hash function use uint32_t which isn't defined on win32 */ 60 | #ifdef _MSC_VER 61 | typedef unsigned int uint32_t; 62 | typedef unsigned char uint8_t; 63 | #else 64 | #include /* uint32_t */ 65 | #endif 66 | 67 | #define UTHASH_VERSION 1.9.8 68 | 69 | #ifndef uthash_fatal 70 | #define uthash_fatal(msg) exit(-1) /* fatal error (out of memory,etc) */ 71 | #endif 72 | #ifndef uthash_malloc 73 | #define uthash_malloc(sz) malloc(sz) /* malloc fcn */ 74 | #endif 75 | #ifndef uthash_free 76 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ 77 | #endif 78 | 79 | #ifndef uthash_noexpand_fyi 80 | #define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */ 81 | #endif 82 | #ifndef uthash_expand_fyi 83 | #define uthash_expand_fyi(tbl) /* can be defined to log expands */ 84 | #endif 85 | 86 | /* initial number of buckets */ 87 | #define HASH_INITIAL_NUM_BUCKETS 32 /* initial number of buckets */ 88 | #define HASH_INITIAL_NUM_BUCKETS_LOG2 5 /* lg2 of initial number of buckets */ 89 | #define HASH_BKT_CAPACITY_THRESH 10 /* expand when bucket count reaches */ 90 | 91 | /* calculate the element whose hash handle address is hhe */ 92 | #define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho))) 93 | 94 | #define HASH_FIND(hh,head,keyptr,keylen,out) \ 95 | do { \ 96 | unsigned _hf_bkt,_hf_hashv; \ 97 | out=NULL; \ 98 | if (head) { \ 99 | HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ 100 | if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv)) { \ 101 | HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ 102 | keyptr,keylen,out); \ 103 | } \ 104 | } \ 105 | } while (0) 106 | 107 | #ifdef HASH_BLOOM 108 | #define HASH_BLOOM_BITLEN (1ULL << HASH_BLOOM) 109 | #define HASH_BLOOM_BYTELEN (HASH_BLOOM_BITLEN/8) + ((HASH_BLOOM_BITLEN%8) ? 1:0) 110 | #define HASH_BLOOM_MAKE(tbl) \ 111 | do { \ 112 | (tbl)->bloom_nbits = HASH_BLOOM; \ 113 | (tbl)->bloom_bv = (uint8_t*)uthash_malloc(HASH_BLOOM_BYTELEN); \ 114 | if (!((tbl)->bloom_bv)) { uthash_fatal( "out of memory"); } \ 115 | memset((tbl)->bloom_bv, 0, HASH_BLOOM_BYTELEN); \ 116 | (tbl)->bloom_sig = HASH_BLOOM_SIGNATURE; \ 117 | } while (0) 118 | 119 | #define HASH_BLOOM_FREE(tbl) \ 120 | do { \ 121 | uthash_free((tbl)->bloom_bv, HASH_BLOOM_BYTELEN); \ 122 | } while (0) 123 | 124 | #define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8] |= (1U << ((idx)%8))) 125 | #define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8] & (1U << ((idx)%8))) 126 | 127 | #define HASH_BLOOM_ADD(tbl,hashv) \ 128 | HASH_BLOOM_BITSET((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1))) 129 | 130 | #define HASH_BLOOM_TEST(tbl,hashv) \ 131 | HASH_BLOOM_BITTEST((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1))) 132 | 133 | #else 134 | #define HASH_BLOOM_MAKE(tbl) 135 | #define HASH_BLOOM_FREE(tbl) 136 | #define HASH_BLOOM_ADD(tbl,hashv) 137 | #define HASH_BLOOM_TEST(tbl,hashv) (1) 138 | #define HASH_BLOOM_BYTELEN 0 139 | #endif 140 | 141 | #define HASH_MAKE_TABLE(hh,head) \ 142 | do { \ 143 | (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ 144 | sizeof(UT_hash_table)); \ 145 | if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ 146 | memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ 147 | (head)->hh.tbl->tail = &((head)->hh); \ 148 | (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ 149 | (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ 150 | (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ 151 | (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ 152 | HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket)); \ 153 | if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ 154 | memset((head)->hh.tbl->buckets, 0, \ 155 | HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket)); \ 156 | HASH_BLOOM_MAKE((head)->hh.tbl); \ 157 | (head)->hh.tbl->signature = HASH_SIGNATURE; \ 158 | } while(0) 159 | 160 | #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ 161 | HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) 162 | 163 | #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ 164 | do { \ 165 | replaced=NULL; \ 166 | HASH_FIND(hh,head,&((add)->fieldname),keylen_in,replaced); \ 167 | if (replaced!=NULL) { \ 168 | HASH_DELETE(hh,head,replaced); \ 169 | }; \ 170 | HASH_ADD(hh,head,fieldname,keylen_in,add); \ 171 | } while(0) 172 | 173 | #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ 174 | do { \ 175 | unsigned _ha_bkt; \ 176 | (add)->hh.next = NULL; \ 177 | (add)->hh.key = (char*)keyptr; \ 178 | (add)->hh.keylen = (unsigned)keylen_in; \ 179 | if (!(head)) { \ 180 | head = (add); \ 181 | (head)->hh.prev = NULL; \ 182 | HASH_MAKE_TABLE(hh,head); \ 183 | } else { \ 184 | (head)->hh.tbl->tail->next = (add); \ 185 | (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ 186 | (head)->hh.tbl->tail = &((add)->hh); \ 187 | } \ 188 | (head)->hh.tbl->num_items++; \ 189 | (add)->hh.tbl = (head)->hh.tbl; \ 190 | HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ 191 | (add)->hh.hashv, _ha_bkt); \ 192 | HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ 193 | HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ 194 | HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ 195 | HASH_FSCK(hh,head); \ 196 | } while(0) 197 | 198 | #define HASH_TO_BKT( hashv, num_bkts, bkt ) \ 199 | do { \ 200 | bkt = ((hashv) & ((num_bkts) - 1)); \ 201 | } while(0) 202 | 203 | /* delete "delptr" from the hash table. 204 | * "the usual" patch-up process for the app-order doubly-linked-list. 205 | * The use of _hd_hh_del below deserves special explanation. 206 | * These used to be expressed using (delptr) but that led to a bug 207 | * if someone used the same symbol for the head and deletee, like 208 | * HASH_DELETE(hh,users,users); 209 | * We want that to work, but by changing the head (users) below 210 | * we were forfeiting our ability to further refer to the deletee (users) 211 | * in the patch-up process. Solution: use scratch space to 212 | * copy the deletee pointer, then the latter references are via that 213 | * scratch pointer rather than through the repointed (users) symbol. 214 | */ 215 | #define HASH_DELETE(hh,head,delptr) \ 216 | do { \ 217 | unsigned _hd_bkt; \ 218 | struct UT_hash_handle *_hd_hh_del; \ 219 | if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) ) { \ 220 | uthash_free((head)->hh.tbl->buckets, \ 221 | (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ 222 | HASH_BLOOM_FREE((head)->hh.tbl); \ 223 | uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 224 | head = NULL; \ 225 | } else { \ 226 | _hd_hh_del = &((delptr)->hh); \ 227 | if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ 228 | (head)->hh.tbl->tail = \ 229 | (UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ 230 | (head)->hh.tbl->hho); \ 231 | } \ 232 | if ((delptr)->hh.prev) { \ 233 | ((UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ 234 | (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ 235 | } else { \ 236 | DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ 237 | } \ 238 | if (_hd_hh_del->next) { \ 239 | ((UT_hash_handle*)((ptrdiff_t)_hd_hh_del->next + \ 240 | (head)->hh.tbl->hho))->prev = \ 241 | _hd_hh_del->prev; \ 242 | } \ 243 | HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ 244 | HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ 245 | (head)->hh.tbl->num_items--; \ 246 | } \ 247 | HASH_FSCK(hh,head); \ 248 | } while (0) 249 | 250 | 251 | /* convenience forms of HASH_FIND/HASH_ADD/HASH_DEL */ 252 | #define HASH_FIND_STR(head,findstr,out) \ 253 | HASH_FIND(hh,head,findstr,strlen(findstr),out) 254 | #define HASH_ADD_STR(head,strfield,add) \ 255 | HASH_ADD(hh,head,strfield,strlen(add->strfield),add) 256 | #define HASH_REPLACE_STR(head,strfield,add,replaced) \ 257 | HASH_REPLACE(hh,head,strfield,strlen(add->strfield),add,replaced) 258 | #define HASH_FIND_INT(head,findint,out) \ 259 | HASH_FIND(hh,head,findint,sizeof(int),out) 260 | #define HASH_ADD_INT(head,intfield,add) \ 261 | HASH_ADD(hh,head,intfield,sizeof(int),add) 262 | #define HASH_REPLACE_INT(head,intfield,add,replaced) \ 263 | HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced) 264 | #define HASH_FIND_PTR(head,findptr,out) \ 265 | HASH_FIND(hh,head,findptr,sizeof(void *),out) 266 | #define HASH_ADD_PTR(head,ptrfield,add) \ 267 | HASH_ADD(hh,head,ptrfield,sizeof(void *),add) 268 | #define HASH_REPLACE_PTR(head,ptrfield,add) \ 269 | HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced) 270 | #define HASH_DEL(head,delptr) \ 271 | HASH_DELETE(hh,head,delptr) 272 | 273 | /* HASH_FSCK checks hash integrity on every add/delete when HASH_DEBUG is defined. 274 | * This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined. 275 | */ 276 | #ifdef HASH_DEBUG 277 | #define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0) 278 | #define HASH_FSCK(hh,head) \ 279 | do { \ 280 | unsigned _bkt_i; \ 281 | unsigned _count, _bkt_count; \ 282 | char *_prev; \ 283 | struct UT_hash_handle *_thh; \ 284 | if (head) { \ 285 | _count = 0; \ 286 | for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ 287 | _bkt_count = 0; \ 288 | _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ 289 | _prev = NULL; \ 290 | while (_thh) { \ 291 | if (_prev != (char*)(_thh->hh_prev)) { \ 292 | HASH_OOPS("invalid hh_prev %p, actual %p\n", \ 293 | _thh->hh_prev, _prev ); \ 294 | } \ 295 | _bkt_count++; \ 296 | _prev = (char*)(_thh); \ 297 | _thh = _thh->hh_next; \ 298 | } \ 299 | _count += _bkt_count; \ 300 | if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ 301 | HASH_OOPS("invalid bucket count %d, actual %d\n", \ 302 | (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ 303 | } \ 304 | } \ 305 | if (_count != (head)->hh.tbl->num_items) { \ 306 | HASH_OOPS("invalid hh item count %d, actual %d\n", \ 307 | (head)->hh.tbl->num_items, _count ); \ 308 | } \ 309 | /* traverse hh in app order; check next/prev integrity, count */ \ 310 | _count = 0; \ 311 | _prev = NULL; \ 312 | _thh = &(head)->hh; \ 313 | while (_thh) { \ 314 | _count++; \ 315 | if (_prev !=(char*)(_thh->prev)) { \ 316 | HASH_OOPS("invalid prev %p, actual %p\n", \ 317 | _thh->prev, _prev ); \ 318 | } \ 319 | _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ 320 | _thh = ( _thh->next ? (UT_hash_handle*)((char*)(_thh->next) + \ 321 | (head)->hh.tbl->hho) : NULL ); \ 322 | } \ 323 | if (_count != (head)->hh.tbl->num_items) { \ 324 | HASH_OOPS("invalid app item count %d, actual %d\n", \ 325 | (head)->hh.tbl->num_items, _count ); \ 326 | } \ 327 | } \ 328 | } while (0) 329 | #else 330 | #define HASH_FSCK(hh,head) 331 | #endif 332 | 333 | /* When compiled with -DHASH_EMIT_KEYS, length-prefixed keys are emitted to 334 | * the descriptor to which this macro is defined for tuning the hash function. 335 | * The app can #include to get the prototype for write(2). */ 336 | #ifdef HASH_EMIT_KEYS 337 | #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ 338 | do { \ 339 | unsigned _klen = fieldlen; \ 340 | write(HASH_EMIT_KEYS, &_klen, sizeof(_klen)); \ 341 | write(HASH_EMIT_KEYS, keyptr, fieldlen); \ 342 | } while (0) 343 | #else 344 | #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) 345 | #endif 346 | 347 | /* default to Jenkin's hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */ 348 | #ifdef HASH_FUNCTION 349 | #define HASH_FCN HASH_FUNCTION 350 | #else 351 | #define HASH_FCN HASH_JEN 352 | #endif 353 | 354 | /* The Bernstein hash function, used in Perl prior to v5.6 */ 355 | #define HASH_BER(key,keylen,num_bkts,hashv,bkt) \ 356 | do { \ 357 | unsigned _hb_keylen=keylen; \ 358 | char *_hb_key=(char*)(key); \ 359 | (hashv) = 0; \ 360 | while (_hb_keylen--) { (hashv) = ((hashv) * 33) + *_hb_key++; } \ 361 | bkt = (hashv) & (num_bkts-1); \ 362 | } while (0) 363 | 364 | 365 | /* SAX/FNV/OAT/JEN hash functions are macro variants of those listed at 366 | * http://eternallyconfuzzled.com/tuts/algorithms/jsw_tut_hashing.aspx */ 367 | #define HASH_SAX(key,keylen,num_bkts,hashv,bkt) \ 368 | do { \ 369 | unsigned _sx_i; \ 370 | char *_hs_key=(char*)(key); \ 371 | hashv = 0; \ 372 | for(_sx_i=0; _sx_i < keylen; _sx_i++) \ 373 | hashv ^= (hashv << 5) + (hashv >> 2) + _hs_key[_sx_i]; \ 374 | bkt = hashv & (num_bkts-1); \ 375 | } while (0) 376 | 377 | #define HASH_FNV(key,keylen,num_bkts,hashv,bkt) \ 378 | do { \ 379 | unsigned _fn_i; \ 380 | char *_hf_key=(char*)(key); \ 381 | hashv = 2166136261UL; \ 382 | for(_fn_i=0; _fn_i < keylen; _fn_i++) \ 383 | hashv = (hashv * 16777619) ^ _hf_key[_fn_i]; \ 384 | bkt = hashv & (num_bkts-1); \ 385 | } while(0) 386 | 387 | #define HASH_OAT(key,keylen,num_bkts,hashv,bkt) \ 388 | do { \ 389 | unsigned _ho_i; \ 390 | char *_ho_key=(char*)(key); \ 391 | hashv = 0; \ 392 | for(_ho_i=0; _ho_i < keylen; _ho_i++) { \ 393 | hashv += _ho_key[_ho_i]; \ 394 | hashv += (hashv << 10); \ 395 | hashv ^= (hashv >> 6); \ 396 | } \ 397 | hashv += (hashv << 3); \ 398 | hashv ^= (hashv >> 11); \ 399 | hashv += (hashv << 15); \ 400 | bkt = hashv & (num_bkts-1); \ 401 | } while(0) 402 | 403 | #define HASH_JEN_MIX(a,b,c) \ 404 | do { \ 405 | a -= b; a -= c; a ^= ( c >> 13 ); \ 406 | b -= c; b -= a; b ^= ( a << 8 ); \ 407 | c -= a; c -= b; c ^= ( b >> 13 ); \ 408 | a -= b; a -= c; a ^= ( c >> 12 ); \ 409 | b -= c; b -= a; b ^= ( a << 16 ); \ 410 | c -= a; c -= b; c ^= ( b >> 5 ); \ 411 | a -= b; a -= c; a ^= ( c >> 3 ); \ 412 | b -= c; b -= a; b ^= ( a << 10 ); \ 413 | c -= a; c -= b; c ^= ( b >> 15 ); \ 414 | } while (0) 415 | 416 | #define HASH_JEN(key,keylen,num_bkts,hashv,bkt) \ 417 | do { \ 418 | unsigned _hj_i,_hj_j,_hj_k; \ 419 | unsigned char *_hj_key=(unsigned char*)(key); \ 420 | hashv = 0xfeedbeef; \ 421 | _hj_i = _hj_j = 0x9e3779b9; \ 422 | _hj_k = (unsigned)keylen; \ 423 | while (_hj_k >= 12) { \ 424 | _hj_i += (_hj_key[0] + ( (unsigned)_hj_key[1] << 8 ) \ 425 | + ( (unsigned)_hj_key[2] << 16 ) \ 426 | + ( (unsigned)_hj_key[3] << 24 ) ); \ 427 | _hj_j += (_hj_key[4] + ( (unsigned)_hj_key[5] << 8 ) \ 428 | + ( (unsigned)_hj_key[6] << 16 ) \ 429 | + ( (unsigned)_hj_key[7] << 24 ) ); \ 430 | hashv += (_hj_key[8] + ( (unsigned)_hj_key[9] << 8 ) \ 431 | + ( (unsigned)_hj_key[10] << 16 ) \ 432 | + ( (unsigned)_hj_key[11] << 24 ) ); \ 433 | \ 434 | HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ 435 | \ 436 | _hj_key += 12; \ 437 | _hj_k -= 12; \ 438 | } \ 439 | hashv += keylen; \ 440 | switch ( _hj_k ) { \ 441 | case 11: hashv += ( (unsigned)_hj_key[10] << 24 ); \ 442 | case 10: hashv += ( (unsigned)_hj_key[9] << 16 ); \ 443 | case 9: hashv += ( (unsigned)_hj_key[8] << 8 ); \ 444 | case 8: _hj_j += ( (unsigned)_hj_key[7] << 24 ); \ 445 | case 7: _hj_j += ( (unsigned)_hj_key[6] << 16 ); \ 446 | case 6: _hj_j += ( (unsigned)_hj_key[5] << 8 ); \ 447 | case 5: _hj_j += _hj_key[4]; \ 448 | case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); \ 449 | case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); \ 450 | case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); \ 451 | case 1: _hj_i += _hj_key[0]; \ 452 | } \ 453 | HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ 454 | bkt = hashv & (num_bkts-1); \ 455 | } while(0) 456 | 457 | /* The Paul Hsieh hash function */ 458 | #undef get16bits 459 | #if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \ 460 | || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__) 461 | #define get16bits(d) (*((const uint16_t *) (d))) 462 | #endif 463 | 464 | #if !defined (get16bits) 465 | #define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8) \ 466 | +(uint32_t)(((const uint8_t *)(d))[0]) ) 467 | #endif 468 | #define HASH_SFH(key,keylen,num_bkts,hashv,bkt) \ 469 | do { \ 470 | unsigned char *_sfh_key=(unsigned char*)(key); \ 471 | uint32_t _sfh_tmp, _sfh_len = keylen; \ 472 | \ 473 | int _sfh_rem = _sfh_len & 3; \ 474 | _sfh_len >>= 2; \ 475 | hashv = 0xcafebabe; \ 476 | \ 477 | /* Main loop */ \ 478 | for (;_sfh_len > 0; _sfh_len--) { \ 479 | hashv += get16bits (_sfh_key); \ 480 | _sfh_tmp = (uint32_t)(get16bits (_sfh_key+2)) << 11 ^ hashv; \ 481 | hashv = (hashv << 16) ^ _sfh_tmp; \ 482 | _sfh_key += 2*sizeof (uint16_t); \ 483 | hashv += hashv >> 11; \ 484 | } \ 485 | \ 486 | /* Handle end cases */ \ 487 | switch (_sfh_rem) { \ 488 | case 3: hashv += get16bits (_sfh_key); \ 489 | hashv ^= hashv << 16; \ 490 | hashv ^= (uint32_t)(_sfh_key[sizeof (uint16_t)] << 18); \ 491 | hashv += hashv >> 11; \ 492 | break; \ 493 | case 2: hashv += get16bits (_sfh_key); \ 494 | hashv ^= hashv << 11; \ 495 | hashv += hashv >> 17; \ 496 | break; \ 497 | case 1: hashv += *_sfh_key; \ 498 | hashv ^= hashv << 10; \ 499 | hashv += hashv >> 1; \ 500 | } \ 501 | \ 502 | /* Force "avalanching" of final 127 bits */ \ 503 | hashv ^= hashv << 3; \ 504 | hashv += hashv >> 5; \ 505 | hashv ^= hashv << 4; \ 506 | hashv += hashv >> 17; \ 507 | hashv ^= hashv << 25; \ 508 | hashv += hashv >> 6; \ 509 | bkt = hashv & (num_bkts-1); \ 510 | } while(0) 511 | 512 | #ifdef HASH_USING_NO_STRICT_ALIASING 513 | /* The MurmurHash exploits some CPU's (x86,x86_64) tolerance for unaligned reads. 514 | * For other types of CPU's (e.g. Sparc) an unaligned read causes a bus error. 515 | * MurmurHash uses the faster approach only on CPU's where we know it's safe. 516 | * 517 | * Note the preprocessor built-in defines can be emitted using: 518 | * 519 | * gcc -m64 -dM -E - < /dev/null (on gcc) 520 | * cc -## a.c (where a.c is a simple test file) (Sun Studio) 521 | */ 522 | #if (defined(__i386__) || defined(__x86_64__) || defined(_M_IX86)) 523 | #define MUR_GETBLOCK(p,i) p[i] 524 | #else /* non intel */ 525 | #define MUR_PLUS0_ALIGNED(p) (((unsigned long)p & 0x3) == 0) 526 | #define MUR_PLUS1_ALIGNED(p) (((unsigned long)p & 0x3) == 1) 527 | #define MUR_PLUS2_ALIGNED(p) (((unsigned long)p & 0x3) == 2) 528 | #define MUR_PLUS3_ALIGNED(p) (((unsigned long)p & 0x3) == 3) 529 | #define WP(p) ((uint32_t*)((unsigned long)(p) & ~3UL)) 530 | #if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__)) 531 | #define MUR_THREE_ONE(p) ((((*WP(p))&0x00ffffff) << 8) | (((*(WP(p)+1))&0xff000000) >> 24)) 532 | #define MUR_TWO_TWO(p) ((((*WP(p))&0x0000ffff) <<16) | (((*(WP(p)+1))&0xffff0000) >> 16)) 533 | #define MUR_ONE_THREE(p) ((((*WP(p))&0x000000ff) <<24) | (((*(WP(p)+1))&0xffffff00) >> 8)) 534 | #else /* assume little endian non-intel */ 535 | #define MUR_THREE_ONE(p) ((((*WP(p))&0xffffff00) >> 8) | (((*(WP(p)+1))&0x000000ff) << 24)) 536 | #define MUR_TWO_TWO(p) ((((*WP(p))&0xffff0000) >>16) | (((*(WP(p)+1))&0x0000ffff) << 16)) 537 | #define MUR_ONE_THREE(p) ((((*WP(p))&0xff000000) >>24) | (((*(WP(p)+1))&0x00ffffff) << 8)) 538 | #endif 539 | #define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) : \ 540 | (MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \ 541 | (MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) : \ 542 | MUR_ONE_THREE(p)))) 543 | #endif 544 | #define MUR_ROTL32(x,r) (((x) << (r)) | ((x) >> (32 - (r)))) 545 | #define MUR_FMIX(_h) \ 546 | do { \ 547 | _h ^= _h >> 16; \ 548 | _h *= 0x85ebca6b; \ 549 | _h ^= _h >> 13; \ 550 | _h *= 0xc2b2ae35l; \ 551 | _h ^= _h >> 16; \ 552 | } while(0) 553 | 554 | #define HASH_MUR(key,keylen,num_bkts,hashv,bkt) \ 555 | do { \ 556 | const uint8_t *_mur_data = (const uint8_t*)(key); \ 557 | const int _mur_nblocks = (keylen) / 4; \ 558 | uint32_t _mur_h1 = 0xf88D5353; \ 559 | uint32_t _mur_c1 = 0xcc9e2d51; \ 560 | uint32_t _mur_c2 = 0x1b873593; \ 561 | uint32_t _mur_k1 = 0; \ 562 | const uint8_t *_mur_tail; \ 563 | const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+_mur_nblocks*4); \ 564 | int _mur_i; \ 565 | for(_mur_i = -_mur_nblocks; _mur_i; _mur_i++) { \ 566 | _mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i); \ 567 | _mur_k1 *= _mur_c1; \ 568 | _mur_k1 = MUR_ROTL32(_mur_k1,15); \ 569 | _mur_k1 *= _mur_c2; \ 570 | \ 571 | _mur_h1 ^= _mur_k1; \ 572 | _mur_h1 = MUR_ROTL32(_mur_h1,13); \ 573 | _mur_h1 = _mur_h1*5+0xe6546b64; \ 574 | } \ 575 | _mur_tail = (const uint8_t*)(_mur_data + _mur_nblocks*4); \ 576 | _mur_k1=0; \ 577 | switch((keylen) & 3) { \ 578 | case 3: _mur_k1 ^= _mur_tail[2] << 16; \ 579 | case 2: _mur_k1 ^= _mur_tail[1] << 8; \ 580 | case 1: _mur_k1 ^= _mur_tail[0]; \ 581 | _mur_k1 *= _mur_c1; \ 582 | _mur_k1 = MUR_ROTL32(_mur_k1,15); \ 583 | _mur_k1 *= _mur_c2; \ 584 | _mur_h1 ^= _mur_k1; \ 585 | } \ 586 | _mur_h1 ^= (keylen); \ 587 | MUR_FMIX(_mur_h1); \ 588 | hashv = _mur_h1; \ 589 | bkt = hashv & (num_bkts-1); \ 590 | } while(0) 591 | #endif /* HASH_USING_NO_STRICT_ALIASING */ 592 | 593 | /* key comparison function; return 0 if keys equal */ 594 | #define HASH_KEYCMP(a,b,len) memcmp(a,b,len) 595 | 596 | /* iterate over items in a known bucket to find desired item */ 597 | #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ 598 | do { \ 599 | if (head.hh_head) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head)); \ 600 | else out=NULL; \ 601 | while (out) { \ 602 | if ((out)->hh.keylen == keylen_in) { \ 603 | if ((HASH_KEYCMP((out)->hh.key,keyptr,keylen_in)) == 0) break; \ 604 | } \ 605 | if ((out)->hh.hh_next) DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,(out)->hh.hh_next)); \ 606 | else out = NULL; \ 607 | } \ 608 | } while(0) 609 | 610 | /* add an item to a bucket */ 611 | #define HASH_ADD_TO_BKT(head,addhh) \ 612 | do { \ 613 | head.count++; \ 614 | (addhh)->hh_next = head.hh_head; \ 615 | (addhh)->hh_prev = NULL; \ 616 | if (head.hh_head) { (head).hh_head->hh_prev = (addhh); } \ 617 | (head).hh_head=addhh; \ 618 | if (head.count >= ((head.expand_mult+1) * HASH_BKT_CAPACITY_THRESH) \ 619 | && (addhh)->tbl->noexpand != 1) { \ 620 | HASH_EXPAND_BUCKETS((addhh)->tbl); \ 621 | } \ 622 | } while(0) 623 | 624 | /* remove an item from a given bucket */ 625 | #define HASH_DEL_IN_BKT(hh,head,hh_del) \ 626 | (head).count--; \ 627 | if ((head).hh_head == hh_del) { \ 628 | (head).hh_head = hh_del->hh_next; \ 629 | } \ 630 | if (hh_del->hh_prev) { \ 631 | hh_del->hh_prev->hh_next = hh_del->hh_next; \ 632 | } \ 633 | if (hh_del->hh_next) { \ 634 | hh_del->hh_next->hh_prev = hh_del->hh_prev; \ 635 | } 636 | 637 | /* Bucket expansion has the effect of doubling the number of buckets 638 | * and redistributing the items into the new buckets. Ideally the 639 | * items will distribute more or less evenly into the new buckets 640 | * (the extent to which this is true is a measure of the quality of 641 | * the hash function as it applies to the key domain). 642 | * 643 | * With the items distributed into more buckets, the chain length 644 | * (item count) in each bucket is reduced. Thus by expanding buckets 645 | * the hash keeps a bound on the chain length. This bounded chain 646 | * length is the essence of how a hash provides constant time lookup. 647 | * 648 | * The calculation of tbl->ideal_chain_maxlen below deserves some 649 | * explanation. First, keep in mind that we're calculating the ideal 650 | * maximum chain length based on the *new* (doubled) bucket count. 651 | * In fractions this is just n/b (n=number of items,b=new num buckets). 652 | * Since the ideal chain length is an integer, we want to calculate 653 | * ceil(n/b). We don't depend on floating point arithmetic in this 654 | * hash, so to calculate ceil(n/b) with integers we could write 655 | * 656 | * ceil(n/b) = (n/b) + ((n%b)?1:0) 657 | * 658 | * and in fact a previous version of this hash did just that. 659 | * But now we have improved things a bit by recognizing that b is 660 | * always a power of two. We keep its base 2 log handy (call it lb), 661 | * so now we can write this with a bit shift and logical AND: 662 | * 663 | * ceil(n/b) = (n>>lb) + ( (n & (b-1)) ? 1:0) 664 | * 665 | */ 666 | #define HASH_EXPAND_BUCKETS(tbl) \ 667 | do { \ 668 | unsigned _he_bkt; \ 669 | unsigned _he_bkt_i; \ 670 | struct UT_hash_handle *_he_thh, *_he_hh_nxt; \ 671 | UT_hash_bucket *_he_new_buckets, *_he_newbkt; \ 672 | _he_new_buckets = (UT_hash_bucket*)uthash_malloc( \ 673 | 2 * tbl->num_buckets * sizeof(struct UT_hash_bucket)); \ 674 | if (!_he_new_buckets) { uthash_fatal( "out of memory"); } \ 675 | memset(_he_new_buckets, 0, \ 676 | 2 * tbl->num_buckets * sizeof(struct UT_hash_bucket)); \ 677 | tbl->ideal_chain_maxlen = \ 678 | (tbl->num_items >> (tbl->log2_num_buckets+1)) + \ 679 | ((tbl->num_items & ((tbl->num_buckets*2)-1)) ? 1 : 0); \ 680 | tbl->nonideal_items = 0; \ 681 | for(_he_bkt_i = 0; _he_bkt_i < tbl->num_buckets; _he_bkt_i++) \ 682 | { \ 683 | _he_thh = tbl->buckets[ _he_bkt_i ].hh_head; \ 684 | while (_he_thh) { \ 685 | _he_hh_nxt = _he_thh->hh_next; \ 686 | HASH_TO_BKT( _he_thh->hashv, tbl->num_buckets*2, _he_bkt); \ 687 | _he_newbkt = &(_he_new_buckets[ _he_bkt ]); \ 688 | if (++(_he_newbkt->count) > tbl->ideal_chain_maxlen) { \ 689 | tbl->nonideal_items++; \ 690 | _he_newbkt->expand_mult = _he_newbkt->count / \ 691 | tbl->ideal_chain_maxlen; \ 692 | } \ 693 | _he_thh->hh_prev = NULL; \ 694 | _he_thh->hh_next = _he_newbkt->hh_head; \ 695 | if (_he_newbkt->hh_head) _he_newbkt->hh_head->hh_prev = \ 696 | _he_thh; \ 697 | _he_newbkt->hh_head = _he_thh; \ 698 | _he_thh = _he_hh_nxt; \ 699 | } \ 700 | } \ 701 | uthash_free( tbl->buckets, tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ 702 | tbl->num_buckets *= 2; \ 703 | tbl->log2_num_buckets++; \ 704 | tbl->buckets = _he_new_buckets; \ 705 | tbl->ineff_expands = (tbl->nonideal_items > (tbl->num_items >> 1)) ? \ 706 | (tbl->ineff_expands+1) : 0; \ 707 | if (tbl->ineff_expands > 1) { \ 708 | tbl->noexpand=1; \ 709 | uthash_noexpand_fyi(tbl); \ 710 | } \ 711 | uthash_expand_fyi(tbl); \ 712 | } while(0) 713 | 714 | 715 | /* This is an adaptation of Simon Tatham's O(n log(n)) mergesort */ 716 | /* Note that HASH_SORT assumes the hash handle name to be hh. 717 | * HASH_SRT was added to allow the hash handle name to be passed in. */ 718 | #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) 719 | #define HASH_SRT(hh,head,cmpfcn) \ 720 | do { \ 721 | unsigned _hs_i; \ 722 | unsigned _hs_looping,_hs_nmerges,_hs_insize,_hs_psize,_hs_qsize; \ 723 | struct UT_hash_handle *_hs_p, *_hs_q, *_hs_e, *_hs_list, *_hs_tail; \ 724 | if (head) { \ 725 | _hs_insize = 1; \ 726 | _hs_looping = 1; \ 727 | _hs_list = &((head)->hh); \ 728 | while (_hs_looping) { \ 729 | _hs_p = _hs_list; \ 730 | _hs_list = NULL; \ 731 | _hs_tail = NULL; \ 732 | _hs_nmerges = 0; \ 733 | while (_hs_p) { \ 734 | _hs_nmerges++; \ 735 | _hs_q = _hs_p; \ 736 | _hs_psize = 0; \ 737 | for ( _hs_i = 0; _hs_i < _hs_insize; _hs_i++ ) { \ 738 | _hs_psize++; \ 739 | _hs_q = (UT_hash_handle*)((_hs_q->next) ? \ 740 | ((void*)((char*)(_hs_q->next) + \ 741 | (head)->hh.tbl->hho)) : NULL); \ 742 | if (! (_hs_q) ) break; \ 743 | } \ 744 | _hs_qsize = _hs_insize; \ 745 | while ((_hs_psize > 0) || ((_hs_qsize > 0) && _hs_q )) { \ 746 | if (_hs_psize == 0) { \ 747 | _hs_e = _hs_q; \ 748 | _hs_q = (UT_hash_handle*)((_hs_q->next) ? \ 749 | ((void*)((char*)(_hs_q->next) + \ 750 | (head)->hh.tbl->hho)) : NULL); \ 751 | _hs_qsize--; \ 752 | } else if ( (_hs_qsize == 0) || !(_hs_q) ) { \ 753 | _hs_e = _hs_p; \ 754 | if (_hs_p){ \ 755 | _hs_p = (UT_hash_handle*)((_hs_p->next) ? \ 756 | ((void*)((char*)(_hs_p->next) + \ 757 | (head)->hh.tbl->hho)) : NULL); \ 758 | } \ 759 | _hs_psize--; \ 760 | } else if (( \ 761 | cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ 762 | DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ 763 | ) <= 0) { \ 764 | _hs_e = _hs_p; \ 765 | if (_hs_p){ \ 766 | _hs_p = (UT_hash_handle*)((_hs_p->next) ? \ 767 | ((void*)((char*)(_hs_p->next) + \ 768 | (head)->hh.tbl->hho)) : NULL); \ 769 | } \ 770 | _hs_psize--; \ 771 | } else { \ 772 | _hs_e = _hs_q; \ 773 | _hs_q = (UT_hash_handle*)((_hs_q->next) ? \ 774 | ((void*)((char*)(_hs_q->next) + \ 775 | (head)->hh.tbl->hho)) : NULL); \ 776 | _hs_qsize--; \ 777 | } \ 778 | if ( _hs_tail ) { \ 779 | _hs_tail->next = ((_hs_e) ? \ 780 | ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ 781 | } else { \ 782 | _hs_list = _hs_e; \ 783 | } \ 784 | if (_hs_e) { \ 785 | _hs_e->prev = ((_hs_tail) ? \ 786 | ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ 787 | } \ 788 | _hs_tail = _hs_e; \ 789 | } \ 790 | _hs_p = _hs_q; \ 791 | } \ 792 | if (_hs_tail){ \ 793 | _hs_tail->next = NULL; \ 794 | } \ 795 | if ( _hs_nmerges <= 1 ) { \ 796 | _hs_looping=0; \ 797 | (head)->hh.tbl->tail = _hs_tail; \ 798 | DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ 799 | } \ 800 | _hs_insize *= 2; \ 801 | } \ 802 | HASH_FSCK(hh,head); \ 803 | } \ 804 | } while (0) 805 | 806 | /* This function selects items from one hash into another hash. 807 | * The end result is that the selected items have dual presence 808 | * in both hashes. There is no copy of the items made; rather 809 | * they are added into the new hash through a secondary hash 810 | * hash handle that must be present in the structure. */ 811 | #define HASH_SELECT(hh_dst, dst, hh_src, src, cond) \ 812 | do { \ 813 | unsigned _src_bkt, _dst_bkt; \ 814 | void *_last_elt=NULL, *_elt; \ 815 | UT_hash_handle *_src_hh, *_dst_hh, *_last_elt_hh=NULL; \ 816 | ptrdiff_t _dst_hho = ((char*)(&(dst)->hh_dst) - (char*)(dst)); \ 817 | if (src) { \ 818 | for(_src_bkt=0; _src_bkt < (src)->hh_src.tbl->num_buckets; _src_bkt++) { \ 819 | for(_src_hh = (src)->hh_src.tbl->buckets[_src_bkt].hh_head; \ 820 | _src_hh; \ 821 | _src_hh = _src_hh->hh_next) { \ 822 | _elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \ 823 | if (cond(_elt)) { \ 824 | _dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho); \ 825 | _dst_hh->key = _src_hh->key; \ 826 | _dst_hh->keylen = _src_hh->keylen; \ 827 | _dst_hh->hashv = _src_hh->hashv; \ 828 | _dst_hh->prev = _last_elt; \ 829 | _dst_hh->next = NULL; \ 830 | if (_last_elt_hh) { _last_elt_hh->next = _elt; } \ 831 | if (!dst) { \ 832 | DECLTYPE_ASSIGN(dst,_elt); \ 833 | HASH_MAKE_TABLE(hh_dst,dst); \ 834 | } else { \ 835 | _dst_hh->tbl = (dst)->hh_dst.tbl; \ 836 | } \ 837 | HASH_TO_BKT(_dst_hh->hashv, _dst_hh->tbl->num_buckets, _dst_bkt); \ 838 | HASH_ADD_TO_BKT(_dst_hh->tbl->buckets[_dst_bkt],_dst_hh); \ 839 | (dst)->hh_dst.tbl->num_items++; \ 840 | _last_elt = _elt; \ 841 | _last_elt_hh = _dst_hh; \ 842 | } \ 843 | } \ 844 | } \ 845 | } \ 846 | HASH_FSCK(hh_dst,dst); \ 847 | } while (0) 848 | 849 | #define HASH_CLEAR(hh,head) \ 850 | do { \ 851 | if (head) { \ 852 | uthash_free((head)->hh.tbl->buckets, \ 853 | (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ 854 | HASH_BLOOM_FREE((head)->hh.tbl); \ 855 | uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 856 | (head)=NULL; \ 857 | } \ 858 | } while(0) 859 | 860 | #define HASH_OVERHEAD(hh,head) \ 861 | (size_t)((((head)->hh.tbl->num_items * sizeof(UT_hash_handle)) + \ 862 | ((head)->hh.tbl->num_buckets * sizeof(UT_hash_bucket)) + \ 863 | (sizeof(UT_hash_table)) + \ 864 | (HASH_BLOOM_BYTELEN))) 865 | 866 | #ifdef NO_DECLTYPE 867 | #define HASH_ITER(hh,head,el,tmp) \ 868 | for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL); \ 869 | el; (el)=(tmp),(*(char**)(&(tmp)))=(char*)((tmp)?(tmp)->hh.next:NULL)) 870 | #else 871 | #define HASH_ITER(hh,head,el,tmp) \ 872 | for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL); \ 873 | el; (el)=(tmp),(tmp)=DECLTYPE(el)((tmp)?(tmp)->hh.next:NULL)) 874 | #endif 875 | 876 | /* obtain a count of items in the hash */ 877 | #define HASH_COUNT(head) HASH_CNT(hh,head) 878 | #define HASH_CNT(hh,head) ((head)?((head)->hh.tbl->num_items):0) 879 | 880 | typedef struct UT_hash_bucket { 881 | struct UT_hash_handle *hh_head; 882 | unsigned count; 883 | 884 | /* expand_mult is normally set to 0. In this situation, the max chain length 885 | * threshold is enforced at its default value, HASH_BKT_CAPACITY_THRESH. (If 886 | * the bucket's chain exceeds this length, bucket expansion is triggered). 887 | * However, setting expand_mult to a non-zero value delays bucket expansion 888 | * (that would be triggered by additions to this particular bucket) 889 | * until its chain length reaches a *multiple* of HASH_BKT_CAPACITY_THRESH. 890 | * (The multiplier is simply expand_mult+1). The whole idea of this 891 | * multiplier is to reduce bucket expansions, since they are expensive, in 892 | * situations where we know that a particular bucket tends to be overused. 893 | * It is better to let its chain length grow to a longer yet-still-bounded 894 | * value, than to do an O(n) bucket expansion too often. 895 | */ 896 | unsigned expand_mult; 897 | 898 | } UT_hash_bucket; 899 | 900 | /* random signature used only to find hash tables in external analysis */ 901 | #define HASH_SIGNATURE 0xa0111fe1 902 | #define HASH_BLOOM_SIGNATURE 0xb12220f2 903 | 904 | typedef struct UT_hash_table { 905 | UT_hash_bucket *buckets; 906 | unsigned num_buckets, log2_num_buckets; 907 | unsigned num_items; 908 | struct UT_hash_handle *tail; /* tail hh in app order, for fast append */ 909 | ptrdiff_t hho; /* hash handle offset (byte pos of hash handle in element */ 910 | 911 | /* in an ideal situation (all buckets used equally), no bucket would have 912 | * more than ceil(#items/#buckets) items. that's the ideal chain length. */ 913 | unsigned ideal_chain_maxlen; 914 | 915 | /* nonideal_items is the number of items in the hash whose chain position 916 | * exceeds the ideal chain maxlen. these items pay the penalty for an uneven 917 | * hash distribution; reaching them in a chain traversal takes >ideal steps */ 918 | unsigned nonideal_items; 919 | 920 | /* ineffective expands occur when a bucket doubling was performed, but 921 | * afterward, more than half the items in the hash had nonideal chain 922 | * positions. If this happens on two consecutive expansions we inhibit any 923 | * further expansion, as it's not helping; this happens when the hash 924 | * function isn't a good fit for the key domain. When expansion is inhibited 925 | * the hash will still work, albeit no longer in constant time. */ 926 | unsigned ineff_expands, noexpand; 927 | 928 | uint32_t signature; /* used only to find hash tables in external analysis */ 929 | #ifdef HASH_BLOOM 930 | uint32_t bloom_sig; /* used only to test bloom exists in external analysis */ 931 | uint8_t *bloom_bv; 932 | char bloom_nbits; 933 | #endif 934 | 935 | } UT_hash_table; 936 | 937 | typedef struct UT_hash_handle { 938 | struct UT_hash_table *tbl; 939 | void *prev; /* prev element in app order */ 940 | void *next; /* next element in app order */ 941 | struct UT_hash_handle *hh_prev; /* previous hh in bucket order */ 942 | struct UT_hash_handle *hh_next; /* next hh in bucket order */ 943 | void *key; /* ptr to enclosing struct's key */ 944 | unsigned keylen; /* enclosing struct's key len */ 945 | unsigned hashv; /* result of hash-fcn(key) */ 946 | } UT_hash_handle; 947 | 948 | #endif /* UTHASH_H */ 949 | -------------------------------------------------------------------------------- /utlist.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2007-2013, Troy D. Hanson http://troydhanson.github.com/uthash/ 3 | All rights reserved. 4 | 5 | Redistribution and use in source and binary forms, with or without 6 | modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | 11 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 12 | IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 13 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 14 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 15 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 16 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 17 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 18 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 19 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 20 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 22 | */ 23 | 24 | #ifndef UTLIST_H 25 | #define UTLIST_H 26 | 27 | #define UTLIST_VERSION 1.9.8 28 | 29 | #include 30 | 31 | /* 32 | * This file contains macros to manipulate singly and doubly-linked lists. 33 | * 34 | * 1. LL_ macros: singly-linked lists. 35 | * 2. DL_ macros: doubly-linked lists. 36 | * 3. CDL_ macros: circular doubly-linked lists. 37 | * 38 | * To use singly-linked lists, your structure must have a "next" pointer. 39 | * To use doubly-linked lists, your structure must "prev" and "next" pointers. 40 | * Either way, the pointer to the head of the list must be initialized to NULL. 41 | * 42 | * ----------------.EXAMPLE ------------------------- 43 | * struct item { 44 | * int id; 45 | * struct item *prev, *next; 46 | * } 47 | * 48 | * struct item *list = NULL: 49 | * 50 | * int main() { 51 | * struct item *item; 52 | * ... allocate and populate item ... 53 | * DL_APPEND(list, item); 54 | * } 55 | * -------------------------------------------------- 56 | * 57 | * For doubly-linked lists, the append and delete macros are O(1) 58 | * For singly-linked lists, append and delete are O(n) but prepend is O(1) 59 | * The sort macro is O(n log(n)) for all types of single/double/circular lists. 60 | */ 61 | 62 | /* These macros use decltype or the earlier __typeof GNU extension. 63 | As decltype is only available in newer compilers (VS2010 or gcc 4.3+ 64 | when compiling c++ code), this code uses whatever method is needed 65 | or, for VS2008 where neither is available, uses casting workarounds. */ 66 | #ifdef _MSC_VER /* MS compiler */ 67 | #if _MSC_VER >= 1600 && defined(__cplusplus) /* VS2010 or newer in C++ mode */ 68 | #define LDECLTYPE(x) decltype(x) 69 | #else /* VS2008 or older (or VS2010 in C mode) */ 70 | #define NO_DECLTYPE 71 | #define LDECLTYPE(x) char* 72 | #endif 73 | #elif defined(__ICCARM__) 74 | #define NO_DECLTYPE 75 | #define LDECLTYPE(x) char* 76 | #else /* GNU, Sun and other compilers */ 77 | #define LDECLTYPE(x) __typeof(x) 78 | #endif 79 | 80 | /* for VS2008 we use some workarounds to get around the lack of decltype, 81 | * namely, we always reassign our tmp variable to the list head if we need 82 | * to dereference its prev/next pointers, and save/restore the real head.*/ 83 | #ifdef NO_DECLTYPE 84 | #define _SV(elt,list) _tmp = (char*)(list); {char **_alias = (char**)&(list); *_alias = (elt); } 85 | #define _NEXT(elt,list,next) ((char*)((list)->next)) 86 | #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); } 87 | /* #define _PREV(elt,list,prev) ((char*)((list)->prev)) */ 88 | #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to); } 89 | #define _RS(list) { char **_alias = (char**)&(list); *_alias=_tmp; } 90 | #define _CASTASGN(a,b) { char **_alias = (char**)&(a); *_alias=(char*)(b); } 91 | #else 92 | #define _SV(elt,list) 93 | #define _NEXT(elt,list,next) ((elt)->next) 94 | #define _NEXTASGN(elt,list,to,next) ((elt)->next)=(to) 95 | /* #define _PREV(elt,list,prev) ((elt)->prev) */ 96 | #define _PREVASGN(elt,list,to,prev) ((elt)->prev)=(to) 97 | #define _RS(list) 98 | #define _CASTASGN(a,b) (a)=(b) 99 | #endif 100 | 101 | /****************************************************************************** 102 | * The sort macro is an adaptation of Simon Tatham's O(n log(n)) mergesort * 103 | * Unwieldy variable names used here to avoid shadowing passed-in variables. * 104 | *****************************************************************************/ 105 | #define LL_SORT(list, cmp) \ 106 | LL_SORT2(list, cmp, next) 107 | 108 | #define LL_SORT2(list, cmp, next) \ 109 | do { \ 110 | LDECLTYPE(list) _ls_p; \ 111 | LDECLTYPE(list) _ls_q; \ 112 | LDECLTYPE(list) _ls_e; \ 113 | LDECLTYPE(list) _ls_tail; \ 114 | int _ls_insize, _ls_nmerges, _ls_psize, _ls_qsize, _ls_i, _ls_looping; \ 115 | if (list) { \ 116 | _ls_insize = 1; \ 117 | _ls_looping = 1; \ 118 | while (_ls_looping) { \ 119 | _CASTASGN(_ls_p,list); \ 120 | list = NULL; \ 121 | _ls_tail = NULL; \ 122 | _ls_nmerges = 0; \ 123 | while (_ls_p) { \ 124 | _ls_nmerges++; \ 125 | _ls_q = _ls_p; \ 126 | _ls_psize = 0; \ 127 | for (_ls_i = 0; _ls_i < _ls_insize; _ls_i++) { \ 128 | _ls_psize++; \ 129 | _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list); \ 130 | if (!_ls_q) break; \ 131 | } \ 132 | _ls_qsize = _ls_insize; \ 133 | while (_ls_psize > 0 || (_ls_qsize > 0 && _ls_q)) { \ 134 | if (_ls_psize == 0) { \ 135 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 136 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 137 | } else if (_ls_qsize == 0 || !_ls_q) { \ 138 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 139 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 140 | } else if (cmp(_ls_p,_ls_q) <= 0) { \ 141 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 142 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 143 | } else { \ 144 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 145 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 146 | } \ 147 | if (_ls_tail) { \ 148 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list); \ 149 | } else { \ 150 | _CASTASGN(list,_ls_e); \ 151 | } \ 152 | _ls_tail = _ls_e; \ 153 | } \ 154 | _ls_p = _ls_q; \ 155 | } \ 156 | if (_ls_tail) { \ 157 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,NULL,next); _RS(list); \ 158 | } \ 159 | if (_ls_nmerges <= 1) { \ 160 | _ls_looping=0; \ 161 | } \ 162 | _ls_insize *= 2; \ 163 | } \ 164 | } \ 165 | } while (0) 166 | 167 | 168 | #define DL_SORT(list, cmp) \ 169 | DL_SORT2(list, cmp, prev, next) 170 | 171 | #define DL_SORT2(list, cmp, prev, next) \ 172 | do { \ 173 | LDECLTYPE(list) _ls_p; \ 174 | LDECLTYPE(list) _ls_q; \ 175 | LDECLTYPE(list) _ls_e; \ 176 | LDECLTYPE(list) _ls_tail; \ 177 | int _ls_insize, _ls_nmerges, _ls_psize, _ls_qsize, _ls_i, _ls_looping; \ 178 | if (list) { \ 179 | _ls_insize = 1; \ 180 | _ls_looping = 1; \ 181 | while (_ls_looping) { \ 182 | _CASTASGN(_ls_p,list); \ 183 | list = NULL; \ 184 | _ls_tail = NULL; \ 185 | _ls_nmerges = 0; \ 186 | while (_ls_p) { \ 187 | _ls_nmerges++; \ 188 | _ls_q = _ls_p; \ 189 | _ls_psize = 0; \ 190 | for (_ls_i = 0; _ls_i < _ls_insize; _ls_i++) { \ 191 | _ls_psize++; \ 192 | _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list); \ 193 | if (!_ls_q) break; \ 194 | } \ 195 | _ls_qsize = _ls_insize; \ 196 | while (_ls_psize > 0 || (_ls_qsize > 0 && _ls_q)) { \ 197 | if (_ls_psize == 0) { \ 198 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 199 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 200 | } else if (_ls_qsize == 0 || !_ls_q) { \ 201 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 202 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 203 | } else if (cmp(_ls_p,_ls_q) <= 0) { \ 204 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 205 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 206 | } else { \ 207 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 208 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 209 | } \ 210 | if (_ls_tail) { \ 211 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list); \ 212 | } else { \ 213 | _CASTASGN(list,_ls_e); \ 214 | } \ 215 | _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \ 216 | _ls_tail = _ls_e; \ 217 | } \ 218 | _ls_p = _ls_q; \ 219 | } \ 220 | _CASTASGN(list->prev, _ls_tail); \ 221 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,NULL,next); _RS(list); \ 222 | if (_ls_nmerges <= 1) { \ 223 | _ls_looping=0; \ 224 | } \ 225 | _ls_insize *= 2; \ 226 | } \ 227 | } \ 228 | } while (0) 229 | 230 | #define CDL_SORT(list, cmp) \ 231 | CDL_SORT2(list, cmp, prev, next) 232 | 233 | #define CDL_SORT2(list, cmp, prev, next) \ 234 | do { \ 235 | LDECLTYPE(list) _ls_p; \ 236 | LDECLTYPE(list) _ls_q; \ 237 | LDECLTYPE(list) _ls_e; \ 238 | LDECLTYPE(list) _ls_tail; \ 239 | LDECLTYPE(list) _ls_oldhead; \ 240 | LDECLTYPE(list) _tmp; \ 241 | int _ls_insize, _ls_nmerges, _ls_psize, _ls_qsize, _ls_i, _ls_looping; \ 242 | if (list) { \ 243 | _ls_insize = 1; \ 244 | _ls_looping = 1; \ 245 | while (_ls_looping) { \ 246 | _CASTASGN(_ls_p,list); \ 247 | _CASTASGN(_ls_oldhead,list); \ 248 | list = NULL; \ 249 | _ls_tail = NULL; \ 250 | _ls_nmerges = 0; \ 251 | while (_ls_p) { \ 252 | _ls_nmerges++; \ 253 | _ls_q = _ls_p; \ 254 | _ls_psize = 0; \ 255 | for (_ls_i = 0; _ls_i < _ls_insize; _ls_i++) { \ 256 | _ls_psize++; \ 257 | _SV(_ls_q,list); \ 258 | if (_NEXT(_ls_q,list,next) == _ls_oldhead) { \ 259 | _ls_q = NULL; \ 260 | } else { \ 261 | _ls_q = _NEXT(_ls_q,list,next); \ 262 | } \ 263 | _RS(list); \ 264 | if (!_ls_q) break; \ 265 | } \ 266 | _ls_qsize = _ls_insize; \ 267 | while (_ls_psize > 0 || (_ls_qsize > 0 && _ls_q)) { \ 268 | if (_ls_psize == 0) { \ 269 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 270 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 271 | if (_ls_q == _ls_oldhead) { _ls_q = NULL; } \ 272 | } else if (_ls_qsize == 0 || !_ls_q) { \ 273 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 274 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 275 | if (_ls_p == _ls_oldhead) { _ls_p = NULL; } \ 276 | } else if (cmp(_ls_p,_ls_q) <= 0) { \ 277 | _ls_e = _ls_p; _SV(_ls_p,list); _ls_p = \ 278 | _NEXT(_ls_p,list,next); _RS(list); _ls_psize--; \ 279 | if (_ls_p == _ls_oldhead) { _ls_p = NULL; } \ 280 | } else { \ 281 | _ls_e = _ls_q; _SV(_ls_q,list); _ls_q = \ 282 | _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--; \ 283 | if (_ls_q == _ls_oldhead) { _ls_q = NULL; } \ 284 | } \ 285 | if (_ls_tail) { \ 286 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list); \ 287 | } else { \ 288 | _CASTASGN(list,_ls_e); \ 289 | } \ 290 | _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \ 291 | _ls_tail = _ls_e; \ 292 | } \ 293 | _ls_p = _ls_q; \ 294 | } \ 295 | _CASTASGN(list->prev,_ls_tail); \ 296 | _CASTASGN(_tmp,list); \ 297 | _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_tmp,next); _RS(list); \ 298 | if (_ls_nmerges <= 1) { \ 299 | _ls_looping=0; \ 300 | } \ 301 | _ls_insize *= 2; \ 302 | } \ 303 | } \ 304 | } while (0) 305 | 306 | /****************************************************************************** 307 | * singly linked list macros (non-circular) * 308 | *****************************************************************************/ 309 | #define LL_PREPEND(head,add) \ 310 | LL_PREPEND2(head,add,next) 311 | 312 | #define LL_PREPEND2(head,add,next) \ 313 | do { \ 314 | (add)->next = head; \ 315 | head = add; \ 316 | } while (0) 317 | 318 | #define LL_CONCAT(head1,head2) \ 319 | LL_CONCAT2(head1,head2,next) 320 | 321 | #define LL_CONCAT2(head1,head2,next) \ 322 | do { \ 323 | LDECLTYPE(head1) _tmp; \ 324 | if (head1) { \ 325 | _tmp = head1; \ 326 | while (_tmp->next) { _tmp = _tmp->next; } \ 327 | _tmp->next=(head2); \ 328 | } else { \ 329 | (head1)=(head2); \ 330 | } \ 331 | } while (0) 332 | 333 | #define LL_APPEND(head,add) \ 334 | LL_APPEND2(head,add,next) 335 | 336 | #define LL_APPEND2(head,add,next) \ 337 | do { \ 338 | LDECLTYPE(head) _tmp; \ 339 | (add)->next=NULL; \ 340 | if (head) { \ 341 | _tmp = head; \ 342 | while (_tmp->next) { _tmp = _tmp->next; } \ 343 | _tmp->next=(add); \ 344 | } else { \ 345 | (head)=(add); \ 346 | } \ 347 | } while (0) 348 | 349 | #define LL_DELETE(head,del) \ 350 | LL_DELETE2(head,del,next) 351 | 352 | #define LL_DELETE2(head,del,next) \ 353 | do { \ 354 | LDECLTYPE(head) _tmp; \ 355 | if ((head) == (del)) { \ 356 | (head)=(head)->next; \ 357 | } else { \ 358 | _tmp = head; \ 359 | while (_tmp->next && (_tmp->next != (del))) { \ 360 | _tmp = _tmp->next; \ 361 | } \ 362 | if (_tmp->next) { \ 363 | _tmp->next = ((del)->next); \ 364 | } \ 365 | } \ 366 | } while (0) 367 | 368 | /* Here are VS2008 replacements for LL_APPEND and LL_DELETE */ 369 | #define LL_APPEND_VS2008(head,add) \ 370 | LL_APPEND2_VS2008(head,add,next) 371 | 372 | #define LL_APPEND2_VS2008(head,add,next) \ 373 | do { \ 374 | if (head) { \ 375 | (add)->next = head; /* use add->next as a temp variable */ \ 376 | while ((add)->next->next) { (add)->next = (add)->next->next; } \ 377 | (add)->next->next=(add); \ 378 | } else { \ 379 | (head)=(add); \ 380 | } \ 381 | (add)->next=NULL; \ 382 | } while (0) 383 | 384 | #define LL_DELETE_VS2008(head,del) \ 385 | LL_DELETE2_VS2008(head,del,next) 386 | 387 | #define LL_DELETE2_VS2008(head,del,next) \ 388 | do { \ 389 | if ((head) == (del)) { \ 390 | (head)=(head)->next; \ 391 | } else { \ 392 | char *_tmp = (char*)(head); \ 393 | while ((head)->next && ((head)->next != (del))) { \ 394 | head = (head)->next; \ 395 | } \ 396 | if ((head)->next) { \ 397 | (head)->next = ((del)->next); \ 398 | } \ 399 | { \ 400 | char **_head_alias = (char**)&(head); \ 401 | *_head_alias = _tmp; \ 402 | } \ 403 | } \ 404 | } while (0) 405 | #ifdef NO_DECLTYPE 406 | #undef LL_APPEND 407 | #define LL_APPEND LL_APPEND_VS2008 408 | #undef LL_DELETE 409 | #define LL_DELETE LL_DELETE_VS2008 410 | #undef LL_DELETE2 411 | #define LL_DELETE2 LL_DELETE2_VS2008 412 | #undef LL_APPEND2 413 | #define LL_APPEND2 LL_APPEND2_VS2008 414 | #undef LL_CONCAT /* no LL_CONCAT_VS2008 */ 415 | #undef DL_CONCAT /* no DL_CONCAT_VS2008 */ 416 | #endif 417 | /* end VS2008 replacements */ 418 | 419 | #define LL_COUNT(head,el,counter) \ 420 | LL_COUNT2(head,el,counter,next) \ 421 | 422 | #define LL_COUNT2(head,el,counter,next) \ 423 | { \ 424 | counter = 0; \ 425 | LL_FOREACH2(head,el,next){ ++counter; } \ 426 | } 427 | 428 | #define LL_FOREACH(head,el) \ 429 | LL_FOREACH2(head,el,next) 430 | 431 | #define LL_FOREACH2(head,el,next) \ 432 | for(el=head;el;el=(el)->next) 433 | 434 | #define LL_FOREACH_SAFE(head,el,tmp) \ 435 | LL_FOREACH_SAFE2(head,el,tmp,next) 436 | 437 | #define LL_FOREACH_SAFE2(head,el,tmp,next) \ 438 | for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) 439 | 440 | #define LL_SEARCH_SCALAR(head,out,field,val) \ 441 | LL_SEARCH_SCALAR2(head,out,field,val,next) 442 | 443 | #define LL_SEARCH_SCALAR2(head,out,field,val,next) \ 444 | do { \ 445 | LL_FOREACH2(head,out,next) { \ 446 | if ((out)->field == (val)) break; \ 447 | } \ 448 | } while(0) 449 | 450 | #define LL_SEARCH(head,out,elt,cmp) \ 451 | LL_SEARCH2(head,out,elt,cmp,next) 452 | 453 | #define LL_SEARCH2(head,out,elt,cmp,next) \ 454 | do { \ 455 | LL_FOREACH2(head,out,next) { \ 456 | if ((cmp(out,elt))==0) break; \ 457 | } \ 458 | } while(0) 459 | 460 | #define LL_REPLACE_ELEM(head, el, add) \ 461 | do { \ 462 | LDECLTYPE(head) _tmp; \ 463 | assert(head != NULL); \ 464 | assert(el != NULL); \ 465 | assert(add != NULL); \ 466 | (add)->next = (el)->next; \ 467 | if ((head) == (el)) { \ 468 | (head) = (add); \ 469 | } else { \ 470 | _tmp = head; \ 471 | while (_tmp->next && (_tmp->next != (el))) { \ 472 | _tmp = _tmp->next; \ 473 | } \ 474 | if (_tmp->next) { \ 475 | _tmp->next = (add); \ 476 | } \ 477 | } \ 478 | } while (0) 479 | 480 | #define LL_PREPEND_ELEM(head, el, add) \ 481 | do { \ 482 | LDECLTYPE(head) _tmp; \ 483 | assert(head != NULL); \ 484 | assert(el != NULL); \ 485 | assert(add != NULL); \ 486 | (add)->next = (el); \ 487 | if ((head) == (el)) { \ 488 | (head) = (add); \ 489 | } else { \ 490 | _tmp = head; \ 491 | while (_tmp->next && (_tmp->next != (el))) { \ 492 | _tmp = _tmp->next; \ 493 | } \ 494 | if (_tmp->next) { \ 495 | _tmp->next = (add); \ 496 | } \ 497 | } \ 498 | } while (0) \ 499 | 500 | 501 | /****************************************************************************** 502 | * doubly linked list macros (non-circular) * 503 | *****************************************************************************/ 504 | #define DL_PREPEND(head,add) \ 505 | DL_PREPEND2(head,add,prev,next) 506 | 507 | #define DL_PREPEND2(head,add,prev,next) \ 508 | do { \ 509 | (add)->next = head; \ 510 | if (head) { \ 511 | (add)->prev = (head)->prev; \ 512 | (head)->prev = (add); \ 513 | } else { \ 514 | (add)->prev = (add); \ 515 | } \ 516 | (head) = (add); \ 517 | } while (0) 518 | 519 | #define DL_APPEND(head,add) \ 520 | DL_APPEND2(head,add,prev,next) 521 | 522 | #define DL_APPEND2(head,add,prev,next) \ 523 | do { \ 524 | if (head) { \ 525 | (add)->prev = (head)->prev; \ 526 | (head)->prev->next = (add); \ 527 | (head)->prev = (add); \ 528 | (add)->next = NULL; \ 529 | } else { \ 530 | (head)=(add); \ 531 | (head)->prev = (head); \ 532 | (head)->next = NULL; \ 533 | } \ 534 | } while (0) 535 | 536 | #define DL_CONCAT(head1,head2) \ 537 | DL_CONCAT2(head1,head2,prev,next) 538 | 539 | #define DL_CONCAT2(head1,head2,prev,next) \ 540 | do { \ 541 | LDECLTYPE(head1) _tmp; \ 542 | if (head2) { \ 543 | if (head1) { \ 544 | _tmp = (head2)->prev; \ 545 | (head2)->prev = (head1)->prev; \ 546 | (head1)->prev->next = (head2); \ 547 | (head1)->prev = _tmp; \ 548 | } else { \ 549 | (head1)=(head2); \ 550 | } \ 551 | } \ 552 | } while (0) 553 | 554 | #define DL_DELETE(head,del) \ 555 | DL_DELETE2(head,del,prev,next) 556 | 557 | #define DL_DELETE2(head,del,prev,next) \ 558 | do { \ 559 | assert((del)->prev != NULL); \ 560 | if ((del)->prev == (del)) { \ 561 | (head)=NULL; \ 562 | } else if ((del)==(head)) { \ 563 | (del)->next->prev = (del)->prev; \ 564 | (head) = (del)->next; \ 565 | } else { \ 566 | (del)->prev->next = (del)->next; \ 567 | if ((del)->next) { \ 568 | (del)->next->prev = (del)->prev; \ 569 | } else { \ 570 | (head)->prev = (del)->prev; \ 571 | } \ 572 | } \ 573 | } while (0) 574 | 575 | #define DL_COUNT(head,el,counter) \ 576 | DL_COUNT2(head,el,counter,next) \ 577 | 578 | #define DL_COUNT2(head,el,counter,next) \ 579 | { \ 580 | counter = 0; \ 581 | DL_FOREACH2(head,el,next){ ++counter; } \ 582 | } 583 | 584 | #define DL_FOREACH(head,el) \ 585 | DL_FOREACH2(head,el,next) 586 | 587 | #define DL_FOREACH2(head,el,next) \ 588 | for(el=head;el;el=(el)->next) 589 | 590 | /* this version is safe for deleting the elements during iteration */ 591 | #define DL_FOREACH_SAFE(head,el,tmp) \ 592 | DL_FOREACH_SAFE2(head,el,tmp,next) 593 | 594 | #define DL_FOREACH_SAFE2(head,el,tmp,next) \ 595 | for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp) 596 | 597 | /* these are identical to their singly-linked list counterparts */ 598 | #define DL_SEARCH_SCALAR LL_SEARCH_SCALAR 599 | #define DL_SEARCH LL_SEARCH 600 | #define DL_SEARCH_SCALAR2 LL_SEARCH_SCALAR2 601 | #define DL_SEARCH2 LL_SEARCH2 602 | 603 | #define DL_REPLACE_ELEM(head, el, add) \ 604 | do { \ 605 | assert(head != NULL); \ 606 | assert(el != NULL); \ 607 | assert(add != NULL); \ 608 | if ((head) == (el)) { \ 609 | (head) = (add); \ 610 | (add)->next = (el)->next; \ 611 | if ((el)->next == NULL) { \ 612 | (add)->prev = (add); \ 613 | } else { \ 614 | (add)->prev = (el)->prev; \ 615 | (add)->next->prev = (add); \ 616 | } \ 617 | } else { \ 618 | (add)->next = (el)->next; \ 619 | (add)->prev = (el)->prev; \ 620 | (add)->prev->next = (add); \ 621 | if ((el)->next == NULL) { \ 622 | (head)->prev = (add); \ 623 | } else { \ 624 | (add)->next->prev = (add); \ 625 | } \ 626 | } \ 627 | } while (0) 628 | 629 | #define DL_PREPEND_ELEM(head, el, add) \ 630 | do { \ 631 | assert(head != NULL); \ 632 | assert(el != NULL); \ 633 | assert(add != NULL); \ 634 | (add)->next = (el); \ 635 | (add)->prev = (el)->prev; \ 636 | (el)->prev = (add); \ 637 | if ((head) == (el)) { \ 638 | (head) = (add); \ 639 | } else { \ 640 | (add)->prev->next = (add); \ 641 | } \ 642 | } while (0) \ 643 | 644 | 645 | /****************************************************************************** 646 | * circular doubly linked list macros * 647 | *****************************************************************************/ 648 | #define CDL_PREPEND(head,add) \ 649 | CDL_PREPEND2(head,add,prev,next) 650 | 651 | #define CDL_PREPEND2(head,add,prev,next) \ 652 | do { \ 653 | if (head) { \ 654 | (add)->prev = (head)->prev; \ 655 | (add)->next = (head); \ 656 | (head)->prev = (add); \ 657 | (add)->prev->next = (add); \ 658 | } else { \ 659 | (add)->prev = (add); \ 660 | (add)->next = (add); \ 661 | } \ 662 | (head)=(add); \ 663 | } while (0) 664 | 665 | #define CDL_DELETE(head,del) \ 666 | CDL_DELETE2(head,del,prev,next) 667 | 668 | #define CDL_DELETE2(head,del,prev,next) \ 669 | do { \ 670 | if ( ((head)==(del)) && ((head)->next == (head))) { \ 671 | (head) = 0L; \ 672 | } else { \ 673 | (del)->next->prev = (del)->prev; \ 674 | (del)->prev->next = (del)->next; \ 675 | if ((del) == (head)) (head)=(del)->next; \ 676 | } \ 677 | } while (0) 678 | 679 | #define CDL_COUNT(head,el,counter) \ 680 | CDL_COUNT2(head,el,counter,next) \ 681 | 682 | #define CDL_COUNT2(head, el, counter,next) \ 683 | { \ 684 | counter = 0; \ 685 | CDL_FOREACH2(head,el,next){ ++counter; } \ 686 | } 687 | 688 | #define CDL_FOREACH(head,el) \ 689 | CDL_FOREACH2(head,el,next) 690 | 691 | #define CDL_FOREACH2(head,el,next) \ 692 | for(el=head;el;el=((el)->next==head ? 0L : (el)->next)) 693 | 694 | #define CDL_FOREACH_SAFE(head,el,tmp1,tmp2) \ 695 | CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) 696 | 697 | #define CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next) \ 698 | for((el)=(head), ((tmp1)=(head)?((head)->prev):NULL); \ 699 | (el) && ((tmp2)=(el)->next, 1); \ 700 | ((el) = (((el)==(tmp1)) ? 0L : (tmp2)))) 701 | 702 | #define CDL_SEARCH_SCALAR(head,out,field,val) \ 703 | CDL_SEARCH_SCALAR2(head,out,field,val,next) 704 | 705 | #define CDL_SEARCH_SCALAR2(head,out,field,val,next) \ 706 | do { \ 707 | CDL_FOREACH2(head,out,next) { \ 708 | if ((out)->field == (val)) break; \ 709 | } \ 710 | } while(0) 711 | 712 | #define CDL_SEARCH(head,out,elt,cmp) \ 713 | CDL_SEARCH2(head,out,elt,cmp,next) 714 | 715 | #define CDL_SEARCH2(head,out,elt,cmp,next) \ 716 | do { \ 717 | CDL_FOREACH2(head,out,next) { \ 718 | if ((cmp(out,elt))==0) break; \ 719 | } \ 720 | } while(0) 721 | 722 | #define CDL_REPLACE_ELEM(head, el, add) \ 723 | do { \ 724 | assert(head != NULL); \ 725 | assert(el != NULL); \ 726 | assert(add != NULL); \ 727 | if ((el)->next == (el)) { \ 728 | (add)->next = (add); \ 729 | (add)->prev = (add); \ 730 | (head) = (add); \ 731 | } else { \ 732 | (add)->next = (el)->next; \ 733 | (add)->prev = (el)->prev; \ 734 | (add)->next->prev = (add); \ 735 | (add)->prev->next = (add); \ 736 | if ((head) == (el)) { \ 737 | (head) = (add); \ 738 | } \ 739 | } \ 740 | } while (0) 741 | 742 | #define CDL_PREPEND_ELEM(head, el, add) \ 743 | do { \ 744 | assert(head != NULL); \ 745 | assert(el != NULL); \ 746 | assert(add != NULL); \ 747 | (add)->next = (el); \ 748 | (add)->prev = (el)->prev; \ 749 | (el)->prev = (add); \ 750 | (add)->prev->next = (add); \ 751 | if ((head) == (el)) { \ 752 | (head) = (add); \ 753 | } \ 754 | } while (0) \ 755 | 756 | #endif /* UTLIST_H */ 757 | 758 | -------------------------------------------------------------------------------- /utstring.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright (c) 2008-2013, Troy D. Hanson http://troydhanson.github.com/uthash/ 3 | All rights reserved. 4 | 5 | Redistribution and use in source and binary forms, with or without 6 | modification, are permitted provided that the following conditions are met: 7 | 8 | * Redistributions of source code must retain the above copyright 9 | notice, this list of conditions and the following disclaimer. 10 | 11 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 12 | IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 13 | TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 14 | PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 15 | OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 16 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 17 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 18 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 19 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 20 | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 22 | */ 23 | 24 | /* a dynamic string implementation using macros 25 | */ 26 | #ifndef UTSTRING_H 27 | #define UTSTRING_H 28 | 29 | #define UTSTRING_VERSION 1.9.8 30 | 31 | #ifdef __GNUC__ 32 | #define _UNUSED_ __attribute__ ((__unused__)) 33 | #else 34 | #define _UNUSED_ 35 | #endif 36 | 37 | #include 38 | #include 39 | #include 40 | #define oom() exit(-1) 41 | 42 | typedef struct { 43 | char *d; 44 | size_t n; /* allocd size */ 45 | size_t i; /* index of first unused byte */ 46 | } UT_string; 47 | 48 | #define utstring_reserve(s,amt) \ 49 | do { \ 50 | if (((s)->n - (s)->i) < (size_t)(amt)) { \ 51 | (s)->d = (char*)realloc((s)->d, (s)->n + amt); \ 52 | if ((s)->d == NULL) oom(); \ 53 | (s)->n += amt; \ 54 | } \ 55 | } while(0) 56 | 57 | #define utstring_init(s) \ 58 | do { \ 59 | (s)->n = 0; (s)->i = 0; (s)->d = NULL; \ 60 | utstring_reserve(s,100); \ 61 | (s)->d[0] = '\0'; \ 62 | } while(0) 63 | 64 | #define utstring_done(s) \ 65 | do { \ 66 | if ((s)->d != NULL) free((s)->d); \ 67 | (s)->n = 0; \ 68 | } while(0) 69 | 70 | #define utstring_free(s) \ 71 | do { \ 72 | utstring_done(s); \ 73 | free(s); \ 74 | } while(0) 75 | 76 | #define utstring_new(s) \ 77 | do { \ 78 | s = (UT_string*)calloc(sizeof(UT_string),1); \ 79 | if (!s) oom(); \ 80 | utstring_init(s); \ 81 | } while(0) 82 | 83 | #define utstring_renew(s) \ 84 | do { \ 85 | if (s) { \ 86 | utstring_clear(s); \ 87 | } else { \ 88 | utstring_new(s); \ 89 | } \ 90 | } while(0) 91 | 92 | #define utstring_clear(s) \ 93 | do { \ 94 | (s)->i = 0; \ 95 | (s)->d[0] = '\0'; \ 96 | } while(0) 97 | 98 | #define utstring_bincpy(s,b,l) \ 99 | do { \ 100 | utstring_reserve((s),(l)+1); \ 101 | if (l) memcpy(&(s)->d[(s)->i], b, l); \ 102 | (s)->i += l; \ 103 | (s)->d[(s)->i]='\0'; \ 104 | } while(0) 105 | 106 | #define utstring_concat(dst,src) \ 107 | do { \ 108 | utstring_reserve((dst),((src)->i)+1); \ 109 | if ((src)->i) memcpy(&(dst)->d[(dst)->i], (src)->d, (src)->i); \ 110 | (dst)->i += (src)->i; \ 111 | (dst)->d[(dst)->i]='\0'; \ 112 | } while(0) 113 | 114 | #define utstring_len(s) ((unsigned)((s)->i)) 115 | 116 | #define utstring_body(s) ((s)->d) 117 | 118 | _UNUSED_ static void utstring_printf_va(UT_string *s, const char *fmt, va_list ap) { 119 | int n; 120 | va_list cp; 121 | while (1) { 122 | #ifdef _WIN32 123 | cp = ap; 124 | #else 125 | va_copy(cp, ap); 126 | #endif 127 | n = vsnprintf (&s->d[s->i], s->n-s->i, fmt, cp); 128 | va_end(cp); 129 | 130 | if ((n > -1) && (n < (int)(s->n-s->i))) { 131 | s->i += n; 132 | return; 133 | } 134 | 135 | /* Else try again with more space. */ 136 | if (n > -1) utstring_reserve(s,n+1); /* exact */ 137 | else utstring_reserve(s,(s->n)*2); /* 2x */ 138 | } 139 | } 140 | #ifdef __GNUC__ 141 | /* support printf format checking (2=the format string, 3=start of varargs) */ 142 | static void utstring_printf(UT_string *s, const char *fmt, ...) 143 | __attribute__ (( format( printf, 2, 3) )); 144 | #endif 145 | _UNUSED_ static void utstring_printf(UT_string *s, const char *fmt, ...) { 146 | va_list ap; 147 | va_start(ap,fmt); 148 | utstring_printf_va(s,fmt,ap); 149 | va_end(ap); 150 | } 151 | 152 | /******************************************************************************* 153 | * begin substring search functions * 154 | ******************************************************************************/ 155 | /* Build KMP table from left to right. */ 156 | _UNUSED_ static void _utstring_BuildTable( 157 | const char *P_Needle, 158 | ssize_t P_NeedleLen, 159 | long *P_KMP_Table) 160 | { 161 | long i, j; 162 | 163 | i = 0; 164 | j = i - 1; 165 | P_KMP_Table[i] = j; 166 | while (i < P_NeedleLen) 167 | { 168 | while ( (j > -1) && (P_Needle[i] != P_Needle[j]) ) 169 | { 170 | j = P_KMP_Table[j]; 171 | } 172 | i++; 173 | j++; 174 | if (i < P_NeedleLen) 175 | { 176 | if (P_Needle[i] == P_Needle[j]) 177 | { 178 | P_KMP_Table[i] = P_KMP_Table[j]; 179 | } 180 | else 181 | { 182 | P_KMP_Table[i] = j; 183 | } 184 | } 185 | else 186 | { 187 | P_KMP_Table[i] = j; 188 | } 189 | } 190 | 191 | return; 192 | } 193 | 194 | 195 | /* Build KMP table from right to left. */ 196 | _UNUSED_ static void _utstring_BuildTableR( 197 | const char *P_Needle, 198 | ssize_t P_NeedleLen, 199 | long *P_KMP_Table) 200 | { 201 | long i, j; 202 | 203 | i = P_NeedleLen - 1; 204 | j = i + 1; 205 | P_KMP_Table[i + 1] = j; 206 | while (i >= 0) 207 | { 208 | while ( (j < P_NeedleLen) && (P_Needle[i] != P_Needle[j]) ) 209 | { 210 | j = P_KMP_Table[j + 1]; 211 | } 212 | i--; 213 | j--; 214 | if (i >= 0) 215 | { 216 | if (P_Needle[i] == P_Needle[j]) 217 | { 218 | P_KMP_Table[i + 1] = P_KMP_Table[j + 1]; 219 | } 220 | else 221 | { 222 | P_KMP_Table[i + 1] = j; 223 | } 224 | } 225 | else 226 | { 227 | P_KMP_Table[i + 1] = j; 228 | } 229 | } 230 | 231 | return; 232 | } 233 | 234 | 235 | /* Search data from left to right. ( Multiple search mode. ) */ 236 | _UNUSED_ static long _utstring_find( 237 | const char *P_Haystack, 238 | size_t P_HaystackLen, 239 | const char *P_Needle, 240 | size_t P_NeedleLen, 241 | long *P_KMP_Table) 242 | { 243 | long i, j; 244 | long V_FindPosition = -1; 245 | 246 | /* Search from left to right. */ 247 | i = j = 0; 248 | while ( (j < (int)P_HaystackLen) && (((P_HaystackLen - j) + i) >= P_NeedleLen) ) 249 | { 250 | while ( (i > -1) && (P_Needle[i] != P_Haystack[j]) ) 251 | { 252 | i = P_KMP_Table[i]; 253 | } 254 | i++; 255 | j++; 256 | if (i >= (int)P_NeedleLen) 257 | { 258 | /* Found. */ 259 | V_FindPosition = j - i; 260 | break; 261 | } 262 | } 263 | 264 | return V_FindPosition; 265 | } 266 | 267 | 268 | /* Search data from right to left. ( Multiple search mode. ) */ 269 | _UNUSED_ static long _utstring_findR( 270 | const char *P_Haystack, 271 | size_t P_HaystackLen, 272 | const char *P_Needle, 273 | size_t P_NeedleLen, 274 | long *P_KMP_Table) 275 | { 276 | long i, j; 277 | long V_FindPosition = -1; 278 | 279 | /* Search from right to left. */ 280 | j = (P_HaystackLen - 1); 281 | i = (P_NeedleLen - 1); 282 | while ( (j >= 0) && (j >= i) ) 283 | { 284 | while ( (i < (int)P_NeedleLen) && (P_Needle[i] != P_Haystack[j]) ) 285 | { 286 | i = P_KMP_Table[i + 1]; 287 | } 288 | i--; 289 | j--; 290 | if (i < 0) 291 | { 292 | /* Found. */ 293 | V_FindPosition = j + 1; 294 | break; 295 | } 296 | } 297 | 298 | return V_FindPosition; 299 | } 300 | 301 | 302 | /* Search data from left to right. ( One time search mode. ) */ 303 | _UNUSED_ static long utstring_find( 304 | UT_string *s, 305 | long P_StartPosition, /* Start from 0. -1 means last position. */ 306 | const char *P_Needle, 307 | ssize_t P_NeedleLen) 308 | { 309 | long V_StartPosition; 310 | long V_HaystackLen; 311 | long *V_KMP_Table; 312 | long V_FindPosition = -1; 313 | 314 | if (P_StartPosition < 0) 315 | { 316 | V_StartPosition = s->i + P_StartPosition; 317 | } 318 | else 319 | { 320 | V_StartPosition = P_StartPosition; 321 | } 322 | V_HaystackLen = s->i - V_StartPosition; 323 | if ( (V_HaystackLen >= P_NeedleLen) && (P_NeedleLen > 0) ) 324 | { 325 | V_KMP_Table = (long *)malloc(sizeof(long) * (P_NeedleLen + 1)); 326 | if (V_KMP_Table != NULL) 327 | { 328 | _utstring_BuildTable(P_Needle, P_NeedleLen, V_KMP_Table); 329 | 330 | V_FindPosition = _utstring_find(s->d + V_StartPosition, 331 | V_HaystackLen, 332 | P_Needle, 333 | P_NeedleLen, 334 | V_KMP_Table); 335 | if (V_FindPosition >= 0) 336 | { 337 | V_FindPosition += V_StartPosition; 338 | } 339 | 340 | free(V_KMP_Table); 341 | } 342 | } 343 | 344 | return V_FindPosition; 345 | } 346 | 347 | 348 | /* Search data from right to left. ( One time search mode. ) */ 349 | _UNUSED_ static long utstring_findR( 350 | UT_string *s, 351 | long P_StartPosition, /* Start from 0. -1 means last position. */ 352 | const char *P_Needle, 353 | ssize_t P_NeedleLen) 354 | { 355 | long V_StartPosition; 356 | long V_HaystackLen; 357 | long *V_KMP_Table; 358 | long V_FindPosition = -1; 359 | 360 | if (P_StartPosition < 0) 361 | { 362 | V_StartPosition = s->i + P_StartPosition; 363 | } 364 | else 365 | { 366 | V_StartPosition = P_StartPosition; 367 | } 368 | V_HaystackLen = V_StartPosition + 1; 369 | if ( (V_HaystackLen >= P_NeedleLen) && (P_NeedleLen > 0) ) 370 | { 371 | V_KMP_Table = (long *)malloc(sizeof(long) * (P_NeedleLen + 1)); 372 | if (V_KMP_Table != NULL) 373 | { 374 | _utstring_BuildTableR(P_Needle, P_NeedleLen, V_KMP_Table); 375 | 376 | V_FindPosition = _utstring_findR(s->d, 377 | V_HaystackLen, 378 | P_Needle, 379 | P_NeedleLen, 380 | V_KMP_Table); 381 | 382 | free(V_KMP_Table); 383 | } 384 | } 385 | 386 | return V_FindPosition; 387 | } 388 | /******************************************************************************* 389 | * end substring search functions * 390 | ******************************************************************************/ 391 | 392 | #endif /* UTSTRING_H */ 393 | --------------------------------------------------------------------------------