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
|
/*========================== begin_copyright_notice ============================
Copyright (C) 2017-2021 Intel Corporation
SPDX-License-Identifier: MIT
============================= end_copyright_notice ===========================*/
#include "LocalScheduler_G4IR.h"
using namespace vISA;
void G4_BB_Schedule::printReadyList(NODE_LIST &ready_list) {
DEBUG_MSG("READY : ");
NODE_LIST_ITER iN(ready_list.begin()), eNode(ready_list.end());
for (; iN != eNode; ++iN) {
DEBUG_EMIT((*iN)->getInstruction());
DEBUG_MSG("");
}
}
Node *G4_BB_Schedule::SendHeuristic(NODE_VECT &ready_list) {
uint32_t earlist = 0xFFFFFFFF;
Node *candidateNode = NULL;
auto iNode(ready_list.begin()), endNode(ready_list.end());
for (; iNode != endNode; ++iNode) {
G4_INST *inst = (*iNode)->getInstruction();
if (inst->isSend()) {
Node *curNode = (*iNode);
if (curNode->earliest < earlist) {
earlist = curNode->earliest;
candidateNode = curNode;
}
}
}
return candidateNode;
}
// Node* G4_BB_Schedule::TornDefUseHeuristic(NODE_VECT &ready_list)
// {
// Node *to_schedule = NULL; /* A node to be scheduled */
// // send is preferred
// if((to_schedule = SendHeuristic(ready_list)))
// {
// return to_schedule;
// }
// // Now we have to choose an instruction that has the maximum distance
// between
// // the current position and the closest definition that is in the
// schedule.
// // NOTE: There can be many instructions that have the same distance => we
// need a tie breaker,
// // which'd be one of the following heuristics (to be added...).
// uint16_t maxDUDiff = 0xffff;
// auto niter(ready_list.begin()), nend(ready_list.end());
// for( ; niter != nend; ++niter)
// {
// if( (*niter)->getClosestDefPos() < maxDUDiff)
// {
// maxDUDiff = (*niter)->getClosestDefPos();
// to_schedule = *niter;
// }
// }
// if(to_schedule == NULL)
// {
// // FIXME : Choosing the first one from the ready list (have to break
// the tie) to_schedule = ready_list.front();
// }
// return to_schedule;
// }
// This one just pops a random node out of the ready list.
Node *G4_BB_Schedule::RandomHeuristic(NODE_LIST &ready_list) {
int range_max = ((int)ready_list.size()) - 1;
int randomNum = (int)(((double)rand() / (double)RAND_MAX) * range_max);
NODE_LIST_ITER iNode = ready_list.begin();
for (int i = 0; i < randomNum; i++, ++iNode)
;
return *iNode;
}
|
