HomeSort by relevance Sort by last modified time
    Searched refs:entries (Results 301 - 325 of 1273) sorted by null

<<11121314151617181920>>

  /external/kernel-headers/original/uapi/linux/netfilter/
x_tables.h 147 #define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
155 __entry = (void *)(entries) + __i; \
167 #define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
168 XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
  /external/kernel-headers/original/uapi/linux/netfilter_bridge/
ebtables.h 47 /* total size of the entries */
55 char __user *entries; member in struct:ebt_replace
63 /* total size of the entries */
71 char *entries; member in struct:ebt_replace_kernel
85 /* nr. of entries */
94 * ebt_entries struct when traversing the entries from start to end.
245 #define EBT_ENTRY_ITERATE(entries, size, fn, args...) \
252 __entry = (void *)(entries) + __i; \
  /external/libexif/libexif/olympus/
exif-mnote-data-olympus.h 47 MnoteOlympusEntry *entries; member in struct:_ExifMnoteDataOlympus
  /external/libexif/libexif/pentax/
exif-mnote-data-pentax.h 38 MnotePentaxEntry *entries; member in struct:_ExifMnoteDataPentax
  /external/linux-tools-perf/perf-3.12.0/tools/perf/
builtin-evlist.c 27 list_for_each_entry(pos, &session->evlist->entries, node)
  /external/linux-tools-perf/perf-3.12.0/tools/perf/util/
rblist.h 22 struct rb_root entries; member in struct:rblist
  /external/mesa3d/src/gallium/drivers/svga/
