}
}
- struct set_entry *entry;
set_foreach(block->predecessors, entry) {
const nir_block *pred = entry->key;
validate_assert(state, pred->successors[0] == block ||
if (reg_state->uses->entries != 0) {
printf("extra entries in register uses:\n");
- struct set_entry *entry;
set_foreach(reg_state->uses, entry)
printf("%p\n", entry->key);
if (reg_state->if_uses->entries != 0) {
printf("extra entries in register if_uses:\n");
- struct set_entry *entry;
set_foreach(reg_state->if_uses, entry)
printf("%p\n", entry->key);
if (reg_state->defs->entries != 0) {
printf("extra entries in register defs:\n");
- struct set_entry *entry;
set_foreach(reg_state->defs, entry)
printf("%p\n", entry->key);
if (def_state->uses->entries != 0) {
printf("extra entries in SSA def uses:\n");
- struct set_entry *entry;
set_foreach(def_state->uses, entry)
printf("%p\n", entry->key);
if (def_state->if_uses->entries != 0) {
printf("extra entries in SSA def uses:\n");
- struct set_entry *entry;
set_foreach(def_state->if_uses, entry)
printf("%p\n", entry->key);
if (_mesa_hash_table_num_entries(errors) > 0) {
fprintf(stderr, "%d additional errors:\n",
_mesa_hash_table_num_entries(errors));
- struct hash_entry *entry;
hash_table_foreach(errors, entry) {
fprintf(stderr, "%s\n", (char *)entry->data);
}