OpenCores
URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [tags/] [nog_patch_38/] [or1ksim/] [cuc/] [bb.c] - Blame information for rev 1062

Go to most recent revision | Details | Compare with Previous | View Log

Line No. Rev Author Line
1 879 markom 
/* bb.c -- OpenRISC Custom Unit Compiler, Basic Block handling
2 
 *    Copyright (C) 2002 Marko Mlinar, markom@opencores.org
3 
 *
4 
 *    This file is part of OpenRISC 1000 Architectural Simulator.
5 
 *
6 
 *    This program is free software; you can redistribute it and/or modify
7 
 *    it under the terms of the GNU General Public License as published by
8 
 *    the Free Software Foundation; either version 2 of the License, or
9 
 *    (at your option) any later version.
10 
 *
11 
 *    This program is distributed in the hope that it will be useful,
12 
 *    but WITHOUT ANY WARRANTY; without even the implied warranty of
13 
 *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14 
 *    GNU General Public License for more details.
15 
 *
16 
 *    You should have received a copy of the GNU General Public License
17 
 *    along with this program; if not, write to the Free Software
18 
 *    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
19 
 
20 
#include <stdio.h>
21 
#include <stdlib.h>
22 
#include <stdarg.h>
23 
#include <assert.h>
24 897 markom 
#include "sim-config.h"
25 
#include "abstract.h"
26 879 markom 
#include "cuc.h"
27 
#include "insn.h"
28 
#include "support/profile.h"
29 
 
30 925 markom 
/* prints out bb string */
31 
void print_bb_num (int num)
32 
{
33 997 markom 
  if (num < 0) PRINTF ("*");
34 
  else if (num == BBID_END) PRINTF ("END");
35 
  else if (num == BBID_START) PRINTF ("START");
36 
  else PRINTF ("%2x", num);
37 925 markom 
}
38 
 
39 879 markom 
/* Print out basic blocks */
40 
void print_cuc_bb (cuc_func *f, char *s)
41 
{
42 
  int i;
43 997 markom 
  PRINTF ("------- %s -------\n", s);
44 879 markom 
  for (i = 0; i < f->num_bb; i++) {
45 997 markom 
    if (f->bb[i].insn) PRINTF ("\n---- BB%-2x * %x ---- ", i, f->bb[i].cnt);
46 
    else PRINTF ("BB%-2x: %4x-%-4x", i, f->bb[i].first, f->bb[i].last);
47 
    PRINTF (" type %02x tmp %i ", f->bb[i].type, f->bb[i].tmp);
48 
    PRINTF ("next "); print_bb_num (f->bb[i].next[0]);
49 
    PRINTF (" "); print_bb_num (f->bb[i].next[1]);
50 
    PRINTF (" prev "); print_bb_num (f->bb[i].prev[0]);
51 
    PRINTF (" "); print_bb_num (f->bb[i].prev[1]);
52 
    PRINTF ("\n");
53 879 markom 
 
54 1062 markom 
    if (f->bb[i].insn) print_insns (i, f->bb[i].insn, f->bb[i].ninsn, 0);
55 879 markom 
  }
56 953 markom 
  if (f->nmsched) {
57 997 markom 
    PRINTF ("\nmsched: ");
58 953 markom 
    for (i = 0; i < f->nmsched; i++)
59 997 markom 
      PRINTF ("%x ", f->msched[i]);
60 
    PRINTF ("\n\n\n");
61 
  } else PRINTF ("\n");
62 897 markom 
  fflush (stdout);
63 879 markom 
}
64 
 
65 
/* Copies src basic block into destination */
66 
cuc_bb *cpy_bb (cuc_bb *dest, cuc_bb *src)
67 
{
68 897 markom 
  int i, j;
69 941 markom 
  dep_list *d;
70 897 markom 
  assert (dest != src);
71 879 markom 
  *dest = *src;
72 
  assert (dest->insn = malloc (sizeof (cuc_insn) * src->ninsn));
73 941 markom 
  for (i = 0; i < src->ninsn; i++) {
74 
    d = src->insn[i].dep;
75 879 markom 
    dest->insn[i] = src->insn[i];
76 941 markom 
    dest->insn[i].dep = NULL;
77 
    while (d) {
78 
      add_dep (&dest->insn[i].dep, d->ref);
79 
      d = d->next;
80 
    }
81 
  }
82 
 
83 
  d = src->mdep;
84 
  dest->mdep = NULL;
85 
  while (d) {
86 
    add_dep (&dest->mdep, d->ref);
87 
    d = d->next;
88 
  }
89 879 markom 
  if (src->ntim) {
90 
    assert (dest->tim = malloc (sizeof (cuc_timings) * src->ntim));
91 897 markom 
    for (i = 0; i < src->ntim; i++) {
92 
      dest->tim[i] = src->tim[i];
93 
      if (src->tim[i].nshared) {
94 
        assert (dest->tim[i].shared = malloc (sizeof (int) * src->tim[i].nshared));
95 
        for (j = 0; j < src->tim[i].nshared; j++)
96 
          dest->tim[i].shared[j] = src->tim[i].shared[j];
97 
      }
98 
    }
99 879 markom 
  }
100 
}
101 
 
102 
/* Duplicates function */
103 
cuc_func *dup_func (cuc_func *f)
104 
{
105 
  cuc_func *n = (cuc_func *) malloc (sizeof (cuc_func));
106 
  int b, i;
107 
  for (b = 0; b < f->num_bb; b++) cpy_bb (&n->bb[b], &f->bb[b]);
108 
  n->num_bb = f->num_bb;
109 
  assert (n->init_bb_reloc = (int *)malloc (sizeof (int) * f->num_init_bb));
110 
  for (b = 0; b < f->num_init_bb; b++) n->init_bb_reloc[b] = f->init_bb_reloc[b];
111 
  n->num_init_bb = f->num_init_bb;
112 915 markom 
  for (i = 0; i < MAX_REGS; i++) {
113 
    n->saved_regs[i] = f->saved_regs[i];
114 
    n->lur[i] = f->lur[i];
115 
    n->used_regs[i] = f->used_regs[i];
116 
  }
117 879 markom 
  n->start_addr = f->start_addr;
118 
  n->end_addr = f->end_addr;
119 
  n->orig_time = f->orig_time;
120 
  n->nmsched = f->nmsched;
121 1041 markom 
  n->num_runs = f->num_runs;
122 879 markom 
  for (i = 0; i < f->nmsched; i++) {
123 
    n->msched[i] = f->msched[i];
124 
    n->mtype[i] = f->mtype[i];
125 
  }
126 906 markom 
  n->nfdeps = f->nfdeps;
127 
  if (f->nfdeps) {
128 
    f->fdeps = (cuc_func **) malloc (sizeof (cuc_func *) * f->nfdeps);
129 
    for (i = 0; i < f->nfdeps; i++) n->fdeps[i] = f->fdeps[i];
130 
  }
131 879 markom 
  return n;
132 
}
133 
 
134 
/* Releases memory allocated by function */
135 
void free_func (cuc_func *f)
136 
{
137 
  int b, i;
138 
  for (b = 0; b < f->num_bb; b++) {
139 
    for (i = 0; i < f->bb[b].ninsn; i++)
140 
      dispose_list (&f->bb[b].insn[i].dep);
141 
    if (f->bb[b].insn) free (f->bb[b].insn);
142 897 markom 
    for (i = 0; i < f->bb[b].ntim; i++)
143 
      if (f->bb[b].tim[i].nshared && f->bb[b].tim[i].shared)
144 
        free (f->bb[b].tim[i].shared);
145 879 markom 
    if (f->bb[b].tim && f->bb[b].ntim) free (f->bb[b].tim);
146 
  }
147 
  free (f);
148 
}
149 
 
150 
/* Recalculates last_used_reg */
151 
void recalc_last_used_reg (cuc_func *f, int b)
152 
{
153 
  int i;
154 
  cuc_bb *bb = &f->bb[b];
155 
 
156 
  /* rebuild last used reg array */
157 
  if (bb->insn[0].index == II_LRBB) bb->last_used_reg[LRBB_REG] = 0;
158 
  else bb->last_used_reg[LRBB_REG] = -1;
159 
 
160 
  for (i = 1; i < MAX_REGS - 1; i++) bb->last_used_reg[i] = -1;
161 
 
162 
    /* Create references */
163 
  for (i = 0; i < bb->ninsn; i++) {
164 
    int k;
165 
    /* Now check for destination operand(s) */
166 
    for (k = 0; k < MAX_OPERANDS; k++) if (bb->insn[i].opt[k] & OPT_DEST)
167 
      if ((bb->insn[i].opt[k] & ~OPT_DEST) == OPT_REGISTER
168 
        && (int)bb->insn[i].op[k] >= 0) {
169 
        bb->last_used_reg[bb->insn[i].op[k]] = REF (b, i);
170 
      }
171 
  }
172 
}
173 
 
