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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
* LIBOIL - Library of Optimized Inner Loops
* Copyright (c) 2004 David A. Schleef <ds@schleef.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <liboil/liboil.h>
#include <glib.h>
#include <string.h>
#include <stdlib.h>
typedef struct _Insn Insn;
struct _Insn {
char *line;
int index;
int n_deps;
int deps[10];
};
Insn insns[100];
int state[100];
int max_depth = 8;
int outputting = 1;
int
main (int argc, char *argv[])
{
gboolean ret;
char *contents;
gsize length;
char **lines;
int i;
int j;
int start_line = -1;
int end_line = -1;
int uber_start_line = -1;
int uber_end_line = -1;
int n_insns = 0;
int depth;
int n_impls = 0;
ret = g_file_get_contents ("it.c", &contents, &length, NULL);
lines = g_strsplit (contents, "\n", 0);
for(i=0;lines[i];i++){
char *uber;
if (strcmp(lines[i],"UBER_START")==0) {
start_line = i;
}
if (strcmp(lines[i],"UBER_END")==0) {
end_line = i;
}
uber = strstr(lines[i],"UBER ");
if (uber) {
int n_deps = 0;
char *end;
if (uber_start_line < 0) uber_start_line = i;
uber_end_line = i;
uber+=5;
insns[n_insns].line = lines[i];
insns[n_insns].index = strtol(uber, &end, 10);
uber = end;
uber++;
while(1) {
while(*uber && *uber == ' ')uber++;
insns[n_insns].deps[n_deps] = strtol(uber, &end, 10);
if (end == uber) break;
uber = end;
n_deps++;
}
insns[n_insns].n_deps = n_deps;
n_insns++;
}
}
if (outputting) {
for(i=0;i<start_line;i++){
g_print("%s\n",lines[i]);
}
}
depth = 0;
while(depth >= 0) {
int insn;
insn = state[depth];
/* check if we've exhausted instructions */
if (insn >= max_depth) {
depth--;
if (depth >= 0) state[depth]++;
continue;
}
/* check if this instruction has been used */
for(i=0;i<depth;i++) {
if (state[i] == insn) {
state[depth]++;
goto loop;
}
}
/* check if this is a valid instruction to place */
for(i=0;i<insns[insn].n_deps;i++){
for(j=0;j<depth;j++){
if (state[j] == insns[insn].deps[i]){
break;
}
}
if (j == depth) {
state[depth]++;
goto loop;
}
}
#if 0
/* only move instruction a few places */
if (depth < insn - 1 || depth > insn + 1) {
state[depth]++;
}
#endif
if (depth < max_depth - 1) {
depth++;
state[depth]=0;
} else {
if (outputting) {
for(i=start_line + 1;i<uber_start_line;i++){
char *s;
s = strstr(lines[i],"UBER_INDEX");
if (s) {
g_print("%.*s%d%s\n", (int)(s-lines[i]), lines[i], n_impls, s+10);
} else {
g_print("%s\n",lines[i]);
}
}
for(i=0;i<max_depth;i++){
g_print("%s\n",insns[state[i]].line);
}
for(i=max_depth;i<n_insns;i++) {
g_print("%s\n",insns[i].line);
}
for(i=uber_end_line + 1;i<end_line;i++){
char *s;
s = strstr(lines[i],"UBER_INDEX");
if (s) {
g_print("%.*s%d%s\n", (int)(s-lines[i]), lines[i], n_impls, s+10);
} else {
g_print("%s\n",lines[i]);
}
}
g_print("\n");
}
n_impls++;
state[depth]++;
}
loop:
;
}
if (!outputting) {
g_print("n_impls = %d\n", n_impls);
}
return 0;
}
|
