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
|
%% -*- erlang-indent-level: 2 -*-
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2001-2009. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% PRIORITY HANDLING AND PRIORITY CALCULATION
%%
%% Handling of ready nodes and priorities.
%% - at present, all nodes have the same priority and so on.
%%
%% *** UNFINISHED ***
%% - should compute a static priority estimate
%% - should dynamically modify priorities + possibly insert NOPs
%% (e.g., to separate branches, etc.)
%% - thus, ought to be passed the current schedule and/or resources as well
-module(hipe_schedule_prio).
-export([init_ready/2,
init_instr_prio/2,
%% initial_ready_set/4,
next_ready/7,
add_ready_nodes/2,
insert_node/3
]).
init_ready(Size,Preds) ->
hipe_ultra_prio:init_ready(Size,Preds).
init_instr_prio(N,DAG) ->
hipe_ultra_prio:init_instr_prio(N,DAG).
%% initial_ready_set(M,N,Preds,Ready) ->
%% hipe_ultra_prio:initial_ready_set(M,N,Preds,Ready).
next_ready(C,Ready,Prio,Nodes,DAG,Preds,Earl) ->
hipe_ultra_prio:next_ready(C,Ready,Prio,Nodes,DAG,Preds,Earl).
add_ready_nodes(NodeLst,Ready) ->
hipe_ultra_prio:add_ready_nodes(NodeLst,Ready).
insert_node(C,I,Ready) ->
hipe_ultra_prio:insert_node(C,I,Ready).
|
