Attachment 105630 Details for Bug 82828 – another debugging patch

[patch] another debugging patch

0001-ra-add-other-debug-printf-s.patch (text/plain), 1.41 KB, created by Connor Abbott on 2014-09-02 18:00:26 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Connor Abbott

Created: 2014-09-02 18:00:26 UTC

Size: 1.41 KB

patch

obsolete

>From a58e5c195d6284d099961d51e7dea6d34a9389dd Mon Sep 17 00:00:00 2001
>From: Connor Abbott <cwabbott0@gmail.com>
>Date: Tue, 2 Sep 2014 13:52:41 -0400
>Subject: [PATCH] ra: add other debug printf's
>
>Signed-off-by: Connor Abbott <cwabbott0@gmail.com>
>---
> src/mesa/program/register_allocate.c | 4 ++++
> 1 file changed, 4 insertions(+)
>
>diff --git a/src/mesa/program/register_allocate.c b/src/mesa/program/register_allocate.c
>index db2be5d..fa242be 100644
>--- a/src/mesa/program/register_allocate.c
>+++ b/src/mesa/program/register_allocate.c
>@@ -353,6 +353,8 @@ ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
>    if (n1 != n2) {
>       int n1_class = g->nodes[n1].class;
>       int n2_class = g->nodes[n2].class;
>+      printf("increasing q total, old q total = %u, n1 = %u, n2 = %d, value = %d\n",
>+             g->nodes[n1].q_total, n1, n2, g->regs->classes[n1_class]->q[n2_class]);
>       g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
>    }
> 
>@@ -434,6 +436,8 @@ decrement_q(struct ra_graph *g, unsigned int n)
>       unsigned int n2_class = g->nodes[n2].class;
> 
>       if (n != n2 && !g->nodes[n2].in_stack) {
>+         printf("decreasing q total, old q total = %u, n = %u, n2 = %d, value = %d\n",
>+                g->nodes[n2].q_total, n, n2, g->regs->classes[n2_class]->q[n_class]);
> 	 g->nodes[n2].q_total -= g->regs->classes[n2_class]->q[n_class];
>       }
>    }
>-- 
>1.8.5.2 (Apple Git-48)
>

Actions: View | Splinter Review

Attachments on bug 82828: 104921 | 105451 | 105572 | 105630 | 105641 | 105645

Use of freedesktop.org services, including Bugzilla, is subject to our Code of Conduct. How we collect and use information is described in our Privacy Policy.