File: pr42389.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (87 lines) | stat: -rw-r--r-- 1,592 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/* { dg-do compile { target powerpc*-*-* ia64-*-* i?86-*-* x86_64-*-* } } */
/* { dg-options "-O2 -fselective-scheduling -fsel-sched-pipelining -fsched-pressure" } */

struct s_linked_f_pointer
{
  struct s_linked_f_pointer *next;
  float *fptr;
};
struct s_trace
{
  int index;
};
struct s_rr_cost
{
  float base_cost;
  float acc_cost;
};
extern int num_nets;
extern struct s_trace **trace_head;
extern struct s_rr_cost *rr_cost;
struct s_rr_route
{
  float cost;
};
static int heap_tail;
extern struct s_linked_f_pointer *rr_modified_head;
extern struct s_rr_route *rr_route;

void
empty_heap (void)
{
  heap_tail = 1;
}

void
reset_path_costs (void)
{
  struct s_linked_f_pointer *mod_ptr;
  if (rr_modified_head != ((void *) 0))
    {
      mod_ptr = rr_modified_head;
      while (mod_ptr->next != ((void *) 0))
	{
	  *(mod_ptr->fptr) = 1.e30;
	  mod_ptr = mod_ptr->next;
	}
      rr_modified_head = ((void *) 0);
    }
}

static void
route_net (int inet)
{
  int i;
  for (i = 1; i < inet; i++)
    reset_path_costs ();
  empty_heap ();
  reset_path_costs ();
}

void
pathfinder_update_one_cost (int inet, float pres_fac, float acc_fac)
{
  struct s_trace *tptr;
  int inode = 0;

  tptr = trace_head[inet];
  inode = tptr->index;
  rr_route[inode].cost = rr_cost[inode].base_cost + rr_cost[inode].acc_cost;
}

int
try_route (int n, float x, float y)
{
  int inet, itry;
  float pres_fac;
  for (itry = 1; itry <= n; itry++)
    {
      for (inet = 0; inet < num_nets; inet++)
	{
	  route_net (inet);
	  pathfinder_update_one_cost (inet, pres_fac, x);
	}
      pres_fac *= y;
    }
}