blob: b6c2aeee6f8721e8c6b04b3b899c3e366e3abc9c (
plain)
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <codemaker/exceptiontree.hxx>
#include <codemaker/typemanager.hxx>
#include <rtl/ref.hxx>
#include <rtl/string.hxx>
#include <rtl/textenc.h>
#include <rtl/ustring.hxx>
#include <unoidl/unoidl.hxx>
#include <memory>
#include <vector>
using codemaker::ExceptionTree;
using codemaker::ExceptionTreeNode;
ExceptionTreeNode * ExceptionTreeNode::add(OString const & theName) {
std::unique_ptr< ExceptionTreeNode > node(new ExceptionTreeNode(theName));
children.push_back(std::move(node));
return children.back().get();
}
void ExceptionTreeNode::clearChildren() {
children.clear();
}
void ExceptionTree::add(
OString const & name, rtl::Reference< TypeManager > const & manager)
{
std::vector< OString > list;
bool bRuntimeException = false;
for (OString n(name); n != "com.sun.star.uno.Exception";) {
if (n == "com.sun.star.uno.RuntimeException") {
bRuntimeException = true;
break;
}
list.push_back(n);
rtl::Reference< unoidl::Entity > ent;
codemaker::UnoType::Sort s = manager->getSort(b2u(n), &ent);
(void) s; // WaE: unused variable
assert(s == codemaker::UnoType::Sort::Exception);
n = u2b(
static_cast< unoidl::ExceptionTypeEntity * >(ent.get())->
getDirectBase());
assert(!n.isEmpty());
}
if (!bRuntimeException) {
ExceptionTreeNode * node = &m_root;
for (std::vector< OString >::reverse_iterator i(list.rbegin());
!node->present; ++i)
{
if (i == list.rend()) {
node->setPresent();
break;
}
for (ExceptionTreeNode::Children::iterator j(
node->children.begin());;
++j)
{
if (j == node->children.end()) {
node = node->add(*i);
break;
}
if ((*j)->name == *i) {
node = j->get();
break;
}
}
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
