Searched refs:entry (Results 51 - 75 of 1482) sorted by relevance

1234567891011>>

/external/mesa3d/src/glsl/
H A Dopt_structure_splitting.cpp109 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
110 if (entry->var == var)
111 return entry;
114 variable_entry2 *entry = new(mem_ctx) variable_entry2(var); local
115 this->variable_list.push_tail(entry);
116 return entry;
123 variable_entry2 *entry = this->get_variable_entry2(ir); local
125 if (entry)
126 entry->declaration = true;
135 variable_entry2 *entry local
205 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
309 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
331 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
[all...]
H A Dglsl_symbol_table.cpp33 void *entry = hieralloc_size(ctx, size); local
34 assert(entry != NULL);
35 return entry;
91 * the current scope, just update the existing entry to include 'v'.
98 /* If not declared at this scope, add a new entry. But if an existing
99 * entry includes a function, propagate that to this block - otherwise
102 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
104 entry->f = existing->f;
105 int added = _mesa_symbol_table_add_symbol(table, -1, v->name, entry);
114 symbol_table_entry *entry local
120 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(t); local
134 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
140 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
147 symbol_table_entry *entry = get_entry(name); local
153 symbol_table_entry *entry = get_entry(name); local
159 symbol_table_entry *entry = get_entry(name); local
[all...]
/external/wpa_supplicant_6/wpa_supplicant/src/rsn_supp/
H A Dpmksa_cache.c35 void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx,
77 static void _pmksa_cache_free_entry(struct rsn_pmksa_cache_entry *entry) argument
79 os_free(entry);
84 struct rsn_pmksa_cache_entry *entry,
88 pmksa->free_cb(entry, pmksa->ctx, replace);
89 _pmksa_cache_free_entry(entry);
100 struct rsn_pmksa_cache_entry *entry = pmksa->pmksa; local
101 pmksa->pmksa = entry->next;
102 wpa_printf(MSG_DEBUG, "RSN: expired PMKSA cache entry for "
103 MACSTR, MAC2STR(entry
83 pmksa_cache_free_entry(struct rsn_pmksa_cache *pmksa, struct rsn_pmksa_cache_entry *entry, int replace) argument
122 struct rsn_pmksa_cache_entry *entry; local
167 struct rsn_pmksa_cache_entry *entry, *pos, *prev; local
272 struct rsn_pmksa_cache_entry *entry, *prev; local
299 struct rsn_pmksa_cache_entry *entry = pmksa->pmksa; local
319 struct rsn_pmksa_cache_entry *entry = pmksa->pmksa; local
363 struct rsn_pmksa_cache_entry *entry = pmksa->pmksa; local
454 struct rsn_pmksa_cache_entry *entry; local
495 pmksa_cache_init(void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx, int replace), void *ctx, struct wpa_sm *sm) argument
[all...]
/external/emma/core/java12/com/vladium/util/
H A DObjectIntMap.java29 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
98 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key))
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry
[all...]
/external/webkit/Source/JavaScriptCore/runtime/
H A DLookup.cpp38 HashEntry* entry = &entries[hashIndex]; local
40 if (entry->key()) {
41 while (entry->next()) {
42 entry = entry->next();
45 entry->setNext(&entries[linkIndex++]);
46 entry = entry->next();
49 entry->initialize(identifier, values[i].attributes, values[i].value1, values[i].value2
71 void setUpStaticFunctionSlot(ExecState* exec, const HashEntry* entry, JSObjec argument
[all...]
H A DLookup.h145 // Find an entry in the table, and return the entry.
146 ALWAYS_INLINE const HashEntry* entry(JSGlobalData* globalData, const Identifier& identifier) const function in struct:JSC::HashTable
149 return entry(identifier);
152 ALWAYS_INLINE const HashEntry* entry(ExecState* exec, const Identifier& identifier) const function in struct:JSC::HashTable
155 return entry(identifier);
159 ALWAYS_INLINE const HashEntry* entry(const Identifier& identifier) const function in struct:JSC::HashTable
163 const HashEntry* entry = &table[identifier.impl()->existingHash() & compactHashSizeMask]; local
165 if (!entry->key())
169 if (entry
192 const HashEntry* entry = table->entry(exec, propertyName); local
208 const HashEntry* entry = table->entry(exec, propertyName); local
234 const HashEntry* entry = table->entry(exec, propertyName); local
253 const HashEntry* entry = table->entry(exec, propertyName); local
270 const HashEntry* entry = table->entry(exec, propertyName); local
288 const HashEntry* entry = table->entry(exec, propertyName); local
308 const HashEntry* entry = table->entry(exec, propertyName); local
[all...]
/external/chromium/net/ftp/
H A Dftp_directory_listing_parser_netware.cc55 FtpDirectoryListingEntry entry;
60 entry.type = FtpDirectoryListingEntry::DIRECTORY;
62 entry.type = FtpDirectoryListingEntry::FILE;
68 // column as the entry type (just there is no space between them). We do not
73 if (!base::StringToInt64(columns[3], &entry.size))
75 if (entry.size < 0)
77 if (entry.type != FtpDirectoryListingEntry::FILE)
78 entry.size = -1;
82 current_time, &entry.last_modified)) {
86 entry
[all...]
H A Dftp_directory_listing_parser_ls.cc154 FtpDirectoryListingEntry entry; local
160 &entry.last_modified)) {
173 entry.type = FtpDirectoryListingEntry::SYMLINK;
175 entry.type = FtpDirectoryListingEntry::DIRECTORY;
177 entry.type = FtpDirectoryListingEntry::FILE;
180 if (!base::StringToInt64(columns[column_offset - 3], &entry.size)) {
183 // entry, but can't really get the size (What if the group is named
187 entry.size = 0;
189 if (entry.size < 0)
191 if (entry
[all...]
/external/chromium/chrome/browser/sessions/
H A Dsession_types.cc62 NavigationEntry* entry = NavigationController::CreateNavigationEntry( local
70 entry->set_page_id(page_id);
71 entry->set_title(title_);
72 entry->set_content_state(state_);
73 entry->set_has_post_data(type_mask_ & TabNavigation::HAS_POST_DATA);
75 return entry;
78 void TabNavigation::SetFromNavigationEntry(const NavigationEntry& entry) { argument
79 virtual_url_ = entry.virtual_url();
80 referrer_ = entry.referrer();
81 title_ = entry
[all...]
/external/easymock/src/org/easymock/internal/
H A DUnorderedBehavior.java36 for (ExpectedInvocationAndResults entry : results) {
37 if (entry.getExpectedInvocation().equals(expected)) {
38 entry.getResults().add(result, count);
48 for (ExpectedInvocationAndResults entry : results) {
50 if (!entry.getExpectedInvocation().matches(actual)) {
53 Result result = entry.getResults().next();
70 for (ExpectedInvocationAndResults entry : results) {
71 if (!entry.getResults().hasValidCallCount()) {
81 for (ExpectedInvocationAndResults entry : results) {
83 boolean validCallCount = entry
[all...]
/external/chromium/net/http/
H A Dhttp_auth_cache_unittest.cc78 HttpAuthCache::Entry* entry; local
127 entry = cache.Lookup(origin, kRealm5, HttpAuth::AUTH_SCHEME_BASIC);
128 EXPECT_TRUE(NULL == entry);
131 entry = cache.Lookup(GURL("https://www.google.com"), kRealm3,
133 EXPECT_TRUE(NULL == entry);
136 entry = cache.Lookup
138 EXPECT_TRUE(NULL == entry);
141 entry = cache.Lookup(
143 ASSERT_FALSE(NULL == entry);
144 EXPECT_EQ(HttpAuth::AUTH_SCHEME_BASIC, entry
229 HttpAuthCache::Entry entry; local
278 HttpAuthCache::Entry* entry = cache.Lookup( local
366 HttpAuthCache::Entry* entry = cache.Lookup( local
445 const HttpAuthCache::Entry* entry = local
457 const HttpAuthCache::Entry* entry = local
[all...]
/external/bison/src/
H A Dmuscle_tab.c104 muscle_entry *entry; local
107 entry = hash_lookup (muscle_table, &probe);
109 if (!entry)
112 entry = xmalloc (sizeof *entry);
113 entry->key = key;
114 hash_insert (muscle_table, entry);
116 entry->value = value;
130 muscle_entry *entry = NULL; local
133 entry
218 muscle_m4_output(muscle_entry *entry, FILE *out) argument
226 muscle_m4_output_processor(void *entry, void *out) argument
[all...]
/external/chromium/chrome/browser/ssl/
H A Dssl_policy.cc88 void SSLPolicy::DidRunInsecureContent(NavigationEntry* entry, argument
90 if (!entry)
93 SiteInstance* site_instance = entry->site_instance();
110 void SSLPolicy::UpdateEntry(NavigationEntry* entry, TabContents* tab_contents) { argument
111 DCHECK(entry);
113 InitializeEntryIfNeeded(entry);
115 if (!entry->url().SchemeIsSecure())
121 if (!entry->ssl().cert_id()) {
122 entry->ssl().set_security_style(SECURITY_STYLE_UNAUTHENTICATED);
126 if (!(entry
214 InitializeEntryIfNeeded(NavigationEntry* entry) argument
[all...]
/external/chromium/chrome/browser/resources/net_internals/
H A Dserviceprovidersview.js111 var entry = serviceProviders[i];
113 addNodeWithText(tr, 'td', entry.name);
114 addNodeWithText(tr, 'td', entry.version);
116 ServiceProvidersView.getLayeredServiceProviderType(entry));
117 addNodeWithText(tr, 'td', ServiceProvidersView.getSocketType(entry));
118 addNodeWithText(tr, 'td', ServiceProvidersView.getProtocolType(entry));
119 addNodeWithText(tr, 'td', entry.path);
133 var entry = namespaceProviders[i];
134 addNodeWithText(tr, 'td', entry.name);
135 addNodeWithText(tr, 'td', entry
[all...]
/external/chromium/net/tools/testserver/
H A Dchromiumsync.py77 """An entry should not have more than one protobuf extension present."""
84 def GetEntryType(entry):
88 entry: A SyncEntity protobuf object whose type to determine.
90 A value from ALL_TYPES if the entry's type can be determined, or None
93 ProtobufExtensionNotUnique: More than one type was indicated by the entry.
95 if entry.server_defined_unique_tag == TOP_LEVEL_FOLDER_TAG:
97 entry_types = GetEntryTypesFromSpecifics(entry.specifics)
283 def _SaveEntry(self, entry):
284 """Insert or update an entry in the change log, and give it a new version.
286 The ID fields of this entry ar
[all...]
/external/chromium/chrome/browser/sync/engine/
H A Dbuild_and_process_conflict_sets_command.cc74 syncable::Entry entry(trans, syncable::GET_BY_ID, *i);
75 CHECK(entry.good());
76 if (entry.Get(syncable::IS_UNSYNCED))
78 if (entry.Get(syncable::IS_UNAPPLIED_UPDATE))
95 void StoreLocalDataForUpdateRollback(syncable::Entry* entry, argument
97 CHECK(!entry->Get(syncable::IS_UNSYNCED)) << " Storing Rollback data for "
98 "entry that's unsynced." << *entry;
99 CHECK(entry->Get(syncable::IS_UNAPPLIED_UPDATE)) << " Storing Rollback data "
100 "for entry tha
254 MergeSetsForIntroducedLoops( syncable::BaseTransaction* trans, syncable::Entry* entry, ConflictProgress* conflict_progress) argument
276 << parent_id << " entry: " << *entry; local
352 CrawlDeletedTreeMergingSets(syncable::BaseTransaction* trans, const syncable::Entry& entry, ConflictProgress* conflict_progress, Checker checker) argument
385 MergeSetsForNonEmptyDirectories( syncable::BaseTransaction* trans, syncable::Entry* entry, ConflictProgress* conflict_progress) argument
[all...]
/external/wpa_supplicant_8/hostapd/src/radius/
H A Dradius_client.c31 * Maximum number of retransmit attempts before the entry is removed from
322 struct radius_msg_list *entry,
329 if (entry->msg_type == RADIUS_ACCT ||
330 entry->msg_type == RADIUS_ACCT_INTERIM) {
332 if (entry->attempts == 0)
340 if (entry->attempts == 0)
348 /* retransmit; remove entry if too many attempts */
349 entry->attempts++;
350 hostapd_logger(radius->ctx, entry->addr, HOSTAPD_MODULE_RADIUS,
352 radius_msg_get_hdr(entry
321 radius_client_retransmit(struct radius_client_data *radius, struct radius_msg_list *entry, os_time_t now) argument
379 struct radius_msg_list *entry, *prev, *tmp; local
487 struct radius_msg_list *entry; local
518 struct radius_msg_list *entry, *prev; local
569 struct radius_msg_list *entry, *prev, *tmp; local
843 struct radius_msg_list *entry, *prev, *_remove; local
883 struct radius_msg_list *entry, *prev, *tmp; local
917 struct radius_msg_list *entry; local
947 struct radius_msg_list *entry; local
1323 struct radius_msg_list *entry, *prev, *tmp; local
[all...]
/external/wpa_supplicant_8/src/radius/
H A Dradius_client.c31 * Maximum number of retransmit attempts before the entry is removed from
322 struct radius_msg_list *entry,
329 if (entry->msg_type == RADIUS_ACCT ||
330 entry->msg_type == RADIUS_ACCT_INTERIM) {
332 if (entry->attempts == 0)
340 if (entry->attempts == 0)
348 /* retransmit; remove entry if too many attempts */
349 entry->attempts++;
350 hostapd_logger(radius->ctx, entry->addr, HOSTAPD_MODULE_RADIUS,
352 radius_msg_get_hdr(entry
321 radius_client_retransmit(struct radius_client_data *radius, struct radius_msg_list *entry, os_time_t now) argument
379 struct radius_msg_list *entry, *prev, *tmp; local
487 struct radius_msg_list *entry; local
518 struct radius_msg_list *entry, *prev; local
569 struct radius_msg_list *entry, *prev, *tmp; local
843 struct radius_msg_list *entry, *prev, *_remove; local
883 struct radius_msg_list *entry, *prev, *tmp; local
917 struct radius_msg_list *entry; local
947 struct radius_msg_list *entry; local
1323 struct radius_msg_list *entry, *prev, *tmp; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/radius/
H A Dradius_client.c31 * Maximum number of retransmit attempts before the entry is removed from
322 struct radius_msg_list *entry,
329 if (entry->msg_type == RADIUS_ACCT ||
330 entry->msg_type == RADIUS_ACCT_INTERIM) {
332 if (entry->attempts == 0)
340 if (entry->attempts == 0)
348 /* retransmit; remove entry if too many attempts */
349 entry->attempts++;
350 hostapd_logger(radius->ctx, entry->addr, HOSTAPD_MODULE_RADIUS,
352 radius_msg_get_hdr(entry
321 radius_client_retransmit(struct radius_client_data *radius, struct radius_msg_list *entry, os_time_t now) argument
379 struct radius_msg_list *entry, *prev, *tmp; local
487 struct radius_msg_list *entry; local
518 struct radius_msg_list *entry, *prev; local
569 struct radius_msg_list *entry, *prev, *tmp; local
843 struct radius_msg_list *entry, *prev, *_remove; local
883 struct radius_msg_list *entry, *prev, *tmp; local
917 struct radius_msg_list *entry; local
947 struct radius_msg_list *entry; local
1323 struct radius_msg_list *entry, *prev, *tmp; local
[all...]
/external/apache-http/src/org/apache/http/impl/conn/tsccm/
H A DBasicPoolEntryRef.java48 /** The planned route of the entry. */
53 * Creates a new reference to a pool entry.
55 * @param entry the pool entry, must not be <code>null</code>
58 public BasicPoolEntryRef(BasicPoolEntry entry, argument
60 super(entry, queue);
61 if (entry == null) {
63 ("Pool entry must not be null.");
65 route = entry.getPlannedRoute();
70 * Obtain the planned route for the referenced entry
[all...]
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/asset/plugins/
H A DZipLocator.java54 private final ZipEntry entry; field in class:ZipLocator.JarAssetInfo
56 public JarAssetInfo(AssetManager manager, AssetKey key, ZipEntry entry){ argument
58 this.entry = entry;
63 return zipfile.getInputStream(entry);
65 throw new AssetLoadException("Failed to load zip entry: "+entry, ex);
80 ZipEntry entry = zipfile.getEntry(name);
81 if (entry == null)
84 return new JarAssetInfo(manager, key, entry);
[all...]
/external/webkit/Source/WebKit2/Shared/
H A DVisitedLinkTable.cpp86 LinkHash* entry; local
88 entry = table + i;
91 if (!*entry)
95 if (*entry == linkHash)
103 *entry = linkHash;
118 LinkHash* entry; local
120 entry = table + i;
123 if (!*entry)
126 if (*entry == linkHash)
/external/chromium/chrome/browser/importer/
H A Dfirefox_importer_unittest.cc192 // Import all bookmarks from a file which include an empty folder entry.
204 ProfileWriter::BookmarkEntry entry; local
208 entry = *it++;
209 EXPECT_EQ(ASCIIToUTF16("Empty"), entry.title);
210 EXPECT_TRUE(entry.is_folder);
211 EXPECT_EQ(base::Time::FromTimeT(1295938143), entry.creation_time);
212 EXPECT_EQ(2, static_cast<int>(entry.path.size()));
213 if (entry.path.size() == 2) {
214 path_it = entry.path.begin();
219 entry
[all...]
/external/dbus/dbus/
H A Ddbus-hash.c138 * @brief Internal representation of a hash entry.
140 * A single entry (key-value pair) in the hash table.
145 DBusHashEntry *next; /**< Pointer to next entry in this
154 * Function used to find and optionally create a hash entry.
172 * element points to first entry in
214 DBusHashTable *table; /**< Pointer to table containing entry. */
216 * first entry in this entry's chain:
217 * used for deleting the entry.
219 DBusHashEntry *entry; /**< Curren member in struct:__anon4996
400 DBusHashEntry *entry; local
445 DBusHashEntry *entry; local
453 free_entry_data(DBusHashTable *table, DBusHashEntry *entry) argument
463 free_entry(DBusHashTable *table, DBusHashEntry *entry) argument
471 remove_entry(DBusHashTable *table, DBusHashEntry **bucket, DBusHashEntry *entry) argument
780 DBusHashEntry *entry; local
805 add_allocated_entry(DBusHashTable *table, DBusHashEntry *entry, unsigned int idx, void *key, DBusHashEntry ***bucket) argument
839 DBusHashEntry *entry; local
910 DBusHashEntry *entry; local
1020 DBusHashEntry *entry; local
1154 DBusHashEntry *entry; local
1180 DBusHashEntry *entry; local
1206 DBusHashEntry *entry; local
1233 DBusHashEntry *entry; local
1259 DBusHashEntry *entry; local
1283 DBusHashEntry *entry; local
1312 DBusHashEntry *entry; local
1341 DBusHashEntry *entry; local
1371 DBusHashEntry *entry; local
1400 DBusHashEntry *entry; local
1471 DBusHashEntry *entry; local
1513 DBusHashEntry *entry; local
1556 DBusHashEntry *entry; local
1598 DBusHashEntry *entry; local
1629 DBusHashEntry *entry; local
1647 DBusHashEntry *entry; local
1676 DBusHashEntry *entry; local
[all...]
/external/icu4c/common/
H A Ducnvmbcs.h266 #define MBCS_ENTRY_TRANSITION_SET_OFFSET(entry, offset) (int32_t)(((entry)&0xff000000)|(offset))
267 #define MBCS_ENTRY_TRANSITION_ADD_OFFSET(entry, offset) (int32_t)((entry)+(offset))
270 #define MBCS_ENTRY_SET_FINAL(entry) (int32_t)((entry)|0x80000000)
271 #define MBCS_ENTRY_FINAL_SET_ACTION(entry, action) (int32_t)(((entry)&0xff0fffff)|((int32_t)(action)<<20L))
272 #define MBCS_ENTRY_FINAL_SET_VALUE(entry, value) (int32_t)(((entry)
[all...]

Completed in 611 milliseconds

1234567891011>>