174 
/* Set the BB limits */
175 
void detect_bb (cuc_func *f)
176 
{
177 
  int i, j, end_bb = 0, eb = 0;
178 
 
179 
  /* Mark block starts/ends */
180 
  for (i = 0; i < num_insn; i++) {
181 
    if (end_bb) insn[i].type |= IT_BBSTART;
182 
    end_bb = 0;
183 
    if (insn[i].type & IT_BRANCH) {
184 
      int jt = insn[i].op[0];
185 
      insn[i].type |= IT_BBEND;
186 
      end_bb = 1;
187 
      if (jt < 0 || jt >= num_insn) {
188 
        fprintf (stderr, "Instruction #%i:Jump out of function '%s'.\n", i, insn[i].disasm);
189 
        exit (1);
190 
      }
191 
      if (jt > 0) insn[jt - 1].type |= IT_BBEND;
192 
      insn[jt].type |= IT_BBSTART;
193 
    }
194 
  }
195 
 
196 
  /* Initialize bb array */
197 
  insn[0].type |= IT_BBSTART;
198 
  insn[num_insn - 1].type |= IT_BBEND;
199 
  f->num_bb = 0;
200 
  for (i = 0; i < num_insn; i++) {
201 
    if (insn[i].type & IT_BBSTART) {
202 
      f->bb[f->num_bb].first = i;
203 
      f->bb[f->num_bb].cnt = 0;
204 
    }
205 
    /* Determine repetitions of a loop */
206 
    if (insn[i].type & IT_BBEND) {
207 
      f->bb[f->num_bb].type = 0;
208 
      f->bb[f->num_bb].last = i;
209 
      f->bb[f->num_bb].next[0] = f->bb[f->num_bb].next[1] = -1;
210 
      f->bb[f->num_bb].tmp = 0;
211 
      f->bb[f->num_bb].ntim = 0;
212 
      f->num_bb++;
213 
      assert (f->num_bb < MAX_BB);
214 
    }
215 
  }
216 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_INIT");
217 879 markom 
 
218 
  /* Build forward connections between BBs */
219 
  for (i = 0; i < f->num_bb; i++)
220 
    if (insn[f->bb[i].last].type & IT_BRANCH) {
221 
      int j;
222 
      assert (insn[f->bb[i].last].index == II_BF);
223 
      /* Find block this instruction jumps to */
224 
      for (j = 0; j < f->num_bb; j++)
225 
        if (f->bb[j].first == insn[f->bb[i].last].op[0]) break;
226 
      assert (j < f->num_bb);
227 
 
228 
      /* Convert the jump address to BB link */
229 
      insn[f->bb[i].last].op[0] = j; insn[f->bb[i].last].opt[0] = OPT_BB;
230 
 
231 
      /* Make a link */
232 
      f->bb[i].next[0] = j;
233 
      if (++f->bb[j].tmp > 2) eb++;
234 
      f->bb[i].next[1] = i + 1;
235 
      if (++f->bb[i + 1].tmp > 2) eb++;
236 
    } else if (f->bb[i].last == num_insn - 1) { /* Last instruction doesn't have to do anything */
237 
    } else {
238 
      f->bb[i].next[0] = i + 1;
239 
      if (++f->bb[i + 1].tmp > 2) eb++;
240 
    }
241 
 
242 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_NEXT");
243 879 markom 
 
244 
  /* Build backward connections, but first insert artificial blocks
245 
   * to handle more than 2 connections */
246 883 markom 
  cucdebug (6, "artificial %i %i\n", f->num_bb, eb);
247 879 markom 
  end_bb = f->num_bb + eb;
248 
  for (i = f->num_bb - 1; i >= 0; i--) {
249 
    j = f->bb[i].tmp;
250 
    if (f->bb[i].tmp > 2) f->bb[i].tmp = -f->bb[i].tmp;
251 
    f->bb[--end_bb] = f->bb[i];
252 
    reloc[i] = end_bb;
253 
    while (j-- > 2) {
254 
      f->bb[--end_bb].first = f->bb[i].first;
255 
      f->bb[end_bb].last = -1;
256 
      f->bb[end_bb].next[0] = -1;
257 
      f->bb[end_bb].next[1] = -1;
258 
      f->bb[end_bb].tmp = 0;
259 
      f->bb[end_bb].cnt = f->bb[i].cnt;
260 
      f->bb[end_bb].ntim = 0;
261 
    }
262 
  }
263 
  f->num_bb += eb;
264 
 
265 
  /* relocate jump instructions */
266 
  for (i = 0; i < num_insn; i++)
267 
    for (j = 0; j < MAX_OPERANDS; j++)
268 
      if (insn[i].opt[j] & OPT_BB)
269 
        insn[i].op[j] = reloc[insn[i].op[j]];
270 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_INSERT-reloc");
271 879 markom 
  for (i = 0; i < f->num_bb; i++) {
272 
    if (f->bb[i].next[0] >= 0) {
273 
      int t = reloc[f->bb[i].next[0]];
274 
      if (f->bb[t].tmp < 0) {
275 
        f->bb[t].tmp = -f->bb[t].tmp;
276 
        t -= f->bb[t].tmp - 2;
277 
      } else if (f->bb[t].tmp > 2) t -= f->bb[t].tmp-- - 2;
278 
      f->bb[i].next[0] = t;
279 
    }
280 
    if (f->bb[i].next[1] >= 0) {
281 
      int t = reloc[f->bb[i].next[1]];
282 
      if (f->bb[t].tmp < 0) {
283 
        f->bb[t].tmp = -f->bb[t].tmp;
284 
        t -= f->bb[t].tmp - 2;
285 
      } else if (f->bb[t].tmp > 2) t -= f->bb[t].tmp-- - 2;
286 
      f->bb[i].next[1] = t;
287 
    }
288 
    /* artificial blocks do not have relocations, hardcode them */
289 
    if (f->bb[i].last < 0) f->bb[i].next[0] = i + 1;
290 
  }
291 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_INSERT");
292 879 markom 
 
293 
  /* Uncoditional branched do not continue to next block */
294 
  for (i = 0; i < f->num_bb; i++) {
295 
    cuc_insn *ii;
296 
    if (f->bb[i].last < 0) continue;
297 
    ii = &insn[f->bb[i].last];
298 
    /* Unconditional branch? */
299 
    if (ii->type & IT_BRANCH && ii->opt[1] & OPT_CONST) {
300 
      change_insn_type (ii, II_NOP);
301 1044 markom 
#if 0
302 879 markom 
      if (f->bb[i].next[1] == i + 1) f->bb[i].next[0] = f->bb[i].next[1];
303 1044 markom 
#endif
304 879 markom 
      f->bb[i].next[1] = -1;
305 
    }
306 1044 markom 
  }
307 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_UNCOND_JUMP");
308 879 markom 
 
309 
  /* Add backward connections */
310 
  for (i = 0; i < f->num_bb; i++)
311 
    f->bb[i].prev[0] = f->bb[i].prev[1] = -1;
312 
 
313 
  for (i = 0; i < f->num_bb; i++) {
314 
    if (f->bb[i].next[0] >= 0) {
315 
      int t = f->bb[i].next[0];
316 
      if (f->bb[t].prev[0] < 0) f->bb[t].prev[0] = i;
317 
      else {
318 
        assert (f->bb[t].prev[1] < 0);
319 
        f->bb[t].prev[1] = i;
320 
      }
321 
    }
322 
    if (f->bb[i].next[1] >= 0) {
323 
      int t = f->bb[i].next[1];
324 
      if (f->bb[t].prev[0] < 0) f->bb[t].prev[0] = i;
325 
      else {
326 
        assert (f->bb[t].prev[1] < 0);
327 
        f->bb[t].prev[1] = i;
328 
      }
329 
    }
330 
  }
331 932 markom 
  /* Add START marker */
332 
  assert (f->bb[0].prev[0] < 0);
333 1061 markom 
  f->bb[0].prev[0] = BBID_START;
334 932 markom 
 
335 925 markom 
  /* Add END marker */
336 1061 markom 
  assert (f->bb[f->num_bb - 1].next[0] < 0);
337 
  assert (f->bb[f->num_bb - 1].next[1] < 0);
338 
  f->bb[f->num_bb - 1].next[0] = BBID_END;
339 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_PREV");
340 879 markom 
}
341 
 
342 905 markom 
/* We do a quick check if there are some anomalies with references */
343 
void cuc_check (cuc_func *f)
344 
{
345 
  int i, j, k;
346 973 markom 
  cucdebug (1, "cuc_check\n");
347 905 markom 
  for (i = 0; i < f->num_bb; i++) {
348 930 markom 
    if (!f->bb[i].insn && f->bb[i].ninsn) goto err;
349 
    for (j = 0; j < f->bb[i].ninsn; j++) {
350 
      cuc_insn *ii = &f->bb[i].insn[j];
351 1062 markom 
      if ((ii->index == II_CMOV || ii->index == II_ADD) && ii->type & IT_COND && ii->opt[0] & OPT_DEST) {
352 930 markom 
        k = 0;
353 
        assert (ii->opt[k] & OPT_REGISTER);
354 
        if ((signed)ii->op[k] >= 0 && ii->op[k] != FLAG_REG && ii->op[k] != LRBB_REG) {
355 1062 markom 
          cucdebug (1, "Invalid dest conditional type opt%x op%x\n", ii->opt[0], ii->op[0]);
356 930 markom 
          goto err;
357 
        }
358 
      }
359 1061 markom 
      for (k = 0; k < MAX_OPERANDS; k++) {
360 930 markom 
        if (ii->opt[k] & OPT_REF) {
361 
          int t = ii->op[k];
362 
          if (REF_BB(t) >= f->num_bb || REF_I (t) >= f->bb[REF_BB(t)].ninsn
363 934 markom 
           || (ii->index == II_CMOV || ii->index == II_ADD) && (
364 930 markom 
                (f->INSN(t).type & IT_COND) != (ii->type & IT_COND) && k < 3
365 1062 markom 
              || !(f->INSN(t).type & IT_COND) && k == 3)) {
366 
            cucdebug (1, "Conditional misused\n");
367 
            goto err;
368 
          }
369 905 markom 
        }
370 1061 markom 
        if (k && ii->opt[k] & OPT_DEST) {
371 
          cucdebug (1, "Destination only allowed for op0!\n");
372 
          goto err;
373 
        }
374 
      }
375 930 markom 
    }
376 905 markom 
  }
377 930 markom 
  return;
378 
err:
379 1062 markom 
  cucdebug (1, "Anomaly detected at [%x_%x].%i\n", i, j, k);
380 930 markom 
  print_cuc_bb (f, "ANOMALY");
381 1062 markom 
  cucdebug (1, "Anomaly detected at [%x_%x].%i\n", i, j, k);
382 930 markom 
  exit (1);
383 905 markom 
}
384 
 
