util: use C99 declaration in the for-loop set_foreach() macro
authorEric Engestrom <eric@engestrom.ch>
Sat, 20 Oct 2018 17:00:09 +0000 (18:00 +0100)
committerEric Engestrom <eric.engestrom@intel.com>
Thu, 25 Oct 2018 11:43:18 +0000 (12:43 +0100)
Signed-off-by: Eric Engestrom <eric@engestrom.ch>
Reviewed-by: Timothy Arceri <tarceri@itsqueeze.com>
24 files changed:
src/compiler/glsl/opt_copy_propagation_elements.cpp
src/compiler/glsl/standalone.cpp
src/compiler/nir/nir_control_flow.c
src/compiler/nir/nir_dominance.c
src/compiler/nir/nir_from_ssa.c
src/compiler/nir/nir_gs_count_vertices.c
src/compiler/nir/nir_liveness.c
src/compiler/nir/nir_lower_gs_intrinsics.c
src/compiler/nir/nir_lower_io_to_temporaries.c
src/compiler/nir/nir_lower_vars_to_ssa.c
src/compiler/nir/nir_opt_if.c
src/compiler/nir/nir_phi_builder.c
src/compiler/nir/nir_print.c
src/compiler/nir/nir_split_vars.c
src/compiler/nir/nir_to_lcssa.c
src/gallium/drivers/freedreno/freedreno_batch.c
src/gallium/drivers/freedreno/freedreno_batch_cache.c
src/gallium/drivers/freedreno/ir3/ir3_compiler_nir.c
src/gallium/drivers/v3d/v3d_simulator.c
src/intel/compiler/brw_nir_tcs_workarounds.c
src/intel/vulkan/anv_batch_chain.c
src/mesa/main/shared.c
src/util/set.c
src/util/set.h

index cd55c54ec0e40c3bf0a830f4bd6ae03e32ee739a..78126ca3870a34f1b92b0d71933b5a59754121d2 100644 (file)
@@ -111,7 +111,6 @@ public:
       /* TODO: Check write mask, and possibly not clear everything. */
 
       /* For any usage of our variable on the RHS, clear it out. */
