/external/valgrind/main/memcheck/tests/linux/ |
H A D | proc-auxv.stderr.exp | 0 entries OK
|
/external/clang/test/CodeGen/ |
H A D | PR4611-bitfield-layout.c | 7 } entries; variable in typeref:struct:object_entry
|
/external/chromium_org/third_party/WebKit/Source/modules/filesystem/ |
H A D | EntriesCallback.idl | 32 void handleEvent(Entry[] entries);
|
H A D | HTMLInputElementFileSystem.cpp | 49 EntryHeapVector entries; local 53 return entries; 58 return entries; 69 // The dropped entries are mapped as top-level entries in the isolated filesystem. 72 entries.append(DirectoryEntry::create(filesystem, virtualPath)); 74 entries.append(FileEntry::create(filesystem, virtualPath)); 76 return entries;
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGUnitTypes.cpp | 38 DEFINE_STATIC_LOCAL(SVGEnumerationStringEntries, entries, ()); 39 if (entries.isEmpty()) { 40 entries.append(std::make_pair(SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE, "userSpaceOnUse")); 41 entries.append(std::make_pair(SVGUnitTypes::SVG_UNIT_TYPE_OBJECTBOUNDINGBOX, "objectBoundingBox")); 43 return entries;
|
/external/jemalloc/test/unit/ |
H A D | qr.c | 3 /* Number of ring entries, in [2..26]. */ 16 init_entries(ring_t *entries) argument 21 qr_new(&entries[i], link); 22 entries[i].id = 'a' + i; 27 test_independent_entries(ring_t *entries) argument 34 qr_foreach(t, &entries[i], link) { 43 qr_reverse_foreach(t, &entries[i], link) { 51 t = qr_next(&entries[i], link); 52 assert_ptr_eq(t, &entries[i], 57 t = qr_prev(&entries[ 66 ring_t entries[NENTRIES]; local 74 test_entries_ring(ring_t *entries) argument 109 ring_t entries[NENTRIES]; local 121 ring_t entries[NENTRIES]; local 150 ring_t entries[NENTRIES]; local 187 test_split_entries(ring_t *entries) argument 211 ring_t entries[NENTRIES]; local [all...] |
H A D | ql.c | 3 /* Number of ring entries, in [2..26]. */ 47 init_entries(list_t *entries, unsigned nentries) argument 52 entries[i].id = 'a' + i; 53 ql_elm_new(&entries[i], link); 58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) argument 63 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); 64 assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id, 69 assert_c_eq(t->id, entries[i].id, "Element id mismatch"); 75 assert_c_eq(t->id, entries[nentries-i-1].id, 81 t = ql_next(head, &entries[ 97 list_t entries[NENTRIES]; local 112 list_t entries[NENTRIES]; local 131 list_t entries[NENTRIES]; local 146 list_t entries[NENTRIES]; local 165 list_t entries[8]; local [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
H A D | StdConstantPool.java | 29 /** {@code non-null;} array of entries */ 30 private final Constant[] entries; field in class:StdConstantPool 47 entries = new Constant[size]; 52 return entries.length; 58 return entries[n]; 77 Constant result = entries[n]; 107 if (n == (entries.length - 1)) { 111 entries[n + 1] = null; 114 if ((cst != null) && (entries[n] == null)) { 119 Constant prev = entries[ [all...] |
/external/valgrind/main/none/tests/darwin/ |
H A D | access_extended.c | 20 struct accessx_descriptor* entries = malloc(entries_szB); local 21 char* string1 = (char*)&entries[3]; 26 entries[0].ad_name_offset = string1 - (char*)entries; 27 entries[1].ad_name_offset = 0; // reuse the previous entry's string 28 entries[2].ad_name_offset = string2 - (char*)entries; 29 entries[0].ad_flags = F_OK; // succeeds 30 entries[1].ad_flags = X_OK; // fails 31 entries[ [all...] |
/external/chromium_org/net/ftp/ |
H A D | ftp_directory_listing_parser.cc | 27 // Fills in |raw_name| for all |entries| using |encoding|. Returns network 30 std::vector<FtpDirectoryListingEntry>* entries) { 31 for (size_t i = 0; i < entries->size(); i++) { 32 if (!base::UTF16ToCodepage(entries->at(i).name, encoding.c_str(), 34 &entries->at(i).raw_name)) { 42 // Parses |text| as an FTP directory listing. Fills in |entries| 48 std::vector<FtpDirectoryListingEntry>* entries, 58 base::Bind(&ParseFtpDirectoryListingLs, lines, current_time, entries), 62 base::Bind(&ParseFtpDirectoryListingWindows, lines, entries), 66 base::Bind(&ParseFtpDirectoryListingVms, lines, entries), 29 FillInRawName(const std::string& encoding, std::vector<FtpDirectoryListingEntry>* entries) argument 44 ParseListing(const base::string16& text, const base::string16& newline_separator, const std::string& encoding, const base::Time& current_time, std::vector<FtpDirectoryListingEntry>* entries, FtpServerType* server_type) argument 94 DecodeAndParse(const std::string& text, const base::Time& current_time, std::vector<FtpDirectoryListingEntry>* entries, FtpServerType* server_type) argument 136 ParseFtpDirectoryListing(const std::string& text, const base::Time& current_time, std::vector<FtpDirectoryListingEntry>* entries) argument [all...] |
H A D | ftp_directory_listing_parser_os2_unittest.cc | 58 std::vector<FtpDirectoryListingEntry> entries; local 61 &entries)); 62 VerifySingleLineTestCase(good_cases[i], entries); 75 std::vector<FtpDirectoryListingEntry> entries; local 78 &entries)); 79 EXPECT_EQ(0U, entries.size()); 107 std::vector<FtpDirectoryListingEntry> entries; local 110 &entries));
|
H A D | ftp_directory_listing_parser_windows_unittest.cc | 64 std::vector<FtpDirectoryListingEntry> entries; local 67 &entries)); 68 VerifySingleLineTestCase(good_cases[i], entries); 83 std::vector<FtpDirectoryListingEntry> entries; local 86 &entries)); 87 EXPECT_EQ(0U, entries.size()); 117 std::vector<FtpDirectoryListingEntry> entries; local 120 &entries));
|
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/ |
H A D | ProgressiveDownloadInformationBox.java | 15 List<Entry> entries = Collections.emptyList(); field in class:ProgressiveDownloadInformationBox 23 return 4 + entries.size() * 8; 29 for (Entry entry : entries) { 36 return entries; 39 public void setEntries(List<Entry> entries) { argument 40 this.entries = entries; 46 entries = new LinkedList<Entry>(); 49 entries.add(entry); 91 "entries [all...] |
H A D | TimeToSampleBox.java | 38 * The sample entries are ordered by decoding time stamps; therefore the deltas are all non-negative. <br> 47 List<Entry> entries = Collections.emptyList(); field in class:TimeToSampleBox 55 return 8 + entries.size() * 8; 62 entries = new ArrayList<Entry>(entryCount); 65 entries.add(new Entry(IsoTypeReader.readUInt32(content), IsoTypeReader.readUInt32(content))); 73 IsoTypeWriter.writeUInt32(byteBuffer, entries.size()); 74 for (Entry entry : entries) { 81 return entries; 84 public void setEntries(List<Entry> entries) { argument 85 this.entries 131 blowupTimeToSamples(List<TimeToSampleBox.Entry> entries) argument [all...] |
/external/chromium_org/third_party/speex/libspeex/ |
H A D | vq.h | 40 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries); 41 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries); 45 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); 47 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); 49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowListPreference.java | 11 CharSequence[] entries; field in class:ShadowListPreference 18 return entries; 22 public void setEntries(CharSequence[] entries) { argument 23 this.entries = entries; 28 this.entries = context.getResources().getStringArray(entriesResId);
|
/external/speex/libspeex/ |
H A D | vq.h | 40 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries); 41 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries); 45 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); 47 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); 49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|
/external/chromium_org/chrome/browser/extensions/api/log_private/ |
H A D | log_parser.cc | 31 std::vector<string> entries; local 33 base::SplitString(input, '\n', &entries); 35 for (size_t i = 0; i < entries.size(); i++) { 36 ParseEntry(entries[i], output, filter_handler);
|
/external/chromium_org/v8/test/mjsunit/es6/ |
H A D | mirror-collections.js | 54 var entries = mapMirror.entries(); variable 55 assertEquals(1, entries.length); 56 assertSame(o2, entries[0].key); 57 assertEquals(22, entries[0].value); 62 entries = mapMirror.entries(); 63 assertEquals(3, entries.length); 64 assertSame(o1, entries[0].key); 65 assertEquals(33, entries[ [all...] |
/external/smack/src/org/jivesoftware/smack/ |
H A D | RosterGroup.java | 34 * A group of roster entries. 43 private final List<RosterEntry> entries; field in class:RosterGroup 54 entries = new ArrayList<RosterEntry>(); 67 * Sets the name of the group. Changing the group's name is like moving all the group entries 68 * of the group to a new group specified by the new name. Since this group won't have entries 75 synchronized (entries) { 76 for (RosterEntry entry : entries) { 89 * Returns the number of entries in the group. 91 * @return the number of entries in the group. 94 synchronized (entries) { [all...] |
/external/chromium_org/chrome/browser/extensions/activity_log/ |
H A D | hashed_ad_network_database.h | 19 void set_entries_for_testing(const char** entries, int num_entries) { argument 20 entries_ = entries; 28 // Points to the array of hash entries. In practice, this is always set to 32 // The number of entries.
|
/external/chromium_org/third_party/skia/tools/skpdiff/ |
H A D | skpdiff_util.h | 37 * Get file entries of the given directory. 39 * @param entries A vector to return the results into 42 bool get_directory(const char path[], SkTArray<SkString>* entries); 47 * @param entries An array to return the results into 50 bool glob_files(const char globPattern[], SkTArray<SkString>* entries);
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | RegularImmutableMap.java | 32 RegularImmutableMap(Entry<? extends K, ? extends V>... entries) { argument 33 super(entries);
|
/external/skia/tools/skpdiff/ |
H A D | skpdiff_util.h | 37 * Get file entries of the given directory. 39 * @param entries A vector to return the results into 42 bool get_directory(const char path[], SkTArray<SkString>* entries); 47 * @param entries An array to return the results into 50 bool glob_files(const char globPattern[], SkTArray<SkString>* entries);
|
/external/chromium_org/tools/cygprofile/ |
H A D | cygprofile_unittest.cc | 21 std::vector<LogEntry>* entries) { 23 // Move the provided |entries| vector to the provided |destination| so that 25 destination->swap(*entries); 29 void CheckFlushDoesNotHappen(std::vector<LogEntry>* entries) { argument 43 std::vector<LogEntry> entries; local 44 thread_log.TakeEntries(&entries); 46 ASSERT_EQ(2U, entries.size()); 47 // The entries should appear in their insertion order. 48 const LogEntry& first_entry = entries[0]; 53 const LogEntry& second_entry = entries[ 20 FlushEntries(std::vector<LogEntry>* destination, std::vector<LogEntry>* entries) argument 71 std::vector<LogEntry> entries; local [all...] |