385 879 markom 
/* Build basic blocks */
386 
void build_bb (cuc_func *f)
387 
{
388 
  int i, j, k;
389 
  for (i = 0; i < f->num_bb; i++) {
390 
    if (f->bb[i].last < 0) f->bb[i].ninsn = MAX_REGS - 1;
391 
    else f->bb[i].ninsn = f->bb[i].last - f->bb[i].first + 1 + MAX_REGS - 1;
392 
    assert (f->bb[i].ninsn >= MAX_REGS - 1);
393 
    f->bb[i].insn = (cuc_insn *) malloc (sizeof (cuc_insn) * f->bb[i].ninsn);
394 
    assert (f->bb[i].insn);
395 
    f->bb[i].nmemory = 0;
396 
    f->bb[i].unrolled = 1;
397 
 
398 
    /* Save space for conditional moves, exclude r0, place lrbb instead */
399 
    change_insn_type (&f->bb[i].insn[0], II_LRBB);
400 
    strcpy (f->bb[i].insn[0].disasm, "lrbb");
401 930 markom 
    f->bb[i].insn[0].type = IT_UNUSED | IT_COND;
402 879 markom 
    f->bb[i].insn[0].dep = NULL;
403 
    f->bb[i].insn[0].op[0] = LRBB_REG; f->bb[i].insn[0].opt[0] = OPT_REGISTER | OPT_DEST;
404 
    f->bb[i].insn[0].opt[1] = OPT_LRBB;
405 
    f->bb[i].insn[0].opt[2] = f->bb[i].insn[0].opt[3] = OPT_NONE;
406 
    for (j = 1; j < MAX_REGS - 1; j++) {
407 
      change_insn_type (&f->bb[i].insn[j], II_CMOV);
408 
      strcpy (f->bb[i].insn[j].disasm, "cmov");
409 930 markom 
      f->bb[i].insn[j].type = j == FLAG_REG || j == LRBB_REG ? IT_COND : 0;
410 879 markom 
      f->bb[i].insn[j].dep = NULL;
411 
      f->bb[i].insn[j].opt[0] = f->bb[i].insn[j].opt[1] = f->bb[i].insn[j].opt[2] = OPT_REGISTER;
412 
      f->bb[i].insn[j].opt[0] |= OPT_DEST;
413 
      f->bb[i].insn[j].op[0] = f->bb[i].insn[j].op[1] = f->bb[i].insn[j].op[2] = j;
414 
      f->bb[i].insn[j].op[3] = LRBB_REG; f->bb[i].insn[j].opt[3] = OPT_REGISTER;
415 
    }
416 897 markom 
 
417 
    /* Relocate instructions */
418 879 markom 
    for (j = MAX_REGS - 1; j < f->bb[i].ninsn; j++) {
419 
      f->bb[i].insn[j] = insn[f->bb[i].first + j - (MAX_REGS - 1)];
420 
      for (k = 0; k < MAX_OPERANDS; k++)
421 
        if (f->bb[i].insn[j].opt[k] & OPT_REF) {
422 
          int b1;
423 
          for (b1 = 0; b1 < i; b1++)
424 898 markom 
            if (f->bb[b1].first <= (signed) f->bb[i].insn[j].op[k]
425 
              && (signed)f->bb[i].insn[j].op[k] <= f->bb[b1].last) break;
426 879 markom 
          assert (b1 < f->num_bb);
427 
          f->bb[i].insn[j].op[k] = REF (b1, f->bb[i].insn[j].op[k] - f->bb[b1].first + MAX_REGS - 1);
428 
        }
429 
      if (f->bb[i].insn[j].type & IT_MEMORY) f->bb[i].nmemory++;
430 
    }
431 
  }
432 905 markom 
  cuc_check (f);
433 879 markom 
}
434 
 
435 1042 markom 
/* Does simplification on blocks A, B, C:
436 
   A->B->C, A->C to just A->B->C */
437 
static void simplify_bb (cuc_func *f, int pred, int s1, int s2, int neg)
438 
{
439 
  cuc_insn *last;
440 
  int i;
441 
  if (cuc_debug >= 3) print_cuc_bb (f, "BEFORE_SIMPLIFY");
442 
  cucdebug (3, "simplify %x->%x->%x (%i)\n", pred, s1, s2, neg);
443 
  assert (s2 != pred); /* Shouldn't occur => stupid */
444 
  f->bb[pred].next[1] = -1;
445 
  f->bb[pred].next[0] = s1;
446 
 
447 
  if (f->bb[s2].prev[0] == pred) {
448 
    f->bb[s2].prev[0] = f->bb[s2].prev[1];
449 
    f->bb[s2].prev[1] = -1;
450 
  } else if (f->bb[s2].prev[1] == pred) {
451 
    f->bb[s2].prev[1] = -1;
452 
  } else assert (0);
453 
 
454 
  last = &f->bb[pred].insn[f->bb[pred].ninsn - 1];
455 
  assert (last->type & IT_BRANCH);
456 
  for (i = 0; i < f->bb[s2].ninsn; i++) {
457 
    cuc_insn *ii= &f->bb[s2].insn[i];
458 
    if (ii->index == II_LRBB) {
459 
      change_insn_type (ii, II_CMOV);
460 
      ii->type = IT_COND;
461 
      ii->op[1] = neg ? 0 : 1; ii->opt[1] = OPT_CONST;
462 
      ii->op[2] = neg ? 1 : 0; ii->opt[2] = OPT_CONST;
463 
      ii->op[3] = last->op[1]; ii->opt[3] = last->opt[1];
464 
    }
465 
  }
466 
  change_insn_type (last, II_NOP);
467 
  if (cuc_debug >= 3) print_cuc_bb (f, "AFTER_SIMPLIFY");
468 
}
469 
 
470 879 markom 
/* type == 0; keep predecessor condition
471 
 * type == 1; keep successor condition
472 
 * type == 2; join loop unrolled blocks */
