1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/tests/test-refcounting.cpp Mon Aug 26 23:18:03 2013 -0700
1.3 @@ -0,0 +1,84 @@
1.4 +// vim: set sts=8 ts=2 sw=2 tw=99 et:
1.5 +//
1.6 +// Copyright (C) 2013, David Anderson and AlliedModders LLC
1.7 +// All rights reserved.
1.8 +//
1.9 +// Redistribution and use in source and binary forms, with or without
1.10 +// modification, are permitted provided that the following conditions are met:
1.11 +//
1.12 +// * Redistributions of source code must retain the above copyright notice, this
1.13 +// list of conditions and the following disclaimer.
1.14 +// * Redistributions in binary form must reproduce the above copyright notice,
1.15 +// this list of conditions and the following disclaimer in the documentation
1.16 +// and/or other materials provided with the distribution.
1.17 +// * Neither the name of AlliedModders LLC nor the names of its contributors
1.18 +// may be used to endorse or promote products derived from this software
1.19 +// without specific prior written permission.
1.20 +//
1.21 +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.22 +// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.23 +// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.24 +// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
1.25 +// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.26 +// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.27 +// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.28 +// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.29 +// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.30 +// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.31 +// POSSIBILITY OF SUCH DAMAGE.
1.32 +
1.33 +#include <am-utility.h>
1.34 +#include <am-refcounting.h>
1.35 +#include "runner.h"
1.36 +
1.37 +using namespace ke;
1.38 +
1.39 +static size_t sDtors = 0;
1.40 +
1.41 +class Counted : public Refcounted<Counted>
1.42 +{
1.43 + public:
1.44 + ~Counted() {
1.45 + sDtors++;
1.46 + }
1.47 +};
1.48 +
1.49 +static inline PassRef<Counted>
1.50 +PassThrough(const Ref<Counted> &obj)
1.51 +{
1.52 + return obj;
1.53 +}
1.54 +
1.55 +class TestRefcounting : public Test
1.56 +{
1.57 + public:
1.58 + TestRefcounting()
1.59 + : Test("Refcounting")
1.60 + {
1.61 + }
1.62 +
1.63 + bool Run() KE_OVERRIDE
1.64 + {
1.65 + {
1.66 + Ref<Counted> obj(Newborn<Counted>(new Counted()));
1.67 + }
1.68 + if (!check(sDtors == 1, "Ref/Newborn counted properly"))
1.69 + return false;
1.70 +
1.71 + {
1.72 + Ref<Counted> obj(Newborn<Counted>(new Counted()));
1.73 + Ref<Counted> obj2 = PassThrough(obj);
1.74 + Ref<Counted> obj3 = PassThrough(obj);
1.75 + if (!check(sDtors == 1, "destructor not called early"))
1.76 + return false;
1.77 + Ref<Counted> obj4 = PassThrough(PassThrough(PassThrough(obj)));
1.78 + if (!check(sDtors == 1, "destructor not called early"))
1.79 + return false;
1.80 + }
1.81 + if (!check(sDtors == 2, "PassRef/Ref counted properly"))
1.82 + return false;
1.83 +
1.84 + return true;
1.85 + }
1.86 +} sTestRefcounting;
1.87 +