Get comparison sizes right.
[smatch.git] / memops.c
blobdaae0613ed49326de5f984fb7985885831890fb7
1 /*
2 * memops - try to combine memory ops.
4 * Copyright (C) 2004 Linus Torvalds
5 */
7 #include <string.h>
8 #include <stdarg.h>
9 #include <stdlib.h>
10 #include <stdio.h>
11 #include <stddef.h>
12 #include <assert.h>
14 #include "parse.h"
15 #include "expression.h"
16 #include "linearize.h"
17 #include "flow.h"
19 static int find_dominating_parents(pseudo_t pseudo, struct instruction *insn,
20 struct basic_block *bb, unsigned long generation, struct pseudo_list **dominators,
21 int local, int loads)
23 struct basic_block *parent;
25 if (bb_list_size(bb->parents) > 1)
26 loads = 0;
27 FOR_EACH_PTR(bb->parents, parent) {
28 struct instruction *one;
29 struct instruction *br;
30 pseudo_t phi;
32 FOR_EACH_PTR_REVERSE(parent->insns, one) {
33 int dominance;
34 if (one == insn)
35 goto no_dominance;
36 dominance = dominates(pseudo, insn, one, local);
37 if (dominance < 0) {
38 if (one->opcode == OP_LOAD)
39 continue;
40 return 0;
42 if (!dominance)
43 continue;
44 if (one->opcode == OP_LOAD && !loads)
45 continue;
46 goto found_dominator;
47 } END_FOR_EACH_PTR_REVERSE(one);
48 no_dominance:
49 if (parent->generation == generation)
50 continue;
51 parent->generation = generation;
53 if (!find_dominating_parents(pseudo, insn, parent, generation, dominators, local, loads))
54 return 0;
55 continue;
57 found_dominator:
58 br = delete_last_instruction(&parent->insns);
59 phi = alloc_phi(parent, one->target, one->size);
60 phi->ident = phi->ident ? : one->target->ident;
61 add_instruction(&parent->insns, br);
62 use_pseudo(phi, add_pseudo(dominators, phi));
63 } END_FOR_EACH_PTR(parent);
64 return 1;
67 static inline int address_taken(pseudo_t pseudo)
69 pseudo_t *usep;
70 FOR_EACH_PTR(pseudo->users, usep) {
71 struct instruction *insn = container(usep, struct instruction, src);
72 if (insn->bb && insn->opcode == OP_SYMADDR)
73 return 1;
74 } END_FOR_EACH_PTR(usep);
75 return 0;
78 static int local_pseudo(pseudo_t pseudo)
80 return pseudo->type == PSEUDO_SYM
81 && !(pseudo->sym->ctype.modifiers & (MOD_STATIC | MOD_NONLOCAL))
82 && !address_taken(pseudo);
85 static void simplify_loads(struct basic_block *bb)
87 struct instruction *insn;
89 FOR_EACH_PTR_REVERSE(bb->insns, insn) {
90 if (!insn->bb)
91 continue;
92 if (insn->opcode == OP_LOAD) {
93 struct instruction *dom;
94 pseudo_t pseudo = insn->src;
95 int local = local_pseudo(pseudo);
96 struct pseudo_list *dominators;
97 unsigned long generation;
99 RECURSE_PTR_REVERSE(insn, dom) {
100 int dominance;
101 if (!dom->bb)
102 continue;
103 dominance = dominates(pseudo, insn, dom, local);
104 if (dominance) {
105 /* possible partial dominance? */
106 if (dominance < 0) {
107 if (dom->opcode == OP_LOAD)
108 continue;
109 goto next_load;
111 /* Yeehaa! Found one! */
112 convert_load_instruction(insn, dom->target);
113 goto next_load;
115 } END_FOR_EACH_PTR_REVERSE(dom);
117 /* Ok, go find the parents */
118 generation = ++bb_generation;
119 bb->generation = generation;
120 dominators = NULL;
121 if (find_dominating_parents(pseudo, insn, bb, generation, &dominators, local, 1)) {
122 /* This happens with initial assignments to structures etc.. */
123 if (!dominators) {
124 if (local) {
125 assert(pseudo->type != PSEUDO_ARG);
126 convert_load_instruction(insn, value_pseudo(0));
128 goto next_load;
130 rewrite_load_instruction(insn, dominators);
133 next_load:
134 /* Do the next one */;
135 } END_FOR_EACH_PTR_REVERSE(insn);
138 static void kill_store(struct instruction *insn)
140 if (insn) {
141 insn->bb = NULL;
142 insn->opcode = OP_SNOP;
143 kill_use(&insn->target);
147 static void kill_dominated_stores(struct basic_block *bb)
149 struct instruction *insn;
151 FOR_EACH_PTR_REVERSE(bb->insns, insn) {
152 if (!insn->bb)
153 continue;
154 if (insn->opcode == OP_STORE) {
155 struct instruction *dom;
156 pseudo_t pseudo = insn->src;
157 int local = local_pseudo(pseudo);
159 RECURSE_PTR_REVERSE(insn, dom) {
160 int dominance;
161 if (!dom->bb)
162 continue;
163 dominance = dominates(pseudo, insn, dom, local);
164 if (dominance) {
165 /* possible partial dominance? */
166 if (dominance < 0)
167 goto next_store;
168 if (dom->opcode == OP_LOAD)
169 goto next_store;
170 /* Yeehaa! Found one! */
171 kill_store(dom);
173 } END_FOR_EACH_PTR_REVERSE(dom);
175 /* Ok, we should check the parents now */
177 next_store:
178 /* Do the next one */;
179 } END_FOR_EACH_PTR_REVERSE(insn);
182 void simplify_memops(struct entrypoint *ep)
184 struct basic_block *bb;
186 FOR_EACH_PTR_REVERSE(ep->bbs, bb) {
187 simplify_loads(bb);
188 } END_FOR_EACH_PTR_REVERSE(bb);
190 FOR_EACH_PTR_REVERSE(ep->bbs, bb) {
191 kill_dominated_stores(bb);
192 } END_FOR_EACH_PTR_REVERSE(bb);