HomeSort by relevance Sort by last modified time
    Searched refs:entry (Results 676 - 700 of 4249) sorted by null

<<21222324252627282930>>

  /frameworks/base/tests/LocationTracker/src/com/android/locationtracker/data/
TrackerEntry.java 25 * Class that holds a tracker entry. An entry can be either a valid location, or
96 TrackerEntry entry = new TrackerEntry(loc); local
99 entry.setTimestamp(timestampVal);
100 entry.setDistFromNetLocation(distFromNetLocation);
101 return entry;
108 TrackerEntry entry = new TrackerEntry(tag, EntryType.LOG_TYPE); local
110 entry.setTimestamp(timestampVal);
111 entry.setLogMsg(msg);
112 return entry;
212 TrackerEntry entry = new TrackerEntry(tag, EntryType.valueOf(sType)); local
    [all...]
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_html_writer_unittest.cc 62 string16 BookmarkEntryToString(const ImportedBookmarkEntry& entry) {
65 if (entry.in_toolbar)
70 result.append(ASCIIToUTF16(" url=") + UTF8ToUTF16(entry.url.spec()));
73 for (size_t i = 0; i < entry.path.size(); ++i) {
76 result.append(entry.path[i]);
80 result.append(entry.title);
83 result.append(base::TimeFormatFriendlyDateAndTime(entry.creation_time));
95 ImportedBookmarkEntry entry; local
96 entry.in_toolbar = on_toolbar;
97 entry.url = url
    [all...]
  /external/chromium_org/chrome/renderer/resources/extensions/
sync_file_system_custom_bindings.js 19 functionName, function(entry, callback) {
20 var fileSystemUrl = entry.toURL();
70 var entry = response[i].entry;
72 entry.fileSystemType,
73 entry.fileSystemName,
74 entry.rootUrl,
75 entry.filePath,
76 entry.isDirectory);
  /external/chromium_org/media/tools/bug_hunter/
bug_hunter.py 143 options.email_entries = [entry for entry in options.email_entries
144 if entry in _ISSUE_ELEMENT_IN_EMAIL_CHOICES]
180 for entry in options.email_entries:
181 self._issue_template += '%%(%s)s ' % entry
200 in list(reversed(comments_feed.entry))[0:max_comments]]
227 if not feed.entry:
232 for entry in feed.entry:
234 issue_id = entry.id.text.split('/')[-1
    [all...]
  /external/grub/netboot/
epic100.c 78 static unsigned int cur_rx, cur_tx; /* The next free ring entry */
267 /* Mark the last entry as wrapping the ring. */
300 int entry; local
302 /* Calculate the next Tx descriptor entry. */
303 entry = cur_tx % TX_RING_SIZE;
305 if ((tx_ring[entry].status & TRING_OWN) == TRING_OWN) {
307 tx_ring[entry].status);
313 txp = (char*)tx_ring[entry].bufaddr;
328 tx_ring[entry].txlength = (len >= 60 ? len : 60);
329 tx_ring[entry].buflength = len
361 int entry; local
    [all...]
  /external/mdnsresponder/mDNSPosix/
NetMonitor.c 203 HostEntry *entry = list->hosts + i; local
204 if (mDNSSameAddress(addr, &entry->addr))
205 return entry;
214 HostEntry *entry; local
225 entry = list->hosts + list->num++;
227 entry->addr = *addr;
228 for (i=0; i<HostPkt_NumTypes; i++) entry->pkts[i] = 0;
229 entry->totalops = 0;
230 for (i=0; i<OP_NumTypes; i++) entry->stat[i] = 0;
231 entry->hostname.c[0] = 0
255 HostEntry *entry = FindHost(addr, list); local
616 HostEntry *entry = GotPacketFromHost(srcaddr, MQ ? HostPkt_Q : HostPkt_L, msg->h.id); local
693 HostEntry *entry = GotPacketFromHost(srcaddr, HostPkt_R, msg->h.id); local
759 HostEntry *entry = GotPacketFromHost(srcaddr, HostPkt_R, msg->h.id); local
    [all...]
  /libcore/luni/src/main/java/java/util/zip/
ZipFile.java 203 * need random-access entry lookup by name, you should probably use {@link ZipInputStream}
238 * Returns the zip entry with the given name, or null if there is no such entry.
258 * @param entry
265 public InputStream getInputStream(ZipEntry entry) throws IOException {
267 entry = getEntry(entry.getName());
268 if (entry == null) {
275 // We don't know the entry data's start position. All we have is the
276 // position of the entry's local header
    [all...]
  /system/media/camera/docs/
camera_metadata_tag_info.mako 50 % for entry in find_unique_entries(sec):
51 [ ${entry.name | csym} - ${path_name(sec) | csym}_START ] =
52 { ${'"%s",' %(entry.name_short) | pad(40)} ${entry.type | ctype_enum,ljust(11)} },
73 % for idx,entry in enumerate(find_unique_entries(sec)):
74 case ${entry.name | csym}: {
75 % if entry.enum:
77 % for val in entry.enum.values:
78 case ${entry.name | csym}_${val.name}:
  /frameworks/base/core/java/android/net/
NetworkStatsHistory.java 26 import static android.net.NetworkStatsHistory.Entry.UNKNOWN;
81 public static class Entry {
265 * Return specific stats entry.
267 public Entry getValues(int i, Entry recycle) {
268 final Entry entry = recycle != null ? recycle : new Entry(); local
269 entry.bucketStart = bucketStart[i];
270 entry.bucketDuration = bucketDuration
360 final NetworkStats.Entry entry = new NetworkStats.Entry( local
480 final Entry entry = recycle != null ? recycle : new Entry(); local
549 final NetworkStats.Entry entry = new NetworkStats.Entry( local
    [all...]
  /art/runtime/
vmap_table.h 31 // Look up nth entry, not called from performance critical code.
36 uint16_t entry = DecodeUnsignedLeb128(&table); local
38 entry = DecodeUnsignedLeb128(&table);
40 return entry;
64 uint16_t entry = DecodeUnsignedLeb128(&table); local
65 if ((entry == vreg) && (in_floats == is_float)) {
70 if (entry == 0xffff) {
77 // Compute the register number that corresponds to the entry in the vmap (vmap_offset, computed
  /bionic/libc/kernel/arch-x86/asm/
desc_32.h 64 #define write_ldt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
65 #define write_gdt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
66 #define write_idt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
  /development/ndk/platforms/android-9/arch-x86/include/asm/
desc_32.h 64 #define write_ldt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
65 #define write_gdt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
66 #define write_idt_entry(dt, entry, a, b) write_dt_entry(dt, entry, a, b)
  /external/chromium/chrome/browser/sync/engine/
process_updates_command.cc 74 // Returns true if the entry is still ok to process.
75 bool ReverifyEntry(syncable::WriteTransaction* trans, const SyncEntity& entry,
78 const bool deleted = entry.has_deleted() && entry.deleted();
79 const bool is_directory = entry.IsFolder();
80 const syncable::ModelType model_type = entry.GetModelType();
83 entry,
109 return SUCCESS_PROCESSED; // The entry has become irrelevant.
115 // server fields of a local entry and then move the data to the local fields
121 return SUCCESS_PROCESSED; // The entry has become irrelevant
    [all...]
  /external/chromium/chrome/browser/ui/toolbar/
toolbar_model.cc 44 NavigationEntry* entry = navigation_controller->GetActiveEntry(); local
48 } else if (entry) {
49 url = entry->virtual_url();
72 NavigationEntry* entry = navigation_controller->GetActiveEntry();
73 if (!entry)
76 const NavigationEntry::SSLStatus& ssl = entry->ssl();
119 // Note: Navigation controller and active entry are guaranteed non-NULL or
  /external/chromium_org/chrome/browser/chromeos/drive/file_system/
truncate_operation.cc 111 scoped_ptr<ResourceEntry> entry) {
119 DCHECK(entry);
120 DCHECK(entry->has_file_specific_info());
122 if (entry->file_specific_info().is_hosted_document()) {
132 entry->resource_id(),
136 weak_ptr_factory_.GetWeakPtr(), entry->resource_id(), callback));
  /external/chromium_org/chrome/browser/ui/webui/
history_ui_unittest.cc 28 BrowsingHistoryHandler::HistoryEntry entry; local
29 entry.time = baseline_time +
31 entry.url = GURL(test_results[i].url);
32 entry.all_timestamps.insert(entry.time.ToInternalValue());
33 results->push_back(entry);
  /external/chromium_org/net/disk_cache/
disk_cache_test_base.h 27 class Entry;
113 int OpenEntry(const std::string& key, disk_cache::Entry** entry);
114 int CreateEntry(const std::string& key, disk_cache::Entry** entry);
120 int OpenNextEntry(void** iter, disk_cache::Entry** next_entry);
123 int ReadData(disk_cache::Entry* entry, int index, int offset,
125 int WriteData(disk_cache::Entry* entry, int index, int offset
    [all...]
  /external/chromium_org/third_party/libusb/src/libusb/
libusbi.h 75 /* Get an entry from the list
83 /* Get each entry from a list
100 #define list_empty(entry) ((entry)->next == (entry))
102 static inline void list_init(struct list_head *entry)
104 entry->prev = entry->next = entry;
107 static inline void list_add(struct list_head *entry, struct list_head *head
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/
packed-cache-inl.h 46 // In an effort to use minimal space, every cache entry represents
48 // entry as empty or uninitialized. In practice, you may want to have
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
71 // be using 128 bits for each entry anyway, so maybe just pick
104 // if a whole key plus a whole value fits in an entry. Otherwise, an
105 // entry is the high bits of a key and a value, packed together.
107 // entry if kHashbits >= 11.
131 // the table is controlled by kHashbits, and the type of each entry in
175 T entry = array_[Hash(key)]; local
176 return KeyMatch(entry, key) ? EntryToValue(entry) : default_value
    [all...]
  /external/chromium_org/third_party/tcmalloc/vendor/src/
packed-cache-inl.h 46 // In an effort to use minimal space, every cache entry represents
48 // entry as empty or uninitialized. In practice, you may want to have
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
71 // be using 128 bits for each entry anyway, so maybe just pick
104 // if a whole key plus a whole value fits in an entry. Otherwise, an
105 // entry is the high bits of a key and a value, packed together.
107 // entry if kHashbits >= 11.
131 // the table is controlled by kHashbits, and the type of each entry in
173 T entry = array_[Hash(key)]; local
174 return KeyMatch(entry, key) ? EntryToValue(entry) : default_value
    [all...]
  /external/chromium_org/webkit/browser/appcache/
appcache.cc 45 void AppCache::AddEntry(const GURL& url, const AppCacheEntry& entry) {
47 entries_.insert(EntryMap::value_type(url, entry));
48 cache_size_ += entry.response_size();
51 bool AppCache::AddOrModifyEntry(const GURL& url, const AppCacheEntry& entry) {
53 entries_.insert(EntryMap::value_type(url, entry));
55 // Entry already exists. Merge the types of the new and existing entries.
57 ret.first->second.add_types(entry.types());
59 cache_size_ += entry.response_size(); // New entry. Add to cache size.
102 const AppCacheEntry* entry = GetEntryAndUrlWithResponseId local
162 const AppCacheDatabase::EntryRecord& entry = entries.at(i); local
262 AppCacheEntry* entry = GetEntry(url_no_ref); local
    [all...]
  /external/e2fsprogs/lib/ext2fs/
ext_attr.c 34 __u32 ext2fs_ext_attr_hash_entry(struct ext2_ext_attr_entry *entry, void *data)
37 char *name = ((char *) entry) + sizeof(struct ext2_ext_attr_entry);
40 for (n = 0; n < entry->e_name_len; n++) {
47 if (entry->e_value_block == 0 && entry->e_value_size != 0) {
49 for (n = (entry->e_value_size + EXT2_EXT_ATTR_ROUND) >>
  /external/guava/guava-tests/test/com/google/common/collect/
BiMapMapInterfaceTest.java 25 import java.util.Map.Entry;
65 for (Entry<String, Integer> entry : bimap.entrySet()) {
66 assertEquals(entry.getKey(), inverse.get(entry.getValue()));
68 for (Entry<Integer, String> entry : inverse.entrySet()) {
69 assertEquals(entry.getKey(), bimap.get(entry.getValue()));
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/
SampleToGroupBox.java 31 * sample group. The table is compactly coded with each entry giving the index of the first sample of a run of
49 List<Entry> entries = new LinkedList<Entry>();
69 for (Entry entry : entries) {
70 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSampleCount());
71 IsoTypeWriter.writeUInt32(byteBuffer, entry.getGroupDescriptionIndex());
85 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(content)), l2i(IsoTypeReader.readUInt32(content))));
89 public static class Entry {
93 public Entry(long sampleCount, int groupDescriptionIndex)
131 Entry entry = (Entry) o; local
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/cdrom/dc/
SDL_syscdrom.c 87 unsigned long entry = toc.entry[i]; local
89 cdrom->track[i].type = (TOC_CTRL(toc.entry[i])==TRACK_CDDA)?SDL_AUDIO_TRACK:SDL_DATA_TRACK;
90 cdrom->track[i].offset = TOC_LBA(entry)-150;
91 cdrom->track[i].length = TOC_LBA((i+1<toc.last)?toc.entry[i+1]:toc.leadout_sector)-TOC_LBA(entry);

Completed in 457 milliseconds

<<21222324252627282930>>