1 /* This file is part of the KDE project
2 Copyright (C) 2007 Matthias Kretz <kretz@kde.org>
4 This program is free software; you can redistribute it and/or
5 modify it under the terms of the GNU Library General Public
6 License as published by the Free Software Foundation; either
7 version 2 of the License, or (at your option) any later version.
9 This library is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 Library General Public License for more details.
14 You should have received a copy of the GNU Library General Public License
15 along with this library; see the file COPYING.LIB. If not, write to
16 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
17 Boston, MA 02110-1301, USA.
26 #include "sourcenode.h"
36 WireCall() : src(0), snk(0) {}
37 WireCall(SourceNode
*a
, SinkNode
*b
) : source(a
->threadSafeObject()), sink(b
->threadSafeObject()), src(a
), snk(b
) {}
40 * If the two WireCalls are in separate graphs treat them as equal (returns false)
42 * If the two WireCalls have the same source treat them as equal (returns false)
44 * If the two WireCalls are in the same graph:
45 * returns false if this wire is a source for \p rhs
46 * returns true if \p rhs is a source for this wire
48 bool operator<(const WireCall
&rhs
) const {
50 // treat the wire calls as equal
54 while (s
&& s
->sinkInterface()) {
55 if (rhs
.snk
== s
->sinkInterface()) {
58 s
= s
->sinkInterface()->source();
63 bool operator==(const WireCall
&rhs
) const
65 return source
== rhs
.source
&& sink
== rhs
.sink
;
68 void addReferenceTo(const QList
<QExplicitlySharedDataPointer
<SharedData
> > &data
)
70 extraReferences
+= data
;
73 QExplicitlySharedDataPointer
<SourceNodeXT
> source
;
74 QExplicitlySharedDataPointer
<SinkNodeXT
> sink
;
79 QList
<QExplicitlySharedDataPointer
<SharedData
> > extraReferences
;
85 inline uint qHash(const Phonon::Xine::WireCall &w)
87 const uint h1 = qHash(w.source);
88 const uint h2 = qHash(w.sink);
89 return ((h1 << 16) | (h1 >> 16)) ^ h2;