| /external/chromium_org/third_party/boringssl/src/crypto/x509/ |
| x_name.c | 142 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL)
155 if (ret->entries)
156 sk_X509_NAME_ENTRY_free(ret->entries);
170 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free);
187 STACK_OF(X509_NAME_ENTRY) *entries;
206 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
207 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
208 entry = sk_X509_NAME_ENTRY_value(entries, j);
210 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
213 sk_X509_NAME_ENTRY_free(entries);
[all...] |
| /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/libexif/libexif/olympus/ |
| exif-mnote-data-olympus.c | 53 if (n->entries) {
55 if (n->entries[i].data) {
56 exif_mem_free (d->mem, n->entries[i].data);
57 n->entries[i].data = NULL;
59 exif_mem_free (d->mem, n->entries);
60 n->entries = NULL;
83 mnote_olympus_tag_get_name (n->entries[i].tag));
85 return mnote_olympus_entry_get_value (&n->entries[i], val, maxlen);
111 * Allocate enough memory for all entries and the number of entries
[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/chromium_org/chrome/browser/sessions/ |
| persistent_tab_restore_service_unittest.cc | 93 TabRestoreService::Entries* mutable_entries() {
208 ASSERT_EQ(1U, service_->entries().size());
211 TabRestoreService::Entry* entry = service_->entries().front();
231 // There should be two entries now.
232 ASSERT_EQ(2U, service_->entries().size());
235 entry = service_->entries().front();
253 EXPECT_TRUE(service_->entries().empty());
267 ASSERT_EQ(1U, service_->entries().size());
270 PersistentTabRestoreService::Entry* entry = service_->entries().front();
291 ASSERT_EQ(1U, service_->entries().size())
[all...] |
| persistent_tab_restore_service.cc | 105 // Number of entries (not commands) before we clobber the file and write
131 Entries::const_iterator entry_iterator) OVERRIDE;
143 // Creates and add entries to |entries| for each of the windows in |windows|.
145 std::vector<Entry*>* entries);
179 // closed tabs. This creates entries, adds them to staging_entries_, and
183 // Populates |loaded_entries| with Entries from |commands|.
187 // Validates all entries in |entries|, deleting any with no navigations. This
188 // also deletes any entries beyond the max number of entries we can hold
250 const Entries& entries = tab_restore_service_helper_->entries(); local
285 const Entries& entries = tab_restore_service_helper_->entries(); local
303 const Entries& entries = tab_restore_service_helper_->entries(); local
552 std::vector<Entry*> entries; local
780 std::vector<Entry*> entries; local
824 const Entries& entries = tab_restore_service_helper_->entries(); local
940 const TabRestoreService::Entries& PersistentTabRestoreService::entries() const { function in class:PersistentTabRestoreService
[all...] |
| persistent_tab_restore_service_browsertest.cc | 38 ASSERT_EQ(1U, trs->entries().size());
39 const TabRestoreService::Entry* restored_entry = trs->entries().front();
|
| /external/chromium_org/build/android/gyp/ |
| java_cpp_enum.py | 17 def __init__(self, class_name=None, class_package=None, entries=None):
20 self.entries = collections.OrderedDict(entries or [])
24 if key in self.entries:
26 self.entries[key] = value
36 assert self.entries
44 if not all(self.entries.values()):
46 for key, value in self.entries.iteritems():
48 self.entries[key] = index
50 elif value in self.entries
[all...] |
| /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/third_party/WebKit/Source/core/svg/ |
| SVGGradientElement.cpp | 39 DEFINE_STATIC_LOCAL(SVGEnumerationStringEntries, entries, ());
40 if (entries.isEmpty()) {
41 entries.append(std::make_pair(SVGSpreadMethodPad, "pad"));
42 entries.append(std::make_pair(SVGSpreadMethodReflect, "reflect"));
43 entries.append(std::make_pair(SVGSpreadMethodRepeat, "repeat"));
45 return entries;
|
| /external/chromium_org/tools/memory_inspector/memory_inspector/core/ |
| memory_map.py | 17 self.entries = [] # List of |MapEntry|, sorted by start address.
21 bisect.insort_right(self.entries, entry)
25 idx = bisect.bisect_right(self.entries, addr) - 1
28 entry = self.entries[idx]
37 return self.entries[index]
40 return len(self.entries)
|
| /external/ltrace/ |
| lens_enum.c | 54 VECT_DESTROY(&self->entries, struct enum_entry,
108 for (i = 0; i < vect_size(&lens->entries); ++i) {
109 struct enum_entry *entry = VECT_ELEMENT(&lens->entries,
143 VECT_INIT(&lens->entries, struct enum_entry);
152 return VECT_PUSHBACK(&lens->entries, &entry);
158 return vect_size(&lens->entries);
|
| /external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
| file_watcher.js | 61 * @param {Array.<Entry>} entries Array of entries.
67 entries, properties) {
68 this.dispatchMetadataEvent_('filesystem', entries, properties);
74 * @param {Array.<Entry>} entries Array of entries.
80 entries, properties) {
81 this.dispatchMetadataEvent_('thumbnail', entries, properties);
87 * @param {Array.<Entry>} entries Array of entries
[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/chromium_org/extensions/common/api/sockets/ |
| sockets_manifest_permission_unittest.cc | 38 EXPECT_EQ(0u, permission->entries().size());
92 if (permissions.size() != permission->entries().size()) {
94 << "Incorrect # of entries in json: " << json;
98 // store entries in the order found in the json message.
101 permission->entries().begin();
102 it != permission->entries().end();
121 CheckFormatEntry entries[] = {op1}; local
123 std::multiset<CheckFormatEntry>(entries, entries + arraysize(entries)),
130 CheckFormatEntry entries[] = {op1, op2}; local
146 CheckFormatEntry entries[] = {op1, op2, op3, op4, op5, op6, op7, op8, op9}; local
[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...] |
| /bionic/libc/kernel/uapi/linux/ |
| net_dropmon.h | 41 __u32 entries; member in struct:net_dm_config_msg
46 __u32 entries; member in struct:net_dm_alert_msg
|
| /dalvik/dx/src/com/android/multidex/ |
| ClassReferenceListBuilder.java | 64 for (Enumeration<? extends ZipEntry> entries = jarOfRoots.entries();
65 entries.hasMoreElements();) {
66 ZipEntry entry = entries.nextElement();
74 for (Enumeration<? extends ZipEntry> entries = jarOfRoots.entries();
75 entries.hasMoreElements();) {
76 ZipEntry entry = entries.nextElement();
|
| /development/ndk/platforms/android-L/include/linux/ |
| net_dropmon.h | 41 __u32 entries; member in struct:net_dm_config_msg
46 __u32 entries; member in struct:net_dm_alert_msg
|
| /external/chromium_org/chrome/browser/media_galleries/linux/ |
| mtp_device_object_enumerator.cc | 10 const std::vector<MtpFileEntry>& entries)
11 : file_entries_(entries),
|
| /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/resources/ |
| FileSystemView.js | 163 * @param {!Array.<!WebInspector.FileSystemModel.Entry>=} entries
165 _directoryContentReceived: function(errorCode, entries)
173 if (errorCode !== 0 || !entries) {
178 entries.sort(WebInspector.FileSystemModel.Entry.compare);
180 this._view.showEntries(entries);
187 while (newEntryIndex < entries.length && oldChildIndex < oldChildren.length) {
188 var newEntry = entries[newEntryIndex];
213 for (; newEntryIndex < entries.length; ++newEntryIndex)
214 this.appendChild(new WebInspector.FileSystemView.EntryTreeElement(this._fileSystemView, entries[newEntryIndex]));
|