-      struct set_entry *set_entry;
       set_foreach(entry->dsts, set_entry) {
          ir_variable *dst_var = (ir_variable *)set_entry->key;
          acp_entry *dst_entry = pull_acp(dst_var);
index c24a220a48d057fc1a086e109e87611bda3f6e66..96ea18f1303822b099a70afff0519218386b9a38 100644 (file)
@@ -87,8 +87,6 @@ public:
 
    void remove_dead_variables()
    {
-      struct set_entry *entry;
-
       set_foreach(variables, entry) {
          ir_variable *ir = (ir_variable *) entry->key;
 
index 92e92c5dea161276a4ba60e210a81bbbb670557c..ddba2e55b45c9433d3064eaee915249b2debd7eb 100644 (file)
@@ -189,7 +189,6 @@ split_block_beginning(nir_block *block)
    new_block->cf_node.parent = block->cf_node.parent;
    exec_node_insert_node_before(&block->cf_node.node, &new_block->cf_node.node);
 
-   struct set_entry *entry;
    set_foreach(block->predecessors, entry) {
       nir_block *pred = (nir_block *) entry->key;
       replace_successor(pred, block, new_block);
index 1781cdcc6f4bb81a2d79d78ffeafb3f979290745..c678727b471c10b3735aea0b5647cc268a61f8e3 100644 (file)
@@ -42,7 +42,6 @@ init_block(nir_block *block, nir_function_impl *impl)
       block->imm_dom = NULL;
    block->num_dom_children = 0;
 
-   struct set_entry *entry;
    set_foreach(block->dom_frontier, entry) {
       _mesa_set_remove(block->dom_frontier, entry);
    }
@@ -72,7 +71,6 @@ static bool
 calc_dominance(nir_block *block)
 {
    nir_block *new_idom = NULL;
-   struct set_entry *entry;
    set_foreach(block->predecessors, entry) {
       nir_block *pred = (nir_block *) entry->key;
 
@@ -96,7 +94,6 @@ static bool
 calc_dom_frontier(nir_block *block)
 {
    if (block->predecessors->entries > 1) {
-      struct set_entry *entry;
       set_foreach(block->predecessors, entry) {
          nir_block *runner = (nir_block *) entry->key;
 
@@ -269,7 +266,6 @@ nir_dump_dom_frontier_impl(nir_function_impl *impl, FILE *fp)
 {
    nir_foreach_block(block, impl) {
       fprintf(fp, "DF(%u) = {", block->index);
-      struct set_entry *entry;
       set_foreach(block->dom_frontier, entry) {
          nir_block *df = (nir_block *) entry->key;
          fprintf(fp, "%u, ", df->index);
index 08d480f119c6f022d32f7bd6ef8d1f4d8e22c9a7..e13c510c111ec944fd224530328a2be26dc9b23a 100644 (file)
@@ -830,7 +830,6 @@ place_phi_read(nir_shader *shader, nir_register *reg,
    if (block != def->parent_instr->block) {
       /* Try to go up the single-successor tree */
       bool all_single_successors = true;
-      struct set_entry *entry;
       set_foreach(block->predecessors, entry) {
          nir_block *pred = (nir_block *)entry->key;
          if (pred->successors[0] && pred->successors[1]) {
index 934c46b78f147883e633f50ad9b3f85c973978fe..06b9cdf73763e8d72ad296a6f4b88cbcdb52bc77 100644 (file)
@@ -62,7 +62,6 @@ nir_gs_count_vertices(const nir_shader *shader)
       /* set_vertex_count intrinsics only appear in predecessors of the
        * end block.  So we don't need to walk all of them.
        */
-      struct set_entry *entry;
       set_foreach(function->impl->end_block->predecessors, entry) {
          nir_block *block = (nir_block *) entry->key;
 
index 1fcb01d5ef63abb6c03c6ee7916f7a8cba6cf683..03e252fbfd83950280bf2bcb1f7f142b3d988f35 100644 (file)
@@ -218,7 +218,6 @@ nir_live_ssa_defs_impl(nir_function_impl *impl)
        * changed, add the predecessor to the work list so that we ensure
        * that the new information is used.
        */
-      struct set_entry *entry;
       set_foreach(block->predecessors, entry) {
          nir_block *pred = (nir_block *)entry->key;
          if (propagate_across_edge(pred, block, &state))
index 4ddace9cf6a3e6fef301e1a1d6d409173f68a20e..78c12e0547503dae490b6aab9b85bae690b01e34 100644 (file)
@@ -165,7 +165,6 @@ append_set_vertex_count(nir_block *end_block, struct state *state)
    /* Insert the new intrinsic in all of the predecessors of the end block,
     * but before any jump instructions (return).
     */
-   struct set_entry *entry;
    set_foreach(end_block->predecessors, entry) {
       nir_block *pred = (nir_block *) entry->key;
       b->cursor = nir_after_block_before_jump(pred);
index d93e20e8d75a39e14ac1d50ff0c7cb373a1e1a3a..b83aaf46e6a663cddfb14d1b0bd91639f21b2f5c 100644 (file)
@@ -98,7 +98,6 @@ emit_output_copies_impl(struct lower_io_state *state, nir_function_impl *impl)
       /* For all other shader types, we need to do the copies right before
        * the jumps to the end block.
        */
-      struct set_entry *block_entry;
       set_foreach(impl->end_block->predecessors, block_entry) {
          struct nir_block *block = (void *)block_entry->key;
          b.cursor = nir_after_block_before_jump(block);
index b3f29e07b6326380b677c0d6d7882ffff7694adf..8e517a78957aed2551690ef4a87d1995382f28d4 100644 (file)
@@ -460,7 +460,6 @@ lower_copies_to_load_store(struct deref_node *node,
    nir_builder b;
    nir_builder_init(&b, state->impl);
 
-   struct set_entry *copy_entry;
    set_foreach(node->copies, copy_entry) {
       nir_intrinsic_instr *copy = (void *)copy_entry->key;
 
@@ -727,7 +726,6 @@ nir_lower_vars_to_ssa_impl(nir_function_impl *impl)
       assert(node->path.path[0]->var->constant_initializer == NULL);
 
       if (node->stores) {
-         struct set_entry *store_entry;
          set_foreach(node->stores, store_entry) {
             nir_intrinsic_instr *store =
                (nir_intrinsic_instr *)store_entry->key;
index 0c94aa170b585c98a087854e2773427881811419..fb161f1c4fdad82b96b2cbbf58f0c4ecfd16e8aa 100644 (file)
@@ -40,7 +40,6 @@ find_continue_block(nir_loop *loop)
 
    assert(header_block->predecessors->entries == 2);
 
-   struct set_entry *pred_entry;
    set_foreach(header_block->predecessors, pred_entry) {
       if (pred_entry->key != prev_block)
          return (nir_block*)pred_entry->key;
index 883884bb7f5729ca374c637d602f04bcff458235..cc5ce81d120fdcc837adf25e65674f322122c229 100644 (file)
@@ -129,7 +129,6 @@ nir_phi_builder_add_value(struct nir_phi_builder *pb, unsigned num_components,
 
    while (w_start != w_end) {
       nir_block *cur = pb->W[w_start++];
-      struct set_entry *dom_entry;
       set_foreach(cur->dom_frontier, dom_entry) {
          nir_block *next = (nir_block *) dom_entry->key;
 
@@ -276,7 +275,6 @@ nir_phi_builder_finish(struct nir_phi_builder *pb)
           * XXX: Calling qsort this many times seems expensive.
           */
          int num_preds = 0;
-         struct set_entry *entry;
          set_foreach(phi->instr.block->predecessors, entry)
             preds[num_preds++] = (nir_block *)entry->key;
          qsort(preds, num_preds, sizeof(*preds), compare_blocks);
index 19f26f4640571d85b29c68f6546bf1b9c2f38c07..ab3d5115688c42e144993069d2894f55bf2d47ad 100644 (file)
@@ -1085,7 +1085,6 @@ print_block(nir_block *block, print_state *state, unsigned tabs)
    nir_block **preds =
       malloc(block->predecessors->entries * sizeof(nir_block *));
 
-   struct set_entry *entry;
    unsigned i = 0;
    set_foreach(block->predecessors, entry) {
       preds[i++] = (nir_block *) entry->key;
index 7eda99819cc830e276b762f93fa9c1cf5abb1412..bf9205c51503be6aa5a6b1b10ddd26602bb628e5 100644 (file)
@@ -1200,7 +1200,6 @@ shrink_vec_var_list(struct exec_list *vars,
          if (!var_usage || !var_usage->vars_copied)
             continue;
 
-         struct set_entry *copy_entry;
          set_foreach(var_usage->vars_copied, copy_entry) {
             struct vec_var_usage *copy_usage = (void *)copy_entry->key;
             if (copy_usage->comps_kept != var_usage->comps_kept) {
index 0f62fc39400dac596a1f3209bd38119bede7f909..7948b117927af37665fa22cd352f2b80d85657de 100644 (file)
@@ -122,7 +122,6 @@ convert_loop_exit_for_ssa(nir_ssa_def *def, void *void_state)
    /* Create a phi node with as many sources pointing to the same ssa_def as
     * the block has predecessors.
     */
-   struct set_entry *entry;
    set_foreach(block_after_loop->predecessors, entry) {
       nir_phi_src *phi_src = ralloc(phi, nir_phi_src);
       phi_src->src = nir_src_for_ssa(def);
index 487176cc6381f98cd4476822cd8b69d8432bde38..6c05fbaa74de97f2bbab23946bb95381bdd33889 100644 (file)
@@ -182,8 +182,6 @@ batch_flush_reset_dependencies(struct fd_batch *batch, bool flush)
 static void
 batch_reset_resources_locked(struct fd_batch *batch)
 {
-       struct set_entry *entry;
-
        pipe_mutex_assert_locked(batch->ctx->screen->lock);
 
        set_foreach(batch->resources, entry) {
index a8b32d9bd08406bfbd6fcba54478c117876c38e6..408d48ccdb6037728f613af4b93e04a875d29207 100644 (file)
@@ -282,7 +282,6 @@ fd_bc_alloc_batch(struct fd_batch_cache *cache, struct fd_context *ctx, bool non
                for (unsigned i = 0; i < ARRAY_SIZE(cache->batches); i++) {
                        batch = cache->batches[i];
                        debug_printf("%d: needs_flush=%d, depends:", batch->idx, batch->needs_flush);
-                       struct set_entry *entry;
                        set_foreach(batch->dependencies, entry) {
                                struct fd_batch *dep = (struct fd_batch *)entry->key;
                                debug_printf(" %d", dep->idx);
index 7a3c8a8579c21565c62893d6934a9078e94bb6df..0c7a722aa0c09d8fbcbe00ddfb435dbfd2f24667 100644 (file)
@@ -2987,7 +2987,6 @@ get_block(struct ir3_context *ctx, const nir_block *nblock)
 {
        struct ir3_block *block;
        struct hash_entry *hentry;
-       struct set_entry *sentry;
        unsigned i;
 
        hentry = _mesa_hash_table_search(ctx->block_ht, nblock);
index 8ef88db3a507a7ca1bffa8fd240f89b92d7d17cb..67a759de0c0f5a162d56a862e6a0a2c7237869f6 100644 (file)
@@ -232,7 +232,6 @@ static int
 v3d_simulator_pin_bos(int fd, struct v3d_job *job)
 {
         struct v3d_simulator_file *file = v3d_get_simulator_file_for_fd(fd);
-        struct set_entry *entry;
 
         set_foreach(job->bos, entry) {
                 struct v3d_bo *bo = (struct v3d_bo *)entry->key;
@@ -250,7 +249,6 @@ static int
 v3d_simulator_unpin_bos(int fd, struct v3d_job *job)
 {
         struct v3d_simulator_file *file = v3d_get_simulator_file_for_fd(fd);
-        struct set_entry *entry;
 
         set_foreach(job->bos, entry) {
                 struct v3d_bo *bo = (struct v3d_bo *)entry->key;
index af7b7180431ef9274cf6f577c7af007fcda3c40a..174cf6eec881c75ce261ca5092f66c6ea2b47dd2 100644 (file)
@@ -138,7 +138,6 @@ brw_nir_apply_tcs_quads_workaround(nir_shader *nir)
    const unsigned num_end_preds = impl->end_block->predecessors->entries;
    nir_block *end_preds[num_end_preds];
    unsigned i = 0;
-   struct set_entry *entry;
 
    set_foreach(impl->end_block->predecessors, entry) {
       end_preds[i++] = (nir_block *) entry->key;
index e08e07ad7bd7062416c9c54256e3f92c8f09e755..a9f8c5b79b1580bb18bcff140fb8949f915320e3 100644 (file)
@@ -89,7 +89,6 @@ anv_reloc_list_init_clone(struct anv_reloc_list *list,
              list->array_length * sizeof(*list->relocs));
       memcpy(list->reloc_bos, other_list->reloc_bos,
              list->array_length * sizeof(*list->reloc_bos));
-      struct set_entry *entry;
       set_foreach(other_list->deps, entry) {
          _mesa_set_add_pre_hashed(list->deps, entry->hash, entry->key);
       }
@@ -205,7 +204,6 @@ anv_reloc_list_append(struct anv_reloc_list *list,
 
    list->num_relocs += other->num_relocs;
 
-   struct set_entry *entry;
    set_foreach(other->deps, entry) {
       _mesa_set_add_pre_hashed(list->deps, entry->hash, entry->key);
    }
@@ -1135,7 +1133,6 @@ anv_execbuf_add_bo(struct anv_execbuf *exec,
          if (bos == NULL)
             return vk_error(VK_ERROR_OUT_OF_HOST_MEMORY);
 
-         struct set_entry *entry;
          struct anv_bo **bo = bos;
          set_foreach(relocs->deps, entry) {
             *bo++ = (void *)entry->key;
index b0338d78b05009e577553dd728a5fa4f43149806..b6de835acefb3315094e32a73d5c64c25fa3ac68 100644 (file)
@@ -409,7 +409,6 @@ free_shared_state(struct gl_context *ctx, struct gl_shared_state *shared)
       _mesa_reference_buffer_object(ctx, &shared->NullBufferObj, NULL);
 
    if (shared->SyncObjects) {
-      struct set_entry *entry;
       set_foreach(shared->SyncObjects, entry) {
          _mesa_unref_sync_object(ctx, (struct gl_sync_object *) entry->key, 1);
       }
index feef96d16eaf35ff4980821a57189091dbd9413a..fe5b10f0fee4c35b28933ec0eef60b9531d4e528 100644 (file)
@@ -168,8 +168,6 @@ _mesa_set_destroy(struct set *ht, void (*delete_function)(struct set_entry *entr
       return;
 
    if (delete_function) {
-      struct set_entry *entry;
-
       set_foreach (ht, entry) {
          delete_function(entry);
       }
@@ -187,8 +185,6 @@ _mesa_set_destroy(struct set *ht, void (*delete_function)(struct set_entry *entr
 void
 _mesa_set_clear(struct set *set, void (*delete_function)(struct set_entry *entry))
 {
-   struct set_entry *entry;
-
    if (!set)
       return;
 
@@ -256,7 +252,7 @@ static void
 set_rehash(struct set *ht, unsigned new_size_index)
 {
    struct set old_ht;
-   struct set_entry *table, *entry;
+   struct set_entry *table;
 
    if (new_size_index >= ARRAY_SIZE(hash_sizes))
       return;
index ffd19a798bd3f3e808ccca558387dbc60e0459a6..54719e4c8ab8feb7a8fb7218d18ee1f9e5dbe342 100644 (file)
@@ -96,9 +96,9 @@ _mesa_set_random_entry(struct set *set,
  * insertion (which may rehash the set, making entry a dangling
  * pointer).
  */
-#define set_foreach(set, entry)                          \
-   for (entry = _mesa_set_next_entry(set, NULL);  \
-        entry != NULL;                                   \
+#define set_foreach(set, entry)                                     \
+   for (struct set_entry *entry = _mesa_set_next_entry(set, NULL);  \
+        entry != NULL;                                              \
         entry = _mesa_set_next_entry(set, entry))
 
 #ifdef __cplusplus