Searched defs:entry (Results 276 - 300 of 1572) sorted by relevance

<<11121314151617181920>>

/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DCatchTable.java23 * Table of catch entries. Each entry includes a range of code
54 * Sets the entry at the given index.
57 * @param entry {@code non-null;} the entry to set at {@code n}
59 public void set(int n, Entry entry) { argument
60 set0(n, entry);
H A DPositionList.java136 * Sets the entry at the given index.
139 * @param entry {@code non-null;} the entry to set at {@code n}
141 public void set(int n, Entry entry) { argument
142 set0(n, entry);
149 /** {@code >= 0;} address of this entry */
158 * @param address {@code >= 0;} address of this entry
/external/e2fsprogs/debugfs/
H A Dls.c45 int entry, variable
68 if (entry == DIRENT_DELETED_FILE) {
/external/e2fsprogs/lib/blkid/
H A Dlist.h21 * using the generic single-entry routines.
35 * Insert a new entry between two known consecutive entries.
51 * list_add - add a new entry
52 * @add: new entry to be added
55 * Insert a new entry after the specified head.
64 * list_add_tail - add a new entry
65 * @add: new entry to be added
68 * Insert a new entry before the specified head.
77 * Delete a list entry by making the prev/next entries
91 * list_del - deletes entry fro
97 list_del(struct list_head *entry) argument
106 list_del_init(struct list_head *entry) argument
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dext_attr.c34 __u32 ext2fs_ext_attr_hash_entry(struct ext2_ext_attr_entry *entry, void *data) argument
37 char *name = ((char *) entry) + sizeof(struct ext2_ext_attr_entry);
40 for (n = 0; n < entry->e_name_len; n++) {
47 if (entry->e_value_block == 0 && entry->e_value_size != 0) {
49 for (n = (entry->e_value_size + EXT2_EXT_ATTR_ROUND) >>
H A Dkernel-list.h11 * using the generic single-entry routines.
29 * Insert a new entry between two known consecutive entries.
45 * Insert a new entry after the specified head..
53 * Insert a new entry at the tail
61 * Delete a list entry by making the prev/next entries
74 static __inline__ void list_del(struct list_head *entry) argument
76 __list_del(entry->prev, entry->next);
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src/org/eclipse/releng/generators/
H A DFetchBaseTask.java70 private String getScript(String key,String entry){ argument
74 String [] cvsinfo=entry.split(",");
82 String fullName=entry.substring(entry.lastIndexOf("/")+1,entry.length());
/external/f2fs-tools/include/
H A Dlist.h54 static inline void __list_del_entry(struct list_head *entry) argument
56 __list_del(entry->prev, entry->next);
59 static inline void list_del(struct list_head *entry) argument
61 __list_del(entry->prev, entry->next);
62 entry->next = LIST_POISON1;
63 entry->prev = LIST_POISON2;
/external/fio/
H A Dflist.h24 * using the generic single-entry routines.
41 * Insert a new entry between two known consecutive entries.
57 * flist_add - add a new entry
58 * @new_entry: new entry to be added
61 * Insert a new entry after the specified head.
77 * Delete a list entry by making the prev/next entries
91 * flist_del - deletes entry from list.
92 * @entry: the element to delete from the list.
93 * Note: flist_empty on entry does not return true after this, the entry i
96 flist_del(struct flist_head *entry) argument
107 flist_del_init(struct flist_head *entry) argument
[all...]
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DGroupedLinkedMap.java22 LinkedEntry<K, V> entry = keyToEntry.get(key);
24 if (entry == null) {
25 entry = new LinkedEntry<K, V>(key);
26 makeTail(entry);
27 keyToEntry.put(key, entry);
32 entry.add(value);
36 LinkedEntry<K, V> entry = keyToEntry.get(key);
37 if (entry == null) {
38 entry = new LinkedEntry<K, V>(key);
39 keyToEntry.put(key, entry);
89 makeHead(LinkedEntry<K, V> entry) argument
97 makeTail(LinkedEntry<K, V> entry) argument
104 updateEntry(LinkedEntry entry) argument
109 removeEntry(LinkedEntry entry) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DBstOperations.java195 * Inserts the specified entry into the tree as the minimum entry. Assumes that {@code
196 * entry.getKey()} is less than the key of all nodes in the subtree {@code root}.
198 public static <N extends BstNode<?, N>> N insertMin(@Nullable N root, N entry, argument
200 checkNotNull(entry);
204 return nodeFactory.createLeaf(entry);
207 insertMin(root.childOrNull(LEFT), entry, nodeFactory, balancePolicy),
213 * Inserts the specified entry into the tree as the maximum entry. Assumes that {@code
214 * entry
216 insertMax(@ullable N root, N entry, BstNodeFactory<N> nodeFactory, BstBalancePolicy<N> balancePolicy) argument
[all...]
H A DSingletonImmutableMap.java26 * Implementation of {@link ImmutableMap} with exactly one entry.
38 private transient Entry<K, V> entry; field in class:SingletonImmutableMap
45 SingletonImmutableMap(Entry<K, V> entry) { argument
46 this.entry = entry;
47 this.singleKey = entry.getKey();
48 this.singleValue = entry.getValue();
51 private Entry<K, V> entry() { method in class:SingletonImmutableMap
52 Entry<K, V> e = entry;
54 ? (entry
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DMapPutTester.java50 nullKeyEntry = entry(null, samples.e3.getValue());
51 nullValueEntry = entry(samples.e3.getKey(), null);
52 nullKeyValueEntry = entry(null, null);
53 presentKeyNullValueEntry = entry(samples.e0.getKey(), null);
104 Entry<K, V> newEntry = entry(null, samples.e3.getValue());
177 Entry<K, V> newEntry = entry(getKeyForNullValue(), samples.e3.getValue());
193 private V put(Map.Entry<K, V> entry) { argument
194 return getMap().put(entry.getKey(), entry.getValue());
/external/icu/icu4c/source/common/
H A Dlrucache.cpp56 void LRUCache::moveToMostRecent(CacheEntry *entry) { argument
57 if (entry->moreRecent == mostRecentlyUsedMarker) {
60 entry->unlink();
61 entry->moreRecent = mostRecentlyUsedMarker;
62 entry->lessRecent = mostRecentlyUsedMarker->lessRecent;
63 mostRecentlyUsedMarker->lessRecent->moreRecent = entry;
64 mostRecentlyUsedMarker->lessRecent = entry;
67 void LRUCache::init(char *adoptedLocId, CacheEntry *entry) { argument
70 entry->init(adoptedLocId, result, status);
83 CacheEntry *entry local
[all...]
/external/icu/icu4c/source/layout/
H A DContextualGlyphInsertionProc2.cpp76 const ContextualGlyphInsertionStateEntry2 *entry = entryTable.getAlias(index, success); local
80 le_uint16 newState = SWAPW(entry->newStateIndex);
81 le_uint16 flags = SWAPW(entry->flags);
83 le_int16 markIndex = SWAPW(entry->markedInsertionListIndex);
91 le_int16 currIndex = SWAPW(entry->currentInsertionListIndex);
H A DContextualGlyphSubstProc2.cpp44 const ContextualGlyphStateEntry2 *entry = entryTable.getAlias(index, success); local
46 le_uint16 newState = SWAPW(entry->newStateIndex);
47 le_uint16 flags = SWAPW(entry->flags);
48 le_int16 markIndex = SWAPW(entry->markIndex);
49 le_int16 currIndex = SWAPW(entry->currIndex);
H A DIndicRearrangementProcessor.cpp44 const IndicRearrangementStateEntry *entry = entryTable.getAlias(index,success); local
45 ByteOffset newState = SWAPW(entry->newStateOffset);
46 IndicRearrangementFlags flags = (IndicRearrangementFlags) SWAPW(entry->flags);
H A DIndicRearrangementProcessor2.cpp41 const IndicRearrangementStateEntry2 *entry = entryTable.getAlias(index, success); local
43 le_uint16 newState = SWAPW(entry->newStateIndex); // index to the new state
44 IndicRearrangementFlags flags = (IndicRearrangementFlags) SWAPW(entry->flags);
H A DLigatureSubstProc.cpp48 const LigatureSubstitutionStateEntry *entry = entryTable.getAlias(index, success); local
50 ByteOffset newState = SWAPW(entry->newStateOffset);
51 le_int16 flags = SWAPW(entry->flags);
H A DLigatureSubstProc2.cpp50 const LigatureSubstitutionStateEntry2 *entry = entryTable.getAlias(index, success); local
53 le_uint16 nextStateIndex = SWAPW(entry->nextStateIndex);
54 le_uint16 flags = SWAPW(entry->entryFlags);
55 le_uint16 ligActionIndex = SWAPW(entry->ligActionIndex);
/external/iptables/extensions/
H A Dlibip6t_MASQUERADE.c75 const struct ip6t_entry *entry = cb->xt_entry; local
79 if (entry->ipv6.proto == IPPROTO_TCP ||
80 entry->ipv6.proto == IPPROTO_UDP ||
81 entry->ipv6.proto == IPPROTO_SCTP ||
82 entry->ipv6.proto == IPPROTO_DCCP ||
83 entry->ipv6.proto == IPPROTO_ICMP)
89 switch (cb->entry->id) {
H A Dlibip6t_REDIRECT.c76 const struct ip6t_entry *entry = cb->xt_entry; local
80 if (entry->ipv6.proto == IPPROTO_TCP
81 || entry->ipv6.proto == IPPROTO_UDP
82 || entry->ipv6.proto == IPPROTO_SCTP
83 || entry->ipv6.proto == IPPROTO_DCCP
84 || entry->ipv6.proto == IPPROTO_ICMP)
90 switch (cb->entry->id) {
H A Dlibipt_MASQUERADE.c76 const struct ipt_entry *entry = cb->xt_entry; local
80 if (entry->ip.proto == IPPROTO_TCP
81 || entry->ip.proto == IPPROTO_UDP
82 || entry->ip.proto == IPPROTO_SCTP
83 || entry->ip.proto == IPPROTO_DCCP
84 || entry->ip.proto == IPPROTO_ICMP)
90 switch (cb->entry->id) {
H A Dlibipt_REDIRECT.c77 const struct ipt_entry *entry = cb->xt_entry; local
81 if (entry->ip.proto == IPPROTO_TCP
82 || entry->ip.proto == IPPROTO_UDP
83 || entry->ip.proto == IPPROTO_SCTP
84 || entry->ip.proto == IPPROTO_DCCP
85 || entry->ip.proto == IPPROTO_ICMP)
91 switch (cb->entry->id) {
/external/kernel-headers/original/uapi/linux/
H A Dflat.h30 unsigned long entry; /* Offset of first executable instruction member in struct:flat_hdr

Completed in 2661 milliseconds

<<11121314151617181920>>