| /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];
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/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);
|
| vq.c | 51 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries)
54 while (i<entries-1 && in>boundary[0])
62 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries)
65 while (i<entries-1 && in>boundary[0])
75 /*Finds the indices of the n-best entries in a codebook*/
76 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)
80 for (i=0;i<entries;i++)
109 /*Finds the indices of the n-best entries in a codebook with sign*/
110 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)
114 for (i=0;i<entries;i++
[all...] |
| vq_bfin.h | 37 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)
68 : "a" (len-1), "a" (in), "a" (2), "d" (entries), "d" (len<<1), "1" (codebook), "4" (E), "2" (best_dist[0]), "3" (nbest[0])
75 for (i=0;i<entries;i++)
|
| 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/icu4c/layout/ |
| SingleTableProcessor.cpp | 38 const LookupSingle *entries = singleTableLookupTable->entries; local
43 const LookupSingle *lookupSingle = singleTableLookupTable->lookupSingle(entries, glyphStorage[glyph]);
|
| /external/e2fsprogs/lib/ext2fs/ |
| brel_ma.c | 43 struct ext2_block_relocate_entry *entries; member in struct:brel_ma
79 sizeof(struct ext2_block_relocate_entry), &ma->entries);
82 memset(ma->entries, 0, size);
112 ma->entries[(unsigned)old] = *ent;
124 if (ma->entries[(unsigned)old].new == 0)
126 *ent = ma->entries[old];
143 if (ma->entries[(unsigned)brel->current].new == 0)
146 *ent = ma->entries[(unsigned)brel->current];
160 if (ma->entries[(unsigned)old].new == 0)
162 ma->entries[(unsigned)new] = ma->entries[old]
[all...] |
| 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/bluetooth/glib/gobject/ |
| pltcheck.sh | 13 echo Checking $so for local PLT entries
|
| /external/qemu/ |
| acl.c | 67 TAILQ_INIT(&acl->entries);
81 TAILQ_FOREACH(entry, &acl->entries, next) {
105 TAILQ_FOREACH(entry, &acl->entries, next) {
106 TAILQ_REMOVE(&acl->entries, entry, next);
124 TAILQ_INSERT_TAIL(&acl->entries, entry, next);
150 TAILQ_FOREACH(tmp, &acl->entries, next) {
168 TAILQ_FOREACH(entry, &acl->entries, next) {
171 TAILQ_REMOVE(&acl->entries, entry, next);
|
| /external/qemu/android/ |
| resource.c | 24 const FileEntry* entries,
27 const FileEntry* e = entries;
|
| charmap.h | 31 const AKeyEntry* entries; member in struct:AKeyCharmap
39 /* Number of entries in android_charmaps array. */
67 * two default entries.
|
| /external/webkit/WebCore/platform/haiku/ |
| FileSystemHaiku.cpp | 76 Vector<String> entries; local
78 return entries;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/project/ |
| AndroidClasspathContainer.java | 35 * @param entries the entries representing the android framework and optional libraries.
39 AndroidClasspathContainer(IClasspathEntry[] entries, IPath path, String name) {
40 mClasspathEntry = entries;
|
| /bootable/recovery/applypatch/ |
| freecache.c | 74 int FindExpendableFiles(char*** names, int* entries) {
78 *entries = 0;
108 if (*entries >= size) {
112 (*names)[(*entries)++] = strdup(path);
119 printf("%d regular files in deletable directories\n", *entries);
121 if (EliminateOpenFiles(*names, *entries) < 0) {
138 int entries; local
140 if (FindExpendableFiles(&names, &entries) < 0) {
144 if (entries == 0) {
157 for (i = 0; i < entries && free_now < bytes_needed; ++i)
[all...] |
| /external/dnsmasq/src/ |
| log.c | 53 static struct log_entry *entries = NULL; variable in typeref:struct:log_entry
141 struct log_entry *tmp = entries;
142 entries = tmp->next;
151 while (entries)
154 if (entries->pid != getpid())
162 if ((rc = write(log_fd, entries->payload + entries->offset, entries->length)) != -1)
164 entries->length -= rc;
165 entries->offset += rc
[all...] |
| /external/openssl/crypto/asn1/ |
| x_name.c | 118 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL)
129 if (ret->entries)
130 sk_X509_NAME_ENTRY_free(ret->entries);
144 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free);
166 STACK_OF(X509_NAME_ENTRY) *entries;
185 entries = (STACK_OF(X509_NAME_ENTRY) *)sk_value(intname.s, i);
186 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
187 entry = sk_X509_NAME_ENTRY_value(entries, j);
189 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
192 sk_X509_NAME_ENTRY_free(entries);
[all...] |
| /development/tools/mkstubs/src/com/android/mkstubs/ |
| AsmAnalyzer.java | 46 Enumeration<? extends ZipEntry> entries = zip.entries(); local
48 while (entries.hasMoreElements()) {
49 entry = entries.nextElement();
|
| /external/bluetooth/glib/gio/ |
| glocalfileenumerator.c | 77 DirEntry *entries; member in struct:_GLocalFileEnumerator
102 if (local->entries != NULL)
104 for (i = 0; local->entries[i].name != NULL; i++)
105 g_free (local->entries[i].name);
107 g_free (local->entries);
270 if (local->entries == NULL ||
271 (local->entries[local->entries_pos].name == NULL))
273 if (local->entries == NULL)
274 local->entries = g_new (DirEntry, CHUNK_SIZE + 1);
278 for (i = 0; local->entries[i].name != NULL; i++
[all...] |
| /external/kernel-headers/original/linux/ |
| stacktrace.h | 7 unsigned long *entries; member in struct:stack_trace
|
| /external/dbus/dbus/ |
| dbus-address.c | 183 * Frees a #NULL-terminated array of address entries.
185 * @param entries the array.
188 dbus_address_entries_free (DBusAddressEntry **entries)
192 for (i = 0; entries[i] != NULL; i++)
193 dbus_address_entry_free (entries[i]);
194 dbus_free (entries);
352 * When connecting to an address, the first address entries
356 * @param entry return location to an array of entries.
369 DBusList *entries, *link; local
376 entries = NULL
693 DBusAddressEntry **entries; local
[all...] |
| /packages/apps/Camera/src/com/android/camera/ |
| ListPreference.java | 71 public void setEntries(CharSequence entries[]) {
72 mEntries = entries == null ? new CharSequence[0] : entries;
120 ArrayList<CharSequence> entries = new ArrayList<CharSequence>(); local
124 entries.add(mEntries[i]);
128 int size = entries.size();
129 mEntries = entries.toArray(new CharSequence[size]);
|
| /external/webkit/JavaScriptCore/runtime/ |
| Lookup.cpp | 32 HashEntry* entries = new HashEntry[compactSize]; local
34 entries[i].setKey(0);
38 HashEntry* entry = &entries[hashIndex];
45 entry->setNext(&entries[linkIndex++]);
51 table = entries;
|
| /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/webkit/WebKitTools/Scripts/ |
| detect-mismatched-virtual-const | 135 my @entries = @{$signature_map{$sig}};
136 # print "$#entries\n";
141 for $i (0 .. $#entries) {
142 my $entry = @entries[$i];
154 if ($#entries > 1 && $num_const > 0 && $num_not_const > 0) {
157 for $i (0 .. $#entries) {
158 my $entry = @entries[$i];
|
