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
|
/*
* Copyright (C) 2020 Collabora, Ltd.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "compiler.h"
/* The scheduler packs multiple instructions into a clause (grouped as bundle),
* and the packing code takes in a clause and emits it to the wire. During
* scheduling, we need to lay out the instructions (bundles) and constants
* within the clause so constraints can be resolved during scheduling instead
* of failing packing. These routines will help building clauses from
* instructions so the scheduler can focus on the high-level algorithm, and
* manipulating clause layouts.
*/
/* Helper to see if a bundle can be inserted. We must satisfy the invariant:
*
* constant_count + bundle_count <= 13
*
* ...which is equivalent to the clause ending up with 8 or fewer quardwords.
* Inserting a bundle increases bundle_count by one, and if it reads a unique
* constant, it increases constant_count by one.
*/
bool
bi_can_insert_bundle(bi_clause *clause, bool constant)
{
unsigned constant_count = clause->constant_count + (constant ? 1 : 0);
unsigned bundle_count = clause->bundle_count + 1;
return (constant_count + bundle_count) <= 13;
}
/* Helper to calculate the number of quadwords in a clause. This is a function
* of the number of instructions and constants; it doesn't require actually
* packing, which is useful for branch offsets.
*
* Table of instruction count to instruction quadwords, per the packing
* algorithm, where * indicates a constant is packed for free:
*
* X | Y
* ---|---
* 1 | 1
* 2 | 2
* 3 | 3*
* 4 | 3
* 5 | 4*
* 6 | 5*
* 7 | 5
* 8 | 6*
*
* Y = { X if X <= 3
* { X - 1 if 4 <= X <= 6
* { X - 2 if 7 <= X <= 8
*
* and there is a constant for free if X is in {3, 5, 6, 8}. The remaining
* constants are packed two-by-two as constant quadwords.
*/
unsigned
bi_clause_quadwords(bi_clause *clause)
{
unsigned X = clause->bundle_count;
unsigned Y = X - ((X >= 7) ? 2 : (X >= 4) ? 1 : 0);
unsigned constants = clause->constant_count;
if ((X != 4) && (X != 7) && (X >= 3) && constants)
constants--;
return Y + DIV_ROUND_UP(constants, 2);
}
|
