Searched refs:entry (Results 26 - 50 of 2790) sorted by relevance

1234567891011>>

/external/wpa_supplicant_8/hostapd/src/ap/
H A Dpmksa_cache_auth.c30 void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx);
38 static void _pmksa_cache_free_entry(struct rsn_pmksa_cache_entry *entry) argument
40 if (entry == NULL)
42 os_free(entry->identity);
43 wpabuf_free(entry->cui);
45 radius_free_class(&entry->radius_class);
47 os_free(entry);
52 struct rsn_pmksa_cache_entry *entry)
57 pmksa->free_cb(entry, pmksa->ctx);
58 pos = pmksa->pmkid[PMKID_HASH(entry
51 pmksa_cache_free_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
123 pmksa_cache_from_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
150 pmksa_cache_to_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
187 pmksa_cache_link_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
243 struct rsn_pmksa_cache_entry *entry, *pos; local
291 struct rsn_pmksa_cache_entry *entry; local
332 struct rsn_pmksa_cache_entry *entry, *prev; local
362 struct rsn_pmksa_cache_entry *entry; local
394 struct rsn_pmksa_cache_entry *entry; local
418 pmksa_cache_auth_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx), void *ctx) argument
[all...]
/external/wpa_supplicant_8/src/ap/
H A Dpmksa_cache_auth.c30 void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx);
38 static void _pmksa_cache_free_entry(struct rsn_pmksa_cache_entry *entry) argument
40 if (entry == NULL)
42 os_free(entry->identity);
43 wpabuf_free(entry->cui);
45 radius_free_class(&entry->radius_class);
47 os_free(entry);
52 struct rsn_pmksa_cache_entry *entry)
57 pmksa->free_cb(entry, pmksa->ctx);
58 pos = pmksa->pmkid[PMKID_HASH(entry
51 pmksa_cache_free_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
123 pmksa_cache_from_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
150 pmksa_cache_to_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
187 pmksa_cache_link_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
243 struct rsn_pmksa_cache_entry *entry, *pos; local
291 struct rsn_pmksa_cache_entry *entry; local
332 struct rsn_pmksa_cache_entry *entry, *prev; local
362 struct rsn_pmksa_cache_entry *entry; local
394 struct rsn_pmksa_cache_entry *entry; local
418 pmksa_cache_auth_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx), void *ctx) argument
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dpmksa_cache_auth.c30 void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx);
38 static void _pmksa_cache_free_entry(struct rsn_pmksa_cache_entry *entry) argument
40 if (entry == NULL)
42 os_free(entry->identity);
43 wpabuf_free(entry->cui);
45 radius_free_class(&entry->radius_class);
47 os_free(entry);
52 struct rsn_pmksa_cache_entry *entry)
57 pmksa->free_cb(entry, pmksa->ctx);
58 pos = pmksa->pmkid[PMKID_HASH(entry
51 pmksa_cache_free_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
123 pmksa_cache_from_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
150 pmksa_cache_to_eapol_data(struct rsn_pmksa_cache_entry *entry, struct eapol_state_machine *eapol) argument
187 pmksa_cache_link_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry) argument
243 struct rsn_pmksa_cache_entry *entry, *pos; local
291 struct rsn_pmksa_cache_entry *entry; local
332 struct rsn_pmksa_cache_entry *entry, *prev; local
362 struct rsn_pmksa_cache_entry *entry; local
394 struct rsn_pmksa_cache_entry *entry; local
418 pmksa_cache_auth_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx), void *ctx) argument
[all...]
/external/chromium_org/chrome/browser/
H A Dchrome_content_browser_client_browsertest.cc21 // Returns the last committed navigation entry of the first tab. May be NULL
22 // if there is no such entry.
35 NavigationEntry* entry = GetLastCommittedEntry(); local
37 ASSERT_TRUE(entry != NULL);
38 EXPECT_EQ(url_long, entry->GetURL());
39 EXPECT_EQ(url_short, entry->GetVirtualURL());
48 NavigationEntry* entry = GetLastCommittedEntry(); local
50 ASSERT_TRUE(entry != NULL);
51 EXPECT_EQ(url_long, entry->GetURL());
52 EXPECT_EQ(url_short, entry
60 NavigationEntry* entry = GetLastCommittedEntry(); local
72 NavigationEntry* entry = GetLastCommittedEntry(); local
90 NavigationEntry* entry = GetLastCommittedEntry(); local
[all...]
/external/chromium_org/chrome_frame/crash_reporting/
H A Dnt_loader.cc13 // Make sure we own the loader's lock on entry here.
18 for (LIST_ENTRY* entry = head->Flink; entry != head; entry = entry->Flink) {
20 CONTAINING_RECORD(entry, LDR_DATA_TABLE_ENTRY, InLoadOrderLinks);
/external/guava/guava-tests/test/com/google/common/collect/
H A DMultisetsImmutableEntryTest.java35 private static <E> Entry<E> entry(final E element, final int count) { method in class:MultisetsImmutableEntryTest
45 assertEquals("foo", entry("foo", 1).toString());
46 assertEquals("bar x 2", entry("bar", 2).toString());
50 assertEquals("null", entry(NE, 1).toString());
51 assertEquals("null x 2", entry(NE, 2).toString());
55 assertEquals(control("foo", 1), entry("foo", 1));
56 assertEquals(control("bar", 2), entry("bar", 2));
57 assertFalse(control("foo", 1).equals(entry("foo", 2)));
58 assertFalse(entry("foo", 1).equals(control("bar", 1)));
59 assertFalse(entry("fo
[all...]
/external/qemu/
H A Dacl.c78 qemu_acl_entry *entry; local
80 QTAILQ_FOREACH(entry, &acl->entries, next) {
82 if (fnmatch(entry->match, party, 0) == 0)
83 return entry->deny ? 0 : 1;
87 if (strcmp(entry->match, party) == 0)
88 return entry->deny ? 0 : 1;
98 qemu_acl_entry *entry; local
104 QTAILQ_FOREACH(entry, &acl->entries, next) {
105 QTAILQ_REMOVE(&acl->entries, entry, next);
106 free(entry
117 qemu_acl_entry *entry; local
135 qemu_acl_entry *entry; local
164 qemu_acl_entry *entry; local
[all...]
H A Denvlist.c47 struct envlist_entry *entry; local
52 entry = envlist->el_entries.lh_first;
53 QLIST_REMOVE(entry, ev_link);
55 free((char *)entry->ev_var);
56 free(entry);
92 * and calls given callback for each entry.
137 struct envlist_entry *entry = NULL; local
152 * new entry.
154 for (entry = envlist->el_entries.lh_first; entry !
186 struct envlist_entry *entry; local
229 struct envlist_entry *entry; local
[all...]
/external/chromium/net/base/
H A Dbackoff_entry_unittest.cc43 TestBackoffEntry entry(&base_policy);
44 EXPECT_FALSE(entry.ShouldRejectRequest());
46 entry.InformOfRequest(false);
47 EXPECT_TRUE(entry.ShouldRejectRequest());
60 TestBackoffEntry entry(&base_policy);
62 EXPECT_FALSE(entry.CanDiscard());
65 entry.InformOfRequest(false);
66 EXPECT_FALSE(entry.CanDiscard());
69 entry.set_now(
70 entry
[all...]
/external/grub/stage2/
H A Dfat.h86 #define FAT_DIRENTRY_ATTRIB(entry) \
87 (*((unsigned char *) (entry+11)))
88 #define FAT_DIRENTRY_VALID(entry) \
89 ( ((*((unsigned char *) entry)) != 0) \
90 && ((*((unsigned char *) entry)) != 0xE5) \
91 && !(FAT_DIRENTRY_ATTRIB(entry) & FAT_ATTRIB_NOT_OK_MASK) )
92 #define FAT_DIRENTRY_FIRST_CLUSTER(entry) \
93 ((*((unsigned short *) (entry+26)))+(*((unsigned short *) (entry+20)) << 16))
94 #define FAT_DIRENTRY_FILELENGTH(entry) \
[all...]
/external/srec/portable/src/
H A Dphashtable.c164 PHashTableEntry *entry = table->entries[idx]; local
168 while (entry != NULL)
170 if (entry->key == NULL)
171 return entry;
173 entry = entry->next;
178 while (entry != NULL)
180 if (entry->hashCode == hashCode && table->args.compFunction(key, entry->key) == 0)
181 return entry;
190 removeEntry(PHashTableEntry *entry) argument
210 PHashTableEntry *entry; local
234 PHashTableEntry* entry; local
255 PHashTableGetEntry(PHashTable *table, const void *key, PHashTableEntry **entry) argument
279 PHashTableEntry *entry, *tmp, *next; local
345 PHashTableEntry *entry; local
427 PHashTableEntry *entry; local
457 PHashTableEntryGetKeyValue(PHashTableEntry *entry, void **key, void **value) argument
475 PHashTableEntrySetValue(PHashTableEntry *entry, const void *value, void **oldValue) argument
492 PHashTableEntryRemove(PHashTableEntry *entry) argument
502 iteratorAdvance(PHashTable *table, PHashTableEntry *entry) argument
537 PHashTableEntryGetFirst(PHashTable *table, PHashTableEntry **entry) argument
553 PHashTableEntryAdvance(PHashTableEntry **entry) argument
[all...]
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/
H A DX509CRLEntryHolder.java19 private TBSCertList.CRLEntry entry; field in class:X509CRLEntryHolder
22 X509CRLEntryHolder(TBSCertList.CRLEntry entry, boolean isIndirect, GeneralNames previousCA) argument
24 this.entry = entry;
27 if (isIndirect && entry.hasExtensions())
29 Extension currentCaName = entry.getExtensions().getExtension(Extension.certificateIssuer);
45 return entry.getUserCertificate().getValue();
55 return entry.getRevocationDate().getDate();
59 * Return whether or not the holder's CRL entry contains extensions.
65 return entry
[all...]
/external/icu4c/layout/
H A DLookupTables.cpp33 const LookupSegment *entry = segments; local
34 const LookupSegment *trial = (const LookupSegment *) ((char *) entry + extra);
37 entry = trial;
42 trial = (const LookupSegment *) ((char *) entry + probe);
45 entry = trial;
49 if (SWAPW(entry->firstGlyph) <= ttGlyph) {
50 return entry;
62 const LookupSingle *entry = entries; local
63 const LookupSingle *trial = (const LookupSingle *) ((char *) entry + extra);
66 entry
[all...]
/external/oprofile/opjitconv/
H A Dconversion.c20 struct jitentry * entry, * next; local
22 for (entry = jitentry_list; entry; entry = next) {
23 if (entry->sym_name_malloced)
24 free(entry->symbol_name);
25 next = entry->next;
26 free(entry);
33 struct jitentry_debug_line * entry, * next; local
35 for (entry
[all...]
/external/chromium_org/third_party/skia/src/gpu/
H A DGrResourceCache.cpp77 while (GrResourceEntry* entry = fList.head()) {
81 fCache.remove(entry->fKey, entry);
84 this->internalDetach(entry);
86 delete entry;
110 void GrResourceCache::internalDetach(GrResourceEntry* entry, argument
112 fList.remove(entry);
117 fClientDetachedBytes += entry->resource()->sizeInBytes();
132 fEntryBytes -= entry->resource()->sizeInBytes();
136 void GrResourceCache::attachToHead(GrResourceEntry* entry, argument
174 GrResourceEntry* entry = NULL; local
210 GrResourceEntry* entry = SkNEW_ARGS(GrResourceEntry, (key, resource)); local
222 makeExclusive(GrResourceEntry* entry) argument
235 removeInvalidResource(GrResourceEntry* entry) argument
248 makeNonExclusive(GrResourceEntry* entry) argument
315 GrResourceEntry* entry = fCache.find(invalidated[i].key, GrTFindUnreffedFunctor()); local
322 deleteResource(GrResourceEntry* entry) argument
350 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); local
409 const GrResourceEntry* entry = iter.init(const_cast<EntryList&>(list), local
437 const GrResourceEntry* entry = iter.init(const_cast<EntryList&>(fExclusiveList), local
474 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); local
[all...]
/external/skia/src/gpu/
H A DGrResourceCache.cpp77 while (GrResourceEntry* entry = fList.head()) {
81 fCache.remove(entry->fKey, entry);
84 this->internalDetach(entry);
86 delete entry;
110 void GrResourceCache::internalDetach(GrResourceEntry* entry, argument
112 fList.remove(entry);
117 fClientDetachedBytes += entry->resource()->sizeInBytes();
132 fEntryBytes -= entry->resource()->sizeInBytes();
136 void GrResourceCache::attachToHead(GrResourceEntry* entry, argument
174 GrResourceEntry* entry = NULL; local
210 GrResourceEntry* entry = SkNEW_ARGS(GrResourceEntry, (key, resource)); local
222 makeExclusive(GrResourceEntry* entry) argument
235 removeInvalidResource(GrResourceEntry* entry) argument
248 makeNonExclusive(GrResourceEntry* entry) argument
315 GrResourceEntry* entry = fCache.find(invalidated[i].key, GrTFindUnreffedFunctor()); local
322 deleteResource(GrResourceEntry* entry) argument
350 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); local
409 const GrResourceEntry* entry = iter.init(const_cast<EntryList&>(list), local
437 const GrResourceEntry* entry = iter.init(const_cast<EntryList&>(fExclusiveList), local
474 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); local
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dhash.c50 * An entry in the hash table.
53 GLuint Key; /**< the entry's key */
54 void *Data; /**< the entry's data */
55 struct HashEntry *Next; /**< pointer to next entry */
92 * Frees each entry on the hash table and then the hash table structure itself.
104 struct HashEntry *entry = table->Table[pos]; local
105 while (entry) {
106 struct HashEntry *next = entry->Next;
107 if (entry->Data) {
111 free(entry);
130 const struct HashEntry *entry; local
180 struct HashEntry *entry; local
234 struct HashEntry *entry, *prev; local
293 struct HashEntry *entry, *next; local
330 struct HashEntry *entry, *next; local
375 const struct HashEntry *entry; local
423 const struct HashEntry *entry = table->Table[pos]; local
492 const struct HashEntry *entry; local
[all...]
/external/mesa3d/src/mesa/main/
H A Dhash.c50 * An entry in the hash table.
53 GLuint Key; /**< the entry's key */
54 void *Data; /**< the entry's data */
55 struct HashEntry *Next; /**< pointer to next entry */
92 * Frees each entry on the hash table and then the hash table structure itself.
104 struct HashEntry *entry = table->Table[pos]; local
105 while (entry) {
106 struct HashEntry *next = entry->Next;
107 if (entry->Data) {
111 free(entry);
130 const struct HashEntry *entry; local
180 struct HashEntry *entry; local
234 struct HashEntry *entry, *prev; local
293 struct HashEntry *entry, *next; local
330 struct HashEntry *entry, *next; local
375 const struct HashEntry *entry; local
423 const struct HashEntry *entry = table->Table[pos]; local
492 const struct HashEntry *entry; local
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DDrawableFactory.java78 DrawableBitmap entry = new DrawableBitmap(null, 0, 0);
79 entry.setParentPool(this);
80 getAvailable().add(entry);
85 public void release(Object entry) { argument
86 ((DrawableBitmap)entry).reset();
87 super.release(entry);
115 ScrollableBitmap entry = new ScrollableBitmap(null, 0, 0);
116 entry.setParentPool(this);
117 getAvailable().add(entry);
122 public void release(Object entry) { argument
151 release(Object entry) argument
[all...]
/external/chromium_org/base/process/
H A Dprocess_iterator_win.cc30 void ProcessIterator::InitProcessEntry(ProcessEntry* entry) { argument
31 memset(entry, 0, sizeof(*entry));
32 entry->dwSize = sizeof(*entry);
37 return _wcsicmp(executable_name_.c_str(), entry().exe_file()) == 0 &&
/external/chromium_org/chrome/browser/ui/views/
H A Daccelerator_table_unittest.cc37 const AcceleratorMapping& entry = *it; local
38 EXPECT_TRUE(acclerators.insert(entry).second)
39 << "Duplicated accelerator: " << entry.keycode << ", "
40 << (entry.modifiers & ui::EF_SHIFT_DOWN) << ", "
41 << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", "
42 << (entry.modifiers & ui::EF_ALT_DOWN);
52 const AcceleratorMapping& entry = *it; local
53 acclerators.insert(entry);
63 AcceleratorMapping entry; local
64 entry
[all...]
/external/chromium/net/disk_cache/
H A Deviction.h34 // Updates the ranking information for an entry.
35 void UpdateRank(EntryImpl* entry, bool modified);
37 // Notifications of interesting events for a given entry.
38 void OnOpenEntry(EntryImpl* entry);
39 void OnCreateEntry(EntryImpl* entry);
40 void OnDoomEntry(EntryImpl* entry);
41 void OnDestroyEntry(EntryImpl* entry);
51 void ReportTrimTimes(EntryImpl* entry);
52 Rankings::List GetListForEntry(EntryImpl* entry);
59 void UpdateRankV2(EntryImpl* entry, boo
[all...]
/external/chromium_org/net/disk_cache/
H A Deviction.h33 // Updates the ranking information for an entry.
34 void UpdateRank(EntryImpl* entry, bool modified);
36 // Notifications of interesting events for a given entry.
37 void OnOpenEntry(EntryImpl* entry);
38 void OnCreateEntry(EntryImpl* entry);
39 void OnDoomEntry(EntryImpl* entry);
40 void OnDestroyEntry(EntryImpl* entry);
51 void ReportTrimTimes(EntryImpl* entry);
52 Rankings::List GetListForEntry(EntryImpl* entry);
59 void UpdateRankV2(EntryImpl* entry, boo
[all...]
/external/chromium_org/net/disk_cache/simple/
H A Dsimple_net_log_parameters.h17 // SimpleEntryImpl. Contains the entry's hash. |entry| can't be NULL and must
20 const SimpleEntryImpl* entry);
24 // and, if successful, the entry's key. |entry| can't be NULL and must outlive
27 const SimpleEntryImpl* entry,
/external/chromium_org/sync/engine/
H A Dconflict_resolver.cc42 MutableEntry entry(trans, syncable::GET_BY_ID, id);
43 // Must be good as the entry won't have been cleaned up.
44 CHECK(entry.good());
48 if (!entry.GetIsUnappliedUpdate() || !entry.GetIsUnsynced()) {
54 if (entry.GetIsDel() && entry.GetServerIsDel()) {
56 // entry.
57 entry.PutIsUnsynced(false);
58 entry
[all...]

Completed in 1950 milliseconds

1234567891011>>