File: class.cpp

package info (click to toggle)
kdsoap 2.2.0%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,996 kB
  • sloc: cpp: 19,877; python: 63; makefile: 16
file content (517 lines) | stat: -rw-r--r-- 12,398 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
/*
    This file is part of kdepim.

    Copyright (c) 2004 Cornelius Schumacher <schumacher@kde.org>
    Copyright (c) 2010 David Faure <dfaure@kdab.com>

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Library General Public
    License as published by the Free Software Foundation; either
    version 2 of the License, or (at your option) any later version.

    This library is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    Library General Public License for more details.

    You should have received a copy of the GNU Library General Public License
    along with this library; see the file COPYING.LIB.  If not, write to
    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
    Boston, MA 02110-1301, USA.
*/

#include "class.h"

#include <QDebug>

using namespace KODE;

class Class::Private
{
public:
    QString mName;
    QString mNameSpace;
    QString mExportDeclaration;
    QString mDPointer;
    bool mUseSharedData = false;
    bool mCanBeCopied = false;
    Function::List mFunctions;
    MemberVariable::List mMemberVariables;
    QStringList mIncludes;
    QStringList mForwardDeclarations;
    Include::List mHeaderIncludes;
    Class::List mBaseClasses;
    Typedef::List mTypedefs;
    Enum::List mEnums;
    QString mDocs;
    Class::List mNestedClasses;
    QString mParentClassName;
    QStringList mDeclMacros;
    bool mIsQGadget = false;
    bool mIsQObject = false;
};

Class::Class() : d(new Private) {}

Class::Class(const Class &other) : d(new Private)
{
    *d = *other.d;
}

Class::Class(const QString &name, const QString &nameSpace) : d(new Private)
{
    Q_ASSERT(!name.isEmpty());
    d->mName = name;
    d->mNameSpace = nameSpace;
}

Class::~Class()
{
    delete d;
}

Class &Class::operator=(const Class &other)
{
    if (this == &other)
        return *this;

    *d = *other.d;

    return *this;
}

void Class::setName(const QString &name)
{
    Q_ASSERT(!name.isEmpty());
    d->mName = name;
}

QString Class::name() const
{
    return d->mName;
}

void Class::setNameSpace(const QString &nameSpace)
{
    d->mNameSpace = nameSpace;
}

QString Class::nameSpace() const
{
    return d->mNameSpace;
}

QString Class::qualifiedName() const
{
    if (d->mNameSpace.isEmpty())
        return d->mName;
    return d->mNameSpace + QLatin1String("::") + d->mName;
}

void Class::setExportDeclaration(const QString &name)
{
    addHeaderInclude(name.toLower() + "_export.h");
    if (name.contains("/")) {
        d->mExportDeclaration = name.split("/").value(1);
    } else {
        d->mExportDeclaration = name;
    }
}

QString Class::exportDeclaration() const
{
    return d->mExportDeclaration;
}

void Class::setUseDPointer(bool useDPointer, const QString &dPointer)
{
    d->mDPointer = useDPointer ? dPointer : QString();
}

bool Class::useDPointer() const
{
    return !d->mDPointer.isEmpty();
}

void Class::setUseSharedData(bool b, const QString &dPointer)
{
    d->mUseSharedData = b;
    if (b) {
        setUseDPointer(true, dPointer);
        d->mCanBeCopied = true;
    }
}

bool Class::useSharedData() const
{
    return d->mUseSharedData;
}

void Class::setCanBeCopied(bool b)
{
    d->mCanBeCopied = b;
}

bool Class::canBeCopied() const
{
    return d->mCanBeCopied;
}

void Class::addInclude(const QString &include, const QString &forwardDeclaration)
{
    if (!include.isEmpty() && !d->mIncludes.contains(include))
        d->mIncludes.append(include);

    if (!forwardDeclaration.isEmpty() && !d->mForwardDeclarations.contains(forwardDeclaration))
        d->mForwardDeclarations.append(forwardDeclaration);
}

