Home
last modified time | relevance | path

Searched defs:nums (Results 1 – 3 of 3) sorted by relevance

/f-stack/app/redis-5.0.5/deps/lua/src/
H A Dltable.c189 static int computesizes (int nums[], int *narray) { in computesizes()
211 static int countint (const TValue *key, int *nums) { in countint()
222 static int numusearray (const Table *t, int *nums) { in numusearray()
247 static int numusehash (const Table *t, int *nums, int *pnasize) { in numusehash()
335 int nums[MAXBITS+1]; /* nums[i] = number of keys between 2^(i-1) and 2^i */ in rehash() local
/f-stack/freebsd/contrib/openzfs/module/lua/
H A Dltable.c196 static int computesizes (int nums[], int *narray) { in computesizes()
218 static int countint (const TValue *key, int *nums) { in countint()
229 static int numusearray (const Table *t, int *nums) { in numusearray()
254 static int numusehash (const Table *t, int *nums, int *pnasize) { in numusehash()
345 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ in rehash() local
/f-stack/app/redis-5.0.5/src/
H A Dquicklist.c2244 long long nums[5000]; in quicklistTest() local
2408 long long nums[5000]; in quicklistTest() local
2435 long long nums[5000]; in quicklistTest() local
2467 long long nums[5000]; in quicklistTest() local
2512 long long nums[5000]; in quicklistTest() local
2541 long long nums[5000]; in quicklistTest() local
2561 long long nums[64]; in quicklistTest() local