473 
static void join_bb (cuc_func *f, int pred, int succ, int type)
474 
{
475 905 markom 
  int i, j, k, n1, n2, ninsn, add_cond = 0;
476 879 markom 
  unsigned long cond_op, cond_opt;
477 
  cuc_insn *insn;
478 
 
479 905 markom 
  if (cuc_debug) cuc_check (f);
480 897 markom 
  cucdebug (3, "%x <= %x+%x (%i)\n", pred, pred, succ, type);
481 
  cucdebug (3, "%x %x\n", f->bb[pred].ninsn, f->bb[succ].ninsn);
482 
  if (cuc_debug >= 3) fflush (stdout);
483 879 markom 
 
484 905 markom 
  n1 = f->bb[pred].ninsn;
485 
  n2 = f->bb[succ].ninsn;
486 
  if (n1 <= 0
487 
   || !(f->bb[pred].insn[n1 - 1].type & IT_BRANCH)) type = 1;
488 879 markom 
  if (type == 0 && f->bb[succ].prev[0] == f->bb[succ].next[0]) add_cond = 1;
489 905 markom 
  if (type == 2) add_cond = 1;
490 
 
491 1045 markom 
  //assert (f->bb[pred].next[0] == f->bb[succ].next[0] || type != 2); /* not supported */
492 879 markom 
 
493 905 markom 
  ninsn = n1 + n2 + (type == 1 ? 0 : 1) + (add_cond ? MAX_REGS : 0);
494 879 markom 
 
495 
  insn = (cuc_insn *) malloc (ninsn * sizeof (cuc_insn));
496 905 markom 
  for (i = 0; i < n1; i++) insn[i] = f->bb[pred].insn[i];
497 
  /* when type == 0, we move the last (jump) instruction to the end */
498 879 markom 
  if (type == 0 || type == 2) {
499 905 markom 
    /* Move first branch instruction to the end */
500 
    assert (insn[n1 - 1].type & IT_BRANCH);
501 
    insn[ninsn - 1] = insn[n1 - 1];
502 
    cond_op = insn[n1 - 1].op[1];
503 
    cond_opt = insn[n1 - 1].opt[1];
504 
 
505 
    /* Remove old branch */
506 
    change_insn_type (&insn[n1 - 1], II_NOP);
507 879 markom 
  }
508 
  /* Copy second block */
509 905 markom 
  for (i = 0; i < n2; i++) insn[i + n1] = f->bb[succ].insn[i];
510 902 markom 
 
511 
  /* and when type == 2, we may need to add sfor instruction, to quit when either is true */
512 
  if (type == 2) {
513 905 markom 
    /* Move second branch instruction to the end */
514 
    if (insn[n1 + n2 - 1].type & IT_BRANCH) {
515 
      insn[ninsn - 1] = insn[n1 + n2 - 1];
516 
 
517 
      /* Use conditional from cmov FLAG_REG, c_p, c_s, c_p */
518 
      insn[ninsn - 1].op[1] = REF (pred, n1 + n2 + FLAG_REG); insn[ninsn - 1].opt[1] = OPT_REF;
519 
 
520 
      /* Remove old one */
521 
      change_insn_type (&insn[n1 + n2 - 1], II_NOP);
522 
    } else change_insn_type (&insn[ninsn - 1], II_NOP); /* do not use branch slot */
523 902 markom 
  }
524 
 
525 905 markom 
#if 1
526 927 markom 
  /* LRBB at start of succ BB is not valid anymore */
527 933 markom 
  if (n1 > 0 && insn[n1].index == II_LRBB) {
528 925 markom 
    if (type == 1) {
529 
      /* We have two possibilities, how this could have happened:
530 
         1. we just moved second predecessor of succ to pred,
531 
            pred now having two predecessors => everything is ok
532 
         2. we just moved second predecessor of succ to pred,
533 
            now, having just one predecessor => LRBB is not needed anymore */
534 
      if (f->bb[pred].prev[1] < 0) { /* handle second option */
535 
        change_insn_type (&insn[n1], II_ADD);
536 
        insn[n1].op[1] = 1; insn[n1].opt[1] = OPT_CONST;
537 
        insn[n1].op[2] = 0; insn[n1].opt[2] = OPT_CONST;
538 
        insn[n1].opt[3] = OPT_NONE;
539 
      }
540 
    } else {
541 
      assert (0); /* not tested yet */
542 
      change_insn_type (&insn[n1], II_NOP);
543 
      for (i = n1; i < ninsn; i++)
544 
        if (insn[i].index == II_CMOV && insn[i].op[3] == REF (pred, n1)) {
545 
          assert (insn[i].opt[3] == OPT_REF);
546 
          insn[i].op[3] = cond_op;
547 
          insn[i].opt[3] = cond_opt;
548 
          if (f->bb[pred].next[0] != succ) {
549 
            unsigned long t; /* negate conditional -- exchange */
550 
            assert (f->bb[pred].next[1] == succ);
551 
            t = insn[i].op[1];
552 
            insn[i].op[1] = insn[i].op[2];
553 
            insn[i].op[2] = t;
554 
            t = insn[i].opt[1];
555 
            insn[i].opt[1] = insn[i].opt[2];
556 
            insn[i].opt[2] = t;
557 
          }
558 902 markom 
        }
559 925 markom 
    }
560 902 markom 
  }
561 905 markom 
#endif
562 879 markom 
 
563 
  for (i = 0; i < ninsn; i++) reloc[i] = -1;
564 
 
565 
  /* Add conditional instructions if required */
566 
  if (add_cond) {
567 
    recalc_last_used_reg (f, pred);
568 
    recalc_last_used_reg (f, succ);
569 1045 markom 
 
570 879 markom 
    /* r0 -- add nop for it */
571 905 markom 
    change_insn_type (&insn[n1 + n2], II_NOP);
572 879 markom 
    for (i = 1; i < MAX_REGS; i++) {
573 905 markom 
      cuc_insn *ii = &insn[n1 + n2 + i];
574 879 markom 
      int a = f->bb[pred].last_used_reg[i];
575 
      int b = f->bb[succ].last_used_reg[i];
576 
 
577 1045 markom 
      /* We have deleted first branch instruction, now we must setup FLAG_REG,
578 
         to point to conditional */
579 
      if (i == FLAG_REG) {
580 
        change_insn_type (ii, II_CMOV);
581 
        ii->type = i == FLAG_REG || i == LRBB_REG ? IT_COND : 0;
582 
        ii->dep = NULL;
583 
        ii->op[0] = i; ii->opt[0] = OPT_REGISTER | OPT_DEST;
584 
        ii->op[1] = cond_op; ii->opt[1] = cond_opt;
585 
        if (b >= 0) {
586 
          ii->op[2] = b; ii->opt[2] = OPT_REF;
587 
        } else {
588 
          ii->op[2] = cond_op; ii->opt[2] = cond_opt;
589 
        }
590 
        ii->op[3] = cond_op; ii->opt[3] = cond_opt;
591 
        reloc[REF_I(a)] = REF (pred, n1 + n2 + i);
592 
      } else if (b < 0) change_insn_type (ii, II_NOP);
593 879 markom 
      else if (a < 0) {
594 
        change_insn_type (ii, II_ADD);
595 930 markom 
        ii->type = i == FLAG_REG || i == LRBB_REG ? IT_COND : 0;
596 879 markom 
        ii->dep = NULL;
597 
        ii->op[0] = i; ii->opt[0] = OPT_REGISTER | OPT_DEST;
598 
        ii->op[1] = b; ii->opt[1] = OPT_REF;
599 
        ii->op[2] = 0; ii->opt[2] = OPT_CONST;
600 905 markom 
        ii->opt[3] = OPT_NONE;
601 879 markom 
      } else if (b >= 0) {
602 
        change_insn_type (ii, II_CMOV);
603 930 markom 
        ii->type = i == FLAG_REG || i == LRBB_REG ? IT_COND : 0;
604 879 markom 
        ii->dep = NULL;
605 
        ii->op[0] = i; ii->opt[0] = OPT_REGISTER | OPT_DEST;
606 
        ii->op[1] = a; ii->opt[1] = OPT_REF;
607 
        ii->op[2] = b; ii->opt[2] = OPT_REF;
608 
        ii->op[3] = cond_op; ii->opt[3] = cond_opt;
609 905 markom 
        reloc[REF_I(a)] = REF (pred, n1 + n2 + i);
610 879 markom 
      }
611 
      sprintf (ii->disasm, "cmov (join BB)");
612 
    }
613 
  }
614 
 
615 905 markom 
  if (cuc_debug) cuc_check (f);
616 879 markom 
  i = 0;
617 
  switch (type) {
618 
  case 0:
619 1061 markom 
    assert (f->bb[pred].next[0] >= 0);
620 879 markom 
    if (f->bb[pred].next[0] == succ) f->bb[pred].next[0] = f->bb[succ].next[0];
621 
    if (f->bb[pred].next[1] == succ) f->bb[pred].next[1] = f->bb[succ].next[0];
622 
    break;
623 
  case 1:
624 1061 markom 
    assert (f->bb[pred].next[0] >= 0 && f->bb[pred].next[0] != BBID_END);
625 879 markom 
    f->bb[pred].next[0] = f->bb[succ].next[0];
626 
    f->bb[pred].next[1] = f->bb[succ].next[1];
627 
    break;
628 905 markom 
  case 2:
629 1061 markom 
    assert (f->bb[pred].next[0] >= 0 && f->bb[pred].next[0] != BBID_END);
630 905 markom 
    f->bb[pred].next[0] = f->bb[succ].next[0];
631 
    f->bb[pred].next[1] = f->bb[succ].next[1];
632 
    break;
633 879 markom 
  }
634 924 markom 
  if (f->bb[pred].next[0] < 0) f->bb[pred].next[0] = f->bb[pred].next[1];
635 879 markom 
  if (f->bb[pred].next[0] == f->bb[pred].next[1]) f->bb[pred].next[1] = -1;
636 927 markom 
 
637 1061 markom 
  if (type == 0) assert (f->bb[succ].next[1] < 0);
638 
 
639 927 markom 
  /* We just did something stupid -- we joined two predecessors into one;
640 
     succ may need the information from which block we came.  We will repair
641 
     this by converting LRBB to CMOV */
642 930 markom 
  for (j = 0; j < 2; j++) {
643 
    int nb = f->bb[pred].next[j];
644 927 markom 
    int t;
645 
 
646 
    /* check just valid connections */
647 
    if (nb < 0 || nb == BBID_END) continue;
648 
 
649 
    /* check type */
650 
    if (f->bb[nb].prev[0] == pred && f->bb[nb].prev[1] == succ) t = 1;
651 
    else if (f->bb[nb].prev[1] == pred && f->bb[nb].prev[0] == succ) t = 0;
652 
    else continue;
653 
 
654 930 markom 
    /* check all LRBB instructions.  */
655 
    for (i = 0; i < f->bb[nb].ninsn; i++)
656 
      if (f->bb[nb].insn[i].index == II_LRBB) {
657 
        cuc_insn *lrbb =&f->bb[nb].insn[i];
658 
        change_insn_type (lrbb, II_CMOV);
659 
        lrbb->op[1] = t; lrbb->opt[1] = OPT_CONST;
660 
        lrbb->op[2] = 1 - t; lrbb->opt[2] = OPT_CONST;
661 
        lrbb->op[3] = cond_op; lrbb->opt[3] = cond_opt;
662 
        lrbb->type |= IT_COND;
663 
      }
664 927 markom 
  }
665 
 
666 879 markom 
  f->bb[succ].type = BB_DEAD;
667 997 markom 
  //PRINTF (" %x %x %x %x %x\n", f->bb[pred].next[0], f->bb[pred].next[1], f->bb[succ].next[0], f->bb[succ].next[1], insn[ninsn - 1].type);
668 905 markom 
  /* remove branch instruction, if there is only one successor */
669 933 markom 
  if (f->bb[pred].next[1] < 0 && ninsn > 0 && insn[ninsn - 1].type & IT_BRANCH) {
670 925 markom 
    assert (f->bb[pred].next[0] != pred); /* end BB, loop should not be possible */
671 905 markom 
    change_insn_type (&insn[ninsn - 1], II_NOP);
672 925 markom 
  }
673 879 markom 
 
674 
  /* Set max count */
675 
  if (f->bb[pred].cnt < f->bb[succ].cnt) f->bb[pred].cnt = f->bb[succ].cnt;
676 
  f->bb[pred].ninsn = ninsn;
677 905 markom 
  f->bb[succ].ninsn = 0;
678 879 markom 
  free (f->bb[pred].insn); f->bb[pred].insn = NULL;
679 
  free (f->bb[succ].insn); f->bb[succ].insn = NULL;
680 
  f->bb[pred].insn = insn;
681 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD)) {
682 
    if (f->bb[i].prev[0] == succ) f->bb[i].prev[0] = pred;
683 
    if (f->bb[i].prev[1] == succ) f->bb[i].prev[1] = pred;
684 
    if (f->bb[i].prev[0] == f->bb[i].prev[1]) f->bb[i].prev[1] = -1;
685 
    for (j = 0; j < f->bb[i].ninsn; j++)
686 
      for (k = 0; k < MAX_OPERANDS; k++)
687 
        if (f->bb[i].insn[j].opt[k] & OPT_REF) {
688 
          /* Check if we are referencing successor BB -> relocate to second part of
689 
             the new block */
690 
          if (REF_BB (f->bb[i].insn[j].op[k]) == succ) {
691 905 markom 
            int t = f->bb[i].insn[j].op[k];
692 
            int ndest = REF (pred, REF_I (t) + n1);
693 997 markom 
            //PRINTF ("%x: %x %x\n", REF(i, j), t, ndest);
694 879 markom 
 
695 905 markom 
            /* We've found a reference to succ. block, being removed, relocate */
696 
            f->bb[i].insn[j].op[k] = ndest;
697 879 markom 
          } else if (REF_BB(f->bb[i].insn[j].op[k]) == pred) {
698 
            if (i != pred && reloc[REF_I(f->bb[i].insn[j].op[k])] >= 0) {
699 
              f->bb[i].insn[j].op[k] = reloc[REF_I(f->bb[i].insn[j].op[k])];
700 
            }
701 
          }
702 
        }
703 
  }
704 
 
705 905 markom 
  if (cuc_debug) cuc_check (f);
706 883 markom 
  if (cuc_debug >= 3) print_cuc_bb (f, "join");
707 879 markom 
}
708 
 
709 
/* Optimize basic blocks */
710 931 markom 
int optimize_bb (cuc_func *f)
711 879 markom 
{
712 931 markom 
  int modified = 0;
713 879 markom 
  int i, j;
714 
remove_lrbb:
715 
  /* we can remove lrbb instructions from blocks with just one predecessor */
716 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD)) {
717 
    if (f->bb[i].prev[0] >= 0 && f->bb[i].prev[1] < 0) { /* exactly one predecessor */
718 
      for (j = 0; j < f->bb[i].ninsn; j++)
719 
        if (f->bb[i].insn[j].index == II_LRBB) {
720 
          cuc_insn *t;
721 925 markom 
          cucdebug (4, "-lrbb %x.%x\n", i, j);
722 879 markom 
 
723 
          /* Change to add LRBB, 0, 0 */
724 
          change_insn_type (&f->bb[i].insn[j], II_ADD);
725 
          f->bb[i].insn[j].type &= ~IT_VOLATILE;
726 
          f->bb[i].insn[j].opt[1] = f->bb[i].insn[j].opt[2] = OPT_CONST;
727 
          f->bb[i].insn[j].op[1] = f->bb[i].insn[j].op[2] = 0; /* always use left block */
728 
          f->bb[i].insn[j].opt[3] = OPT_NONE;
729 931 markom 
          modified = 1;
730 934 markom 
          if (f->bb[i].prev[0] != BBID_START && f->bb[f->bb[i].prev[0]].ninsn > 0) {
731 932 markom 
            t = &f->bb[f->bb[i].prev[0]].insn[f->bb[f->bb[i].prev[0]].ninsn - 1];
732 879 markom 
 
733 932 markom 
            /* If the predecessor still has a conditional jump instruction, we must be careful.
734 
               If next[0] == next[1] join them. Now we will link lrbb and correct the situation */
735 
            if (t->type & IT_BRANCH) { /* We must set a reference to branch result */
736 
              f->bb[i].insn[j].opt[1] = t->opt[1];
737 
              f->bb[i].insn[j].op[1] = t->op[1];
738 
              /* sometimes branch is not needed anymore */
739 
              if (f->bb[f->bb[i].prev[0]].next[1] < 0) change_insn_type (t, II_NOP);
740 
            }
741 879 markom 
          }
742 
        }
743 
    }
744 
  }
745 
 
746 927 markom 
  /* Ordering of joining types is cruical -- we should concat all directly connected BBs
747 
     together first, so when we do a type != 1 joining, we can remove LRBB, directly by
748 
     looking at number of its predeccessors */
749 879 markom 
 
