| /external/clang/test/CodeGen/ |
| PR4611-bitfield-layout.c | 7 } entries; variable in typeref:struct:object_entry
|
| /external/chromium_org/third_party/WebKit/Source/modules/filesystem/ |
| EntriesCallback.idl | 32 void handleEvent(Entry[] entries);
|
| 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;
|
| /development/samples/HoneycombGallery/src/com/example/android/hcgallery/ |
| DirectoryCategory.java | 21 private DirectoryEntry[] entries; field in class:DirectoryCategory
23 public DirectoryCategory(String name, DirectoryEntry[] entries) {
25 this.entries = entries;
33 return entries.length;
37 return entries[i];
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| 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/ |
| qr.c | 3 /* Number of ring entries, in [2..26]. */
16 init_entries(ring_t *entries)
21 qr_new(&entries[i], link);
22 entries[i].id = 'a' + i;
27 test_independent_entries(ring_t *entries)
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[i], link)
66 ring_t entries[NENTRIES]; local
109 ring_t entries[NENTRIES]; local
121 ring_t entries[NENTRIES]; local
150 ring_t entries[NENTRIES]; local
211 ring_t entries[NENTRIES]; local
[all...] |
| ql.c | 3 /* Number of ring entries, in [2..26]. */
47 init_entries(list_t *entries, unsigned nentries)
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)
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[i], link)
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/chromium_org/chrome/browser/extensions/activity_log/ |
| hashed_ad_network_database.h | 19 void set_entries_for_testing(const char** entries, int num_entries) {
20 entries_ = entries;
28 // Points to the array of hash entries. In practice, this is always set to
32 // The number of entries.
|
| /dalvik/dx/src/com/android/dx/rop/cst/ |
| 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];
91 * Get all entries in this constant pool.
93 * @return the returned array may contain null entries.
96 return entries;
116 if (n == (entries.length - 1))
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/cst/ |
| 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[n - 1]
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
| 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[n - 1]
[all...] |
| /external/chromium_org/net/ftp/ |
| 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),
[all...] |
| 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));
|
| 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/ |
| 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) {
40 this.entries = entries;
46 entries = new LinkedList<Entry>();
49 entries.add(entry);
91 "entries=" + entries
[all...] |
| 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) {
85 this.entries = entries
[all...] |
| CompositionTimeToSample.java | 48 List<Entry> entries = Collections.emptyList(); field in class:CompositionTimeToSample
55 return 8 + 8 * entries.size();
59 return entries;
62 public void setEntries(List<Entry> entries) {
63 this.entries = entries;
70 entries = new ArrayList<Entry>(numberOfEntries);
73 entries.add(e);
80 IsoTypeWriter.writeUInt32(byteBuffer, entries.size());
82 for (Entry entry : entries) {
[all...] |
| /external/chromium_org/third_party/speex/libspeex/ |
| 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/ |
| 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/third_party/skia/tools/skpdiff/ |
| 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/ |
| RegularImmutableMap.java | 32 RegularImmutableMap(Entry<? extends K, ? extends V>... entries) {
33 super(entries);
|
| /external/chromium_org/tools/cygprofile/ |
| 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) {
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[1]
71 std::vector<LogEntry> entries; local
[all...] |
| /external/chromium_org/net/base/ |
| net_log_unittest.h | 23 const CapturingNetLog::CapturedEntryList& entries,
31 static_cast<size_t>(static_cast<int>(entries.size()) + i) :
33 if (j >= entries.size())
35 const CapturingNetLog::CapturedEntry& entry = entries[j];
95 const CapturingNetLog::CapturedEntryList& entries,
100 static_cast<size_t>(static_cast<int>(entries.size()) + i) :
102 if (j >= entries.size())
104 const CapturingNetLog::CapturedEntry& entry = entries[j];
113 const CapturingNetLog::CapturedEntryList& entries,
118 static_cast<size_t>(static_cast<int>(entries.size()) + min_index)
[all...] |
| /external/javassist/src/main/javassist/tools/reflect/ |
| Compiler.java | 78 CompiledClass[] entries = new CompiledClass[args.length]; local
79 int n = parse(args, entries);
86 processClasses(entries, n);
89 private static void processClasses(CompiledClass[] entries, int n)
97 CtClass c = pool.get(entries[i].classname);
98 if (entries[i].metaobject != null
99 || entries[i].classobject != null) {
102 if (entries[i].metaobject == null)
105 metaobj = entries[i].metaobject;
107 if (entries[i].classobject == null
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| pb_validate.c | 57 struct pb_validate_entry *entries; member in struct:pb_validate
80 if(vl->used && vl->entries[vl->used - 1].buf == buf) {
81 vl->entries[vl->used - 1].flags |= flags;
94 new_entries = (struct pb_validate_entry *)REALLOC(vl->entries,
103 vl->entries = new_entries;
106 assert(!vl->entries[vl->used].buf);
107 pb_reference(&vl->entries[vl->used].buf, buf);
108 vl->entries[vl->used].flags = flags;
123 ret = callback(vl->entries[i].buf, data);
138 ret = pb_validate(vl->entries[i].buf, vl, vl->entries[i].flags)
[all...] |
