| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| BackgroundScanScheduler.java | 48 * schedule it can to try and satisfy requests. The hardware level accepts a series of buckets,
53 * the last buckets (lower priority) are placed in the next best bucket until the number of buckets
56 * <p>Finally, the scheduler creates a WifiNative.ScanSettings from the list of buckets which may be
79 * Default period to use if no buckets are being scheduled
89 * List of predefined periods (in ms) that buckets can be scheduled at. Ordered by preference
90 * if there are not enough buckets for all periods. All periods MUST be an integer multiple of
102 * For example if the hardware only supports 2 buckets and scans are requested with periods of
103 * 40s, 20s and 10s then the two buckets scheduled will have periods 40s and 20s and the 10s
107 * for each type. Regular scan requests will be packed into the remaining buckets
[all...] |
| SupplicantWifiScannerImpl.java | 242 WifiNative.BucketSettings bucket = settings.buckets[i];
366 mBackgroundScanSettings.buckets[bucket_id];
377 // only no batch if all buckets specify it
415 mPendingSingleScanSettings.buckets[i];
634 // ignore buckets scanned since there is only one bucket for a single scan
[all...] |
| /hardware/broadcom/wlan/bcmdhd/wifi_hal/ |
| gscan.cpp | 481 result = request.put_u32(GSCAN_ATTRIBUTE_BUCKET_ID, mParams->buckets[i].bucket);
485 result = request.put_u32(GSCAN_ATTRIBUTE_BUCKET_PERIOD, mParams->buckets[i].period);
490 mParams->buckets[i].band);
495 mParams->buckets[i].step_count);
500 mParams->buckets[i].max_period);
505 mParams->buckets[i].report_events);
511 mParams->buckets[i].num_channels);
516 if (mParams->buckets[i].num_channels) {
519 for (int j = 0; j < mParams->buckets[i].num_channels; j++) {
520 result = request.put_u32(j, mParams->buckets[i].channels[j].channel)
[all...] |
| /libcore/ojluni/src/main/java/sun/security/util/ |
| Cache.java | 61 * In its current implementation, the number of buckets (NOT entries) in
63 * maximum cache size to value that uses those buckets fully. For example,
65 * maximum size of 750 would be a good choice: try 1024 buckets, with a
67 * buckets / 4 * 3. As mentioned above, with a SoftReference cache, it is
272 int buckets = (int)(maxSize / LOAD_FACTOR) + 1; local
273 cacheMap = new LinkedHashMap<>(buckets, LOAD_FACTOR, true);
|
| /external/v8/tools/gyp/pylib/gyp/ |
| mac_tool.py | 671 # Create empty hashmap buckets.
672 buckets = [None] * capacity
679 while buckets[key & capacity - 1] is not None:
681 buckets[key & capacity - 1] = (file, path)
684 for bucket in buckets:
698 for bucket in buckets:
|
| /external/llvm/include/llvm/Object/ |
| ELFTypes.h | 477 ArrayRef<Elf_Word> buckets() const {
501 ArrayRef<Elf_Word> buckets() const {
507 return ArrayRef<Elf_Word>(buckets().end(), DynamicSymCount - symndx);
|
| /frameworks/opt/net/wifi/service/jni/ |
| com_android_server_wifi_WifiNative.cpp | 479 settings, "buckets", bucket_array_type, i);
481 params.buckets[i].bucket = helper.getIntField(bucket, "bucket");
482 params.buckets[i].band = (wifi_band) helper.getIntField(bucket, "band");
483 params.buckets[i].period = helper.getIntField(bucket, "period_ms");
484 params.buckets[i].max_period = helper.getIntField(bucket, "max_period_ms");
489 params.buckets[i].base = 2;
490 params.buckets[i].step_count = helper.getIntField(bucket, "step_count");
493 params.buckets[i].report_events = report_events;
496 ALOGD("bucket[%d] = %d:%d:%d:%d:%d:%d:%d", i, params.buckets[i].bucket,
497 params.buckets[i].band, params.buckets[i].period
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| runtime-gdb.py | 118 buckets = self.val['buckets']
124 bp = buckets + bucket
|
| /prebuilts/go/linux-x86/src/runtime/ |
| runtime-gdb.py | 118 buckets = self.val['buckets']
124 bp = buckets + bucket
|
| /hardware/libhardware_legacy/include/hardware_legacy/ |
| gscan.h | 32 int max_scan_buckets; // maximum number of channel buckets
58 // multiple buckets that were scanned this period and one has the
98 "buckets on this platform.");
102 * buckets that are currently being scanned. See the buckets_scanned field
155 // Note that a given channel may appear in multiple buckets
168 wifi_scan_bucket_spec buckets[MAX_BUCKETS]; member in struct:__anon31012
173 * When this is called all requested buckets should be scanned, starting the beginning of the cycle
176 * If there are two buckets specified
181 * - t=0 buckets 1, 2, and 3 are scanned
187 * - t=60 buckets 1, 2, and 3 are scanne
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/gslib/ |
| gcs_json_api.py | 389 # Here and in list buckets, we have no way of knowing
393 return self.api_client.buckets.Get(apitools_request,
457 return self.api_client.buckets.Patch(apitools_request,
484 return self.api_client.buckets.Insert(apitools_request,
498 self.api_client.buckets.Delete(apitools_request)
527 bucket_list = self.api_client.buckets.List(apitools_request,
540 bucket_list = self.api_client.buckets.List(apitools_request,
549 """Yields buckets from a list returned by apitools."""
[all...] |
| /frameworks/base/core/java/android/service/notification/ |
| ZenModeConfig.java | 310 final int[] buckets = new int[maxHrs + 3]; local
311 buckets[0] = 15;
312 buckets[1] = 30;
313 buckets[2] = 45;
315 buckets[2 + i] = 60 * i;
317 return buckets;
[all...] |
| /external/libchrome/base/metrics/ |
| histogram.h | 7 // vector of numbers corresponding to each of the aggregating buckets).
34 // The buckets layout of class Histogram is exponential. For example, buckets
38 // for values between 1 and 64, with 8 buckets, such as:
45 // the smallest ratio that it can use to construct the number of buckets
46 // selected in the constructor. An another example, if you had 50 buckets,
49 // root of 10000. This approach provides very fine grain (narrow) buckets
51 // gigantic range with the addition of very few buckets.
101 // Initialize maximum number of buckets in histograms as 16,384.
111 // buckets > 2 [minimum buckets needed: underflow, overflow and the range
[all...] |
| /external/libselinux/src/ |
| android.c | 1050 unsigned int hash, buckets, entries, chainlen, longestchain; local
1053 buckets = entries = longestchain = 0;
1056 buckets++;
1069 selinux_log(SELINUX_INFO, "SELinux: %d pkg entries and %d/%d buckets used, longest chain %d\n", entries, buckets, PKGTAB_SIZE, longestchain);
[all...] |
| /external/libunwind/include/ |
| dwarf.h | 345 dwarf_reg_state_t buckets[DWARF_UNW_CACHE_SIZE]; member in struct:dwarf_rs_cache
|
| /libcore/luni/src/main/native/ |
| org_apache_harmony_xml_ExpatParser.cpp | 128 // Free the buckets.
370 InternedString*** buckets = parsingContext->internedStrings; local
371 InternedString** bucket = buckets[bucketIndex];
395 buckets[bucketIndex] = bucket;
411 buckets[bucketIndex] = bucket;
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| unordered_test.cpp | 35 CPPUNIT_TEST(buckets);
52 void buckets();
321 void UnorderedTest::buckets() function in class:UnorderedTest
390 //we force a large number of buckets:
426 // Adding an element back shouldn't change number of buckets:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
|
| /ndk/tests/device/test-stlport/unit/ |
| unordered_test.cpp | 35 CPPUNIT_TEST(buckets);
52 void buckets();
321 void UnorderedTest::buckets() function in class:UnorderedTest
390 //we force a large number of buckets:
426 // Adding an element back shouldn't change number of buckets:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
|
| /external/emma/lib/ |
| emma.jar | |
| /external/owasp/sanitizer/tools/emma/lib/ |
| emma.jar | |
| /prebuilts/devtools/tools/lib/ |
| emma.jar | |
| emma_device.jar | |
| /toolchain/binutils/binutils-2.25/gold/ |
| dynobj.cc | 853 // Given a vector of hash codes, compute the number of hash buckets to
862 // Array used to determine the number of hash table buckets to use
865 // buckets, fewer than 37 we use 17 buckets, and so forth. We never
866 // use more than 262147 buckets. This is straight from the old GNU
868 static const unsigned int buckets[] = local
873 const int buckets_count = sizeof buckets / sizeof buckets[0];
881 if (symcount < buckets[i] * full_fraction)
883 ret = buckets[i]
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/apitools/samples/storage_sample/storage/ |
| storage_v1.py | 595 """Command wrapping buckets.Delete."""
635 result = client.buckets.Delete(
641 """Command wrapping buckets.Get."""
692 result = client.buckets.Get(
698 """Command wrapping buckets.Insert."""
759 result = client.buckets.Insert(
765 """Command wrapping buckets.List."""
774 u'Maximum number of buckets to return.',
785 u'Filter results to buckets whose names begin with this prefix.',
795 """Retrieves a list of buckets for a given project
[all...] |
| /external/elfutils/libdwfl/ |
| dwfl_module_getdwarf.c | 755 const Elf32_Word *const buckets = data->d_buf; local
758 if (buckets[bucket] > maxndx)
759 maxndx = buckets[bucket];
[all...] |
