Searched defs:entry (Results 1 - 25 of 1572) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h63 /** Key that created this particular entry
67 /** Pointer to the data for this particular entry
73 * that the data pointer does not need to be freed when the entry
78 /** Pointer to the next entry in this bucket if there
92 /** Pointer to the first entry in the bucket (if any, it
167 /* Next entry to return, if NULL, then move to next bucket if any
169 pANTLR3_HASH_ENTRY entry; member in struct:ANTLR3_HASH_ENUM_struct
257 * entries calling any free pointers for each entry.
266 void (*del) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry);
267 void * (*get) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry);
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3baserecognizer.c1861 pANTLR3_TRIE_ENTRY entry; local
1866 entry = recognizer->state->ruleMemo->get(recognizer->state->ruleMemo, (ANTLR3_INTKEY)ruleIndex);
1868 if (entry == NULL)
1889 ruleList = (pANTLR3_INT_TRIE) (entry->data.ptr);
1895 entry = ruleList->get(ruleList, ruleParseStart);
1896 if (entry != NULL)
1898 stopIndex = (ANTLR3_MARKER)(entry->data.intVal);
1994 pANTLR3_TRIE_ENTRY entry; local
2037 entry = recognizer->state->ruleMemo->get(recognizer->state->ruleMemo, (ANTLR3_INTKEY)ruleIndex);
2039 if (entry !
[all...]
H A Dantlr3basetree.c189 pANTLR3_BASE_TREE entry; local
190 entry = child->children->get(child->children, i);
194 if (entry != NULL)
196 tree->children->add(tree->children, entry, (void (ANTLR3_CDECL *) (void *))child->free);
H A Dantlr3collections.c91 static void antlr3VectorDel (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry);
92 static void * antlr3VectorGet (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry);
93 static void * antrl3VectorRemove (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry);
96 static ANTLR3_UINT32 antlr3VectorSet (pANTLR3_VECTOR vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting);
200 pANTLR3_HASH_ENTRY entry; local
216 entry = thisBucket->entries;
220 while (entry != NULL)
222 /* Save next entry - we do not want to access memory in entry after we
225 nextEntry = entry
278 pANTLR3_HASH_ENTRY entry; local
335 pANTLR3_HASH_ENTRY entry; local
398 pANTLR3_HASH_ENTRY entry; local
422 pANTLR3_HASH_ENTRY entry; local
448 pANTLR3_HASH_ENTRY entry; local
487 pANTLR3_HASH_ENTRY entry; local
527 pANTLR3_HASH_ENTRY entry; local
598 pANTLR3_HASH_ENTRY entry; local
943 pANTLR3_HASH_ENTRY entry; local
1138 ANTLR3_UINT32 entry; local
1163 ANTLR3_UINT32 entry; local
1195 antlr3VectorDel(pANTLR3_VECTOR vector, ANTLR3_UINT32 entry) argument
1231 antlr3VectorGet(pANTLR3_VECTOR vector, ANTLR3_UINT32 entry) argument
1250 antrl3VectorRemove(pANTLR3_VECTOR vector, ANTLR3_UINT32 entry) argument
1356 antlr3VectorSet(pANTLR3_VECTOR vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting) argument
[all...]
/external/apache-http/src/org/apache/http/impl/conn/
H A DAbstractPooledConnAdapter.java49 * The connection in the pool entry is used to initialize the base class.
51 * pool entry. {@link #shutdown shutdown} and {@link #close close}
52 * will clear the tracked route in the pool entry and call the
70 /** The wrapped pool entry. */
78 * @param entry the pool entry for the connection being wrapped
81 AbstractPoolEntry entry) {
82 super(manager, entry.connection);
83 this.poolEntry = entry;
80 AbstractPooledConnAdapter(ClientConnectionManager manager, AbstractPoolEntry entry) argument
H A DSingleClientConnManager.java93 /** The one and only entry in this pool. */
241 // either. There's no harm in recreating an entry if
413 * The pool entry for this connection manager.
418 * Creates a new pool entry.
426 * Closes the connection in this pool entry.
438 * Shuts down the connection in this pool entry.
460 * @param entry the pool entry for the connection being wrapped
463 protected ConnAdapter(PoolEntry entry, HttpRoute route) { argument
464 super(SingleClientConnManager.this, entry);
[all...]
/external/apache-http/src/org/apache/http/impl/conn/tsccm/
H A DAbstractConnPool.java77 * and point to the pool entry for the issued connection.
150 * Obtains a pool entry with a connection within the given timeout.
157 * @return pool entry holding a connection for the route
182 * Returns an entry into the pool.
183 * The connection of the entry is expected to be in a suitable state,
187 * @param entry the entry for the connection to release
188 * @param reusable <code>true</code> if the entry is deemed
190 * @param validDuration The duration that the entry should remain free and reusable.
193 public abstract void freeEntry(BasicPoolEntry entry, boolea argument
[all...]
H A DBasicPoolEntryRef.java53 /** The planned route of the entry. */
58 * Creates a new reference to a pool entry.
60 * @param entry the pool entry, must not be <code>null</code>
63 public BasicPoolEntryRef(BasicPoolEntry entry, argument
65 super(entry, queue);
66 if (entry == null) {
68 ("Pool entry must not be null.");
70 route = entry.getPlannedRoute();
75 * Obtain the planned route for the referenced entry
[all...]
H A DBasicPooledConnAdapter.java56 * @param entry the pool entry for the connection being wrapped
59 AbstractPoolEntry entry) {
60 super(tsccm, entry);
73 * Obtains the pool entry.
75 * @return the pool entry, or <code>null</code> if detached
58 BasicPooledConnAdapter(ThreadSafeClientConnManager tsccm, AbstractPoolEntry entry) argument
H A DConnPoolByRoute.java250 * Obtains a pool entry with a connection within the given timeout.
260 * @return pool entry holding a connection for the route
279 BasicPoolEntry entry = null;
286 while (entry == null) {
305 entry = getFreeEntry(rospl, state);
306 if (entry != null) {
320 entry = createEntry(rospl, operator);
325 entry = createEntry(rospl, operator);
362 } // while no entry
368 return entry;
375 freeEntry(BasicPoolEntry entry, boolean reusable, long validDuration, TimeUnit timeUnit) argument
523 deleteEntry(BasicPoolEntry entry) argument
[all...]
H A DRouteSpecificPool.java107 * @return the max entry number
116 * A pool is unused if there is neither an entry nor a waiting thread.
150 * Obtains a free entry from this pool, if one is available.
152 * @return an available pool entry, or <code>null</code> if there is none
158 BasicPoolEntry entry = it.previous();
159 if (LangUtils.equals(state, entry.getState())) {
161 return entry;
166 BasicPoolEntry entry = freeEntries.remove();
167 entry.setState(null);
168 OperatedClientConnection conn = entry
186 freeEntry(BasicPoolEntry entry) argument
208 createdEntry(BasicPoolEntry entry) argument
231 deleteEntry(BasicPoolEntry entry) argument
[all...]
/external/bison/lib/
H A Dhash.c67 block for this function. In a word, HASHER randomizes a user entry
70 function for a user entry. */
87 some user-provided data (also called a user entry). An entry indistinctly
88 refers to both the internal entry and its associated user entry. A user
89 entry contents may be hashed by a randomization function (the hashing
99 entry is linear in time with the size of the bucket. Consequently, a
257 /* If ENTRY matches an entry already in the hash table, return the
258 entry fro
261 hash_lookup(const Hash_table *table, const void *entry) argument
307 hash_get_next(const Hash_table *table, const void *entry) argument
776 free_entry(Hash_table *table, struct hash_entry *entry) argument
790 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument
1038 hash_insert_if_absent(Hash_table *table, void const *entry, void const **matched_ent) argument
1122 hash_insert0(Hash_table *table, void const *entry, void const **matched_ent) argument
1134 hash_insert(Hash_table *table, void const *entry) argument
1148 hash_delete(Hash_table *table, const void *entry) argument
[all...]
/external/bison/src/
H A Dmuscle-tab.c69 muscle_entry_free (void *entry) argument
71 muscle_entry *mentry = entry;
112 muscle_entry *entry; local
115 entry = hash_lookup (muscle_table, &probe);
117 if (!entry)
120 entry = xmalloc (sizeof *entry);
121 entry->key = key;
122 if (!hash_insert (muscle_table, entry))
126 free (entry
142 muscle_entry *entry = NULL; local
646 muscle_m4_output(muscle_entry *entry, FILE *out) argument
654 muscle_m4_output_processor(void *entry, void *out) argument
[all...]
H A Dstate.c396 state *entry; local
400 entry = hash_lookup (state_table, probe);
402 return entry;
H A Dsymtab.c665 symbol *entry; local
668 entry = hash_lookup (symbol_table, &probe);
670 if (!entry)
674 entry = symbol_new (key, loc);
675 if (!hash_insert (symbol_table, entry))
678 return entry;
691 semantic_type *entry; local
694 entry = hash_lookup (semantic_type_table, &probe);
696 if (!entry)
699 entry
[all...]
/external/blktrace/btt/
H A Dlist.h50 * Insert a new entry between two known consecutive entries.
66 * list_add - add a new entry
67 * @new: new entry to be added
70 * Insert a new entry after the specified head.
79 * list_add_tail - add a new entry
80 * @new: new entry to be added
83 * Insert a new entry before the specified head.
92 * Delete a list entry by making the prev/next entries
105 * list_del - deletes entry from list.
106 * @entry
110 list_del(struct list_head *entry) argument
[all...]
/external/bluetooth/bluedroid/osi/src/
H A Dconfig.c89 entry_t *entry = entry_find(config, section, key); local
90 if (!entry)
94 int ret = strtol(entry->value, &endptr, 0);
103 entry_t *entry = entry_find(config, section, key); local
104 if (!entry)
107 if (!strcmp(entry->value, "true"))
109 if (!strcmp(entry->value, "false"))
120 entry_t *entry = entry_find(config, section, key); local
121 if (!entry)
124 return entry
153 entry_t *entry = list_node(node); local
161 entry_t *entry = entry_new(key, value); local
248 entry_t *entry = calloc(1, sizeof(entry_t)); local
272 entry_t *entry = list_node(node); local
[all...]
/external/bluetooth/bluedroid/stack/smp/
H A Dsmp_main.c423 ** Description Handle events to the state machine. It looks up the entry
425 ** If it is a valid entry, it gets the state table.Set the next state,
438 UINT8 action, entry, i; local
453 /* lookup entry /w event & curr_state */
454 /* If entry is ignore, return.
456 if ((event < SMP_MAX_EVT) && ( (entry = entry_table[event - 1][curr_state]) != SMP_SM_IGNORE ))
458 if (entry & SMP_ALL_TBL_MASK)
460 entry &= ~SMP_ALL_TBL_MASK;
475 smp_set_state(state_table[entry-1][SMP_SME_NEXT_STATE]);
484 if ((action = state_table[entry
[all...]
/external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/
H A DX509CRLEntryHolder.java19 private TBSCertList.CRLEntry entry; field in class:X509CRLEntryHolder
22 X509CRLEntryHolder(TBSCertList.CRLEntry entry, boolean isIndirect, GeneralNames previousCA) argument
24 this.entry = entry;
27 if (isIndirect && entry.hasExtensions())
29 Extension currentCaName = entry.getExtensions().getExtension(Extension.certificateIssuer);
45 return entry.getUserCertificate().getValue();
55 return entry.getRevocationDate().getDate();
59 * Return whether or not the holder's CRL entry contains extensions.
65 return entry
[all...]
/external/ceres-solver/internal/ceres/
H A Dincomplete_lq_factorization.cc136 pair<int, double>& entry = (*scratch)[scratch_count]; local
137 entry.first = i;
138 entry.second = dense_row[i];
153 const pair<int, double>& entry = (*scratch)[i]; local
154 cols[num_nonzeros] = entry.first;
155 values[num_nonzeros] = entry.second;
/external/chromium_org/android_webview/native/
H A Daw_contents.cc731 content::NavigationEntry* entry =
734 if (entry) {
735 entry->GetFavicon().valid = true;
736 entry->GetFavicon().url = icon_url;
737 entry->GetFavicon().image = gfx::Image::CreateFrom1xBitmap(bitmap);
800 content::NavigationEntry* entry = local
802 if (!entry)
805 int cert_id = entry->GetSSL().cert_id;
H A Dstate_serializer.cc117 // Set up the file access rights for the selected navigation entry.
154 bool WriteNavigationEntryToPickle(const content::NavigationEntry& entry, argument
156 if (!pickle->WriteString(entry.GetURL().spec()))
159 if (!pickle->WriteString(entry.GetVirtualURL().spec()))
162 const content::Referrer& referrer = entry.GetReferrer();
168 if (!pickle->WriteString16(entry.GetTitle()))
171 if (!pickle->WriteString(entry.GetPageState().ToEncodedData()))
174 if (!pickle->WriteBool(static_cast<int>(entry.GetHasPostData())))
177 if (!pickle->WriteString(entry.GetOriginalRequestURL().spec()))
180 if (!pickle->WriteString(entry
197 RestoreNavigationEntryFromPickle(PickleIterator* iterator, content::NavigationEntry* entry) argument
[all...]
/external/chromium_org/apps/
H A Dsaved_files_service_unittest.cc61 // Check that a registered file entry has the correct value.
66 const SavedFileEntry* entry = local
68 ASSERT_TRUE(entry);
69 EXPECT_EQ(id_string, entry->id);
70 EXPECT_EQ(path_, entry->path);
71 EXPECT_TRUE(entry->is_directory);
72 EXPECT_EQ(sequence_number, entry->sequence_number);
77 SavedFileEntry entry; local
94 // Test that no entry has a sequence number.
99 // Test that only entry #
129 SavedFileEntry entry; local
154 SavedFileEntry entry; local
187 SavedFileEntry entry; local
[all...]
/external/chromium_org/ash/accelerators/
H A Daccelerator_table_unittest.cc32 const AcceleratorData& entry = kAcceleratorData[i]; local
33 EXPECT_TRUE(acclerators.insert(entry).second)
34 << "Duplicated accelerator: " << entry.trigger_on_press << ", "
35 << entry.keycode << ", " << (entry.modifiers & ui::EF_SHIFT_DOWN)
36 << ", " << (entry.modifiers & ui::EF_CONTROL_DOWN) << ", "
37 << (entry.modifiers & ui::EF_ALT_DOWN);

Completed in 3820 milliseconds

1234567891011>>