750 
  /* Type 1 joining
751 
     1. link between pred & succ
752 
     2. no other pred's successors
753 925 markom 
     3. no other succ's predecessors, except if pred has max one */
754 932 markom 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD)) {
755 
    int p = f->bb[i].prev[0];
756 
    if (p < 0 || p == BBID_START) continue;
757 925 markom 
    /* one successor and max sum of 3 predecessors */
758 932 markom 
    if (f->bb[p].next[0] >= 0 && f->bb[p].next[1] < 0
759 
     && (f->bb[p].prev[1] < 0 || f->bb[i].prev[1] < 0)) {
760 925 markom 
      /* First we will move all predecessors from succ to pred, and then we will do
761 
         real type 1 joining */
762 932 markom 
      if (f->bb[i].prev[1] >= 0 && f->bb[i].prev[1] != BBID_START) {
763 
        int p1 = f->bb[i].prev[1];
764 925 markom 
        /* joining is surely not worth another extra memory access */
765 932 markom 
        if (f->bb[p].nmemory) continue;
766 
        if (f->bb[p].prev[0] >= 0) {
767 
           assert (f->bb[p].prev[1] < 0);
768 
           f->bb[p].prev[1] = p1;
769 
        } else f->bb[p].prev[0] = p1;
770 
        if (f->bb[p1].next[0] == i) f->bb[p1].next[0] = p;
771 
        else if (f->bb[p1].next[1] == i) f->bb[p1].next[1] = p;
772 925 markom 
        else assert (0);
773 
        f->bb[i].prev[1] = -1;
774 
      }
775 932 markom 
      assert (p >= 0 && f->bb[i].prev[1] < 0); /* one predecessor */
776 
      join_bb (f, p, i, 1);
777 931 markom 
      modified = 1;
778 879 markom 
      goto remove_lrbb;
779 
    }
780 932 markom 
  }
781 927 markom 
 
782 
  /* Type 0 joining
783 
     1. link between pred & succ
784 
     2. no memory accesses in succ
785 
     3. optional pred's second successors
786 
     4. max. one succ's successors */
787 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD))
788 932 markom 
    if (f->bb[i].prev[0] >= 0 && f->bb[i].prev[0] != BBID_START
789 
     && f->bb[i].prev[1] < 0 /* one predecessor */
790 927 markom 
     && f->bb[i].next[1] < 0 /* max. one successor */
791 
     && f->bb[i].nmemory == 0) {                  /* and no memory acceses */
792 
      join_bb (f, f->bb[i].prev[0], i, 0);
793 931 markom 
      modified = 1;
794 927 markom 
      goto remove_lrbb;
795 
    }
796 879 markom 
 
797 
  /* Type 2 joining
798 
     1. link between pred & succ
799 
     2. succ has exactly one predeccessor
800 
     3. pred & succ share common successor
801 
     4. optional succ's second successor */
802 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD))
803 
    if (f->bb[i].prev[0] >= 0 && f->bb[i].prev[1] < 0) { /* one predecessor */
804 
      int p = f->bb[i].prev[0];
805 932 markom 
      if (p == BBID_START) continue;
806 905 markom 
#if 0 /* not yet supported */
807 
      if (f->bb[p].next[0] == i
808 
       && (f->bb[i].next[1] == f->bb[p].next[1]
809 
        || f->bb[i].next[1] == f->bb[p].next[0])) {
810 
        join_bb (f, p, i, 2);
811 897 markom 
        goto remove_lrbb;
812 
      }
813 905 markom 
#endif
814 
      if (f->bb[p].next[1] == i
815 1045 markom 
       && (f->bb[p].next[0] == f->bb[i].next[1]
816 
        || f->bb[p].next[0] == f->bb[i].next[0])) {
817 905 markom 
        join_bb (f, p, i, 2);
818 931 markom 
        modified = 1;
819 905 markom 
        goto remove_lrbb;
820 
      }
821 879 markom 
    }
822 1042 markom 
 
823 
  /* BB simplify:
824 
     1. a block has exactly 2 successors A and B
825 
     2. A has exactly one successor -- B
826 
     3. A has no memory accesses
827 
     to:
828 
     flow always goes though A, LRBB is replaced by current block conditional
829 
    */
830 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD))
831 
    if (f->bb[i].next[0] >= 0 && f->bb[i].next[0] != BBID_END
832 
      && f->bb[i].next[1] >= 0 && f->bb[i].next[1] != BBID_END) {
833 
      int a = f->bb[i].next[0];
834 
      int b = f->bb[i].next[1];
835 
      int neg = 0;
836 
      /* Exchange? */
837 
      if (f->bb[b].next[0] == a && f->bb[b].next[1] < 0) {
838 
        int t = a;
839 
        a = b;
840 
        b = t;
841 
        neg = 1;
842 
      }
843 
      /* Do the simplification if possible */
844 
      if (f->bb[a].next[0] == b && f->bb[a].next[1] < 0
845 
       && f->bb[a].nmemory == 0) {
846 
        simplify_bb (f, i, a, b, neg);
847 
        modified = 1;
848 
        goto remove_lrbb;
849 
      }
850 
    }
851 
 
852 931 markom 
  return modified;
853 879 markom 
}
854 
 
855 
/* Removes BBs marked as dead */
856 931 markom 
int remove_dead_bb (cuc_func *f)
857 879 markom 
{
858 
  int i, j, k, d = 0;
859 
 
860 
  for (i = 0; i < f->num_bb; i++) if (f->bb[i].type & BB_DEAD) {
861 
    if (f->bb[i].insn) free (f->bb[i].insn);
862 
    f->bb[i].insn = NULL;
863 
    reloc[i] = -1;
864 
  } else {
865 
    reloc[i] = d;
866 
    f->bb[d++] = f->bb[i];
867 
  }
868 931 markom 
  if (f->num_bb == d) return 0;
869 879 markom 
  f->num_bb = d;
870 
 
871 
  /* relocate initial blocks */
872 
  for (i = 0; i < f->num_init_bb; i++)
873 
    f->init_bb_reloc[i] = reloc[f->init_bb_reloc[i]];
874 
 
875 
  /* repair references */
876 
  for (i = 0; i < f->num_bb; i++) if (!(f->bb[i].type & BB_DEAD)) {
877 973 markom 
          cucdebug (5, "%x %x %x %x %x\n", i, f->bb[i].prev[0], f->bb[i].prev[1], f->bb[i].next[0], f->bb[i].next[1]);
878 925 markom 
          fflush (stdout);
879 932 markom 
    if (f->bb[i].prev[0] >= 0 && f->bb[i].prev[0] != BBID_START)
880 
      assert ((f->bb[i].prev[0] = reloc[f->bb[i].prev[0]]) >= 0);
881 
    if (f->bb[i].prev[1] >= 0 && f->bb[i].prev[1] != BBID_START)
882 
      assert ((f->bb[i].prev[1] = reloc[f->bb[i].prev[1]]) >= 0);
883 925 markom 
    if (f->bb[i].next[0] >= 0 && f->bb[i].next[0] != BBID_END)
884 
      assert ((f->bb[i].next[0] = reloc[f->bb[i].next[0]]) >= 0);
885 
    if (f->bb[i].next[1] >= 0 && f->bb[i].next[1] != BBID_END)
886 
      assert ((f->bb[i].next[1] = reloc[f->bb[i].next[1]]) >= 0);
887 879 markom 
    if (f->bb[i].prev[0] == f->bb[i].prev[1]) f->bb[i].prev[1] = -1;
888 
    if (f->bb[i].next[0] == f->bb[i].next[1]) f->bb[i].next[1] = -1;
889 
 
890 
    for (j = 0; j < f->bb[i].ninsn; j++)
891 
      for (k = 0; k < MAX_OPERANDS; k++)
892 925 markom 
        if (f->bb[i].insn[j].opt[k] & OPT_BB && (signed)f->bb[i].insn[j].op[k] >= 0) {
893 
          if (f->bb[i].insn[j].op[k] != BBID_END)
894 
            assert ((f->bb[i].insn[j].op[k] = reloc[f->bb[i].insn[j].op[k]]) >= 0);
895 
        } else if (f->bb[i].insn[j].opt[k] & OPT_REF) {
896 879 markom 
          int t = f->bb[i].insn[j].op[k];
897 
          assert (reloc[REF_BB(t)] >= 0);
898 
          f->bb[i].insn[j].op[k] = REF (reloc[REF_BB(t)], REF_I (t));
899 
        }
900 
  }
901 931 markom 
  return 1;
902 879 markom 
}
903 
 
904 
/* Recursive calculation of dependencies */
905 
static int reg_dep_rec (cuc_func *f, int cur)
906 
{
907 
  int i, j;
908 
  cuc_insn *insn = f->bb[cur].insn;
909 
 
910 997 markom 
  //PRINTF ("\n %i", cur);
911 879 markom 
  /* Spread only, do not loop */
912 
  if (f->bb[cur].tmp) return;
913 
  f->bb[cur].tmp = 1;
914 997 markom 
  //PRINTF ("!   ");
915 879 markom 
 
916 
  for (i = 0; i < f->bb[cur].ninsn; i++) {
917 
    /* Check for destination operand(s) */
918 
    for (j = 0; j < MAX_OPERANDS; j++) if (insn[i].opt[j] & OPT_DEST)
919 
      if ((insn[i].opt[j] & ~OPT_DEST) == OPT_REGISTER && (signed)insn[i].op[j] >= 0) {
920 997 markom 
        //PRINTF ("%i:%i,%x ", insn[i].op[j], i, REF (cur, i));
921 879 markom 
        assert (insn[i].op[j] > 0 && insn[i].op[j] < MAX_REGS); /* r0 should never be dest */
922 
        f->bb[cur].last_used_reg[insn[i].op[j]] = REF (cur, i);
923 
      }
924 
  }
925 
 
926 925 markom 
  if (f->bb[cur].next[0] >= 0 && f->bb[cur].next[0] != BBID_END)
927 
    reg_dep_rec (f, f->bb[cur].next[0]);
928 
  if (f->bb[cur].next[1] >= 0 && f->bb[cur].next[1] != BBID_END)
929 
    reg_dep_rec (f, f->bb[cur].next[1]);
930 879 markom 
}
931 
 
