Searched refs:entry (Results 201 - 225 of 2918) sorted by relevance

1234567891011>>

/external/google-breakpad/src/processor/
H A Daddress_map_unittest.cc80 linked_ptr<CountedObject> entry; local
84 ASSERT_FALSE(test_map.Retrieve(0, &entry, &address));
85 ASSERT_FALSE(test_map.Retrieve(INT_MIN, &entry, &address));
86 ASSERT_FALSE(test_map.Retrieve(INT_MAX, &entry, &address));
92 ASSERT_TRUE(test_map.Retrieve(1, &entry, &address));
95 ASSERT_EQ(CountedObject::count(), 1); // still holding entry in this scope
98 ASSERT_FALSE(test_map.Retrieve(0, &entry, &address));
99 ASSERT_FALSE(test_map.Retrieve(INT_MIN, &entry, &address));
100 ASSERT_FALSE(test_map.Retrieve(INT_MAX, &entry, &address));
105 ASSERT_FALSE(test_map.Retrieve(9, &entry,
[all...]
/external/icu/icu4c/source/tools/toolutil/
H A Ducmstate.cpp40 * row=[[firstentry ','] entry (',' entry)*]
43 * entry=range [':' nextstate] ['.' action]
55 int32_t entry; local
84 /* read an entry, the start of the range first */
107 entry=MBCS_ENTRY_FINAL(0, MBCS_STATE_VALID_16, 0);
109 entry=MBCS_ENTRY_TRANSITION(0, 0);
119 entry=MBCS_ENTRY_SET_STATE(entry, i);
126 entry
335 int32_t entry, sum, state, cell, count; local
427 int32_t entry, state, cell, count; local
623 int32_t entry, offset, oldOffset, trailOffset, oldTrailOffset, savings, sum; local
846 int32_t i, entry, savings, localSavings, belowSavings; local
933 int32_t state, cell, entry; local
980 int32_t i, entry, count; local
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_fs_vector_splitting.cpp128 variable_entry *entry = new(mem_ctx) variable_entry(var);
129 _mesa_hash_table_insert(ht, var, entry);
130 return entry;
147 variable_entry *entry = this->get_variable_entry(var); local
149 if (entry)
150 entry->whole_vector_access++;
238 variable_entry *entry = get_splitting_entry(deref_var->var);
239 if (!entry)
242 ir_variable *var = entry->components[swiz->mask.x];
243 *rvalue = new(entry
336 struct variable_entry *entry = (struct variable_entry *) hte->data; local
357 struct variable_entry *entry = (struct variable_entry *) hte->data; local
[all...]
/external/autotest/contrib/
H A Dsummarize_loadtest.py87 tags = {str(entry[key]) for entry in entries}
95 values = [entry[key] for entry in entries if key in entry]
122 for entry in entries:
123 value = str(entry[keys[0]])
124 indexed.setdefault(value, []).append(entry)
165 for entry in dump_entries:
166 print(json.dumps(entry))
[all...]
/external/deqp/external/glslang/
H A Dosinclude.cpp84 static void EnterGenericThread (void* entry) argument
86 ((TThreadEntrypoint)entry)(DE_NULL);
89 void* OS_CreateThread (TThreadEntrypoint entry) argument
91 return (void*)(deUintptr)deThread_create(EnterGenericThread, (void*)entry, DE_NULL);
/external/guava/guava/src/com/google/common/collect/
H A DForwardingSortedMultiset.java122 Entry<E> entry = entryIterator.next();
123 return Multisets.immutableEntry(entry.getElement(), entry.getCount());
145 Entry<E> entry = entryIterator.next();
146 return Multisets.immutableEntry(entry.getElement(), entry.getCount());
165 Entry<E> entry = entryIterator.next();
166 entry = Multisets.immutableEntry(entry.getElement(), entry
[all...]
/external/iproute2/lib/
H A Dmpls_ntop.c16 uint32_t entry = ntohl(addr[count++].entry); local
17 uint32_t label = (entry & MPLS_LS_LABEL_MASK) >> MPLS_LS_LABEL_SHIFT;
24 if (entry & MPLS_LS_S_MASK)
H A Dnamespace.c22 struct dirent *entry; local
30 while ((entry = readdir(dir)) != NULL) {
31 if (strcmp(entry->d_name, ".") == 0)
33 if (strcmp(entry->d_name, "..") == 0)
35 snprintf(netns_name, sizeof(netns_name), "%s/%s", etc_netns_path, entry->d_name);
36 snprintf(etc_name, sizeof(etc_name), "/etc/%s", entry->d_name);
109 struct dirent *entry; local
115 while ((entry = readdir(dir)) != NULL) {
116 if (strcmp(entry->d_name, ".") == 0)
118 if (strcmp(entry
[all...]
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java32 IntQueue.Entry entry = new Entry(value);
34 tail.next = entry;
35 tail = entry;
38 head = entry;
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_slab.c54 pb_slab_reclaim(struct pb_slabs *slabs, struct pb_slab_entry *entry) argument
56 struct pb_slab *slab = entry->slab;
58 LIST_DEL(&entry->head); /* remove from reclaim list */
59 LIST_ADD(&entry->head, &slab->free);
64 struct pb_slab_group *group = &slabs->groups[entry->group_index];
78 struct pb_slab_entry *entry = local
81 if (!slabs->can_reclaim(slabs->priv, entry))
84 pb_slab_reclaim(slabs, entry);
88 /* Allocate a slab entry of the given size from the given heap.
104 struct pb_slab_entry *entry; local
163 pb_slab_free(struct pb_slabs* slabs, struct pb_slab_entry *entry) argument
245 struct pb_slab_entry *entry = local
[all...]
/external/mesa3d/src/util/tests/hash_table/
H A Dinsert_many.c49 struct hash_entry *entry; local
66 entry = _mesa_hash_table_search(ht, keys + i);
67 assert(entry);
68 assert(key_value(entry->key) == i);
/external/swiftshader/src/Reactor/
H A DLLVMRoutine.hpp39 //int getFunctionSize(); // Includes constants before the entry point
45 const void *entry; member in class:sw::LLVMRoutine
/external/syslinux/com32/gplinclude/acpi/
H A Dxsdt.h25 uint64_t *entry[255]; member in struct:__anon23618
/external/syslinux/gpxe/src/arch/i386/prefix/
H A Dnbiprefix.S20 .word entry, 0x07c0 /* Start execution at 0x07c0:entry */
49 * NBI entry point
52 entry: label
74 .size entry, . - entry
/external/v8/src/compiler/
H A Dvalue-numbering-reducer.cc69 // Allocate the initial entries and insert the first entry.
85 Node* entry = entries_[i];
86 if (!entry) {
88 // Reuse dead entry that we discovered on the way.
91 // Have to insert a new entry.
102 if (entry == node) {
114 Node* entry = entries_[j];
115 if (!entry) {
119 if (entry->IsDead()) {
122 if (entry
201 Node* const entry = entries_[j]; local
[all...]
/external/v8/src/
H A Dsource-position-table.cc68 void EncodeEntry(ZoneVector<byte>& bytes, const PositionTableEntry& entry) { argument
70 DCHECK(entry.code_offset >= 0);
73 entry.is_statement ? entry.code_offset : -entry.code_offset - 1);
74 EncodeInt(bytes, entry.source_position);
97 void DecodeEntry(ByteArray* bytes, int* index, PositionTableEntry* entry) { argument
100 entry->is_statement = true;
101 entry->code_offset = tmp;
103 entry
130 AddEntry(const PositionTableEntry& entry) argument
[all...]
/external/v8/src/x64/
H A Dsimulator-x64.h14 // do is to call the entry directly.
16 #define CALL_GENERATED_CODE(isolate, entry, p0, p1, p2, p3, p4) \
17 (entry(p0, p1, p2, p3, p4))
22 // Call the generated regexp code directly. The code at the entry address should
24 #define CALL_GENERATED_REGEXP_CODE(isolate, entry, p0, p1, p2, p3, p4, p5, p6, \
26 (FUNCTION_CAST<regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6, p7, p8))
/external/v8/src/x87/
H A Dsimulator-x87.h14 // do is to call the entry directly.
15 #define CALL_GENERATED_CODE(isolate, entry, p0, p1, p2, p3, p4) \
16 (entry(p0, p1, p2, p3, p4))
22 // Call the generated regexp code directly. The code at the entry address should
24 #define CALL_GENERATED_REGEXP_CODE(isolate, entry, p0, p1, p2, p3, p4, p5, p6, \
26 (FUNCTION_CAST<regexp_matcher>(entry)(p0, p1, p2, p3, p4, p5, p6, p7, p8))
/external/volley/src/test/java/com/android/volley/mock/
H A DMockCache.java32 public void setEntryToReturn(Entry entry) { argument
33 mFakeEntry = entry;
47 public void put(String key, Entry entry) { argument
50 entryPut = entry;
/external/ipsec-tools/src/racoon/
H A Dgenlist.c52 struct genlist_entry *entry = calloc(sizeof(struct genlist_entry), 1); local
53 entry->data = data;
54 TAILQ_INSERT_HEAD(head, entry, chain);
55 return entry;
61 struct genlist_entry *entry = calloc(sizeof(struct genlist_entry), 1); local
62 entry->data = data;
63 TAILQ_INSERT_TAIL(head, entry, chain);
64 return entry;
117 print_entry(void *entry, void *arg)
119 if (!entry)
[all...]
/external/ltp/testcases/kernel/syscalls/modify_ldt/
H A Dmodify_ldt01.c220 modify_ldt_s entry; local
222 entry.entry_number = 0;
223 entry.base_addr = (unsigned long)seg;
224 entry.limit = size;
225 entry.seg_32bit = 1;
226 entry.contents = 0;
227 entry.read_exec_only = 0;
228 entry.limit_in_pages = 0;
229 entry.seg_not_present = 0;
231 return modify_ldt(1, &entry, sizeo
[all...]
H A Dmodify_ldt02.c29 * Create a segment at entry 0 and a valid base address.
32 * Write an invalid base address into entry 0.
33 * Read the contents of entry 0 in the child process.
170 modify_ldt_s entry; local
172 entry.entry_number = 0;
173 entry.base_addr = (unsigned long)seg;
174 entry.limit = size;
175 entry.seg_32bit = 1;
176 entry.contents = 0;
177 entry
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/piff/
H A DTfrfBox.java60 for (Entry entry : entries) {
62 IsoTypeWriter.writeUInt64(byteBuffer, entry.fragmentAbsoluteTime);
63 IsoTypeWriter.writeUInt64(byteBuffer, entry.fragmentAbsoluteDuration);
65 IsoTypeWriter.writeUInt32(byteBuffer, entry.fragmentAbsoluteTime);
66 IsoTypeWriter.writeUInt32(byteBuffer, entry.fragmentAbsoluteDuration);
77 Entry entry = new Entry();
79 entry.fragmentAbsoluteTime = IsoTypeReader.readUInt64(content);
80 entry.fragmentAbsoluteDuration = IsoTypeReader.readUInt64(content);
82 entry.fragmentAbsoluteTime = IsoTypeReader.readUInt32(content);
83 entry
[all...]
/external/syslinux/gpxe/src/include/gpxe/
H A Dlist.h24 * using the generic single-entry routines.
42 * Insert a new entry between two known consecutive entries.
57 * Add a new entry to the head of a list
59 * @v new New entry to be added
62 * Insert a new entry after the specified head. This is good for
75 * Add a new entry to the tail of a list
77 * @v new New entry to be added
80 * Insert a new entry before the specified head. This is useful for
94 * Delete a list entry by making the prev/next entries
107 * Delete an entry fro
[all...]
/external/autotest/client/profilers/powertop/src/
H A Dintelcstates.c78 struct dirent *entry; local
93 while ((entry = readdir(cpudir))) {
94 if (strlen(entry->d_name) < 3)
97 if (!isdigit(entry->d_name[3]))
101 entry->d_name);
109 while ((entry = readdir(dir))) {
110 if (strlen(entry->d_name) < 3)
112 sprintf(filename + len, "/%s/desc", entry->d_name);

Completed in 822 milliseconds

1234567891011>>