This file is part of Valgrind, a dynamic binary instrumentation
framework.
- Copyright (C) 2005 Nicholas Nethercote
+ Copyright (C) 2005-2006 Nicholas Nethercote
njn@valgrind.org
This program is free software; you can redistribute it and/or
}
// Push onto the iterator stack.
-static void stackPush(AvlTree* t, AvlNode* n, Int i)
+static inline void stackPush(AvlTree* t, AvlNode* n, Int i)
{
vg_assert(t->stackTop < STACK_MAX);
vg_assert(1 <= i && i <= 3);
}
// Pop from the iterator stack.
-static Bool stackPop(AvlTree* t, AvlNode** n, Int* i)
+static inline Bool stackPop(AvlTree* t, AvlNode** n, Int* i)
{
vg_assert(t->stackTop <= STACK_MAX);
// Destructor, frees up all memory held by remaining nodes.
void VG_(OSet_Destroy)(AvlTree* t, OSetNodeDestroy_t destroyNode)
{
- AvlNode* n;
- Int i, sz = 0;
+ AvlNode* n = NULL;
+ Int i = 0, sz = 0;
vg_assert(t);
stackClear(t);
void* VG_(OSet_Next)(AvlTree* t)
{
- Int i;
- OSetNode* n;
+ Int i = 0;
+ OSetNode* n = NULL;
vg_assert(t);
/*--------------------------------------------------------------------*/
-/*--- An ordered set implemenation. pub_core_oset.h ---*/
+/*--- An ordered set implementation. pub_core_oset.h ---*/
/*--------------------------------------------------------------------*/
/*
This file is part of Valgrind, a dynamic binary instrumentation
framework.
- Copyright (C) 2000-2006 Julian Seward
- jseward@acm.org
+ Copyright (C) 2005-2006 Nicholas Nethercote
+ njn@valgrind.org
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
This file is part of Valgrind, a dynamic binary instrumentation
framework.
- Copyright (C) 2000-2006 Julian Seward
- jseward@acm.org
+ Copyright (C) 2005-2006 Nicholas Nethercote
+ njn@valgrind.org
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as