Searched refs:entries (Results 176 - 200 of 548) sorted by relevance

1234567891011>>

/external/dbus/bus/
H A Dactivation.c48 DBusHashTable *entries; member in struct:BusActivation
64 DBusHashTable *entries; member in struct:__anon4932
96 DBusList *entries; member in struct:__anon4934
127 if (dir->entries)
128 _dbus_hash_table_unref (dir->entries);
205 link = _dbus_list_get_first_link (&pending_activation->entries);
213 link = _dbus_list_get_next_link (&pending_activation->entries, link);
215 _dbus_list_clear (&pending_activation->entries);
360 entry = _dbus_hash_table_lookup_string (s_dir->entries,
370 if (_dbus_hash_table_lookup_string (activation->entries, nam
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DImmutableSortedMultiset.java287 ImmutableList<Entry<E>> entries =
289 if (entries.isEmpty()) {
292 verifyEntries(entries);
293 return RegularImmutableSortedMultiset.createFromSorted(comparator, entries);
299 ImmutableList<Entry<E>> entries =
301 if (entries.isEmpty()) {
304 verifyEntries(entries);
305 return RegularImmutableSortedMultiset.createFromSorted(comparator, entries);
308 private static <E> void verifyEntries(Collection<Entry<E>> entries) { argument
309 for (Entry<E> entry : entries) {
[all...]
/external/libvorbis/vq/
H A Dbookutil.c56 for(i=0;i<book->entries;i++){
252 &(c->dim),&(c->entries))!=2){
273 quant_to_read=c->entries*c->dim;
277 /* load the quantized entries */
290 c->lengthlist=_ogg_malloc(sizeof(long)*c->entries);
291 for(i=0;i<c->entries;i++)
301 b->valuelist=_book_unquantize(c,c->entries,NULL);
406 /* wrap build_tree_from_lengths to allow zero entries in the histogram */
421 fprintf(stderr,"\rEliminating %d unused entries; %d entries remai
[all...]
/external/webkit/Source/WebKit/mac/History/
H A DWebBackForwardList.mm271 HistoryItemVector& entries = backForwardList->entries();
273 unsigned size = entries.size();
275 if (entries[i] == backForwardList->currentItem()) {
282 [result appendString:[kit(entries[i].get()) description]];
/external/guava/guava-tests/test/com/google/common/cache/
H A DPopulatedCachesTest.java59 // don't let the entries get GCed
69 // don't let the entries get GCed
85 // don't let the entries get GCed
108 // don't let the entries get GCed
129 // don't let the entries get GCed
143 // don't let the entries get GCed
164 // don't let the entries get GCed
179 // don't let the entries get GCed
248 Set<Entry<Object, Object>> entries = cache.asMap().entrySet();
252 ASSERT.that(entries)
[all...]
/external/linux-tools-perf/util/
H A Devlist.c38 INIT_LIST_HEAD(&evlist->entries);
57 list_for_each_entry_safe(pos, n, &evlist->entries, node) {
82 list_add_tail(&entry->node, &evlist->entries);
164 return list_entry(evlist->entries.next, struct perf_evsel, node);
289 list_for_each_entry(evsel, &evlist->entries, node) {
329 list_for_each_entry(evsel, &evlist->entries, node) {
393 list_for_each_entry(evsel, &evlist->entries, node) {
448 list_for_each_entry(evsel, &evlist->entries, node) {
469 pos = first = list_entry(evlist->entries.next, struct perf_evsel, node);
471 list_for_each_entry_continue(pos, &evlist->entries, nod
[all...]
/external/chromium/chrome/common/extensions/docs/examples/extensions/news/javascript/
H A Dfeed.js134 var entries = doc.getElementsByTagName('entry');
135 if (entries.length == 0) {
136 entries = doc.getElementsByTagName('item');
138 var count = Math.min(entries.length, maxFeedItems);
147 item = entries.item(i);
215 if (moreStoriesUrl && entries.length != 0) {
226 if (entries.length == 0) {
/external/linux-tools-perf/util/ui/browsers/
H A Dannotate.c21 struct rb_root entries; member in struct:annotate_browser
148 browser->entries = RB_ROOT;
159 objdump__insert_line(&browser->entries, rbpos);
163 browser->curr_hot = rb_last(&browser->entries);
222 nd = rb_last(&self->entries);
230 nd = rb_first(&self->entries);
294 browser.b.entries = &notes->src->source,
/external/openssl/crypto/x509/
H A Dx509name.c95 return(sk_X509_NAME_ENTRY_num(name->entries));
118 sk=name->entries;
131 if(name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
135 return(sk_X509_NAME_ENTRY_value(name->entries,loc));
144 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
147 sk=name->entries;
220 sk=name->entries;
/external/qemu/audio/
H A Daudio.c818 for (cap = s->cap_head.lh_first; cap; cap = cap->entries.le_next) {
833 for (cb = cap->cb_head.lh_first; cb; cb = cb->entries.le_next) {
854 for (sw = hw->sw_head.lh_first; sw; sw = sw->entries.le_next) {
868 SWVoiceCap *sc1 = sc->entries.le_next;
878 QLIST_REMOVE (sw, entries);
879 QLIST_REMOVE (sc, entries);
897 for (cap = s->cap_head.lh_first; cap; cap = cap->entries.le_next) {
923 QLIST_INSERT_HEAD (&hw_cap->sw_head, sw, entries);
924 QLIST_INSERT_HEAD (&hw->cap_head, sc, entries);
945 for (sw = hw->sw_head.lh_first; sw; sw = sw->entries
[all...]
/external/webkit/Source/WebKit/efl/ewk/
H A Dewk_tiled_model.c499 } entries; member in struct:_Ewk_Tile_Unused_Cache
573 "entries=(count:%zd, allocated:%zd), "
575 tuc, tuc->entries.count, tuc->entries.allocated,
593 if (!tuc->entries.count)
596 EINA_LIST_FREE(tuc->entries.list, itr) {
602 tuc->entries.count = 0;
688 if (!tuc->entries.count)
703 EINA_LIST_FOREACH_SAFE(tuc->entries.list, l, l_next, itr) {
717 tuc->entries
[all...]
/external/emma/core/java12/com/vladium/emma/data/
H A DCoverageData.java86 * note: rhs entries override current entries if they have different stamps;
98 for (Iterator entries = rhscoverageData.entrySet ().iterator (); entries.hasNext (); )
100 final Map.Entry entry = (Map.Entry) entries.next ();
195 final Iterator entries = coverageMap.entrySet ().iterator ();
198 final Map.Entry entry = (Map.Entry) entries.next ();
H A DMetaData.java164 * note: rhs entries must override current entries
175 // rhs entries always override existing content:
177 for (Iterator entries = rhsclasses.entrySet ().iterator (); entries.hasNext (); )
179 final Map.Entry entry = (Map.Entry) entries.next ();
251 final Iterator entries = classMap.entrySet ().iterator ();
254 final Map.Entry entry = (Map.Entry) entries.next ();
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedHashMultimap.java35 * entries and that returns collections whose iterators follow the ordering in
42 * order they were added. The collections generated by {@code entries} and
75 * Map entries with an iteration order corresponding to the order in which the
107 * multimap has the same {@link Multimap#entries()} iteration order as the
184 // converts a collection of values into a list of key/value map entries
185 Collection<Map.Entry<K, E>> entries
188 entries.add(createEntry(value));
190 return entries;
243 * by entries().iterator().remove()
280 * <p>Generates an iterator across map entries tha
336 @Override public Set<Map.Entry<K, V>> entries() { method in class:LinkedHashMultimap
[all...]
/external/linux-tools-perf/
H A Dbuiltin-diff.c93 struct rb_node *next = rb_first(&self->entries);
99 rb_erase(&n->rb_node, &self->entries);
104 self->entries = tmp;
116 struct rb_node *n = self->entries.rb_node;
137 for (nd = rb_first(&newer->entries); nd; nd = rb_next(nd)) {
/external/webkit/Source/WebKit2/UIProcess/cf/
H A DWebPageProxyCF.cpp158 const BackForwardListItemVector& entries = m_backForwardList->entries(); local
159 if (size_t size = entries.size()) {
161 process()->registerNewWebBackForwardListItem(entries[i].get());
163 SessionState state(m_backForwardList->entries(), m_backForwardList->currentIndex());
/external/chromium/chrome/browser/webdata/
H A Dautofill_table_unittest.cc137 // Simulate the submission of a handful of entries in a field called "Name",
435 std::vector<AutofillEntry> entries; local
436 entries.push_back(entry);
437 ASSERT_TRUE(db.GetAutofillTable()->UpdateAutofillEntries(entries));
463 std::vector<AutofillEntry> entries; local
464 entries.push_back(entry);
465 ASSERT_TRUE(db.GetAutofillTable()->UpdateAutofillEntries(entries));
491 std::vector<AutofillEntry> entries; local
492 entries.push_back(entry);
493 ASSERT_TRUE(db.GetAutofillTable()->UpdateAutofillEntries(entries));
510 std::vector<AutofillEntry> entries; local
556 std::vector<AutofillEntry> entries; local
586 std::vector<AutofillEntry> entries; local
1447 std::vector<AutofillEntry> entries; local
1483 std::vector<AutofillEntry> entries; local
1547 std::vector<AutofillEntry> entries; local
1596 std::vector<AutofillEntry> entries; local
[all...]
/external/chromium/chrome/browser/sessions/
H A Dtab_restore_service.h35 // To listen for changes to the set of entries managed by the TabRestoreService
67 // Is this entry from the last session? This is set to true for entries that
68 // were closed during the last session, and false for entries that were
129 // entries has changed.
133 // at least one tab, a Window is created, added to entries and observers are
140 // Removes all entries from the list and notifies observers the list
144 // Returns the entries, ordered with most recently closed entries at the
146 virtual const Entries& entries() const;
149 // entries t
[all...]
/external/iptables/include/linux/netfilter_ipv6/
H A Dip6_tables.h212 /* Number of entries */
215 /* Size of entries. */
228 /* Number of entries */
231 /* Total size of new entries */
240 /* Information about old entries: */
241 /* Number of counters (must be equal to current number of entries). */
243 /* The old entries' counters. */
246 /* The entries (hang off end: not really an array). */
247 struct ip6t_entry entries[0]; member in struct:ip6t_replace
261 /* The entries
[all...]
/external/jmonkeyengine/engine/src/networking/com/jme3/network/serializing/serializers/
H A DMapSerializer.java61 struct MapEntry[length] entries {
136 Set<Entry> entries = map.entrySet();
138 Iterator<Entry> it = entries.iterator();
175 it = entries.iterator();
/external/kernel-headers/original/linux/netfilter_arp/
H A Darp_tables.h151 /* Number of entries */
154 /* Size of entries. */
168 /* Number of entries */
171 /* Total size of new entries */
180 /* Information about old entries: */
181 /* Number of counters (must be equal to current number of entries). */
183 /* The old entries' counters. */
186 /* The entries (hang off end: not really an array). */
187 struct arpt_entry entries[0]; member in struct:arpt_replace
202 /* The entries
[all...]
/external/kernel-headers/original/linux/netfilter_ipv6/
H A Dip6_tables.h174 /* Number of entries */
177 /* Size of entries. */
191 /* Number of entries */
194 /* Total size of new entries */
203 /* Information about old entries: */
204 /* Number of counters (must be equal to current number of entries). */
206 /* The old entries' counters. */
209 /* The entries (hang off end: not really an array). */
210 struct ip6t_entry entries[0]; member in struct:ip6t_replace
225 /* The entries
[all...]
/external/llvm/utils/llvm-build/llvmbuild/
H A Dmain.py320 entries = {}
354 # Insert the entries for library groups we should add to.
356 entries[dep][2].append(llvmconfig_component_name)
359 entries[c.name] = (llvmconfig_component_name, library_name,
363 # Convert to a list of entries and sort by name.
364 entries = entries.values()
367 # only listing entries that have no other dependents.
368 root_entries = set(e[0] for e in entries)
369 for _,_,deps,_ in entries
[all...]
/external/webkit/Source/WebCore/platform/qt/
H A DFileSystemQt.cpp103 Vector<String> entries; local
111 entries.append(entry);
114 return entries;
/external/webkit/Source/WebCore/platform/wx/
H A DFileSystemWx.cpp193 Vector<String> entries; local
197 entries.append(file_paths[i]);
200 return entries;

Completed in 479 milliseconds

1234567891011>>