/external/zlib/src/contrib/minizip/ |
H A D | mztools.c | 42 int entries = 0; local 214 entries++; 223 int entriesZip = entries; 278 /* Number of recovered entries */ 281 *nRecovered = entries;
|
/external/valgrind/main/callgrind/ |
H A D | global.h | 537 UInt size, entries; member in struct:_bb_hash 543 UInt size, entries; member in struct:_cxt_hash 553 UInt size, entries; member in struct:_bbcc_hash 559 UInt size, entries; member in struct:_jcc_hash
|
/external/valgrind/main/coregrind/m_syswrap/ |
H A D | syswrap-darwin.c | 2175 // This is a ridiculous syscall. Specifically, the 'entries' argument points 2189 // This affects us here because number of entries in the 'results' buffer is 2195 // know we have a well-formed 'entries' buffer. This means we might miss some 2205 PRE_REG_READ4(int, "access_extended", void *, entries, vki_size_t, size, 2207 PRE_MEM_READ("access_extended(entries)", ARG1, ARG2 ); 2220 struct vki_accessx_descriptor* entries = (struct vki_accessx_descriptor*)ARG1; local 2240 u = entries[i].ad_name_offset / sizeof(struct vki_accessx_descriptor);
|
/external/valgrind/main/include/vki/ |
H A D | vki-linux.h | 2181 struct vki_unipair __user *entries; member in struct:vki_unimapdesc 2219 unsigned int kb_cnt; /* number of entries in following array */
|
/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/tremolo/Tremolo/ |
H A D | codebook.h | 61 long used_entries; /* populated codebook entries */ 68 long entries; /* codebook entries */ member in struct:codebook
|
/external/strace/ |
H A D | mem.c | 551 unsigned long cur, end, abbrev_end, entries; local 555 entries = tcp->u_arg[1] >> 16; 556 if (!entries || !tcp->u_arg[2]) { 561 end = cur + (sizeof(int) * entries);
|
/external/stressapptest/src/ |
H A D | queue.cc | 73 int64 entries; local 94 entries = (lastin - nextout_ + q_size_) % q_size_; 97 if (entries) 98 newindex = ((rand % entries) + nextout_) % q_size_;
|
/external/speex/libspeex/ |
H A D | vq.c | 51 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries) argument 54 while (i<entries-1 && in>boundary[0]) 62 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries) argument 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) argument 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) argument 114 for (i=0;i<entries; [all...] |
H A D | vq_arm4.h | 36 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) argument 39 for (i=0;i<entries;i+=4)
|
H A D | 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) argument 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++)
|
H A D | 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) argument 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) argument 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/srec/portable/src/ |
H A D | 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 [all...] |
/external/skia/src/animator/ |
H A D | SkAnimateActive.cpp | 151 // int entries = animate->entries(); 153 // value.fOperand = animate->getValues()[entries - 1]; 374 int entries = animate->entries(); local 375 SkASSERT(entries > 0); 379 interpolator.reset(components, entries == 1 ? 2 : entries, animate->getValuesType()); 383 if (entries == 1) { 388 for (int entry = 0; entry < entries; entr [all...] |
H A D | SkAnimateBase.h | 32 int entries() { return fValues.count() / components(); } function in class:SkAnimateBase
|
/external/skia/src/core/ |
H A D | SkFlattenable.cpp | 96 SkDebugf("%s has no registered name/factory/type entries." 108 const Entry* entries = gEntries; 110 if (strcmp(entries[i].fName, name) == 0) { 111 return entries[i].fFactory; 123 const Entry* entries = gEntries; local 125 if (strcmp(entries[i].fName, name) == 0) { 126 *type = entries[i].fType; 138 const Entry* entries = gEntries; local 140 if (entries[i].fFactory == fact) { 141 return entries[ [all...] |
H A D | SkQuadTree.cpp | 105 // reinsert all the entries of this node to allow child trickle 106 SkTInternalSList<Entry> entries; local 107 entries.pushAll(&node->fEntries); 108 while(!entries.isEmpty()) { 109 this->insert(node, entries.pop()); 133 // first clear the entries of this node 198 SkTInternalSList<Entry> entries; local 199 entries.pushAll(&fDeferred); 200 while(!entries.isEmpty()) { 201 Entry* entry = entries [all...] |
H A D | SkTObjectPool.h | 84 * The type for a new block of entries for the list. 87 T entries[numItemsPerBlock]; member in struct:SkTObjectPool::Block 103 fAvailable.push(&block->entries[index]);
|
/external/skia/src/pathops/ |
H A D | SkPathOpsCommon.cpp | 551 const int entries = (ends - 1) * count; // folded triangle : n * (n - 1) / 2 local 553 distances.push_back_n(entries); 571 sortedDist.push_back_n(entries); 572 for (rIndex = 0; rIndex < entries; ++rIndex) { 577 for (rIndex = 0; rIndex < entries; ++rIndex) {
|
/external/skia/src/ports/ |
H A D | SkFontHost_mac.cpp | 920 uint16_t entries = fGlyphCount - fFBoundingBoxesGlyphOffset; local 921 fFBoundingBoxes.reset(entries); 926 for (uint16_t boundingBoxesIndex = 0; boundingBoxesIndex < entries; ++boundingBoxesIndex) { 1700 // compute font header entries
|
/external/skia/tests/ |
H A D | RandomTest.cpp | 108 unsigned int entries[kNumEntries]; local 111 memset(entries, 0, sizeof(unsigned int)*kNumEntries); 129 entries[index] |= (0x1 << entry_shift); 132 // count entries 135 unsigned int entry = entries[i];
|
/external/skia/tools/skpdiff/ |
H A D | skpdiff_util.cpp | 107 bool get_directory(const char path[], SkTArray<SkString>* entries) { argument 115 // Loop through dir entries until there are none left (i.e. readdir returns NULL) 124 entries->push_back(SkString(entry->d_name)); 155 entries->push_back(SkString(findFileData.cFileName)); 166 bool glob_files(const char globPattern[], SkTArray<SkString>* entries) { argument 178 entries->push_back(SkString(*paths));
|
/external/smack/src/org/jivesoftware/smack/ |
H A D | Roster.java | 61 private final Map<String,RosterEntry> entries; field in class:Roster 116 entries = new ConcurrentHashMap<String,RosterEntry>(); 331 if (entries.containsKey(item.getUser())) { 332 entries.remove(item.getUser()); 350 if (!entries.containsKey(item.getUser())) { 351 entries.put(item.getUser(), entry); 359 entries.put(item.getUser(), entry); 367 // list of unfiled entries. 371 // Otherwise add it to the list of unfiled entries. 413 // Loop through any groups that remain and remove the entries [all...] |
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/smack/src/org/jivesoftware/smackx/workgroup/agent/ |
H A D | AgentRoster.java | 55 private List<String> entries;
field in class:AgentRoster 70 entries = new ArrayList<String>();
108 // Fire events for the existing entries and presences in the roster
113 if (entries.contains(jid)) {
148 return entries.size();
154 * @return all entries in the roster.
158 synchronized (entries) {
159 for (Iterator<String> i = entries.iterator(); i.hasNext();) {
178 synchronized (entries) {
179 for (Iterator<String> i = entries [all...] |