932 
/* Detect register dependencies */
933 
void reg_dep (cuc_func *f)
934 
{
935 
  int i, b, c;
936 
 
937 
  /* Set dead blocks */
938 
  for (b = 0; b < f->num_bb; b++) {
939 
    f->bb[b].tmp = 0;
940 
    for (i = 0; i < MAX_REGS; i++) f->bb[b].last_used_reg[i] = -1;
941 
  }
942 
 
943 
  /* Start with first block and set dependecies of all reachable blocks */
944 
  /* At the same time set last_used_regs */
945 
  reg_dep_rec (f, 0);
946 
 
947 
  for (i = 0; i < f->num_bb; i++)
948 
    if (f->bb[i].tmp) f->bb[i].tmp = 0;
949 
    else f->bb[i].type |= BB_DEAD;
950 
 
951 
  /* Detect loops; mark BBs where loops must be broken */
952 
  for (c = 0; c < f->num_bb; c++) {
953 
    int min = 3, minb;
954 
 
955 
    /* search though all non-visited for minimum number of unvisited predecessors */
956 
    for (b = 0; b < f->num_bb; b++) if (!f->bb[b].tmp) {
957 
      int tmp = 0;
958 932 markom 
      if (f->bb[b].prev[0] >= 0 && f->bb[b].prev[0] != BBID_START
959 
       && !f->bb[f->bb[b].prev[0]].tmp) tmp++;
960 
      if (f->bb[b].prev[1] >= 0 && f->bb[b].prev[1] != BBID_START
961 
       && !f->bb[f->bb[b].prev[1]].tmp) tmp++;
962 879 markom 
      if (tmp < min) {
963 
        minb = b;
964 
        min = tmp;
965 
        if (tmp == 0) break; /* We already have the best one */
966 
      }
967 
    }
968 
    b = minb;
969 
    f->bb[b].tmp = 1; /* Mark visited */
970 883 markom 
    cucdebug (3, "minb %i min %i\n", minb, min);
971 879 markom 
    if (min) { /* We just broke the loop */
972 
      f->bb[b].type |= BB_INLOOP;
973 
    }
974 
  }
975 
 
976 
  /* Set real predecessors in cmov instructions to previous blocks */
977 
  for (b = 0; b < f->num_bb; b++)
978 
    for (i = 1; i < MAX_REGS - 1; i++) {
979 
      int pa, pb;
980 
      assert (f->bb[b].insn[i].index ==  II_CMOV);
981 
      assert (f->bb[b].insn[i].opt[0] == OPT_REGISTER | OPT_DEST);
982 
      assert (f->bb[b].insn[i].op[0] == i);
983 932 markom 
      if (f->bb[b].prev[0] < 0 || f->bb[b].prev[0] == BBID_START) pa = -1;
984 879 markom 
      else pa = f->bb[f->bb[b].prev[0]].last_used_reg[i];
985 932 markom 
      if (f->bb[b].prev[1] < 0 || f->bb[b].prev[1] == BBID_START) pb = -1;
986 879 markom 
      else pb = f->bb[f->bb[b].prev[1]].last_used_reg[i];
987 
 
988 
      /* We do some very simple optimizations right away to make things more readable */
989 
      if (pa < 0 && pb < 0) {
990 
        /* Was not used at all */
991 
        change_insn_type (&f->bb[b].insn[i], II_ADD);
992 
        f->bb[b].insn[i].op[2] = 0; f->bb[b].insn[i].opt[2] = OPT_CONST;
993 
        f->bb[b].insn[i].opt[3] = OPT_NONE;
994 
      } else if (pa < 0) {
995 
        change_insn_type (&f->bb[b].insn[i], II_ADD);
996 
        assert (f->INSN(pb).opt[0] == (OPT_REGISTER | OPT_DEST));
997 
        f->bb[b].insn[i].op[1] = pb; f->bb[b].insn[i].opt[1] = OPT_REF;
998 
        f->bb[b].insn[i].op[2] = 0; f->bb[b].insn[i].opt[2] = OPT_CONST;
999 
        f->bb[b].insn[i].opt[3] = OPT_NONE;
1000 
      } else if (pb < 0) {
1001 
        change_insn_type (&f->bb[b].insn[i], II_ADD);
1002 
        assert (f->INSN(pa).opt[0] == (OPT_REGISTER | OPT_DEST));
1003 
        f->bb[b].insn[i].op[1] = pa; f->bb[b].insn[i].opt[1] = OPT_REF;
1004 
        f->bb[b].insn[i].op[2] = 0; f->bb[b].insn[i].opt[2] = OPT_CONST;
1005 
        f->bb[b].insn[i].opt[3] = OPT_NONE;
1006 
      } else {
1007 
        int t = REF (b, 0); /* lrbb should be first instruction */
1008 
        assert (f->INSN(t).index == II_LRBB);
1009 
 
1010 
        f->bb[b].insn[i].op[1] = pa; f->bb[b].insn[i].opt[1] = OPT_REF;
1011 
        assert (f->INSN(pa).opt[0] == (OPT_REGISTER | OPT_DEST));
1012 
 
1013 
        f->bb[b].insn[i].op[2] = pb; f->bb[b].insn[i].opt[2] = OPT_REF;
1014 
        assert (f->INSN(pb).opt[0] == (OPT_REGISTER | OPT_DEST));
1015 
 
1016 
        /* Update op[3] -- flag register */
1017 
        assert (f->bb[b].insn[i].opt[3] == OPT_REGISTER);
1018 
        assert (f->bb[b].insn[i].op[3] == LRBB_REG);
1019 
        assert (t >= 0);
1020 
        f->bb[b].insn[i].opt[3] = OPT_REF; /* Convert already used regs to references */
1021 
        f->bb[b].insn[i].op[3] = t;
1022 
        assert (f->INSN(t).opt[0] == (OPT_REGISTER | OPT_DEST));
1023 
      }
1024 
    }
1025 
 
1026 
  /* assign register references */
1027 
  for (b = 0; b < f->num_bb; b++) {
1028 
    /* rebuild last used reg array */
1029 
    f->bb[b].last_used_reg[0] = -1;
1030 
    if (f->bb[b].insn[0].index == II_LRBB) f->bb[b].last_used_reg[LRBB_REG] = 0;
1031 
    else f->bb[b].last_used_reg[LRBB_REG] = -1;
1032 
 
1033 
    for (i = 1; i < MAX_REGS - 1; i++)
1034 
      f->bb[b].last_used_reg[i] = -1;
1035 
 
1036 
    /* Create references */
1037 
    for (i = 0; i < f->bb[b].ninsn; i++) {
1038 
      int k;
1039 
      /* Check for source operands first */
1040 
      for (k = 0; k < MAX_OPERANDS; k++) {
1041 
        if (!(f->bb[b].insn[i].opt[k] & OPT_DEST))
1042 
        if (f->bb[b].insn[i].opt[k] & OPT_REGISTER) {
1043 
          int t = f->bb[b].last_used_reg[f->bb[b].insn[i].op[k]];
1044 
 
1045 
          if (f->bb[b].insn[i].op[k] == 0) { /* Convert r0 to const0 */
1046 
            f->bb[b].insn[i].opt[k] = OPT_CONST;
1047 
            f->bb[b].insn[i].op[k] = 0;
1048 
          } else if (t >= 0) {
1049 
            f->bb[b].insn[i].opt[k] = OPT_REF; /* Convert already used regs to references */
1050 
            f->bb[b].insn[i].op[k] = t;
1051 
            assert (f->INSN(t).opt[0] == (OPT_REGISTER | OPT_DEST));
1052 
            //f->INSN(t).op[0] = -1;
1053 
          }
1054 
        } else if (f->bb[b].insn[i].opt[k] & OPT_REF) {
1055 
          //f->INSN(f->bb[b].insn[i].op[k]).op[0] = -1; /* Mark referenced */
1056 
          f->INSN(f->bb[b].insn[i].op[k]).type &= ~IT_UNUSED;
1057 
        }
1058 
      }
1059 
 
1060 
      /* Now check for destination operand(s) */
1061 
      for (k = 0; k < MAX_OPERANDS; k++) if (f->bb[b].insn[i].opt[k] & OPT_DEST)
1062 
        if ((f->bb[b].insn[i].opt[k] & ~OPT_DEST) == OPT_REGISTER
1063 
          && (int)f->bb[b].insn[i].op[k] >= 0) {
1064 
          int t = f->bb[b].last_used_reg[f->bb[b].insn[i].op[k]];
1065 
          assert (f->bb[b].insn[i].op[k] != 0); /* r0 should never be dest */
1066 
          f->bb[b].last_used_reg[f->bb[b].insn[i].op[k]] = REF (b, i);
1067 
        }
1068 
    }
1069 
  }
1070 
 
1071 
  /* Remove all unused lrbb */
1072 
  for (b = 0; b < f->num_bb; b++)
1073 
    for (i = 0; i < f->bb[b].ninsn; i++)
1074 
      if (f->bb[b].insn[i].type & IT_UNUSED) change_insn_type (&f->bb[b].insn[i], II_NOP);
1075 
 
1076 
  /* SSAs with final register value are marked as outputs */
1077 1061 markom 
  assert (f->bb[f->num_bb - 1].next[0] == BBID_END);
1078 939 markom 
  for (i = 0; i < MAX_REGS; i++) if (!caller_saved[i]) {
1079 879 markom 
    int t = f->bb[f->num_bb - 1].last_used_reg[i];
1080 
    /* Mark them volatile, so optimizer does not remove them */
1081 
    if (t >= 0) f->bb[REF_BB(t)].insn[REF_I(t)].type |= IT_OUTPUT;
1082 
  }
1083 939 markom 
  {
1084 
    int t = f->bb[f->num_bb - 1].last_used_reg[i];
1085 
    /* Mark them volatile, so optimizer does not remove them */
1086 
    if (t >= 0) f->bb[REF_BB(t)].insn[REF_I(t)].type |= IT_OUTPUT;
1087 
  }
1088 879 markom 
}
1089 
 
