Cross Reference: /openjdk7/hotspot/src/share/vm/c1/c1

Lines Matching defs:entry
81     ValueMapEntry* entry;
82     for (entry = entry_at(i); entry != NULL; entry = entry->next()) {
83       if (!is_killed(entry->value())) {
84         worklist.push(entry);
89       entry = worklist.pop();
90       int new_index = entry_index(entry->hash(), new_size);
92       if (entry->nesting() != nesting() && new_entries.at(new_index) != entry->next()) {
94         // is not allowed because then the same entry is contained in multiple value maps.
95         // clone entry when next-pointer must be changed
96         entry = new ValueMapEntry(entry->hash(), entry->value(), entry->nesting(), NULL);
98       entry->set_next(new_entries.at(new_index));
99       new_entries.at_put(new_index, entry);
115     for (ValueMapEntry* entry = entry_at(entry_index(hash, size())); entry != NULL; entry = entry->next()) {
116       if (entry->hash() == hash) {
117         Value f = entry->value();
121           TRACE_VALUE_NUMBERING(tty->print_cr("Value Numbering: %s %c%d equal to %c%d  (size %d, entries %d, nesting-diff %d)", x->name(), x->type()->tchar(), x->id(), f->type()->tchar(), f->id(), size(), entry_count(), nesting() - entry->nesting()));
123           if (entry->nesting() != nesting() && f->as_Constant() == NULL) {
156     for (ValueMapEntry* entry = entry_at(i); entry != NULL; entry = entry->next()) {     \
157       Value value = entry->value();                                                      \
159       must_kill_implementation(must_kill, entry, value)                                  \
165           _entries.at_put(i, entry->next());                                             \
168           prev_entry->set_next(entry->next());                                           \
171           prev_entry = entry;                                                            \
174         TRACE_VALUE_NUMBERING(tty->print_cr("Value Numbering: killed %s %c%d  (size %d, entries %d, nesting-diff %d)", value->name(), value->type()->tchar(), value->id(), size(), entry_count(), nesting() - entry->nesting()));   \
176         prev_entry = entry;                                                              \
181 #define MUST_KILL_MEMORY(must_kill, entry, value)                                        \
184 #define MUST_KILL_ARRAY(must_kill, entry, value)                                         \
188 #define MUST_KILL_FIELD(must_kill, entry, value)                                         \
195 #define MUST_KILL_EXCEPTION(must_kill, entry, value)                                     \
196   assert(entry->nesting() < nesting(), "must not find bigger nesting than current");     \
197   bool must_kill = (entry->nesting() == nesting() - 1);
240       for (ValueMapEntry* entry = entry_at(i); entry != NULL; entry = entry->next()) {
241         Value value = entry->value();
242         tty->print("%s %c%d (%s%d) -> ", value->name(), value->type()->tchar(), value->id(), is_killed(value) ? "x" : "", entry->nesting());