| /external/jmonkeyengine/engine/src/bullet-common/com/jme3/bullet/control/ragdoll/ |
| HumanoidRagdollPreset.java | 37 LexiconEntry entry = new LexiconEntry(); local
38 entry.addSynonym("head", 100);
39 lexicon.put("head", entry);
41 entry = new LexiconEntry();
42 entry.addSynonym("torso", 100);
43 entry.addSynonym("chest", 100);
44 entry.addSynonym("spine", 45);
45 entry.addSynonym("high", 25);
46 lexicon.put("torso", entry);
48 entry = new LexiconEntry()
[all...] |
| /external/clang/test/CodeGen/ |
| PR2643-null-store-to-bitfield.c | 8 } entry = {0}; local
|
| /external/qemu/android/utils/ |
| list.h | 19 * - List entries contain references to the next, and the previous entry in the
21 * - The list is circular, i.e. the "last" list entry references the "list head"
22 * in its 'next' reference, and the "list head" references the "last" entry in
29 /* Next entry in the list */
31 /* Previous entry in the list */
49 /* Inserts an entry to the head of the list */
51 alist_insert_head(ACList* list, ACList* entry)
54 entry->next = next;
55 entry->prev = list;
56 next->prev = entry;
87 ACList* entry = NULL; local
102 ACList* entry = NULL; local
[all...] |
| /external/mesa3d/src/glsl/ |
| opt_dead_code.cpp | 53 variable_entry *entry = (variable_entry *)iter.get(); local
63 assert(entry->referenced_count >= entry->assigned_count);
67 entry->var->name, (void *) entry->var,
68 entry->referenced_count, entry->assigned_count,
69 entry->declaration ? "" : "not ");
72 if ((entry->referenced_count > entry->assigned_count
[all...] |
| ir_variable_refcount.cpp | 54 variable_entry *entry = (variable_entry *)iter.get(); local
55 if (entry->var == var)
56 return entry;
59 variable_entry *entry = new(mem_ctx) variable_entry(var); local
60 assert(entry->referenced_count == 0);
61 this->variable_list.push_tail(entry);
62 return entry;
69 variable_entry *entry = this->get_variable_entry(ir); local
70 if (entry)
71 entry->declaration = true
81 variable_entry *entry = this->get_variable_entry(var); local
104 variable_entry *entry; local
[all...] |
| /external/replicaisland/src/com/replica/replicaisland/ |
| VectorPool.java | 36 public void release(Object entry) {
37 ((Vector2)entry).zero();
38 super.release(entry);
43 Vector2 entry = super.allocate(); local
44 entry.set(source);
45 return entry;
|
| DrawableFactory.java | 78 DrawableBitmap entry = new DrawableBitmap(null, 0, 0); local
79 entry.setParentPool(this);
80 getAvailable().add(entry);
85 public void release(Object entry) {
86 ((DrawableBitmap)entry).reset();
87 super.release(entry);
115 ScrollableBitmap entry = new ScrollableBitmap(null, 0, 0); local
116 entry.setParentPool(this);
117 getAvailable().add(entry);
122 public void release(Object entry) {
144 TiledBackgroundVertexGrid entry = new TiledBackgroundVertexGrid(); local
[all...] |
| /external/webkit/Source/WebCore/bindings/js/ |
| JSEntryCustom.cpp | 37 #include "Entry.h"
47 JSValue toJS(ExecState* exec, JSDOMGlobalObject* globalObject, Entry* entry)
49 if (!entry)
52 if (entry->isFile())
53 return getDOMObjectWrapper<JSFileEntry>(exec, globalObject, static_cast<FileEntry*>(entry));
55 ASSERT(entry->isDirectory());
56 return getDOMObjectWrapper<JSDirectoryEntry>(exec, globalObject, static_cast<DirectoryEntry*>(entry));
|
| JSEntrySyncCustom.cpp | 47 JSValue toJS(ExecState* exec, JSDOMGlobalObject* globalObject, EntrySync* entry)
49 if (!entry)
52 if (entry->isFile())
53 return getDOMObjectWrapper<JSFileEntrySync>(exec, globalObject, static_cast<FileEntrySync*>(entry));
55 ASSERT(entry->isDirectory());
56 return getDOMObjectWrapper<JSDirectoryEntrySync>(exec, globalObject, static_cast<DirectoryEntrySync*>(entry));
|
| /ndk/sources/host-tools/make-3.81/w32/include/ |
| w32err.h | 22 #define EXTERN_DECL(entry, args) entry args
|
| /external/skia/src/effects/ |
| SkBitmapCache.cpp | 12 struct SkBitmapCache::Entry {
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm)
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead; local
47 while (entry) {
48 Entry* next = entry->fNext
86 Entry* entry = fHead; local
111 Entry* entry = new Entry(buffer, len, bm); local
133 Entry* entry = fHead; local
[all...] |
| /external/libmtp/examples/ |
| hotplug.c | 117 LIBMTP_device_entry_t * entry = &entries[i]; local
122 printf("# %s %s\n", entry->vendor, entry->product);
124 // printf("SYSFS{idVendor}==\"%04x\", SYSFS{idProduct}==\"%04x\", %s\n", entry->vendor_id, entry->product_id, action);
126 printf("ATTR{idVendor}==\"%04x\", ATTR{idProduct}==\"%04x\", %s\n", entry->vendor_id, entry->product_id, action);
130 printf("# %s %s\n", entry->vendor, entry->product);
131 printf("libmtp.sh 0x0003 0x%04x 0x%04x 0x0000 0x0000 0x00 0x00 0x00 0x00 0x00 0x00 0x00000000\n", entry->vendor_id, entry->product_id)
188 LIBMTP_device_entry_t * entry = &entries[i]; local
[all...] |
| /external/webkit/Source/JavaScriptCore/runtime/ |
| NumericStrings.h | 39 CacheEntry<double>& entry = lookup(d); local
40 if (d == entry.key && !entry.value.isNull())
41 return entry.value;
42 entry.key = d;
43 entry.value = UString::number(d);
44 return entry.value;
51 CacheEntry<int>& entry = lookup(i);
52 if (i == entry.key && !entry.value.isNull()
[all...] |
| /external/freetype/src/base/ |
| ftsnames.c | 57 TT_NameEntryRec* entry = ttface->name_table.names + idx; local
61 if ( entry->stringLength > 0 && entry->string == NULL )
67 if ( FT_NEW_ARRAY ( entry->string, entry->stringLength ) ||
68 FT_STREAM_SEEK( entry->stringOffset ) ||
69 FT_STREAM_READ( entry->string, entry->stringLength ) )
71 FT_FREE( entry->string );
72 entry->stringLength = 0
[all...] |
| /external/skia/src/gpu/ |
| GrResourceCache.cpp | 76 void GrResourceCache::internalDetach(GrResourceEntry* entry,
78 GrResourceEntry* prev = entry->fPrev;
79 GrResourceEntry* next = entry->fNext;
91 if (!entry->isLocked()) {
98 fClientDetachedBytes += entry->resource()->sizeInBytes();
101 fEntryBytes -= entry->resource()->sizeInBytes();
105 void GrResourceCache::attachToHead(GrResourceEntry* entry,
107 entry->fPrev = NULL;
108 entry->fNext = fHead;
110 fHead->fPrev = entry;
162 GrResourceEntry* entry = fCache.find(key); local
188 GrResourceEntry* entry = new GrResourceEntry(key, resource); local
261 GrResourceEntry* entry = fTail; local
295 GrResourceEntry* entry = fHead; local
328 const GrResourceEntry* entry = head; local
355 GrResourceEntry* entry = fHead; local
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| pmksa_cache_auth.c | 30 void (*free_cb)(struct rsn_pmksa_cache_entry *entry, void *ctx);
38 static void _pmksa_cache_free_entry(struct rsn_pmksa_cache_entry *entry)
40 if (entry == NULL)
42 os_free(entry->identity);
44 radius_free_class(&entry->radius_class);
46 os_free(entry);
51 struct rsn_pmksa_cache_entry *entry)
56 pmksa->free_cb(entry, pmksa->ctx);
57 pos = pmksa->pmkid[PMKID_HASH(entry->pmkid)];
60 if (pos == entry) {
97 struct rsn_pmksa_cache_entry *entry = pmksa->pmksa; local
234 struct rsn_pmksa_cache_entry *entry, *pos; local
282 struct rsn_pmksa_cache_entry *entry; local
321 struct rsn_pmksa_cache_entry *entry, *prev; local
351 struct rsn_pmksa_cache_entry *entry; local
383 struct rsn_pmksa_cache_entry *entry; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MultisetsImmutableEntryTest.java | 20 import com.google.common.collect.Multiset.Entry;
35 private static <E> Entry<E> entry(final E element, final int count) { method in class:MultisetsImmutableEntryTest
39 private static <E> Entry<E> control(E element, int count) {
45 assertEquals("foo", entry("foo", 1).toString());
46 assertEquals("bar x 2", entry("bar", 2).toString());
50 assertEquals("null", entry(NE, 1).toString());
51 assertEquals("null x 2", entry(NE, 2).toString());
55 assertEquals(control("foo", 1), entry("foo", 1));
56 assertEquals(control("bar", 2), entry("bar", 2))
64 assertEquals(control(NE, 1), entry(NE, 1)); method
[all...] |
| /external/qemu/ |
| acl.c | 78 qemu_acl_entry *entry; local
80 QTAILQ_FOREACH(entry, &acl->entries, next) {
82 if (fnmatch(entry->match, party, 0) == 0)
83 return entry->deny ? 0 : 1;
87 if (strcmp(entry->match, party) == 0)
88 return entry->deny ? 0 : 1;
98 qemu_acl_entry *entry; local
104 QTAILQ_FOREACH(entry, &acl->entries, next) {
105 QTAILQ_REMOVE(&acl->entries, entry, next);
106 free(entry->match)
117 qemu_acl_entry *entry; local
135 qemu_acl_entry *entry; local
164 qemu_acl_entry *entry; local
[all...] |
| envlist.c | 47 struct envlist_entry *entry; local
52 entry = envlist->el_entries.lh_first;
53 QLIST_REMOVE(entry, ev_link);
55 free((char *)entry->ev_var);
56 free(entry);
92 * and calls given callback for each entry.
137 struct envlist_entry *entry = NULL; local
152 * new entry.
154 for (entry = envlist->el_entries.lh_first; entry != NULL
186 struct envlist_entry *entry; local
229 struct envlist_entry *entry; local
[all...] |
| /external/chromium/net/base/ |
| backoff_entry_unittest.cc | 43 TestBackoffEntry entry(&base_policy);
44 EXPECT_FALSE(entry.ShouldRejectRequest());
46 entry.InformOfRequest(false);
47 EXPECT_TRUE(entry.ShouldRejectRequest());
60 TestBackoffEntry entry(&base_policy);
62 EXPECT_FALSE(entry.CanDiscard());
65 entry.InformOfRequest(false);
66 EXPECT_FALSE(entry.CanDiscard());
69 entry.set_now(
70 entry.GetReleaseTime() + TimeDelta::FromMilliseconds(1))
[all...] |
| /external/grub/stage2/ |
| fat.h | 86 #define FAT_DIRENTRY_ATTRIB(entry) \
87 (*((unsigned char *) (entry+11)))
88 #define FAT_DIRENTRY_VALID(entry) \
89 ( ((*((unsigned char *) entry)) != 0) \
90 && ((*((unsigned char *) entry)) != 0xE5) \
91 && !(FAT_DIRENTRY_ATTRIB(entry) & FAT_ATTRIB_NOT_OK_MASK) )
92 #define FAT_DIRENTRY_FIRST_CLUSTER(entry) \
93 ((*((unsigned short *) (entry+26)))+(*((unsigned short *) (entry+20)) << 16))
94 #define FAT_DIRENTRY_FILELENGTH(entry) \
[all...] |
| /external/srec/portable/src/ |
| phashtable.c | 164 PHashTableEntry *entry = table->entries[idx]; local
168 while (entry != NULL)
170 if (entry->key == NULL)
171 return entry;
173 entry = entry->next;
178 while (entry != NULL)
180 if (entry->hashCode == hashCode && table->args.compFunction(key, entry->key) == 0)
181 return entry;
210 PHashTableEntry *entry; local
234 PHashTableEntry* entry; local
279 PHashTableEntry *entry, *tmp, *next; local
345 PHashTableEntry *entry; local
427 PHashTableEntry *entry; local
[all...] |
| /external/webkit/Tools/RebaselineQueueServer/model/ |
| queueentry.py | 38 entry = QueueEntry()
39 entry.builder = builder_name
40 entry.test = test
41 entry.put()
42 return entry
48 for entry in query:
49 entry.delete()
61 for entry in query:
62 builder_names.add(entry.builder)
|
| /external/icu4c/layout/ |
| LookupTables.cpp | 33 const LookupSegment *entry = segments; local
34 const LookupSegment *trial = (const LookupSegment *) ((char *) entry + extra);
37 entry = trial;
42 trial = (const LookupSegment *) ((char *) entry + probe);
45 entry = trial;
49 if (SWAPW(entry->firstGlyph) <= ttGlyph) {
50 return entry;
62 const LookupSingle *entry = entries; local
63 const LookupSingle *trial = (const LookupSingle *) ((char *) entry + extra);
66 entry = trial
[all...] |
| /external/oprofile/opjitconv/ |
| conversion.c | 20 struct jitentry * entry, * next; local
22 for (entry = jitentry_list; entry; entry = next) {
23 if (entry->sym_name_malloced)
24 free(entry->symbol_name);
25 next = entry->next;
26 free(entry);
33 struct jitentry_debug_line * entry, * next; local
35 for (entry = jitentry_debug_line_list; entry; entry = next)
[all...] |