void Class::addIncludes(const QStringList &files, const QStringList &forwardDeclarations)
{
    for (int i = 0; i < files.count(); ++i) {
        if (!d->mIncludes.contains(files[i]))
            if (!files[i].isEmpty())
                d->mIncludes.append(files[i]);
    }

    for (int i = 0; i < forwardDeclarations.count(); ++i) {
        if (!d->mForwardDeclarations.contains(forwardDeclarations[i]))
            d->mForwardDeclarations.append(forwardDeclarations[i]);
    }
}

QStringList Class::includes() const
{
    return d->mIncludes;
}

QStringList Class::forwardDeclarations() const
{
    return d->mForwardDeclarations;
}

void Class::addHeaderInclude(const QString &include, Include::IncludeType type)
{
    auto newInclude = Include(include, type);
    if (include.isEmpty() || d->mHeaderIncludes.contains(newInclude))
        return;

    d->mHeaderIncludes.append(newInclude);
}

void Class::addHeaderIncludes(const QStringList &includes, Include::IncludeType type)
{
    QStringList::ConstIterator it;
    for (it = includes.constBegin(); it != includes.constEnd(); ++it)
        addHeaderInclude(*it, type);
}

Include::List Class::headerIncludes() const
{
    return d->mHeaderIncludes;
}

void Class::addBaseClass(const Class &c)
{
    d->mBaseClasses.append(c);
}

Class::List Class::baseClasses() const
{
    return d->mBaseClasses;
}

void Class::addFunction(const Function &function)
{
    d->mFunctions.append(function);
    if (!d->mIsQObject) {
        if (function.access() & Function::Signal || function.access() & Function::Slot)
            d->mIsQObject = true;
    }
}

Function::List Class::functions() const
{
    return d->mFunctions;
}

void Class::addMemberVariable(const MemberVariable &v)
{
    d->mMemberVariables.append(v);
}

MemberVariable::List Class::memberVariables() const
{
    return d->mMemberVariables;
}

void Class::addTypedef(const Typedef &typeDefinition)
{
    d->mTypedefs.append(typeDefinition);
}

Typedef::List Class::typedefs() const
{
    return d->mTypedefs;
}

void Class::addEnum(const Enum &enumValue)
{
    d->mEnums.append(enumValue);
}

Enum::List Class::enums() const
{
    return d->mEnums;
}

bool Class::hasEnum(const QString &name) const
{
    for (const Enum &e : qAsConst(d->mEnums)) {
        if (e.name() == name)
            return true;
    }
    return false;
}

bool Class::isValid() const
{
    return !d->mName.isEmpty();
}

bool Class::hasFunction(const QString &functionName) const
{
    Function::List::ConstIterator it;
    for (it = d->mFunctions.constBegin(); it != d->mFunctions.constEnd(); ++it) {
        if ((*it).name() == functionName)
            return true;
    }

    return false;
}

void Class::setQObject(bool isQObject)
{
    d->mIsQObject = isQObject;
}

bool Class::isQObject() const
{
    return d->mIsQObject;
}

bool Class::isQGadget() const
{
    return d->mIsQGadget;
}

void Class::setQGadget(const bool isQGadget)
{
    d->mIsQGadget = isQGadget;
}

void Class::setDocs(const QString &str)
{
    d->mDocs = str;
}

QString Class::docs() const
{
    return d->mDocs;
}

void Class::addNestedClass(const Class &nestedClass)
{
    Class addedClass = nestedClass;
    addedClass.setParentClassName(name());

    d->mNestedClasses.append(addedClass);
}

Class::List Class::nestedClasses() const
{
    return d->mNestedClasses;
}

QString Class::parentClassName() const
{
    return d->mParentClassName;
}

void Class::setParentClassName(const QString &parentClassName)
{
    d->mParentClassName = parentClassName;
}

QString Class::dPointerName() const
{
    return d->mDPointer;
}

////

// Returns what a class depends on: its base class(es) and any by-value member var
static QStringList dependenciesForClass(const Class &aClass, const QStringList &allClasses,
                                        const QStringList &excludedClasses)
{
    QStringList lst;
    Q_FOREACH (const Class &baseClass, aClass.baseClasses()) {
        const QString baseName = baseClass.qualifiedName();
        if (!baseName.startsWith('Q') && !excludedClasses.contains(baseName))
            lst.append(baseClass.name());
    }
    if (!aClass.useDPointer()) {
        Q_FOREACH (const MemberVariable &member, aClass.memberVariables()) {
            const QString type = member.type();
            if (allClasses.contains(type)) {
                lst.append(type);
            }
        }
    }

    return lst;
}

