| /external/iproute2/man/man8/ |
| tc-sfb.8 | 107 Maximum length of a buckets queue, in packets, before packets start being
185 Furthermore, if a buckets queue has a very high marking rate,
|
| tc-sfq.8 | 69 Each of these buckets should represent a unique flow. Because multiple flows may
79 at most 128 buckets of 1024 available. In case of overflow, tail-drop is performed
|
| /external/llvm/lib/DebugInfo/PDB/Raw/ |
| PublicsStream.cpp | 130 // Hash buckets follow.
134 "Hash buckets corrupted."));
|
| /external/mesa3d/src/mesa/program/ |
| hash_table.h | 55 * Creates a hash table with the specified number of buckets. The supplied
59 * \param num_buckets Number of buckets (bins) in the hash table.
|
| /external/v8/tools/ |
| eval_gc_nvp.py | 162 parser.add_argument('--histogram-omit-empty-buckets',
165 help='omit empty histogram buckets')
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashIterator.h | 150 * buckets
235 * HashTable has two kinds of iterators. One is used to traverse buckets
|
| HashBase.tcc | 191 // the buckets are empty (meaning that many are filled with tombstones),
209 // Rehash all the items into their new buckets. Luckily :) we already have
|
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 115 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
117 * The non-empty buckets contain the node before the first node in the
122 * std::forward_list::before_begin. Empty buckets contain
123 * nullptr. Note that one of the non-empty buckets contains
135 * how many empty buckets there are in the container.
320 // interesting in move semantic to leave hashtable with only 1 buckets
363 // Gets bucket begin, deals with the fact that non-empty buckets contain
749 // Set number of buckets to be appropriate for container of n element.
893 // Reuse allocated buckets and nodes.
925 // Restore previous buckets
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 115 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
117 * The non-empty buckets contain the node before the first node in the
122 * std::forward_list::before_begin. Empty buckets contain
123 * nullptr. Note that one of the non-empty buckets contains
135 * how many empty buckets there are in the container.
320 // interesting in move semantic to leave hashtable with only 1 buckets
363 // Gets bucket begin, deals with the fact that non-empty buckets contain
749 // Set number of buckets to be appropriate for container of n element.
893 // Reuse allocated buckets and nodes.
925 // Restore previous buckets
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 115 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
117 * The non-empty buckets contain the node before the first node in the
122 * std::forward_list::before_begin. Empty buckets contain
123 * nullptr. Note that one of the non-empty buckets contains
135 * how many empty buckets there are in the container.
320 // interesting in move semantic to leave hashtable with only 1 buckets
363 // Gets bucket begin, deals with the fact that non-empty buckets contain
749 // Set number of buckets to be appropriate for container of n element.
893 // Reuse allocated buckets and nodes.
925 // Restore previous buckets
[all...] |
| /external/libchrome/base/metrics/ |
| histogram.cc | 7 // vector of numbers corresponding to each of the aggregating buckets).
291 // consecutive buckets that is sooo small, that the integer bounds are the same
296 // that bucket onward we do use the exponential growth of buckets.
543 // buckets), so we need this to make it possible to see what is going on and
544 // not have 0-graphical-height buckets.
614 break; // All buckets are empty.
710 ListValue* buckets) const {
723 buckets->Set(index, bucket_value.release());
731 // buckets.
872 // Adjacent buckets with different widths would have "surprisingly" many (few
[all...] |
| histogram_unittest.cc | 338 // This test exploits the fact that the CustomHistogram can have 2 buckets,
339 // while the base class Histogram is *supposed* to have at least 3 buckets.
417 // Verify they landed in the underflow, and overflow buckets.
441 // Verify they landed in the underflow, and overflow buckets.
451 // Check to be sure samples land as expected is "correct" buckets.
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 80 * if the number of buckets is small). We could implement dual hashing algorithms
109 /** Number of buckets available in this table
113 /** Points to the memory where the array of buckets
116 pANTLR3_HASH_BUCKET buckets; member in struct:ANTLR3_HASH_TABLE_struct
353 pANTLR3_TRIE_ENTRY buckets; /**< This is the data bucket(s) that the key indexes, which may be NULL */ member in struct:ANTLR3_INT_TRIE_NODE_struct
|
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
| overuse_detector_unittest.cc | 124 int buckets[100]; local
125 memset(buckets, 0, sizeof(buckets));
129 buckets[index]++;
132 printf("Bucket n:%d, %d\n", n, buckets[n]);
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| WificondScannerImpl.java | 233 WifiNative.BucketSettings bucket = settings.buckets[i];
357 mBackgroundScanSettings.buckets[bucket_id];
368 // only no batch if all buckets specify it
397 mPendingSingleScanSettings.buckets[i];
672 // ignore buckets scanned since there is only one bucket for a single scan
[all...] |
| /external/llvm/include/llvm/ADT/ |
| StringMap.h | 57 // Initialize the map with zero buckets to allocation.
92 /// Allocate the table with the specified number of buckets and otherwise
279 // instantiate this new object without any tombstone buckets. The
|
| /external/llvm/include/llvm/IR/ |
| ValueMap.h | 138 /// Grow the map so that it has at least Size buckets. Does not shrink
208 /// somewhere into the ValueMap's array of buckets (i.e. either to a key or
214 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| ValueMap.h | 109 /// Grow the map so that it has at least Size buckets. Does not shrink
165 /// somewhere into the ValueMap's array of buckets (i.e. either to a key or
171 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
|
| /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
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/configuration/ |
| VaryingConfiguration.java | 134 * value can be used to determine how to partition the buckets of values.
239 // Divide up the available devices into {@link #mVariationCount} + 1 buckets
241 // Then assign buckets to each {@link #mVariation} version, and pick one
|
| /system/core/bootstat/ |
| bootstat.cpp | 174 // via Tron, which does not accept non-integer buckets in histograms.
327 // UMA does not display negative values in buckets, so convert to positive.
351 // The data is not meaningful yet and skews the histogram buckets.
|
| /external/libmojo/third_party/jinja2/ |
| bccache.py | 58 """Buckets are used to store the bytecode for one template. It's created
61 The buckets get an internal checksum from the cache assigned and use this
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/power/ |
| PowerUI.java | 128 * Buckets the battery level.
186 Slog.d(TAG, "buckets ....." + mLowBatteryAlertCloseLevel
|
| /frameworks/base/services/tests/servicestests/src/com/android/server/net/ |
| NetworkStatsCollectionTest.java | 149 // record empty data straddling between buckets
155 // assert that we report boundary in atomic buckets
|
