1bf215546Sopenharmony_ci/*
2bf215546Sopenharmony_ci * Copyright (C) 2021 Alyssa Rosenzweig <alyssa@rosenzweig.io>
3bf215546Sopenharmony_ci *
4bf215546Sopenharmony_ci * Permission is hereby granted, free of charge, to any person obtaining a
5bf215546Sopenharmony_ci * copy of this software and associated documentation files (the "Software"),
6bf215546Sopenharmony_ci * to deal in the Software without restriction, including without limitation
7bf215546Sopenharmony_ci * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8bf215546Sopenharmony_ci * and/or sell copies of the Software, and to permit persons to whom the
9bf215546Sopenharmony_ci * Software is furnished to do so, subject to the following conditions:
10bf215546Sopenharmony_ci *
11bf215546Sopenharmony_ci * The above copyright notice and this permission notice (including the next
12bf215546Sopenharmony_ci * paragraph) shall be included in all copies or substantial portions of the
13bf215546Sopenharmony_ci * Software.
14bf215546Sopenharmony_ci *
15bf215546Sopenharmony_ci * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16bf215546Sopenharmony_ci * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17bf215546Sopenharmony_ci * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
18bf215546Sopenharmony_ci * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19bf215546Sopenharmony_ci * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20bf215546Sopenharmony_ci * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21bf215546Sopenharmony_ci * SOFTWARE.
22bf215546Sopenharmony_ci */
23bf215546Sopenharmony_ci
24bf215546Sopenharmony_ci#include "agx_compiler.h"
25bf215546Sopenharmony_ci
26bf215546Sopenharmony_ci/* SSA-based scalar dead code elimination */
27bf215546Sopenharmony_ci
28bf215546Sopenharmony_civoid
29bf215546Sopenharmony_ciagx_dce(agx_context *ctx)
30bf215546Sopenharmony_ci{
31bf215546Sopenharmony_ci   bool progress;
32bf215546Sopenharmony_ci   do {
33bf215546Sopenharmony_ci      progress = false;
34bf215546Sopenharmony_ci
35bf215546Sopenharmony_ci      BITSET_WORD *seen = calloc(BITSET_WORDS(ctx->alloc), sizeof(BITSET_WORD));
36bf215546Sopenharmony_ci
37bf215546Sopenharmony_ci      agx_foreach_instr_global(ctx, I) {
38bf215546Sopenharmony_ci         agx_foreach_src(I, s) {
39bf215546Sopenharmony_ci            if (I->src[s].type == AGX_INDEX_NORMAL)
40bf215546Sopenharmony_ci               BITSET_SET(seen, I->src[s].value);
41bf215546Sopenharmony_ci         }
42bf215546Sopenharmony_ci      }
43bf215546Sopenharmony_ci
44bf215546Sopenharmony_ci      agx_foreach_instr_global_safe_rev(ctx, I) {
45bf215546Sopenharmony_ci         if (!agx_opcodes_info[I->op].can_eliminate) continue;
46bf215546Sopenharmony_ci
47bf215546Sopenharmony_ci         bool needed = false;
48bf215546Sopenharmony_ci
49bf215546Sopenharmony_ci         agx_foreach_dest(I, d) {
50bf215546Sopenharmony_ci            if (I->dest[d].type == AGX_INDEX_NORMAL)
51bf215546Sopenharmony_ci               needed |= BITSET_TEST(seen, I->dest[d].value);
52bf215546Sopenharmony_ci            else if (I->dest[d].type != AGX_INDEX_NULL)
53bf215546Sopenharmony_ci               needed = true;
54bf215546Sopenharmony_ci         }
55bf215546Sopenharmony_ci
56bf215546Sopenharmony_ci         if (!needed) {
57bf215546Sopenharmony_ci            agx_remove_instruction(I);
58bf215546Sopenharmony_ci            progress = true;
59bf215546Sopenharmony_ci         }
60bf215546Sopenharmony_ci      }
61bf215546Sopenharmony_ci
62bf215546Sopenharmony_ci      free(seen);
63bf215546Sopenharmony_ci   } while (progress);
64bf215546Sopenharmony_ci}
65