3 * Copyright (c) 2019 Collabora LTD
5 * Author: Gert Wollny <gert.wollny@collabora.com>
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * on the rights to use, copy, modify, merge, publish, distribute, sub
11 * license, and/or sell copies of the Software, and to permit persons to whom
12 * the Software is furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice (including the next
15 * paragraph) shall be included in all copies or substantial portions of the
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
21 * THE AUTHOR(S) AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
22 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
23 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
24 * USE OR OTHER DEALINGS IN THE SOFTWARE.
27 #include "sfn_callstack.h"
31 CallStack::CallStack(r600_bytecode
& bc
):
37 CallStack::~CallStack()
41 int CallStack::push(unsigned type
)
48 ++m_bc
.stack
.push_wqm
;
57 return update_max_depth(type
);
60 void CallStack::pop(unsigned type
)
65 assert(m_bc
.stack
.push
>= 0);
68 --m_bc
.stack
.push_wqm
;
69 assert(m_bc
.stack
.push_wqm
>= 0);
73 assert(m_bc
.stack
.loop
>= 0);
81 int CallStack::update_max_depth(unsigned type
)
84 r600_stack_info
& stack
= m_bc
.stack
;
88 int entry_size
= stack
.entry_size
;
90 elements
= (stack
.loop
+ stack
.push_wqm
) * entry_size
;
91 elements
+= stack
.push
;
93 /* These next three lines are EVERGREEN specific and should
94 * be moved to a virtual function when other chipsets are to
96 assert(m_bc
.chip_class
== EVERGREEN
);
97 if (type
== FC_PUSH_VPM
|| stack
.push
> 0) {
103 entries
= (elements
+ (entry_size
- 1)) / entry_size
;
105 if (entries
> stack
.max_entries
)
106 stack
.max_entries
= entries
;