| /external/e2fsprogs/lib/ext2fs/ |
| irel_ma.c | 58 struct ext2_inode_relocate_entry *entries; member in struct:irel_ma
102 sizeof(struct ext2_inode_relocate_entry), &ma->entries);
105 memset(ma->entries, 0, size);
155 if (ma->entries[(unsigned) old].new == 0)
158 ent->orig = ma->entries[(unsigned) old].orig;
165 ma->entries[(unsigned) old].max_refs) {
168 ma->entries[(unsigned) old].max_refs);
174 ma->entries[(unsigned) old] = *ent;
187 if (ma->entries[(unsigned) old].new == 0)
189 *ent = ma->entries[(unsigned) old]
[all...] |
| /external/openssl/crypto/asn1/ |
| x_name.c | 137 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL)
150 if (ret->entries)
151 sk_X509_NAME_ENTRY_free(ret->entries);
165 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free);
181 STACK_OF(X509_NAME_ENTRY) *entries;
200 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
201 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
202 entry = sk_X509_NAME_ENTRY_value(entries, j);
204 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
207 sk_X509_NAME_ENTRY_free(entries);
[all...] |
| /external/srec/portable/src/ |
| phashtable.c | 49 PHashTableEntry entries[ALLOC_SIZE]; member in struct:PHashTableEntryBlock_t
61 PHashTableEntry **entries; member in struct:PHashTable_t
106 tmp->entries = NEW_ARRAY(PHashTableEntry *, tmp->args.capacity, memTag);
108 if (tmp->entries == NULL)
116 tmp->entries[--i] = NULL;
144 FREE(table->entries);
164 PHashTableEntry *entry = table->entries[idx];
193 entry->table->entries[entry->idx] = entry->next;
283 REALLOC(table->entries,
289 table->entries = newEntries
[all...] |
| /external/libvorbis/vq/ |
| latticetune.c | 45 int entries=-1,dim=-1,guard=1; local
81 entries=b->entries;
84 hits=_ogg_malloc(entries*sizeof(long));
85 lengths=_ogg_calloc(entries,sizeof(long));
86 for(j=0;j<entries;j++)hits[j]=guard;
133 build_tree_from_lengths0(entries,hits,lengths);
141 for(i=0;i<entries;i++)
144 for(j=0;j<entries;j++){
|
| vqgen.c | 78 for(i=0;i<v->entries;i++)
96 float spacings[v->entries];
104 for(j=0;j<v->entries;j++){
107 for(k=0;k<v->entries;k++){
121 if(k<v->entries)continue;
177 for(j=0;j<v->entries;j++){
199 for(j=0;j<v->entries;j++){
229 for(j=0;j<v->entries;j++){
240 void vqgen_init(vqgen *v,int elements,int aux,int entries,float mindist,
252 v->entries=entries
[all...] |
| /external/speex/libspeex/ |
| vq_sse.h | 36 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
43 ALLOC(dist, entries, float);
48 for (i=0;i<entries>>2;i++)
55 for (i=0;i<entries;i++)
75 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
82 ALLOC(dist, entries, float);
87 for (i=0;i<entries>>2;i++)
94 for (i=0;i<entries;i++)
117 nbest[k]+=entries;
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
| AbstractSampleEncryptionBox.java | 27 List<Entry> entries = new LinkedList<Entry>(); field in class:AbstractSampleEncryptionBox
36 offset += 4; //num entries
75 entries.add(e);
82 return entries.size();
86 return entries;
89 public void setEntries(List<Entry> entries) {
90 this.entries = entries;
151 IsoTypeWriter.writeUInt32(byteBuffer, entries.size());
152 for (Entry entry : entries) {
[all...] |
| /external/chromium_org/chrome/browser/sessions/ |
| persistent_tab_restore_service.cc | 106 // Number of entries (not commands) before we clobber the file and write
132 Entries::const_iterator entry_iterator) OVERRIDE;
144 // Creates and add entries to |entries| for each of the windows in |windows|.
146 std::vector<Entry*>* entries);
180 // closed tabs. This creates entries, adds them to staging_entries_, and
184 // Populates |loaded_entries| with Entries from |commands|.
188 // Validates all entries in |entries|, deleting any with no navigations. This
189 // also deletes any entries beyond the max number of entries we can hold
251 const Entries& entries = tab_restore_service_helper_->entries(); local
286 const Entries& entries = tab_restore_service_helper_->entries(); local
304 const Entries& entries = tab_restore_service_helper_->entries(); local
553 std::vector<Entry*> entries; local
781 std::vector<Entry*> entries; local
825 const Entries& entries = tab_restore_service_helper_->entries(); local
941 const TabRestoreService::Entries& PersistentTabRestoreService::entries() const { function in class:PersistentTabRestoreService
[all...] |
| persistent_tab_restore_service_browsertest.cc | 94 TabRestoreService::Entries* mutable_entries() {
211 ASSERT_EQ(1U, service_->entries().size());
214 TabRestoreService::Entry* entry = service_->entries().front();
234 // There should be two entries now.
235 ASSERT_EQ(2U, service_->entries().size());
238 entry = service_->entries().front();
256 EXPECT_TRUE(service_->entries().empty());
270 ASSERT_EQ(1U, service_->entries().size());
273 PersistentTabRestoreService::Entry* entry = service_->entries().front();
294 ASSERT_EQ(1U, service_->entries().size())
[all...] |
| /external/chromium_org/net/dns/ |
| dns_hosts_unittest.cc | 37 } entries[] = { local
54 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(entries); ++i) {
55 DnsHostsKey key(entries[i].host, entries[i].family);
58 ASSERT_TRUE(ParseIPLiteralToNumber(entries[i].ip, &ip));
59 ASSERT_EQ(ip.size(), (entries[i].family == ADDRESS_FAMILY_IPV4) ? 4u : 16u);
|
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| copy-acl.c | 229 aclent_t *entries;
284 /* Huh? The number of ACL entries changed since the last call.
300 entries = NULL;
309 entries = NULL;
313 entries = (aclent_t *) malloc (count * sizeof (aclent_t));
314 if (entries == NULL)
321 ? facl (source_desc, GETACL, count, entries)
322 : acl (src_name, GETACL, count, entries))
325 /* Huh? The number of ACL entries changed since the last call.
349 /* If both ace_entries and entries are available, try SETACL befor
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/fragment/ |
| TrackRunBox.java | 51 private List<Entry> entries = new ArrayList<Entry>(); field in class:TrackRunBox
55 return entries;
128 long[] result = new long[entries.size()];
131 result[i] = entries.get(i).getSampleCompositionTimeOffset();
183 size += entrySize * entries.size();
189 IsoTypeWriter.writeUInt32(byteBuffer, entries.size());
199 for (Entry entry : entries) {
243 entries.add(entry);
249 return entries.size();
340 sb.append("{sampleCount=").append(entries.size())
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| RefSortedMap.java | 85 transient ArrayList<MapEntry<K, V>> entries = new ArrayList<MapEntry<K, V>>(); field in class:RefSortedMap
116 entries.size();
122 return offset + 1 < entries.size()
123 && isInRange(entries.get(offset + 1).getKey());
134 return entries.get(offset);
143 RefSortedMap.this.entries.remove(offset);
182 if (-idx - 1 >= entries.size() || !isInRange(entries.get(-idx - 1).getKey())) {
185 return entries.get(-idx - 1).getKey();
205 if (idx < 0 || !isInRange(entries.get(idx).getKey()))
[all...] |
| /external/libvorbis/lib/ |
| codebook.c | 37 oggpack_write(opb,c->entries,24);
42 for(i=1;i<c->entries;i++)
44 if(i==c->entries)ordered=1;
55 for(i=1;i<c->entries;i++){
60 oggpack_write(opb,i-count,_ilog(c->entries-count));
65 oggpack_write(opb,i-count,_ilog(c->entries-count));
72 /* algortihmic mapping has use for 'unused entries', which we tag
75 for(i=0;i<c->entries;i++)
78 if(i==c->entries){
79 oggpack_write(opb,0,1); /* no unused entries */
[all...] |
| /external/chromium/chrome/browser/sessions/ |
| tab_restore_service_browsertest.cc | 129 ASSERT_EQ(1U, service_->entries().size());
132 TabRestoreService::Entry* entry = service_->entries().front();
150 // There should be two entries now.
151 ASSERT_EQ(2U, service_->entries().size());
154 entry = service_->entries().front();
171 EXPECT_TRUE(service_->entries().empty());
185 ASSERT_EQ(1U, service_->entries().size());
188 TabRestoreService::Entry* entry = service_->entries().front();
209 ASSERT_EQ(1U, service_->entries().size());
213 TabRestoreService::Entry* entry = service_->entries().front()
[all...] |
| /external/chromium_org/chrome/browser/media_galleries/linux/ |
| mtp_device_object_enumerator.cc | 12 const std::vector<MtpFileEntry>& entries)
13 : file_entries_(entries),
|
| /external/chromium_org/chrome/browser/resources/sync_internals/ |
| events.js | 32 var entries = chrome.sync.log.entries; variable
33 for (var i = 0; i < entries.length; ++i) {
34 syncEvents.appendChild(makeLogEntryNode(entries[i]));
|
| /external/chromium_org/chrome/test/mini_installer/ |
| registry_verifier.py | 8 def VerifyRegistryEntries(entries):
12 entries: A dictionary whose keys are registry keys and values are
15 for key, expectation in entries.iteritems():
|
| /external/chromium_org/net/ftp/ |
| ftp_directory_listing_parser_os2.cc | 20 std::vector<FtpDirectoryListingEntry>* entries) {
64 // Some FTP servers send listing entries with empty names.
67 // Other entries can still be useful.
71 entries->push_back(entry);
|
| ftp_directory_listing_parser_windows.cc | 20 std::vector<FtpDirectoryListingEntry>* entries) {
59 // Some FTP servers send listing entries with empty names.
62 // Other entries can still be useful.
66 entries->push_back(entry);
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| FileSystemView.js | 153 * @param {Array.<WebInspector.FileSystemModel.Entry>=} entries
155 _directoryContentReceived: function(errorCode, entries)
163 if (errorCode !== 0 || !entries) {
168 entries.sort(WebInspector.FileSystemModel.Entry.compare);
170 this._view.showEntries(entries);
177 while (newEntryIndex < entries.length && oldChildIndex < oldChildren.length) {
178 var newEntry = entries[newEntryIndex];
203 for (; newEntryIndex < entries.length; ++newEntryIndex)
204 this.appendChild(new WebInspector.FileSystemView.EntryTreeElement(this._fileSystemView, entries[newEntryIndex]));
|
| /external/chromium_org/v8/src/ |
| heap-snapshot-generator-inl.h | 38 return &snapshot()->entries()[from_index_];
48 return static_cast<int>(this - &snapshot_->entries().first());
|
| /external/elfutils/tests/ |
| run-readelf-test4.sh | 32 Index of archive 'testfile19.index' has 4 entries:
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingSetMultimap.java | 41 @Override public Set<Entry<K, V>> entries() { method in class:ForwardingSetMultimap
42 return delegate().entries();
|
| /external/icu4c/layout/ |
| LookupTables.h | 59 const LookupSingle *lookupSingle(const LookupSingle *entries, LEGlyphID glyph) const;
79 LookupSingle entries[ANY_NUMBER]; member in struct:SingleTableLookupTable
|