static bool allKnown(const QStringList &deps, const QStringList &classNames)
{
    Q_FOREACH (const QString &dep, deps) {
        if (!classNames.contains(dep)) {
            return false;
        }
    }
    return true;
}

static bool classLessThan(const Class &c1, const Class &c2)
{
    return c1.qualifiedName() < c2.qualifiedName();
}

/**
 * This method sorts a list of classes in a way that the base class
 * of a class, as well as the classes it use by value in member vars,
 * always appear before the class itself.
 */
static Class::List sortByDependenciesHelper(const Class::List &classes,
                                            const QStringList &excludedClasses)
{
    Class::List allClasses(classes);
    std::sort(allClasses.begin(), allClasses.end(), classLessThan); // make result deterministic

    QStringList allClassNames;
    Q_FOREACH (const Class &c, allClasses)
        allClassNames.append(c.qualifiedName());

    Class::List retval;

    QStringList classNames;

    // copy all classes without dependencies
    Class::List::Iterator it = allClasses.begin();
    while (it != allClasses.end()) {
        if (dependenciesForClass(*it, allClassNames, excludedClasses).isEmpty()) {
            retval.append(*it);
            classNames.append((*it).qualifiedName());

            it = allClasses.erase(it);
        } else {
            ++it;
        }
    }

    while (!allClasses.isEmpty()) {
        const int currentCount = allClasses.count();
        // copy all classes which have a class from retval/classNames (i.e. already written out)
        // as base class - or as member variable
        for (it = allClasses.begin(); it != allClasses.end();) {

            const QStringList deps = dependenciesForClass(*it, allClassNames, excludedClasses);
            if (allKnown(deps, classNames)) {
                retval.append(*it);
                classNames.append((*it).qualifiedName());

                it = allClasses.erase(it);
            } else {
                ++it;
            }
        }
        if (allClasses.count() == currentCount) {
            // We didn't resolve anything this time around, so let's not loop forever
            qDebug() << "ERROR: Couldn't find class dependencies (base classes, member vars) for "
                        "classes"
                     << allClasses.classNames();
            Q_FOREACH (const Class &c, allClasses) {
                qDebug() << c.qualifiedName() << "depends on"
                         << dependenciesForClass(c, allClassNames, excludedClasses);
            }

            return retval;
        }
    }

    return retval;
}

void ClassList::sortByDependencies(const QStringList &excludedClasses)
{
    *this = sortByDependenciesHelper(*this, excludedClasses);
}

void ClassList::sortAlphabetically()
{
    std::sort(begin(), end(), classLessThan);
}

ClassList::const_iterator ClassList::findClass(const QString &qualifiedName) const
{
    ClassList::const_iterator it = begin();
    for (; it != end(); ++it)
        if ((*it).qualifiedName() == qualifiedName)
            break;
    return it;
}

QStringList KODE::ClassList::classNames() const
{
    QStringList names;
    ClassList::const_iterator it = begin();
    for (; it != end(); ++it)
        names.append((*it).name());
    return names;
}

void KODE::ClassList::addClass(const Class &cl)
{
    const QString qn = cl.qualifiedName();
    ClassList::iterator it = begin();
    for (; it != end(); ++it) {
        if ((*it).qualifiedName() == qn) {
            qWarning() << "ERROR: Already having a class called" << qn;
        }
    }

    *this += cl;
}

void KODE::Class::addDeclarationMacro(const QString &macro)
{
    d->mDeclMacros.append(macro);
}

QStringList KODE::Class::declarationMacros() const
{
    return d->mDeclMacros;
}

void KODE::Class::setNamespaceAndName(const QString &name)
{
    d->mName = name;
    d->mNameSpace.clear();
    while (d->mName.contains("::")) {
        const int pos = d->mName.indexOf("::");
        if (!d->mNameSpace.isEmpty())
            d->mNameSpace += QLatin1String("::");
        d->mNameSpace += d->mName.left(pos);
        d->mName = d->mName.mid(pos + 2);
    }
}