qi-hardware/wernermisc
1
0
Fork 0
mirror of git://projects.qi-hardware.com/wernermisc.git synced 2024-11-15 12:34:05 +02:00
Code

m1/perf/: added LCPF scheduler

Browse Source
This commit is contained in:
Werner Almesberger 2011-09-18 07:45:17 -03:00
parent abd7de7265
commit 5dc1c6de36
3 changed files with 38 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
m1/perf/Makefile
View File

@ -36,6 +36,7 @@ $(LIBFPVM_A):
clean: clean:
$(MAKE) -C $(M1SWLIB_DIR) clean $(MAKE) -C $(M1SWLIB_DIR) clean
$(MAKE) -C $(COMPILER_DIR) clean $(MAKE) -C $(COMPILER_DIR) clean
rm -f $(M1SWLIB_DIR)/sched.o
rm -f $(OBJS) rm -f $(OBJS)
path: path:

3
m1/perf/TODO
View File

@ -1,8 +1,9 @@
Done: Done:
- dynamically allocate scheduler context - dynamically allocate scheduler context
- see if preferring critical path can improve code efficiency (YES !)
Pending: Pending:
- see if preferring critical path can improve code efficiency - see if dynamically adjusting the critical path leads to further improvements
- test IF - test IF
- run result comparison against full set of patches - run result comparison against full set of patches
- check if result comparison actually compares meaningful data - check if result comparison actually compares meaningful data

36
m1/perf/sched.c
View File

@ -31,7 +31,8 @@
#include <hw/pfpu.h> #include <hw/pfpu.h>
#define REG_STATS //#define REG_STATS
//#define LCPF /* longest critical path first */
#ifdef DEBUG #ifdef DEBUG
#define Dprintf printf #define Dprintf printf
@ -64,6 +65,9 @@ struct insn {
int earliest; /* earliest cycle dependencies seen so far are met */ int earliest; /* earliest cycle dependencies seen so far are met */
struct list dependants; /* list of dependencies (constant) */ struct list dependants; /* list of dependencies (constant) */
int num_dependants; /* number of unresolved dependencies */ int num_dependants; /* number of unresolved dependencies */
#ifdef LCPF
int distance; /* minimum cycles on this path until the end */
#endif
}; };
@ -376,6 +380,18 @@ static void init_scheduler(struct fpvm_fragment *frag)
else else
list_add_tail(&sc->ready[0], &insn->more); list_add_tail(&sc->ready[0], &insn->more);
} }
#ifdef LCPF
struct data_ref *dep;
for (i = frag->ninstructions-1; i >= 0; i--) {
insn = sc->insns+i;
foreach (dep, &insn->dependants)
if (dep->insn->distance > insn->distance)
insn->distance = dep->insn->distance;
insn->distance += insn->latency;
}
#endif
} }
@ -441,6 +457,9 @@ static int schedule(unsigned int *code)
int remaining; int remaining;
int i, last, end; int i, last, end;
struct insn *insn; struct insn *insn;
#ifdef LCPF
struct insn *best;
#endif
remaining = sc->frag->ninstructions; remaining = sc->frag->ninstructions;
for (i = 0; remaining; i++) { for (i = 0; remaining; i++) {
@ -451,17 +470,32 @@ static int schedule(unsigned int *code)
i, remaining, count(&sc->waiting), count(&sc->ready[i])); i, remaining, count(&sc->waiting), count(&sc->ready[i]));
list_concat(&sc->waiting, &sc->ready[i]); list_concat(&sc->waiting, &sc->ready[i]);
#ifdef LCPF
best = NULL;
#endif
foreach (insn, &sc->waiting) { foreach (insn, &sc->waiting) {
end = i+insn->latency; end = i+insn->latency;
if (end >= PFPU_PROGSIZE) if (end >= PFPU_PROGSIZE)
return -1; return -1;
if (!FIELD(code[end]).dest) { if (!FIELD(code[end]).dest) {
#ifdef LCPF
if (!best || best->distance < insn->distance)
best = insn;
#else
issue(insn, i, code); issue(insn, i, code);
list_del(&insn->more); list_del(&insn->more);
remaining--; remaining--;
break; break;
#endif
} }
} }
#ifdef LCPF
if (best) {
issue(best, i, code);
list_del(&best->more);
remaining--;
}
#endif
if (FIELD(code[i]).dest) if (FIELD(code[i]).dest)
put_reg(sc->pfpu_regs[FIELD(code[i]).dest].vm_reg); put_reg(sc->pfpu_regs[FIELD(code[i]).dest].vm_reg);
} }