Searched refs:entry (Results 76 - 100 of 2747) sorted by relevance

1234567891011>>

/external/oprofile/opjitconv/
H A Dparse_dump.c25 /* parse a code load record and add the entry to the jitentry list */
29 struct jitentry * entry; local
37 entry = xcalloc(1, sizeof(struct jitentry));
40 entry->next = NULL;
43 entry->symbol_name = (char *)ptr;
44 entry->sym_name_malloced = 0;
46 entry->code = rec->code_addr ? ptr : NULL;
47 entry->vma = rec->vma;
48 entry->code_size = rec->code_size;
49 entry
89 struct jitentry * entry; local
[all...]
/external/chromium_org/third_party/mesa/src/src/mapi/mapi/
H A Dentry_x86_tls.h100 char *entry; local
104 for (entry = x86_entry_start; entry < x86_entry_end; entry += 16)
105 memcpy(entry, patch, sizeof(patch));
116 entry_patch(mapi_func entry, int slot) argument
118 char *code = (char *) entry;
131 mapi_func entry; local
140 entry = (mapi_func) code;
141 entry_patch(entry, slo
[all...]
/external/mesa3d/src/mapi/mapi/
H A Dentry_x86_tls.h100 char *entry; local
104 for (entry = x86_entry_start; entry < x86_entry_end; entry += 16)
105 memcpy(entry, patch, sizeof(patch));
116 entry_patch(mapi_func entry, int slot) argument
118 char *code = (char *) entry;
131 mapi_func entry; local
140 entry = (mapi_func) code;
141 entry_patch(entry, slo
[all...]
/external/smack/src/org/xbill/DNS/
H A DCompression.java35 * Adds a compression entry mapping a name to a position in a message.
44 Entry entry = new Entry();
45 entry.name = name;
46 entry.pos = pos;
47 entry.next = table[row];
48 table[row] = entry;
63 for (Entry entry = table[row]; entry != null; entry = entry
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/oauth_contacts/
H A Dbackground.js28 for (var i = 0, entry; entry = data.feed.entry[i]; i++) {
30 'name' : entry['title']['$t'],
31 'id' : entry['id']['$t'],
35 if (entry['gd$email']) {
36 var emails = entry['gd$email'];
/external/emma/core/java12/com/vladium/util/
H A DIntSet.java89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
91 if (key == entry.m_key)
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next)
111 result [scan ++] = entry
[all...]
H A DIntIntMap.java27 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
93 if (key == entry.m_key) return true;
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry
[all...]
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/icu/icu4c/source/layout/
H A DLookupTables.cpp34 LEReferenceTo<LookupSegment> entry(base, success, segments);
35 LEReferenceTo<LookupSegment> trial(entry, success, extra);
40 entry = trial;
45 trial = entry; // copy
49 entry = trial;
53 if (SWAPW(entry->firstGlyph) <= ttGlyph) {
54 return entry.getAlias();
66 LEReferenceTo<LookupSingle> entry(base, success, entries);
67 LEReferenceTo<LookupSingle> trial(entry, success, extra);
70 entry
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractMapEntryTest.java36 private static <K, V> Entry<K, V> entry(final K key, final V value) { method in class:AbstractMapEntryTest
52 assertEquals("foo=1", entry("foo", 1).toString());
56 assertEquals("null=1", entry(NK, 1).toString());
57 assertEquals("foo=null", entry("foo", NV).toString());
58 assertEquals("null=null", entry(NK, NV).toString());
62 Entry<String, Integer> foo1 = entry("foo", 1);
65 assertEquals(control("bar", 2), entry("bar", 2));
66 assertFalse(control("foo", 1).equals(entry("foo", 2)));
73 assertEquals(control(NK, 1), entry(NK, 1));
74 assertEquals(control("bar", NV), entry("ba
[all...]
/external/chromium_org/third_party/mesa/src/src/glsl/
H A Dglsl_symbol_table.cpp33 void *entry = ralloc_size(ctx, size); local
34 assert(entry != NULL);
35 return entry;
39 static void operator delete(void *entry) argument
41 ralloc_free(entry);
90 * the current scope, just update the existing entry to include 'v'.
97 /* If not declared at this scope, add a new entry. But if an existing
98 * entry includes a function, propagate that to this block - otherwise
101 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
103 entry
113 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
119 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(t); local
133 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
139 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(u); local
145 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
153 symbol_table_entry *entry = get_entry(name); local
159 symbol_table_entry *entry = get_entry(name); local
165 symbol_table_entry *entry = get_entry(name); local
[all...]
H A Dopt_structure_splitting.cpp115 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
116 if (entry->var == var)
117 return entry;
120 variable_entry2 *entry = new(mem_ctx) variable_entry2(var); local
121 this->variable_list.push_tail(entry);
122 return entry;
129 variable_entry2 *entry = this->get_variable_entry2(ir); local
131 if (entry)
132 entry->declaration = true;
141 variable_entry2 *entry local
217 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
323 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
345 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
[all...]
/external/mesa3d/src/glsl/
H A Dglsl_symbol_table.cpp33 void *entry = ralloc_size(ctx, size); local
34 assert(entry != NULL);
35 return entry;
39 static void operator delete(void *entry) argument
41 ralloc_free(entry);
90 * the current scope, just update the existing entry to include 'v'.
97 /* If not declared at this scope, add a new entry. But if an existing
98 * entry includes a function, propagate that to this block - otherwise
101 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
103 entry
113 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(v); local
119 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(t); local
133 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
139 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(u); local
145 symbol_table_entry *entry = new(mem_ctx) symbol_table_entry(f); local
153 symbol_table_entry *entry = get_entry(name); local
159 symbol_table_entry *entry = get_entry(name); local
165 symbol_table_entry *entry = get_entry(name); local
[all...]
H A Dopt_structure_splitting.cpp115 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
116 if (entry->var == var)
117 return entry;
120 variable_entry2 *entry = new(mem_ctx) variable_entry2(var); local
121 this->variable_list.push_tail(entry);
122 return entry;
129 variable_entry2 *entry = this->get_variable_entry2(ir); local
131 if (entry)
132 entry->declaration = true;
141 variable_entry2 *entry local
217 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
323 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
345 variable_entry2 *entry = (variable_entry2 *)iter.get(); local
[all...]
/external/oprofile/daemon/
H A Dopd_cookie.c105 struct cookie_entry * entry = xmalloc(sizeof(struct cookie_entry)); local
107 entry->value = cookie;
108 entry->name = xmalloc(PATH_MAX + 1);
110 err = lookup_dcookie(cookie, entry->name, PATH_MAX);
115 free(entry->name);
116 entry->name = NULL;
117 entry->ignored = 0;
119 entry->ignored = is_image_ignored(entry->name);
122 return entry;
137 struct cookie_entry * entry; local
160 struct cookie_entry * entry; local
182 struct cookie_entry * entry; local
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/workspace/
H A DFileSystemMapping.js104 var entry = new WebInspector.FileSystemMapping.Entry(savedEntry.fileSystemPath, savedEntry.urlPrefix, savedEntry.pathPrefix);
105 fileSystemMappings.push(entry);
119 var entry = new WebInspector.FileSystemMapping.ExcludedFolderEntry(savedEntry.fileSystemPath, savedEntry.path);
120 excludedFolders.push(entry);
146 var entry = fileSystemMapping[i];
147 this._mappingForURLPrefix[entry.urlPrefix] = entry;
148 this._urlPrefixes.push(entry.urlPrefix);
185 var entry = new WebInspector.FileSystemMapping.Entry(fileSystemPath, urlPrefix, pathPrefix);
186 this._fileSystemMappings[fileSystemPath].push(entry);
[all...]
/external/icu/icu4c/source/common/
H A Dlrucache.cpp56 void LRUCache::moveToMostRecent(CacheEntry *entry) { argument
57 if (entry->moreRecent == mostRecentlyUsedMarker) {
60 entry->unlink();
61 entry->moreRecent = mostRecentlyUsedMarker;
62 entry->lessRecent = mostRecentlyUsedMarker->lessRecent;
63 mostRecentlyUsedMarker->lessRecent->moreRecent = entry;
64 mostRecentlyUsedMarker->lessRecent = entry;
67 void LRUCache::init(char *adoptedLocId, CacheEntry *entry) { argument
70 entry->init(adoptedLocId, result, status);
83 CacheEntry *entry local
[all...]
/external/chromium_org/net/ftp/
H A Dftp_directory_listing_parser_netware.cc57 FtpDirectoryListingEntry entry;
62 entry.type = FtpDirectoryListingEntry::DIRECTORY;
64 entry.type = FtpDirectoryListingEntry::FILE;
70 // column as the entry type (just there is no space between them). We do not
75 if (!base::StringToInt64(columns[3], &entry.size))
77 if (entry.size < 0)
79 if (entry.type != FtpDirectoryListingEntry::FILE)
80 entry.size = -1;
84 current_time, &entry.last_modified)) {
88 entry
[all...]
/external/deqp/framework/delibs/dethread/win32/
H A DdeThreadWin32.c59 ThreadEntry* entry = (ThreadEntry*)entryPtr; local
60 deThreadFunc func = entry->func;
61 void* arg = entry->arg;
63 deFree(entry);
72 ThreadEntry* entry = (ThreadEntry*)deMalloc(sizeof(ThreadEntry)); local
75 if (!entry)
78 entry->func = func;
79 entry->arg = arg;
81 thread = CreateThread(DE_NULL, 0, startThread, entry, 0, DE_NULL);
84 deFree(entry);
[all...]
/external/chromium_org/components/dom_distiller/core/
H A Darticle_entry.cc18 bool IsEntryValid(const ArticleEntry& entry) { argument
19 if (!entry.has_entry_id())
21 for (int i = 0; i < entry.pages_size(); ++i) {
22 if (!IsEntryPageValid(entry.pages(i)))
37 ArticleEntry entry = article_specifics; local
38 DCHECK(IsEntryValid(entry));
39 return entry;
42 EntitySpecifics SpecificsFromEntry(const ArticleEntry& entry) { argument
43 DCHECK(IsEntryValid(entry));
45 *specifics.mutable_article() = entry;
63 CreateLocalData(const ArticleEntry& entry) argument
[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_org/third_party/skia/src/core/
H A DSkBitmapHeap.cpp127 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) { argument
128 if (fMostRecentlyUsed == entry) {
129 fMostRecentlyUsed = entry->fLessRecentlyUsed;
131 SkASSERT(fLeastRecentlyUsed == entry);
137 // Remove entry from its prior place, and make sure to cover the hole.
138 if (fLeastRecentlyUsed == entry) {
139 SkASSERT(entry->fMoreRecentlyUsed != NULL);
140 fLeastRecentlyUsed = entry->fMoreRecentlyUsed;
142 // Since we have already considered the case where entry is the most recently used, it must
144 SkASSERT(entry
155 appendToLRU(SkBitmapHeap::LookupEntry* entry) argument
237 findInLookupTable(const LookupEntry& indexEntry, SkBitmapHeapEntry** entry) argument
275 removeEntryFromLookupTable(LookupEntry* entry) argument
289 SkBitmapHeapEntry* entry = NULL; local
[all...]
/external/skia/src/core/
H A DSkBitmapHeap.cpp127 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) { argument
128 if (fMostRecentlyUsed == entry) {
129 fMostRecentlyUsed = entry->fLessRecentlyUsed;
131 SkASSERT(fLeastRecentlyUsed == entry);
137 // Remove entry from its prior place, and make sure to cover the hole.
138 if (fLeastRecentlyUsed == entry) {
139 SkASSERT(entry->fMoreRecentlyUsed != NULL);
140 fLeastRecentlyUsed = entry->fMoreRecentlyUsed;
142 // Since we have already considered the case where entry is the most recently used, it must
144 SkASSERT(entry
155 appendToLRU(SkBitmapHeap::LookupEntry* entry) argument
237 findInLookupTable(const LookupEntry& indexEntry, SkBitmapHeapEntry** entry) argument
275 removeEntryFromLookupTable(LookupEntry* entry) argument
289 SkBitmapHeapEntry* entry = NULL; local
[all...]
/external/chromium_org/remoting/client/
H A Dclient_status_logger.cc59 scoped_ptr<ServerLogEntry> entry(
61 AddClientFieldsToLogEntry(entry.get());
62 entry->AddModeField(log_to_server_.mode());
76 AddSessionIdToLogEntry(entry.get(), session_id_);
81 AddSessionDurationToLogEntry(entry.get(),
90 log_to_server_.Log(*entry.get());
98 scoped_ptr<ServerLogEntry> entry(MakeLogEntryForStatistics(statistics));
99 AddClientFieldsToLogEntry(entry.get());
100 entry->AddModeField(log_to_server_.mode());
101 AddSessionIdToLogEntry(entry
[all...]
/external/chromium_org/v8/src/compiler/
H A Dnode-cache.cc64 Entry* entry = &entries_[j]; local
65 if (entry->value_ == NULL) {
66 entry->key_ = old->key_;
67 entry->value_ = old->value_;
81 // Allocate the initial entries and insert the first entry.
86 Entry* entry = &entries_[hash & (INITIAL_SIZE - 1)]; local
87 entry->key_ = key;
88 return &entry->value_;
96 Entry* entry = &entries_[i]; local
97 if (entry
108 Entry* entry = &entries_[hash & (size_ - 1)]; local
[all...]

Completed in 1162 milliseconds

1234567891011>>