From 54816fb3d2f89ff3a5c7d578a1bdb932f7e31e5e Mon Sep 17 00:00:00 2001 From: "dbaron%dbaron.org" Date: Sat, 18 Jan 2003 18:37:41 +0000 Subject: [PATCH] Two typo fixes. git-svn-id: svn://10.0.0.236/trunk@136604 18797224-902f-48f8-a5cc-f745e15eee43 --- mozilla/tools/trace-malloc/leaksoup.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/mozilla/tools/trace-malloc/leaksoup.cpp b/mozilla/tools/trace-malloc/leaksoup.cpp index 11a3257423c..c10a76671e2 100644 --- a/mozilla/tools/trace-malloc/leaksoup.cpp +++ b/mozilla/tools/trace-malloc/leaksoup.cpp @@ -63,7 +63,7 @@ struct AllocationNode { nsAutoVoidArray pointers_from; // Early on in the algorithm, the pre-order index from a DFS. - // Later on, set to the index of the strongly connected index to + // Later on, set to the index of the strongly connected component to // which this node belongs. PRUint32 index; @@ -215,10 +215,10 @@ int main(int argc, char **argv) // When doing post-order processing, we have to be // careful not to put reached nodes into the stack. - nsVoidArray &pf = n->pointers_to; - for (PRInt32 i = pf.Count() - 1; i >= 0; --i) { - if (!NS_STATIC_CAST(AllocationNode*, pf[i])->reached) { - stack.AppendElement(pf[i]); + nsVoidArray &pt = n->pointers_to; + for (PRInt32 i = pt.Count() - 1; i >= 0; --i) { + if (!NS_STATIC_CAST(AllocationNode*, pt[i])->reached) { + stack.AppendElement(pt[i]); } } }