|
| 1 | +#include "phpx.h" |
| 2 | + |
| 3 | +extern "C" |
| 4 | +{ |
| 5 | +#include <php_swoole.h> |
| 6 | +#include <swoole.h> |
| 7 | +extern void MurmurHash3_x64_128(const void * key, const int len, const uint32_t seed, void *out); |
| 8 | +extern void SpookyHash128(const void *key, size_t len, uint64_t seed1, uint64_t seed2, uint64_t *hash1, uint64_t *hash2); |
| 9 | +} |
| 10 | + |
| 11 | +#include <iostream> |
| 12 | + |
| 13 | +using namespace php; |
| 14 | +using namespace std; |
| 15 | + |
| 16 | +struct BloomFilterObject |
| 17 | +{ |
| 18 | + size_t capacity; |
| 19 | + char *array; |
| 20 | + uint32_t k_num; |
| 21 | + uint64_t bit_num; |
| 22 | + uint64_t *hashes; |
| 23 | + swLock lock; |
| 24 | +}; |
| 25 | + |
| 26 | +#define RESOURCE_NAME "BloomFilterResource" |
| 27 | +#define PROPERTY_NAME "ptr" |
| 28 | + |
| 29 | +static void compute_hashes(uint32_t k_num, char *key, size_t len, uint64_t *hashes) |
| 30 | +{ |
| 31 | + uint64_t out[2]; |
| 32 | + MurmurHash3_x64_128(key, len, 0, out); |
| 33 | + |
| 34 | + hashes[0] = out[0]; |
| 35 | + hashes[1] = out[1]; |
| 36 | + |
| 37 | + uint64_t *hash1 = out; |
| 38 | + uint64_t *hash2 = hash1 + 1; |
| 39 | + SpookyHash128(key, len, 0, 0, hash1, hash2); |
| 40 | + |
| 41 | + hashes[2] = out[0]; |
| 42 | + hashes[3] = out[1]; |
| 43 | + |
| 44 | + for (uint32_t i = 4; i < k_num; i++) |
| 45 | + { |
| 46 | + hashes[i] = hashes[1] + ((i * hashes[3]) % 18446744073709551557U); |
| 47 | + } |
| 48 | +} |
| 49 | + |
| 50 | +static void BloomFilterResDtor(zend_resource *res) |
| 51 | +{ |
| 52 | + BloomFilterObject *bf = static_cast<BloomFilterObject *>(res->ptr); |
| 53 | + efree(bf->hashes); |
| 54 | + bf->lock.free(&bf->lock); |
| 55 | + sw_shm_free(bf); |
| 56 | +} |
| 57 | + |
| 58 | +static PHPX_METHOD(BloomFilter, __construct) |
| 59 | +{ |
| 60 | + long capacity = args[0].toInt(); |
| 61 | + if (capacity <= 0) |
| 62 | + { |
| 63 | + capacity = 65536; |
| 64 | + } |
| 65 | + |
| 66 | + uint32_t k_num = 2; |
| 67 | + if (args.exists(1)) |
| 68 | + { |
| 69 | + k_num = (uint32_t) args[1].toInt(); |
| 70 | + } |
| 71 | + |
| 72 | + BloomFilterObject *bf = (BloomFilterObject *) sw_shm_malloc(sizeof(BloomFilterObject) + capacity); |
| 73 | + if (bf == NULL) |
| 74 | + { |
| 75 | + throwException("RuntimeException", "sw_shm_malloc() failed."); |
| 76 | + } |
| 77 | + bf->capacity = capacity; |
| 78 | + bf->array = (char *) (bf + 1); |
| 79 | + bzero(bf->array, bf->capacity); |
| 80 | + |
| 81 | + bf->hashes = (uint64_t*) ecalloc(k_num, sizeof(uint64_t)); |
| 82 | + if (bf->hashes == NULL) |
| 83 | + { |
| 84 | + throwException("RuntimeException", "ecalloc() failed."); |
| 85 | + } |
| 86 | + bf->bit_num = bf->capacity * 8; |
| 87 | + bf->k_num = k_num; |
| 88 | + |
| 89 | + if (swRWLock_create(&bf->lock, 1) < 0) |
| 90 | + { |
| 91 | + throwException("RuntimeException", "swRWLock_create() failed."); |
| 92 | + } |
| 93 | + |
| 94 | + _this.oSet(PROPERTY_NAME, RESOURCE_NAME, bf); |
| 95 | +} |
| 96 | + |
| 97 | +PHPX_METHOD(BloomFilter, has) |
| 98 | +{ |
| 99 | + BloomFilterObject *bf = _this.oGet<BloomFilterObject>(PROPERTY_NAME, RESOURCE_NAME); |
| 100 | + auto key = args[0]; |
| 101 | + compute_hashes(bf->k_num, key.toCString(), key.length(), bf->hashes); |
| 102 | + |
| 103 | + uint32_t i; |
| 104 | + uint32_t n; |
| 105 | + bool miss; |
| 106 | + |
| 107 | + bf->lock.lock_rd(&bf->lock); |
| 108 | + for (i = 0; i < bf->k_num; i++) |
| 109 | + { |
| 110 | + n = bf->hashes[i] % bf->bit_num; |
| 111 | + miss = !(bf->array[n / 8] & (1 << (n % 8))); |
| 112 | + if (miss) |
| 113 | + { |
| 114 | + bf->lock.unlock(&bf->lock); |
| 115 | + retval = false; |
| 116 | + return; |
| 117 | + } |
| 118 | + } |
| 119 | + bf->lock.unlock(&bf->lock); |
| 120 | + retval = true; |
| 121 | +} |
| 122 | + |
| 123 | +static PHPX_METHOD(BloomFilter, add) |
| 124 | +{ |
| 125 | + BloomFilterObject *bf = _this.oGet<BloomFilterObject>(PROPERTY_NAME, RESOURCE_NAME); |
| 126 | + auto key = args[0]; |
| 127 | + compute_hashes(bf->k_num, key.toCString(), key.length(), bf->hashes); |
| 128 | + |
| 129 | + uint32_t i; |
| 130 | + uint32_t n; |
| 131 | + |
| 132 | + bf->lock.lock(&bf->lock); |
| 133 | + for (i = 0; i < bf->k_num; i++) |
| 134 | + { |
| 135 | + n = bf->hashes[i] % bf->bit_num; |
| 136 | + bf->array[n / 8] |= (1 << (n % 8)); |
| 137 | + } |
| 138 | + bf->lock.unlock(&bf->lock); |
| 139 | +} |
| 140 | + |
| 141 | +static PHPX_METHOD(BloomFilter, clear) |
| 142 | +{ |
| 143 | + BloomFilterObject *bf = _this.oGet<BloomFilterObject>(PROPERTY_NAME, RESOURCE_NAME); |
| 144 | + bf->lock.lock(&bf->lock); |
| 145 | + bzero(bf->array, bf->capacity); |
| 146 | + bf->lock.unlock(&bf->lock); |
| 147 | +} |
| 148 | + |
| 149 | +static PHPX_METHOD(BloomFilter, dump) |
| 150 | +{ |
| 151 | + BloomFilterObject *bf = _this.oGet<BloomFilterObject>(PROPERTY_NAME, RESOURCE_NAME); |
| 152 | + auto file = args[0].toCString(); |
| 153 | + |
| 154 | + bf->lock.lock(&bf->lock); |
| 155 | + int fd = open(file, O_CREAT | O_WRONLY, 0644); |
| 156 | + if (fd < 0) |
| 157 | + { |
| 158 | + fail: bf->lock.unlock(&bf->lock); |
| 159 | + retval = false; |
| 160 | + if (fd >= 0) |
| 161 | + { |
| 162 | + close(fd); |
| 163 | + unlink(file); |
| 164 | + } |
| 165 | + return; |
| 166 | + } |
| 167 | + if (swoole_sync_writefile(fd, &bf->capacity, sizeof(bf->capacity)) < 0) |
| 168 | + { |
| 169 | + goto fail; |
| 170 | + } |
| 171 | + if (swoole_sync_writefile(fd, bf->array, bf->capacity) < 0) |
| 172 | + { |
| 173 | + goto fail; |
| 174 | + } |
| 175 | + bf->lock.unlock(&bf->lock); |
| 176 | + close(fd); |
| 177 | + retval = true; |
| 178 | +} |
| 179 | + |
| 180 | +static PHPX_METHOD(BloomFilter, load) |
| 181 | +{ |
| 182 | + auto file = args[0].toCString(); |
| 183 | + int fd = open(file, O_RDONLY); |
| 184 | + if (fd < 0) |
| 185 | + { |
| 186 | + fail: retval = false; |
| 187 | + if (fd >= 0) |
| 188 | + { |
| 189 | + close(fd); |
| 190 | + } |
| 191 | + return; |
| 192 | + } |
| 193 | + |
| 194 | + size_t capacity; |
| 195 | + if (swoole_sync_readfile(fd, &capacity, sizeof(capacity)) < 0) |
| 196 | + { |
| 197 | + goto fail; |
| 198 | + } |
| 199 | + |
| 200 | + long filesize = swoole_file_size(file); |
| 201 | + if (filesize < 0 || filesize < capacity + sizeof(capacity)) |
| 202 | + { |
| 203 | + goto fail; |
| 204 | + } |
| 205 | + |
| 206 | + auto o = newObject("BloomFilter", (long) capacity); |
| 207 | + BloomFilterObject *bf = o.oGet<BloomFilterObject>(PROPERTY_NAME, RESOURCE_NAME); |
| 208 | + if (swoole_sync_readfile(fd, bf->array, capacity) < 0) |
| 209 | + { |
| 210 | + goto fail; |
| 211 | + } |
| 212 | + close(fd); |
| 213 | + retval = o; |
| 214 | +} |
| 215 | + |
| 216 | +PHPX_EXTENSION() |
| 217 | +{ |
| 218 | + Extension *extension = new Extension("BloomFilter", "1.0.1"); |
| 219 | + |
| 220 | + extension->onStart = [extension]() noexcept |
| 221 | + { |
| 222 | + extension->registerConstant("BLOOMFILTER_VERSION", 10001); |
| 223 | + |
| 224 | + Class *c = new Class("BloomFilter"); |
| 225 | + c->addMethod(PHPX_ME(BloomFilter, __construct), CONSTRUCT); |
| 226 | + c->addMethod(PHPX_ME(BloomFilter, add)); |
| 227 | + c->addMethod(PHPX_ME(BloomFilter, has)); |
| 228 | + c->addMethod(PHPX_ME(BloomFilter, clear)); |
| 229 | + c->addMethod(PHPX_ME(BloomFilter, load), STATIC); |
| 230 | + c->addMethod(PHPX_ME(BloomFilter, dump)); |
| 231 | + |
| 232 | + extension->registerClass(c); |
| 233 | + extension->registerResource(RESOURCE_NAME, BloomFilterResDtor); |
| 234 | + }; |
| 235 | + |
| 236 | + extension->require("swoole"); |
| 237 | + |
| 238 | + extension->info({"BloomFilter support", "enabled"}, |
| 239 | + { |
| 240 | + {"author", "Tianfeng Han"}, |
| 241 | + {"version", extension->version}, |
| 242 | + {"date", "2018-01-10"}, |
| 243 | + }); |
| 244 | + |
| 245 | + return extension; |
| 246 | +} |
0 commit comments