| /system/extras/ext4_utils/ |
| xattr.h | 38 #define EXT4_XATTR_NEXT(entry) \
40 (char *)(entry) + EXT4_XATTR_LEN((entry)->e_name_len)))
43 #define IS_LAST_ENTRY(entry) (*(uint32_t *)(entry) == 0)
|
| /bionic/tests/math_data/ |
| atan2f_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| sincosf_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| scalb_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| scalbf_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| frexpf_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| asin_intel_data.h | 18 { // Entry 0
22 { // Entry 1
26 { // Entry 2
30 { // Entry 3
34 { // Entry 4
38 { // Entry 5
42 { // Entry 6
46 { // Entry 7
50 { // Entry 8
54 { // Entry
[all...] |
| powf_intel_data.h | 18 { // Entry 0
22 { // Entry 1
26 { // Entry 2
30 { // Entry 3
34 { // Entry 4
38 { // Entry 5
42 { // Entry 6
46 { // Entry 7
50 { // Entry 8
54 { // Entry
[all...] |
| frexp_intel_data.h | 18 { // Entry 0
23 { // Entry 1
28 { // Entry 2
33 { // Entry 3
38 { // Entry 4
43 { // Entry 5
48 { // Entry 6
53 { // Entry 7
58 { // Entry 8
63 { // Entry
[all...] |
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| IntQueue.java | 20 private static class Entry {
21 private IntQueue.Entry next;
23 private Entry(int value) {
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value); local
34 tail.next = entry;
35 tail = entry;
[all...] |
| /external/llvm/projects/ |
| CMakeLists.txt | 5 foreach(entry ${entries})
6 if(IS_DIRECTORY ${entry} AND EXISTS ${entry}/CMakeLists.txt)
7 if((NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/compiler-rt) AND
8 (NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/dragonegg) AND
9 (NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/libcxx) AND
10 (NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/libcxxabi) AND
11 (NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/libunwind) AND
12 (NOT ${entry} STREQUAL ${CMAKE_CURRENT_SOURCE_DIR}/test-suite))
13 add_subdirectory(${entry})
[all...] |
| /external/squashfs-tools/kernel/fs/squashfs/ |
| cache.c | 70 struct squashfs_cache_entry *entry; local
76 if (cache->entry[i].block == block)
94 * At least one unused cache entry. A simple
95 * round-robin strategy is used to choose the entry to
100 if (cache->entry[i].refcount == 0)
106 entry = &cache->entry[i];
109 * Initialise choosen cache entry, and fill it in from
113 entry->block = block;
114 entry->refcount = 1
261 struct squashfs_cache_entry *entry = &cache->entry[i]; local
337 struct squashfs_cache_entry *entry; local
[all...] |
| /external/toybox/toys/posix/ |
| who.c | 29 struct utmpx *entry; local
33 while ((entry = getutxent())) {
34 if ((toys.optflags & FLAG_a) || entry->ut_type == USER_PROCESS) {
39 time = entry->ut_tv.tv_sec;
42 printf("%s\t%s\t%*.*s\t(%s)\n", entry->ut_user, entry->ut_line,
43 time_size, time_size, ctime(&time), entry->ut_host);
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 27 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
61 m_buckets = new Entry [initialCapacity];
87 final Entry [] buckets = m_buckets;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
93 if (key == entry.m_key) return true;
111 final Entry [] buckets = m_buckets
[all...] |
| ObjectIntMap.java | 29 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
63 m_buckets = new Entry [initialCapacity];
91 final Entry [] buckets = m_buckets;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
98 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)
[all...] |
| /external/mesa3d/src/glsl/ |
| ir_variable_refcount.cpp | 54 ir_variable_refcount_entry *entry = (ir_variable_refcount_entry *)iter.get(); local
55 if (entry->var == var)
56 return entry;
59 ir_variable_refcount_entry *entry = new(mem_ctx) ir_variable_refcount_entry(var); local
60 assert(entry->referenced_count == 0);
61 this->variable_list.push_tail(entry);
62 return entry;
69 ir_variable_refcount_entry *entry = this->get_variable_entry(ir); local
70 if (entry)
71 entry->declaration = true
81 ir_variable_refcount_entry *entry = this->get_variable_entry(var); local
104 ir_variable_refcount_entry *entry; local
[all...] |
| /external/autotest/client/common_lib/cros/ |
| dbus_send_unittests.py | 15 dict entry(
19 dict entry(
23 dict entry(
29 dict entry(
33 dict entry(
38 dict entry(
42 dict entry(
46 dict entry(
50 dict entry(
54 dict entry(
[all...] |
| /frameworks/av/media/libmediaplayerservice/nuplayer/ |
| NuPlayerStreamListener.cpp | 56 QueueEntry entry; local
57 entry.mIsCommand = false;
58 entry.mIndex = index;
59 entry.mSize = size;
60 entry.mOffset = 0;
63 mQueue.push_back(entry);
78 QueueEntry entry; local
79 entry.mIsCommand = true;
80 entry.mCommand = cmd;
81 entry.mExtra = extra
113 QueueEntry *entry = &*mQueue.begin(); local
[all...] |
| /external/skia/src/core/ |
| SkTInternalLList.h | 48 void remove(T* entry) {
50 SkASSERT(this->isInList(entry));
52 T* prev = entry->fPrev;
53 T* next = entry->fNext;
66 entry->fPrev = NULL;
67 entry->fNext = NULL;
70 entry->fList = NULL;
74 void addToHead(T* entry) {
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext)
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| AbstractMapTester.java | 26 import java.util.Map.Entry;
41 AbstractContainerTester<Map<K, V>, Map.Entry<K, V>> {
52 @Override protected Collection<Map.Entry<K, V>> actualContents() {
79 protected Map.Entry<K, V>[] createArrayWithNullKey() {
80 Map.Entry<K, V>[] array = createSamplesArray();
82 final Map.Entry<K, V> oldEntry = array[nullKeyLocation];
83 array[nullKeyLocation] = entry(null, oldEntry.getValue());
95 private Entry<K, V> getEntryNullReplaces() {
96 Iterator<Entry<K, V>> entries = getSampleElements().iterator();
107 protected Map.Entry<K, V>[] createArrayWithNullValue()
187 protected Entry<K, V> entry(K key, V value) { method in class:AbstractMapTester
[all...] |
| /external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/ |
| FileProcessor.java | 30 * either {@link #processFile(Entry)} or {@link #processDir(Entry, ArrayList)} can be overridden, or both. The entries provided to
43 ArrayList<Entry> outputFiles = new ArrayList();
47 Comparator<Entry> entryComparator = new Comparator<Entry>() {
48 public int compare (Entry o1, Entry o2) {
71 /** Sets the comparator for {@link #processDir(Entry, ArrayList)}. By default the files are sorted by alpha. */
109 public ArrayList<Entry> process (String inputFileOrDir, String outputRoot) throws Exception {
115 * @return the processed files added with {@link #addProcessedFile(Entry)}. */
148 Entry entry = new Entry(); local
205 Entry entry = new Entry(); local
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| DivideTimeScaleTrack.java | 43 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() {
47 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() {
55 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() {
90 List<CompositionTimeToSample.Entry> adjustCtts() {
91 List<CompositionTimeToSample.Entry> origCtts = this.source.getCompositionTimeEntries();
93 List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(origCtts.size());
94 for (CompositionTimeToSample.Entry entry : origCtts) {
95 entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), entry.getOffset() / timeScaleDivisor))
[all...] |
| /external/v8/src/base/ |
| hashmap.h | 47 struct Entry {
54 // If an entry with matching key is found, returns that entry.
56 Entry* Lookup(void* key, uint32_t hash) const;
58 // If an entry with matching key is found, returns that entry.
59 // If no matching entry is found, a new entry is inserted with
61 Entry* LookupOrInsert(void* key, uint32_t hash,
64 // Removes the entry with matching key
287 Entry* entry = LookupOrInsert(p->key, p->hash, allocator); local
[all...] |
| /frameworks/base/tests/LocationTracker/src/com/android/locationtracker/data/ |
| CSVFormatter.java | 42 public String getOutput(TrackerEntry entry) {
45 rowOutput.append(entry.getTimestamp());
47 rowOutput.append(entry.getTag());
49 //rowOutput.append(entry.getType());
51 if (entry.getType() == EntryType.LOCATION_TYPE) {
52 if (entry.getLocation().hasAccuracy()) {
53 rowOutput.append(entry.getLocation().getAccuracy());
56 rowOutput.append(entry.getLocation().getLatitude());
58 rowOutput.append(entry.getLocation().getLongitude());
60 if (entry.getLocation().hasAltitude())
[all...] |
| /external/dbus/doc/ |
| dbus-specification.xml | 424 dict entry is always a key-value pair.
435 In most languages, an array of dict entry would be represented as a
445 <entry>Conventional Name</entry>
446 <entry>Code</entry>
447 <entry>Description</entry>
452 <entry><literal>INVALID</literal></entry>
[all...] |