1090 897 markom 
/* split the BB, based on the group numbers in .tmp */
1091 
void expand_bb (cuc_func *f, int b)
1092 
{
1093 
  int n = f->num_bb;
1094 
  int mg = 0;
1095 
  int b1, i, j;
1096 
 
1097 
  for (i = 0; i < f->bb[b].ninsn; i++)
1098 
    if (f->bb[b].insn[i].tmp > mg) mg = f->bb[b].insn[i].tmp;
1099 
 
1100 
  /* Create copies */
1101 
  for (b1 = 1; b1 <= mg; b1++) {
1102 
    assert (f->num_bb < MAX_BB);
1103 
    cpy_bb (&f->bb[f->num_bb], &f->bb[b]);
1104 
    f->num_bb++;
1105 
  }
1106 
 
1107 
  /* Relocate */
1108 
  for (b1 = 0; b1 < f->num_bb; b1++)
1109 
    for (i = 0; i < f->bb[b1].ninsn; i++) {
1110 
      dep_list *d = f->bb[b1].insn[i].dep;
1111 
      for (j = 0; j < MAX_OPERANDS; j++)
1112 
        if (f->bb[b1].insn[i].opt[j] & OPT_REF) {
1113 
          int t = f->bb[b1].insn[i].op[j];
1114 
          if (REF_BB(t) == b && f->INSN(t).tmp != 0)
1115 
            f->bb[b1].insn[i].op[j] = REF (n + f->INSN(t).tmp - 1, REF_I(t));
1116 
        }
1117 
      while (d) {
1118 
        if (REF_BB (d->ref) == b && f->INSN(d->ref).tmp != 0)
1119 
          d->ref = REF (n + f->INSN(d->ref).tmp - 1, REF_I(d->ref));
1120 
        d = d->next;
1121 
      }
1122 
    }
1123 
 
1124 
  /* Delete unused instructions */
1125 
  for (j = 0; j <= mg; j++) {
1126 
    if (j == 0) b1 = b;
1127 
    else b1 = n + j - 1;
1128 
    for (i = 0; i < f->bb[b1].ninsn; i++) {
1129 
      if (f->bb[b1].insn[i].tmp != j)
1130 
        change_insn_type (&f->bb[b1].insn[i], II_NOP);
1131 
      f->bb[b1].insn[i].tmp = 0;
1132 
    }
1133 
    if (j < mg) {
1134 
      f->bb[b1].next[0] = n + j;
1135 
      f->bb[b1].next[1] = -1;
1136 
      f->bb[n + j].prev[0] = b1;
1137 
      f->bb[n + j].prev[1] = -1;
1138 
    } else {
1139 
      i = f->bb[b1].next[0];
1140 
      f->bb[n + j].prev[0] = j == 1 ? b : b1 - 1;
1141 
      f->bb[n + j].prev[1] = -1;
1142 925 markom 
      if (i >= 0 && i != BBID_END) {
1143 897 markom 
        if (f->bb[i].prev[0] == b) f->bb[i].prev[0] = b1;
1144 
        if (f->bb[i].prev[1] == b) f->bb[i].prev[1] = b1;
1145 
      }
1146 
      i = f->bb[b1].next[1];
1147 925 markom 
      if (i >= 0 && i != BBID_END) {
1148 897 markom 
        if (f->bb[i].prev[0] == b) f->bb[i].prev[0] = b1;
1149 
        if (f->bb[i].prev[1] == b) f->bb[i].prev[1] = b1;
1150 
      }
1151 
    }
1152 
  }
1153 
}
1154 
 
1155 879 markom 
/* Scans sequence of BBs and set bb[].cnt */
1156 
void generate_bb_seq (cuc_func *f, char *mp_filename, char *bb_filename)
1157 
{
1158 
  FILE *fi, *fo;
1159 
  struct mprofentry_struct *buf;
1160 
  const int bufsize = 256;
1161 
  unsigned long *bb_start;
1162 
  unsigned long *bb_end;
1163 
  int b, i, r;
1164 
  int curbb, prevbb = -1;
1165 
  unsigned long addr = -1;
1166 
  unsigned long prevaddr = -1;
1167 897 markom 
  int mssum = 0;
1168 
  int mlsum = 0;
1169 
  int mscnt = 0;
1170 
  int mlcnt = 0;
1171 940 markom 
  int reopened = 0;
1172 879 markom 
 
1173 940 markom 
  /* Use already opened stream? */
1174 
  if (runtime.sim.fmprof) {
1175 
    fi = runtime.sim.fmprof;
1176 
    reopened = 1;
1177 
    rewind (fi);
1178 
  } else assert (fi = fopen (mp_filename, "rb"));
1179 879 markom 
  assert (fo = fopen (bb_filename, "wb+"));
1180 
 
1181 
  assert (bb_start = (unsigned long *) malloc (sizeof (unsigned long) * f->num_bb));
1182 
  assert (bb_end = (unsigned long *) malloc (sizeof (unsigned long) * f->num_bb));
1183 
  for (b = 0; b < f->num_bb; b++) {
1184 
    bb_start[b] = f->start_addr + f->bb[b].first * 4;
1185 
    bb_end[b] = f->start_addr + f->bb[b].last * 4;
1186 997 markom 
    //PRINTF ("%i %x %x\n", b, bb_start[b], bb_end[b]);
1187 879 markom 
    f->bb[0].cnt = 0;
1188 
  }
1189 
 
1190 
  buf = (struct mprofentry_struct *) malloc (sizeof (struct mprofentry_struct) * bufsize);
1191 
  assert (buf);
1192 
 
1193 997 markom 
  //PRINTF ("BBSEQ:\n");
1194 879 markom 
  do {
1195 
    r = fread (buf, sizeof (struct mprofentry_struct), bufsize, fi);
1196 997 markom 
    //PRINTF ("r%i : ", r);
1197 879 markom 
    for (i = 0; i < r; i++) {
1198 
      if (buf[i].type & MPROF_FETCH) {
1199 997 markom 
        //PRINTF ("%x, ", buf[i].addr);
1200 879 markom 
        if (buf[i].addr >= f->start_addr && buf[i].addr <= f->end_addr) {
1201 
          assert (buf[i].type & MPROF_32);
1202 
          prevaddr = addr;
1203 
          addr = buf[i].addr;
1204 
          for (b = 0; b < f->num_bb; b++)
1205 
            if (bb_start[b] <= addr && addr <= bb_end[b]) break;
1206 
          assert (b < f->num_bb);
1207 
          curbb = b;
1208 
          if (prevaddr + 4 != addr) prevbb = -1;
1209 
        } else curbb = -1;
1210 
 
1211 
#warning TODO: do not count interrupts
1212 
        if (curbb != prevbb && curbb >= 0) {
1213 
          fwrite (&curbb, sizeof (unsigned long), 1, fo);
1214 997 markom 
          //PRINTF (" [%i] ", curbb);
1215 879 markom 
          f->bb[curbb].cnt++;
1216 
          prevbb = curbb;
1217 
        }
1218 897 markom 
      } else {
1219 
        if (verify_memoryarea(buf[i].addr))
1220 
          if (buf[i].type & MPROF_WRITE) mscnt++, mssum += cur_area->delayw;
1221 1041 markom 
          else mlcnt++, mlsum += cur_area->delayr;
1222 879 markom 
      }
1223 
    }
1224 997 markom 
    //PRINTF ("\n");
1225 879 markom 
  } while (r == bufsize);
1226 997 markom 
  //PRINTF ("\n");
1227 879 markom 
 
1228 897 markom 
  runtime.cuc.mdelay[0] = (1. * mlsum) / mlcnt;
1229 1041 markom 
  runtime.cuc.mdelay[1] = (1. * mssum) / mscnt;
1230 897 markom 
  runtime.cuc.mdelay[2] = runtime.cuc.mdelay[3] = 1;
1231 883 markom 
  f->num_runs = f->bb[0].cnt;
1232 940 markom 
  if (!reopened) fclose (fi);
1233 879 markom 
  fclose (fo);
1234 
  free (buf);
1235 
  free (bb_end);
1236 
  free (bb_start);
1237 
 
1238 
  /* Initialize basic block relocations */
1239 
  f->num_init_bb = f->num_bb;
1240 997 markom 
  //PRINTF ("num_init_bb = %i\n", f->num_init_bb);
1241 879 markom 
  assert (f->init_bb_reloc = (int *)malloc (sizeof (int) * f->num_init_bb));
1242 
  for (b = 0; b < f->num_init_bb; b++) f->init_bb_reloc[b] = b;
1243 
}
1244 
 
1245 
/* Scans sequence of BBs and set counts for pre/unrolled loop for BB b */
1246 
void count_bb_seq (cuc_func *f, int b, char *bb_filename, int *counts, int preroll, int unroll)
1247 
{
1248 
  FILE *fi;
1249 
  const int bufsize = 256;
1250 
  int i, r;
1251 
  int *buf;
1252 
  int cnt = 0;
1253 
  int times = preroll - 1 + unroll;
1254 
 
1255 
  assert (fi = fopen (bb_filename, "rb"));
1256 
  for (i = 0; i < times; i++) counts[i] = 0;
1257 
  assert (buf = (int *) malloc (sizeof (int) * bufsize));
1258 
 
1259 
  do {
1260 
    r = fread (buf, sizeof (int), bufsize, fi);
1261 
    for (i = 0; i < r; i++) {
1262 
      /* count consecutive acesses */
1263 
      if (f->init_bb_reloc[buf[i]] == b) {
1264 
        counts[cnt]++;
1265 
        if (++cnt >= times) cnt = preroll - 1;
1266 
      } else cnt = 0;
1267 
    }
1268 
  } while (r == bufsize);
1269 
 
1270 
  log ("Counts %i,%i :", preroll, unroll);
1271 
  for (i = 0; i < times; i++) log ("%x ", counts[i]);
1272 
  log ("\n");
1273 
 
1274 
  fclose (fi);
1275 
  free (buf);
1276 
}
1277 
 
1278 
/* relocate all accesses inside of BB b to back/fwd */
1279 
static void relocate_bb (cuc_bb *bb, int b, int back, int fwd)
1280 
{
1281 
  int i, j;
1282 
  for (i = 0; i < bb->ninsn; i++)
1283 
    for (j = 0; j < MAX_OPERANDS; j++)
1284 
      if (bb->insn[i].opt[j] & OPT_REF
1285 
       && REF_BB (bb->insn[i].op[j]) == b) {
1286 
        int t = REF_I (bb->insn[i].op[j]);
1287 
        if (t < i) bb->insn[i].op[j] = REF (back, t);
1288 
        else bb->insn[i].op[j] = REF (fwd, t);
1289 
      }
1290 
}
1291 
 
1292 1061 markom 
/* Preroll if type == 1 or unroll if type == 0 loop in BB b `ntimes' times and return
1293 
   new function. Original function is unmodified. */
