Searched defs:bucket (Results 76 - 100 of 114) sorted by relevance

12345

/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Ddeep-heap-profile.cc438 // Write the bucket listing into a .bucket file.
566 buffer->AppendInt64(bucket->alloc_size - bucket->free_size, 10);
570 buffer->AppendInt(bucket->allocs, 6, false);
572 buffer->AppendInt(bucket->frees, 6, false);
594 for (int depth = 0; depth < bucket->depth; depth++) {
596 buffer->AppendPtr(reinterpret_cast<uintptr_t>(bucket->stack[depth]), 8);
628 Bucket* bucket,
636 AddToHashValue(reinterpret_cast<uintptr_t>(bucket),
627 Lookup( Bucket* bucket, const std::type_info* type, bool is_mmap) argument
683 Bucket* bucket = deep_bucket->bucket; local
706 Bucket* bucket = deep_bucket->bucket; local
1104 Bucket* bucket = MemoryRegionMap::GetBucket( local
[all...]
H A Dheap-profile-table.cc162 Bucket* bucket = curr; local
164 dealloc_(bucket->stack);
165 dealloc_(bucket);
194 // Create new bucket
233 Bucket* b = v.bucket();
252 info->call_stack = alloc_value->bucket()->stack;
253 info->stack_depth = alloc_value->bucket()->depth;
403 // Our file format is "bucket, bucket, ..., bucket, proc_self_maps_inf
646 Bucket* bucket; member in struct:HeapProfileTable::Snapshot::Entry
[all...]
/external/fio/
H A Dclient.c72 int bucket = hash_long(client->fd, FIO_CLIENT_HASH_BITS); local
74 bucket &= FIO_CLIENT_HASH_MASK;
75 flist_add(&client->hash_list, &client_hash[bucket]);
118 int bucket = hash_long(fd, FIO_CLIENT_HASH_BITS) & FIO_CLIENT_HASH_MASK; local
122 flist_for_each(entry, &client_hash[bucket]) {
/external/icu/icu4c/source/i18n/
H A Dalphaindex.cpp151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); local
153 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode);
160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); local
161 if (bucket->displayBucket_ != NULL) {
162 bucket = bucket->displayBucket_;
164 return bucket->displayIndex_;
261 // or called after using the old-style bucket iterator API.
333 // Ignore an index character that will land in the overflow bucket.
454 // underflow bucket
455 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); local
679 Bucket *bucket = currentBucket; local
[all...]
/external/chromium_org/extensions/browser/api/web_request/
H A Dweb_request_api.cc2120 // time it is called. Instead we only decrement the bucket counter at the time
2132 virtual bool Apply(Bucket* bucket,
2139 // We don't need to take care of the life time of |bucket|: It is owned by the
2141 // long as |this| exists, the respective BucketMapper and its bucket will
2143 void OnPageLoad(Bucket* bucket);
2154 bool ClearCacheQuotaHeuristic::Apply(Bucket* bucket, argument
2156 if (event_time > bucket->expiration())
2157 bucket->Reset(config(), event_time);
2159 // Call bucket->DeductToken() on a new page load, this is when
2165 bucket));
2174 OnPageLoad(Bucket* bucket) argument
[all...]
/external/chromium_org/gpu/command_buffer/service/
H A Dprogram_manager_unittest.cc984 CommonDecoder::Bucket bucket; local
987 program->GetProgramInfo(&manager_, &bucket);
989 bucket.GetDataAs<ProgramInfoHeader*>(0, sizeof(ProgramInfoHeader));
994 const ProgramInput* inputs = bucket.GetDataAs<const ProgramInput*>(
1004 const int32* location = bucket.GetDataAs<const int32*>(
1008 const char* name_buf = bucket.GetDataAs<const char*>(
1020 const int32* locations = bucket.GetDataAs<const int32*>(
1028 const char* name_buf = bucket.GetDataAs<const char*>(
1042 CommonDecoder::Bucket bucket; local
1056 program->GetProgramInfo(&manager_, &bucket);
[all...]
H A Dgles2_cmd_decoder_autogen.h2820 Bucket* bucket = GetBucket(bucket_id); local
2821 if (!bucket || bucket->size() == 0) {
2825 if (!bucket->GetAsString(&str)) {
2840 Bucket* bucket = GetBucket(bucket_id); local
2841 if (!bucket || bucket->size() == 0) {
2845 if (!bucket->GetAsString(&str)) {
H A Dgles2_cmd_decoder_unittest_base.cc1057 CommonDecoder::Bucket* bucket = decoder_->CreateBucket(bucket_id); local
1058 bucket->SetSize(size);
H A Dgles2_cmd_decoder.cc4898 Bucket* bucket = GetBucket(c.name_bucket_id); local
4899 if (!bucket || bucket->size() == 0) {
4903 if (!bucket->GetAsString(&name_str)) {
4952 Bucket* bucket = GetBucket(c.name_bucket_id); local
4953 if (!bucket || bucket->size() == 0) {
4957 if (!bucket->GetAsString(&name_str)) {
6872 // of whatever context it came from (shared memory, immediate memory, bucket
6892 Bucket* bucket local
6960 Bucket* bucket = CreateBucket(bucket_id); local
6978 Bucket* bucket = CreateBucket(bucket_id); local
6997 Bucket* bucket = CreateBucket(bucket_id); local
7015 Bucket* bucket = CreateBucket(bucket_id); local
7884 Bucket* bucket = GetBucket(c.name_bucket_id); local
7933 Bucket* bucket = GetBucket(c.name_bucket_id); local
8016 Bucket* bucket = CreateBucket(c.bucket_id); local
8468 Bucket* bucket = GetBucket(c.bucket_id); local
8495 Bucket* bucket = GetBucket(c.bucket_id); local
9328 Bucket* bucket = CreateBucket(name_bucket_id); local
9365 Bucket* bucket = CreateBucket(name_bucket_id); local
9535 Bucket* bucket = GetBucket(c.bucket_id); local
9586 Bucket* bucket = CreateBucket(c.bucket_id); local
9598 Bucket* bucket = GetBucket(c.bucket_id); local
9730 Bucket* bucket = CreateBucket(bucket_id); local
9737 program->GetProgramInfo(program_manager(), bucket); local
10850 Bucket* bucket = GetBucket(c.bucket_id); local
[all...]
/external/chromium_org/net/disk_cache/blockfile/
H A Dindex_table_v3.cc209 disk_cache::IndexBucket** bucket) {
210 if (!(*bucket)->next)
213 int bucket_num = (*bucket)->next / disk_cache::kCellsPerBucket;
215 // The next bucket must fall within the extra table. Note that this is not
218 // accessing that bucket for the first time. This behavior has to change if
220 (*bucket)->next = 0;
223 *bucket = &table[bucket_num - min_bucket_num];
442 // used directly as an index into the main table; once that bucket is located,
443 // all cells with that partial hash (i.e., belonging to that bucket) are
444 // inspected, and if present, the next bucket (locate
207 GetNextBucket(int min_bucket_num, int max_bucket_num, disk_cache::IndexBucket* table, disk_cache::IndexBucket** bucket) argument
580 IndexBucket* bucket = &main_table_[bucket_num]; local
620 IndexBucket* bucket = &main_table_[bucket_num]; local
798 IndexBucket* bucket = &main_table_[bucket_num]; local
848 IndexBucket* bucket = NULL; local
893 IndexBucket* bucket = &main_table_[i]; local
908 UpdateFromBucket(IndexBucket* bucket, int bucket_hash, int limit_time, IndexIterator* no_use, IndexIterator* low_use, IndexIterator* high_use) argument
981 IndexBucket* bucket = &source_table[i]; local
1083 IndexBucket* bucket = &main_table_[bucket_num]; local
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DHashTable.h527 static void initializeBucket(ValueType& bucket);
528 static void deleteBucket(ValueType& bucket) { bucket.~ValueType(); Traits::constructDeletedValue(bucket, Allocator::isGarbageCollected); } argument
767 template<typename Traits, typename Value> static void initialize(Value& bucket) argument
769 new (NotNull, &bucket) Value(Traits::emptyValue());
774 template<typename Traits, typename Value> static void initialize(Value& bucket) argument
776 // This initializes the bucket without copying the empty value.
779 memset(&bucket, 0, sizeof(bucket));
784 initializeBucket(ValueType& bucket) argument
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dalphaindex.cpp150 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); local
152 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode);
159 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); local
160 if (bucket->displayBucket_ != NULL) {
161 bucket = bucket->displayBucket_;
163 return bucket->displayIndex_;
260 // or called after using the old-style bucket iterator API.
332 // Ignore an index characters that will land in the overflow bucket.
460 // underflow bucket
461 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); local
683 Bucket *bucket = currentBucket; local
[all...]
/external/elfutils/0.153/src/
H A Dstrip.c1466 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; local
1473 changed. We keep the same size for the bucket array. */
1474 bucket[1] = symd->d_size / elsize;
1475 Elf32_Word nbucket = bucket[0];
1476 bucket += 2;
1477 Elf32_Word *chain = bucket + nbucket;
1485 memset (bucket, '\0',
1501 if (bucket[hidx] == 0)
1502 bucket[hidx] = inner;
1505 hidx = bucket[hid
1520 Elf64_Xword *bucket = (Elf64_Xword *) hashd->d_buf; local
[all...]
H A Delflint.c1965 section [%2d] '%s': hash bucket reference %zu out of bounds\n"),
2006 section [%2d] '%s': hash bucket reference %zu out of bounds\n"),
2078 section [%2d] '%s': hash chain for bucket %zu lower than symbol index bias\n"),
2099 section [%2d] '%s': symbol %u referenced in chain for bucket %zu is undefined\n"),
2110 section [%2d] '%s': hash value for symbol %u in chain for bucket %zu wrong\n"),
2141 section [%2d] '%s': hash chain for bucket %zu out of bounds\n"),
2146 section [%2d] '%s': symbol reference in chain for bucket %zu out of bounds\n"),
2291 const Elf32_Word *bucket = &hasharr[2]; local
2296 Elf32_Word symidx = bucket[cnt];
2308 const Elf64_Xword *bucket local
[all...]
H A Dldgeneric.c3550 /* Determine how often each hash bucket is used. */
3893 that all symbols with the same hash value module the bucket table
3909 /* Determine the "optimal" bucket size. */
4052 Elf32_Word *bucket = NULL; local
4056 /* Determine the "optimal" bucket size. If we also generate the
4084 bucket = &((Elf32_Word *) hashdata->d_buf)[2];
4092 if (bucket[hashidx] == 0)
4093 bucket[hashidx] = dynidx;
4096 hashidx = bucket[hashidx];
H A Dreadelf.c79 N_("Display histogram of bucket list lengths"), 0 },
157 /* True if bucket list length histogram should be printed. */
2635 \nHistogram for bucket list length in section [%2u] '%s' (total of %d bucket):\n Addr: %#0*" PRIx64 " Offset: %#08" PRIx64 " Link to section: [%2u] '%s'\n",
2637 \nHistogram for bucket list length in section [%2u] '%s' (total of %d buckets):\n Addr: %#0*" PRIx64 " Offset: %#08" PRIx64 " Link to section: [%2u] '%s'\n",
2705 Elf32_Word *bucket = &((Elf32_Word *) data->d_buf)[2]; local
2714 Elf32_Word inner = bucket[cnt];
2747 Elf64_Xword *bucket = &((Elf64_Xword *) data->d_buf)[2]; local
2756 Elf64_Xword inner = bucket[cnt];
2801 Elf32_Word *bucket local
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/fbcon/
H A DSDL_fbvideo.c1192 vidmem_bucket *bucket; local
1197 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
1198 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
1199 if ( bucket->prev ) {
1200 if ( bucket
1220 vidmem_bucket *bucket; local
1252 vidmem_bucket *bucket, *freeable; local
1265 vidmem_bucket *bucket; local
1340 vidmem_bucket *bucket, *freeable; local
[all...]
/external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
H A Dsctp_pcb.c217 struct sctp_vrflist *bucket; local
255 bucket = &SCTP_BASE_INFO(sctp_vrfhash)[(vrf_id & SCTP_BASE_INFO(hashvrfmark))];
256 LIST_INSERT_HEAD(bucket, vrf, next_vrf);
287 struct sctp_vrflist *bucket; local
290 bucket = &SCTP_BASE_INFO(sctp_vrfhash)[(vrf_id & SCTP_BASE_INFO(hashvrfmark))];
291 LIST_FOREACH(liste, bucket, next_vrf) {
1209 * Ok now for each of the guys in this bucket we must look and see:
3779 /* find the bucket */
3787 /* put it in the bucket */
5126 /* put it in the bucket i
[all...]
/external/mdnsresponder/mDNSShared/
H A Ddnsextd.c809 int i, bucket, newnbuckets = d->nbuckets * 2; local
821 bucket = ptr->rr.resrec.namehash % newnbuckets;
824 tmp->next = new[bucket];
825 new[bucket] = tmp;
1377 int i, allocsize, bucket; local
1400 bucket = rr->namehash % d->nbuckets;
1401 rptr = &d->table[bucket];
1446 bucket = rr->namehash % d->nbuckets;
1447 rptr = &d->table[bucket];
1461 tmp->next = d->table[bucket];
1672 int bucket = DomainNameHashValue(&e->qname) % LLQ_TABLESIZE; local
2060 int bucket = DomainNameHashValue(&e->qname) % LLQ_TABLESIZE; local
2087 int bucket = DomainNameHashValue(qname) % LLQ_TABLESIZE; local
2286 int bucket = bucket = DomainNameHashValue(qname) % LLQ_TABLESIZE; local
[all...]
/external/yaffs2/yaffs2/
H A Dyaffs_guts.c1404 int bucket; local
1407 /* If it is still linked into the bucket list, free from the list */
1410 bucket = yaffs_HashFunction(tn->objectId);
1411 dev->objectBucket[bucket].count--;
1522 int bucket = yaffs_FindNiceObjectBucket(dev); local
1531 __u32 n = (__u32) bucket;
1538 if (1 || dev->objectBucket[bucket].count > 0) {
1539 list_for_each(i, &dev->objectBucket[bucket].list) {
1556 int bucket = yaffs_HashFunction(in->objectId); local
1559 list_add(&in->hashLink, &dev->objectBucket[bucket]
1566 int bucket = yaffs_HashFunction(number); local
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.event_1.2.0.v20100503.jar ... equinox.internal.event.EventHandlerWrapper wrapper private void bucket (org.eclipse.equinox.internal.event. ...
/external/guava/guava/lib/
H A Djdiff.jarMETA-INF/ META-INF/MANIFEST.MF jdiff/ jdiff/API.class API.java package jdiff ...
/external/chromium_org/third_party/libxml/src/
H A Dxmlschemas.c297 #define WXS_BUCKET(ctx) WXS_CONSTRUCTOR((ctx))->bucket
387 xmlSchemaBucketPtr bucket; member in struct:_xmlSchemaSchemaRelation
463 /* The owning main or import schema bucket. */
572 xmlSchemaBucketPtr mainBucket; /* The main schema bucket */
576 xmlSchemaBucketPtr bucket; /* The current schema bucket */ member in struct:_xmlSchemaConstructionCtxt
3495 xmlSchemaBucketFree(xmlSchemaBucketPtr bucket) argument
3497 if (bucket == NULL)
3499 if (bucket->globals != NULL) {
3500 xmlSchemaComponentListFree(bucket
5014 xmlSchemaFindRedefCompInGraph(xmlSchemaBucketPtr bucket, xmlSchemaTypeType type, const xmlChar *name, const xmlChar *nsName) argument
10076 xmlSchemaParseNewDocWithContext(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10145 xmlSchemaParseNewDoc(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10202 xmlSchemaSchemaRelationAddChild(xmlSchemaBucketPtr bucket, xmlSchemaSchemaRelationPtr rel) argument
10263 xmlSchemaAddSchemaDoc(xmlSchemaParserCtxtPtr pctxt, int type, const xmlChar *schemaLocation, xmlDocPtr schemaDoc, const char *schemaBuffer, int schemaBufferLen, xmlNodePtr invokingNode, const xmlChar *sourceTargetNamespace, const xmlChar *importNamespace, xmlSchemaBucketPtr *bucket) argument
10695 xmlSchemaBucketPtr bucket = NULL; local
10939 xmlSchemaBucketPtr bucket = NULL; local
20672 xmlSchemaAddComponents(xmlSchemaParserCtxtPtr pctxt, xmlSchemaBucketPtr bucket) argument
21267 xmlSchemaBucketPtr bucket = NULL; local
21570 xmlSchemaBucketPtr bucket = NULL; local
[all...]
/external/chromium_org/v8/src/
H A Dobjects.cc15494 int bucket = Smi::cast(hash)->value() & (new_buckets - 1); local
15495 Object* chain_entry = new_table->get(kHashTableStartIndex + bucket);
15496 new_table->set(kHashTableStartIndex + bucket, Smi::FromInt(new_entry));
15548 int bucket = HashToBucket(hash); local
15550 Object* chain_entry = get(kHashTableStartIndex + bucket);
15551 set(kHashTableStartIndex + bucket, Smi::FromInt(entry));
/external/libxml2/
H A Dxmlschemas.c297 #define WXS_BUCKET(ctx) WXS_CONSTRUCTOR((ctx))->bucket
387 xmlSchemaBucketPtr bucket; member in struct:_xmlSchemaSchemaRelation
463 /* The owning main or import schema bucket. */
572 xmlSchemaBucketPtr mainBucket; /* The main schema bucket */
576 xmlSchemaBucketPtr bucket; /* The current schema bucket */ member in struct:_xmlSchemaConstructionCtxt
3514 xmlSchemaBucketFree(xmlSchemaBucketPtr bucket) argument
3516 if (bucket == NULL)
3518 if (bucket->globals != NULL) {
3519 xmlSchemaComponentListFree(bucket
5033 xmlSchemaFindRedefCompInGraph(xmlSchemaBucketPtr bucket, xmlSchemaTypeType type, const xmlChar *name, const xmlChar *nsName) argument
10095 xmlSchemaParseNewDocWithContext(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10164 xmlSchemaParseNewDoc(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10221 xmlSchemaSchemaRelationAddChild(xmlSchemaBucketPtr bucket, xmlSchemaSchemaRelationPtr rel) argument
10282 xmlSchemaAddSchemaDoc(xmlSchemaParserCtxtPtr pctxt, int type, const xmlChar *schemaLocation, xmlDocPtr schemaDoc, const char *schemaBuffer, int schemaBufferLen, xmlNodePtr invokingNode, const xmlChar *sourceTargetNamespace, const xmlChar *importNamespace, xmlSchemaBucketPtr *bucket) argument
10714 xmlSchemaBucketPtr bucket = NULL; local
10958 xmlSchemaBucketPtr bucket = NULL; local
20701 xmlSchemaAddComponents(xmlSchemaParserCtxtPtr pctxt, xmlSchemaBucketPtr bucket) argument
21296 xmlSchemaBucketPtr bucket = NULL; local
21599 xmlSchemaBucketPtr bucket = NULL; local
[all...]

Completed in 880 milliseconds

12345