svga_screen_cache.h 109 /* Entries with unused buffers, ordered from most to least recently used
113 /* Entries with buffers still in validate lists (2) */
116 /** Empty entries (1) */
119 /** The actual storage for the entries */
120 struct svga_host_surface_cache_entry entries[SVGA_HOST_SURFACE_CACHE_SIZE]; member in struct:svga_host_surface_cache
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
CPUProfileFlameChart.js 154 var entries = [];
161 stack.push(entries.length);
164 entries.push(null);
169 entries[index] = new ChartEntry(depth, totalTime, startTime, selfTime, node);
175 var entryNodes = new Array(entries.length);
176 var entryLevels = new Uint8Array(entries.length);
177 var entryTotalTimes = new Float32Array(entries.length);
178 var entrySelfTimes = new Float32Array(entries.length);
179 var entryStartTimes = new Float64Array(entries.length);
182 for (var i = 0; i < entries.length; ++i)
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
MapsTransformValuesUnmodifiableIteratorTest.java 278 Set<Map.Entry<String, String>> entries = map.entrySet();
279 Map.Entry<String, String> firstEntry = entries.iterator().next();
280 entries.remove(firstEntry);
283 Iterator<Map.Entry<String, String>> entryIterator = entries.iterator();
292 assertTrue(entries.isEmpty());
334 Set<Map.Entry<String, Boolean>> entries = map.entrySet();
335 assertTrue(entries.contains(Maps.immutableEntry("a", true)));
336 assertTrue(entries.contains(Maps.immutableEntry("b", (Boolean) null)));
337 assertTrue(entries.contains(
340 assertFalse(entries.contains(Maps.immutableEntry("c", (Boolean) null)))
    [all...]
  /external/bluetooth/bluedroid/osi/src/
config.c 20 list_t *entries; member in struct:__anon5811
152 for (const list_node_t *node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
162 list_append(sec->entries, entry);
224 section->entries = list_new(entry_free);
234 list_free(section->entries);
271 for (const list_node_t *node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
  /external/chromium_org/chrome/browser/devtools/device/adb/
adb_device_info_query.cc 94 std::vector<std::string> entries; local
95 Tokenize(response, "\n", &entries);
96 for (size_t i = 1; i < entries.size(); ++i) {
98 Tokenize(entries[i], " \r", &fields);
120 std::vector<std::string> entries; local
121 Tokenize(response, "\n", &entries);
122 for (size_t i = 1; i < entries.size(); ++i) {
124 Tokenize(entries[i], " \r", &fields);
  /external/chromium_org/chrome/browser/ui/webui/quota_internals/
quota_internals_proxy.h 65 void DidDumpQuotaTable(const QuotaTableEntries& entries);
66 void DidDumpOriginInfoTable(const OriginInfoTableEntries& entries);
  /external/chromium_org/components/password_manager/core/browser/
password_syncable_service.h 80 // Retrieves the entries from password db and fills both |password_entries|
86 // Uses the |PasswordStore| APIs to change entries.
87 void WriteToPasswordStore(const SyncEntries& entries);
98 // Calls |operation| for each element in |entries| and appends the changes to
102 const PasswordForms& entries,
112 // The password store that adds/updates/deletes password entries. Not owned.
  /external/chromium_org/net/disk_cache/blockfile/
block_files_unittest.cc 89 CacheAddr entries[kNumEntries]; local
97 entries[i] = address.value();
103 CacheAddr temp = entries[source1];
104 entries[source1] = entries[source2];
105 entries[source2] = temp;
109 Addr address(entries[i]);
113 // At this point, there are kNumEntries / 2 entries on the file, randomly
116 Addr address(entries[kNumEntries / 2]);
233 // Change the number of entries
    [all...]
stress_cache.cc 100 // This thread will loop forever, adding and removing entries from the cache.
101 // iteration is the current crash cycle, so the entries on the cache are marked
105 uint32 mask = 0xfff; // 4096 entries.
130 printf("Iteration %d, initial entries: %d\n", iteration,
145 disk_cache::Entry* entries[kNumEntries] = {0}; local
161 if (entries[slot])
162 entries[slot]->Close();
165 rv = cache->OpenEntry(keys[key], &entries[slot], cb.callback());
167 rv = cache->CreateEntry(keys[key], &entries[slot], cb.callback());
174 rv = entries[slot]->WriteData(0, 0, buffer.get(), size, cb.callback()
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/resources/
IndexedDBViews.js 308 * @param {!Array.<!WebInspector.IndexedDBModel.Entry>} entries
312 function callback(entries, hasMore)
316 this._entries = entries;
317 for (var i = 0; i < entries.length; ++i) {
320 data["key"] = entries[i].key;
321 data["primaryKey"] = entries[i].primaryKey;
322 data["value"] = entries[i].value;
324 var primaryKey = JSON.stringify(this._isIndex ? entries[i].primaryKey : entries[i].key);
  /external/chromium_org/ui/file_manager/file_manager/foreground/js/
file_transfer_controller.js 257 * Obtains entries that need to share with me.
258 * The method also observers child entries of the given entries.
259 * @param {Array.<Entries>} entries Entries.
260 * @return {Promise} Promise to be fulfilled with the entries that need to
263 getMultiProfileShareEntries_: function(entries) {
269 // Call processEntry for each item of entries.
270 var processEntries = function(entries) {
    [all...]
  /external/icu/icu4c/source/layout/
LookupTables.cpp 60 const LookupSingle *BinarySearchLookupTable::lookupSingle(const LETableReference &base, const LookupSingle *entries, LEGlyphID glyph, LEErrorCode &success) const
66 LEReferenceTo<LookupSingle> entry(base, success, entries);
  /external/libvorbis/lib/
codebook.h 38 long entries; /* codebook entries */ member in struct:static_codebook
52 long *quantlist; /* map == 1: (int)(entries^(1/dim)) element column map
53 map == 2: list of dim*entries quantized entry vals
60 long entries; /* codebook entries */ member in struct:codebook
61 long used_entries; /* populated codebook entries */
66 used entries are populated */
67 float *valuelist; /* list of dim*entries actual entry values */
  /external/libvorbis/vq/
localcodebook.h 38 long entries; /* codebook entries */ member in struct:static_codebook
52 long *quantlist; /* map == 1: (int)(entries^(1/dim)) element column map
53 map == 2: list of dim*entries quantized entry vals
60 long entries; /* codebook entries */ member in struct:codebook
61 long used_entries; /* populated codebook entries */
66 used entries are populated */
67 float *valuelist; /* list of dim*entries actual entry values */
metrics.c 75 histogram[i]=_ogg_calloc(b->entries,sizeof(float));
76 histogram_error[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
77 histogram_errorsq[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
78 histogram_hi[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
79 histogram_lo[i]=_ogg_calloc(b->entries*b->dim,sizeof(float));
99 for(j=0;j<c->c->entries;j++){
102 for(k=0;k<c->c->entries;k++){
151 int n=b->c->entries;
  /art/runtime/
reference_table.cc 46 << "overflowed (" << max_size_ << " entries)";
151 void ReferenceTable::Dump(std::ostream& os, Table& entries) {
152 if (entries.empty()) {
157 // Dump the most recent N entries.
159 size_t count = entries.size();
164 os << " Last " << (count - first) << " entries (of " << count << "):\n";
166 mirror::Object* ref = entries[idx].Read();
201 for (size_t i = 0; i < entries.size(); ++i) {
202 mirror::Object* entry = entries[i].Read();
  /external/chromium_org/chrome/browser/resources/options/
autofill_options.js 140 * |entries|.
141 * @param {!Array} entries The list of addresses.
143 setAddressList_: function(entries) {
144 this.addressList_.dataModel = new ArrayDataModel(entries);
149 * |entries|.
150 * @param {!Array} entries The list of credit cards.
152 setCreditCardList_: function(entries) {
153 this.creditCardList_.dataModel = new ArrayDataModel(entries);
215 AutofillOptions.setAddressList = function(entries) {
216 AutofillOptions.getInstance().setAddressList_(entries);
    [all...]
  /external/chromium_org/chrome/browser/ui/app_list/search/
history_data.cc 18 // A struct used to sort query entries by time.
160 std::vector<EntrySortData> entries;
163 entries.push_back(EntrySortData(&it->first, &it->second.update_time));
167 std::partial_sort(entries.begin(),
168 entries.begin() + entries_to_remove,
169 entries.end(),
173 const std::string& query = *entries[i].query;
  /external/chromium_org/chrome/utility/importer/
external_process_importer_bridge.cc 145 const std::vector<ImporterAutofillFormDataEntry>& entries) {
147 entries.size()));
153 int autofill_form_data_entries_left = entries.end() - entries.begin();
155 entries.begin();
156 it < entries.end();) {

Completed in 2494 milliseconds

<<11121314151617181920>>