1294 
static cuc_func *roll_loop (cuc_func *f, int b, int ntimes, int type)
1295 879 markom 
{
1296 
  int b1, t, i, j, prevb, prevart_b;
1297 
  cuc_func *n = dup_func (f);
1298 
  cuc_bb *ob = &f->bb[b];
1299 
  cuc_insn *ii;
1300 
 
1301 1061 markom 
  assert (ntimes > 1);
1302 
  cucdebug (3, "roll type = %i, BB%i x %i (num_bb %i)\n", type, b, ntimes, n->num_bb);
1303 
  ntimes--;
1304 
  assert (n->num_bb + ntimes * 2 < MAX_BB);
1305 879 markom 
 
1306 
  prevb = b;
1307 
  prevart_b = b;
1308 1061 markom 
 
1309 
  /* point to first artificial block */
1310 
  if (n->bb[b].next[0] != b) {
1311 
    n->bb[b].next[0] = n->num_bb + 1;
1312 
  } else if (n->bb[b].next[1] != b) {
1313 
    n->bb[b].next[1] = n->num_bb + 1;
1314 
  }
1315 
 
1316 879 markom 
  /* Duplicate the BB */
1317 1061 markom 
  for (t = 0; t < ntimes; t++) {
1318 879 markom 
    cuc_bb *pb = &n->bb[prevart_b];
1319 
    /* Add new block and set links */
1320 
    b1 = n->num_bb++;
1321 
    cpy_bb (&n->bb[b1], ob);
1322 
    /* Only one should be in loop, so we remove any INLOOP flags from duplicates */
1323 1061 markom 
    n->bb[b1].type &= ~BB_INLOOP;
1324 
    print_cuc_bb (n, "prerollA");
1325 879 markom 
 
1326 1061 markom 
    printf ("prevb %i b1 %i prevart %i\n", prevb, b1, prevart_b);
1327 879 markom 
    /* Set predecessor's successor */
1328 
    if (n->bb[prevb].next[0] == b) {
1329 
      n->bb[prevb].next[0] = b1;
1330 
      if (pb->next[0] < 0) pb->next[0] = b1 + 1;
1331 
      else pb->next[1] = b1 + 1;
1332 
      n->bb[b1].next[1] = b1 + 1;
1333 
    } else if (n->bb[prevb].next[1] == b) {
1334 
      if (pb->next[0] < 0) pb->next[0] = b1 + 1;
1335 
      else pb->next[1] = b1 + 1;
1336 
      n->bb[b1].next[0] = b1 + 1;
1337 
      n->bb[prevb].next[1] = b1;
1338 
    } else assert (0);
1339 
 
1340 
    /* Set predecessor */
1341 
    n->bb[b1].prev[0] = prevb;
1342 
    n->bb[b1].prev[1] = -1;
1343 
 
1344 
    /* Relocate backward references to current instance and forward references
1345 
       to previous one */
1346 
    relocate_bb (&n->bb[b1], b, b1, prevb);
1347 
 
1348 
    /* add artificial block, just to join accesses */
1349 
    b1 = n->num_bb++;
1350 
    cpy_bb (&n->bb[b1], ob);
1351 
    n->bb[b1].cnt = 0;
1352 
 
1353 
    for (i = 0; i < ob->ninsn - 1; i++) {
1354 
      ii = &n->bb[b1].insn[i];
1355 
      if (ob->insn[i].opt[0] & OPT_DEST) {
1356 
        change_insn_type (ii, II_CMOV);
1357 
        ii->op[0] = -1; ii->opt[0] = OPT_REGISTER | OPT_DEST;
1358 
        ii->op[1] = REF (prevart_b, i); ii->opt[1] = OPT_REF;
1359 
        ii->op[2] = REF (b1 - 1, i); ii->opt[2] = OPT_REF;
1360 
 
1361 
        /* Take left one, if we should have finished the first iteration*/
1362 
        if (pb->insn[pb->ninsn - 1].type & IT_BRANCH) {
1363 
          ii->op[3] = pb->insn[pb->ninsn - 1].op[1]; ii->opt[3] = pb->insn[pb->ninsn - 1].opt[1];
1364 
        } else {
1365 
          assert (pb->insn[pb->ninsn - 1].type & IT_COND);
1366 
          ii->op[3] = REF (prevart_b, pb->ninsn - 1); ii->opt[3] = OPT_REF;
1367 
        }
1368 
        ii->dep = NULL;
1369 930 markom 
        ii->type = ob->insn[i].type & IT_COND;
1370 879 markom 
      } else {
1371 
        change_insn_type (ii, II_NOP);
1372 
      }
1373 
    }
1374 
 
1375 928 markom 
    /* Add conditional or instruction at the end, prioritizing flags */
1376 879 markom 
    ii = &n->bb[b1].insn[ob->ninsn - 1];
1377 928 markom 
    change_insn_type (ii, II_CMOV);
1378 879 markom 
    ii->op[0] = FLAG_REG; ii->opt[0] = OPT_REGISTER | OPT_DEST;
1379 
    if (pb->insn[pb->ninsn - 1].type & IT_BRANCH) {
1380 
      ii->op[1] = pb->insn[pb->ninsn - 1].op[1];
1381 
      ii->opt[1] = pb->insn[pb->ninsn - 1].opt[1];
1382 
    } else {
1383 
      ii->op[1] = REF (prevart_b, pb->ninsn - 1);
1384 
      ii->opt[1] = OPT_REF;
1385 
    }
1386 
    if (n->bb[b1 - 1].insn[pb->ninsn - 1].type & IT_BRANCH) {
1387 
      ii->op[2] = n->bb[b1 - 1].insn[pb->ninsn - 1].op[1];
1388 
      ii->opt[2] = n->bb[b1 - 1].insn[pb->ninsn - 1].opt[1];
1389 
    } else {
1390 
      ii->op[2] = REF (b1 - 1, pb->ninsn - 1);
1391 
      ii->opt[2] = OPT_REF;
1392 
    }
1393 928 markom 
    /* {z = x || y;} is same as {z = x ? x : y;} */
1394 
    ii->op[3] = ii->op[1]; ii->opt[3] = ii->opt[1];
1395 933 markom 
    ii->type = IT_COND;
1396 879 markom 
 
1397 
    /* Only one should be in loop, so we remove any INLOOP flags from duplicates */
1398 1061 markom 
    n->bb[b1].type &= ~BB_INLOOP;
1399 879 markom 
    n->bb[b1].prev[0] = prevart_b;
1400 
    n->bb[b1].prev[1] = b1 - 1;
1401 925 markom 
    n->bb[b1].next[0] = -1;
1402 879 markom 
    n->bb[b1].next[1] = -1;
1403 1061 markom 
 
1404 879 markom 
    prevb = b1 - 1;
1405 
    prevart_b = b1;
1406 1061 markom 
    print_cuc_bb (n, "prerollB");
1407 879 markom 
  }
1408 1061 markom 
 
1409 
  print_cuc_bb (n, "preroll0");
1410 
  n->bb[prevart_b].next[0] = ob->next[0] == b ? ob->next[1] : ob->next[0];
1411 879 markom 
 
1412 1061 markom 
  print_cuc_bb (n, "preroll1");
1413 879 markom 
  /* repair BB after loop, to point back to latest artificial BB */
1414 
  b1 = n->bb[prevart_b].next[0];
1415 925 markom 
  if (b1 >= 0 && b1 != BBID_END) {
1416 897 markom 
    if (n->bb[b1].prev[0] == b) n->bb[b1].prev[0] = prevart_b;
1417 
    else if (n->bb[b1].prev[1] == b) n->bb[b1].prev[1] = prevart_b;
1418 879 markom 
    else assert (0);
1419 
  }
1420 
 
1421 1061 markom 
  if (type) {
1422 
    /* Relink to itself */
1423 
    /* Set predecessor's successor */
1424 
    if (n->bb[prevb].next[0] == b) n->bb[prevb].next[0] = prevb;
1425 
    else if (n->bb[prevb].next[1] == b) n->bb[prevb].next[1] = prevb;
1426 
    else assert (0);
1427 
    n->bb[prevb].prev[1] = prevb;
1428 879 markom 
 
1429 1061 markom 
    /* Set predecessor */
1430 
    if (n->bb[b].prev[0] == b) {
1431 
      n->bb[b].prev[0] = n->bb[b].prev[1];
1432 
      n->bb[b].prev[1] = -1;
1433 
    } else if (n->bb[b].prev[1] == b) n->bb[b].prev[1] = -1;
1434 
    else assert (0);
1435 
  } else {
1436 
    /* Relink back to start of the loop */
1437 879 markom 
    /* Set predecessor's successor */
1438 1061 markom 
    if (n->bb[prevb].next[0] == b) n->bb[prevb].next[0] = b;
1439 
    else if (n->bb[prevb].next[1] == b) n->bb[prevb].next[1] = b;
1440 
    else assert (0);
1441 879 markom 
 
1442 
    /* Set predecessor */
1443 1061 markom 
    if (n->bb[b].prev[0] == b) n->bb[b].prev[0] = prevb;
1444 
    else if (n->bb[b].prev[1] == b) n->bb[b].prev[1] = prevb;
1445 879 markom 
    else assert (0);
1446 
  }
1447 
 
1448 1061 markom 
  print_cuc_bb (n, "preroll2");
1449 879 markom 
 
1450 
  /* Relocate backward references to current instance and forward references
1451 
     to previous one */
1452 
  relocate_bb (&n->bb[b], b, b, prevb);
1453 
 
1454 
  /* Relocate all other blocks to point to latest prevart_b */
1455 
  for (i = 0; i < f->num_bb; i++)
1456 
    if (i != b) relocate_bb (&n->bb[i], b, prevart_b, prevart_b);
1457 
 
1458 
  return n;
1459 
}
1460 
 
1461 
/* Unroll loop b unroll times and return new function. Original
1462 
   function is unmodified. */
1463 
cuc_func *preunroll_loop (cuc_func *f, int b, int preroll, int unroll, char *bb_filename)
1464 
{
1465 
  int b1, i;
1466 
  cuc_func *n, *t;
1467 
  int *counts;
1468 
  int *bb_reloc;
1469 
 
1470 
  if (preroll > 1) {
1471 1061 markom 
    t = roll_loop (f, b, preroll, 1);
1472 879 markom 
    b1 = t->num_bb - 2;
1473 
    if (unroll > 1) {
1474 
      //print_cuc_bb (t, "preunroll1");
1475 1061 markom 
      n = roll_loop (t, b1, unroll, 0);
1476 879 markom 
      free_func (t);
1477 
    } else n = t;
1478 
  } else {
1479 
    b1 = b;
1480 1061 markom 
    if (unroll > 1) n = roll_loop (f, b1, unroll, 0);
1481 897 markom 
    else return dup_func (f);
1482 879 markom 
  }
1483 
 
1484 897 markom 
  /* Assign new counts to functions */
1485 879 markom 
  assert (counts = (int *)malloc (sizeof (int) * (preroll - 1 + unroll)));
1486 
  count_bb_seq (n, b, bb_filename, counts, preroll, unroll);
1487 
  for (i = 0; i < preroll - 1 + unroll; i++) {
1488 
    if (i == 0) b1 = b;
1489 
    else b1 = f->num_bb + (i - 1) * 2;
1490 
    n->bb[b1].cnt = counts[i];
1491 
  }
1492 
 
1493 
  //print_cuc_bb (n, "preunroll");
1494 
  free (counts);
1495 
  return n;
1496 
}
1497 933 markom 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.