/external/iproute2/netem/ |
normal.c | 14 #define TABLESIZE 16384 29 double table[TABLESIZE+1]; 32 i = rint(TABLESIZE * normal(x, 0.0, 1.0)); 38 for (i = n = 0; i < TABLESIZE; i += 4) {
|
paretonormal.c | 23 #define TABLESIZE 16384 54 double table[TABLESIZE+1]; 57 i = rint(TABLESIZE*normal(x, 0.0, 1.0)); 64 for (i = n = 0; i < TABLESIZE; i += 4) {
|
pareto.c | 14 #define TABLESIZE 16384
|
maketable.c | 78 #define TABLESIZE 16384/4 135 inverttable(int *table, int inversesize, int tablesize, int cumulative) 145 for (i=0; i < tablesize; ++i) { 228 inverse = inverttable(table, TABLESIZE, DISTTABLESIZE, total); 229 interpolatetable(inverse, TABLESIZE); 230 printtable(inverse, TABLESIZE);
|
README.distribution | 63 4. Invert the table: for each table entry F(x) = y, make the y*TABLESIZE 65 for the ("normalized") inverse of size TABLESIZE, covering its domain 0 66 to 1 with granularity 1/TABLESIZE. Note that even with the granularity
|
/dalvik/vm/ |
Hash.cpp | 56 pHashTable->tableSize = dexRoundUpPower2(initialSize); 60 (HashEntry*) malloc(pHashTable->tableSize * sizeof(HashEntry)); 66 memset(pHashTable->pEntries, 0, pHashTable->tableSize * sizeof(HashEntry)); 79 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { 115 for (count = i = 0; i < pHashTable->tableSize; i++) { 145 for (i = 0; i < pHashTable->tableSize; i++) { 163 pHashTable->tableSize = newSize; 182 assert(pHashTable->tableSize > 0); 187 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; 188 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; [all...] |
Hash.h | 74 int tableSize; /* must be power of 2 */ 132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); 189 int lim = pIter->pHashTable->tableSize; 203 return (pIter->idx >= pIter->pHashTable->tableSize); 206 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize);
|
/bootable/recovery/minzip/ |
Hash.c | 61 pHashTable->tableSize = roundUpPower2(initialSize); 65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable)); 83 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { 119 for (count = i = 0; i < pHashTable->tableSize; i++) { 149 for (i = 0; i < pHashTable->tableSize; i++) { 167 pHashTable->tableSize = newSize; 186 assert(pHashTable->tableSize > 0); 191 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; 192 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; 205 if (pHashTable->tableSize == 1 [all...] |
Hash.h | 62 int tableSize; /* must be power of 2 */ 108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); 154 int lim = pIter->pHashTable->tableSize; 168 return (pIter->idx >= pIter->pHashTable->tableSize); 171 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize);
|
/external/skia/src/ports/ |
SkHarfBuzzFont.cpp | 178 const size_t tableSize = SkFontHost::GetTableSize(uniqueID, tag); 179 if (!tableSize) { 184 *len = tableSize; 188 if (*len < tableSize) { 192 SkFontHost::GetTableData(uniqueID, tag, 0, tableSize, buffer);
|
SkFontHost_mac_coretext.cpp | 812 size_t tableSize = GetTableSize(uniqueID, tableTags[index]); 813 totalSize += (tableSize + 3) & ~3; 814 *tableSizes.append() = tableSize; 846 size_t tableSize = tableSizes[index]; 847 GetTableData(uniqueID, tableTags[index], 0, tableSize, dataPtr); 850 (uint32*)dataPtr, tableSize)); 852 entry->fLength = SkEndian_SwapBE32(tableSize); 853 dataPtr += (tableSize + 3) & ~3; [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
BloomFilter.h | 42 static const size_t tableSize = 1 << keyBits; 79 uint8_t m_table[tableSize]; 110 memset(m_table, 0, tableSize); 117 for (size_t n = 0; n < tableSize; ++n) { 127 for (size_t n = 0; n < tableSize; ++n) {
|
/frameworks/base/media/libstagefright/codecs/aacdec/ |
esc_iquant_scaling.cpp | 165 IF (maxInput < TABLESIZE) 189 IF (absX < TABLESIZE) 279 * For input values > TABLESIZE, multiply by FACTOR to get x ^ (1/3) 296 * The actual table size is one more than TABLESIZE, to allow for 299 #define TABLESIZE (INPUTRANGE/SPACING) 496 if (maxInput < TABLESIZE) 534 } /* end if (maxInput < TABLESIZE)*/ 536 else /* maxInput >= TABLESIZE) */ 544 if (absX < TABLESIZE) 570 if (absX < TABLESIZE) [all...] |
/external/webkit/Source/WebCore/platform/graphics/mac/ |
SimpleFontDataATSUI.mm | 63 ByteCount tableSize; 64 OSStatus status = ATSFontGetTable(fontID, tables[i], 0, 0, 0, &tableSize);
|
SimpleFontDataMac.mm | 303 ByteCount tableSize; 304 if (ATSFontGetTable(atsFont, tableName, 0, 0, NULL, &tableSize) != noErr) 307 CFMutableDataRef data = CFDataCreateMutable(kCFAllocatorDefault, tableSize); 311 CFDataIncreaseLength(data, tableSize); 312 if (ATSFontGetTable(atsFont, tableName, 0, tableSize, CFDataGetMutableBytePtr(data), &tableSize) != noErr) {
|
/external/webkit/Source/WebCore/platform/graphics/android/ |
HarfbuzzSkia.cpp | 206 const size_t tableSize = SkFontHost::GetTableSize(font->uniqueID(), tag); 207 if (!tableSize) 211 *len = tableSize; 215 if (*len < tableSize) 217 SkFontHost::GetTableData(font->uniqueID(), tag, 0, tableSize, buffer);
|
/external/webkit/Source/WebCore/platform/graphics/chromium/ |
HarfbuzzSkia.cpp | 223 const size_t tableSize = SkFontHost::GetTableSize(font->uniqueID(), tag); 224 if (!tableSize) 228 *len = tableSize; 232 if (*len < tableSize) 234 SkFontHost::GetTableData(font->uniqueID(), tag, 0, tableSize, buffer);
|
/frameworks/compile/libbcc/lib/ExecutionEngine/OldJIT/ |
CacheWriter.cpp | 120 size_t tableSize = sizeof(OBCC_DependencyTable) + 123 OBCC_DependencyTable *tab = (OBCC_DependencyTable *)malloc(tableSize); 131 mpHeaderSection->depend_tab_size = tableSize; 152 size_t tableSize = sizeof(OBCC_FuncTable) + 155 OBCC_FuncTable *tab = (OBCC_FuncTable *)malloc(tableSize); 163 mpHeaderSection->func_table_size = tableSize;
|
/external/guava/src/com/google/common/collect/ |
RegularImmutableMap.java | 47 int tableSize = Hashing.chooseTableSize(immutableEntries.length); 48 table = new Object[tableSize * 2]; 49 mask = tableSize - 1;
|
/external/iproute2/ |
README.distribution | 61 4. Invert the table: for each table entry F(x) = y, make the y*TABLESIZE 63 for the ("normalized") inverse of size TABLESIZE, covering its domain 0 64 to 1 with granularity 1/TABLESIZE. Note that even with the granularity
|
/external/webkit/Source/WebKit2/UIProcess/ |
VisitedLinkProvider.cpp | 97 unsigned tableSize = nextPowerOf2(keyCount * VisitedLinkTableMaxLoad); 101 if (tableSize < minimumTableSize) 104 return tableSize;
|
/external/qemu/distrib/sdl-1.2.12/src/video/maccommon/ |
SDL_macwm.c | 91 short tableSize, dataWidth; 96 tableSize = sizeof (GammaTbl) + pTableGammaIn->gFormulaSize + 98 pTableGammaOut = (GammaTblPtr) NewPtr (tableSize); /* allocate new table */ 100 BlockMove( (Ptr)pTableGammaIn, (Ptr)pTableGammaOut, tableSize); /* move everything */ 288 short tableSize, dataWidth; 291 tableSize = sizeof (GammaTbl) + (channels * entries * dataWidth); 292 pTableGammaOut = (GammaTblPtr) NewPtrClear (tableSize); /* allocate new tabel */
|
/bionic/libc/stdio/ |
vfprintf.c | 56 static int __grow_type_table(unsigned char **typetable, int *tablesize); 882 int tablesize; /* current size of type table */ local 892 ((nextarg >= tablesize) ? \ 893 __grow_type_table(&typetable, &tablesize) : 0, \ 934 tablesize = STATIC_ARG_TBL_SIZE; 1196 __grow_type_table(unsigned char **typetable, int *tablesize) 1199 int newsize = *tablesize * 2; 1201 if (*tablesize == STATIC_ARG_TBL_SIZE) { 1206 memcpy( *typetable, oldtable, *tablesize); 1211 memmove(new, *typetable, *tablesize); [all...] |
/frameworks/compile/libbcc/lib/ExecutionEngine/ |
MCCacheWriter.cpp | 109 size_t tableSize = sizeof(OBCC_DependencyTable) + 112 OBCC_DependencyTable *tab = (OBCC_DependencyTable *)malloc(tableSize); 120 mpHeaderSection->depend_tab_size = tableSize;
|
/external/bison/src/ |
uniqstr.c | 104 hash_uniqstr (void const *m, size_t tablesize) 106 return hash_string (m, tablesize);
|