Line data    Source code

       1             : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
       2             : /*
       3             :  * This file is part of the LibreOffice project.
       4             :  *
       5             :  * This Source Code Form is subject to the terms of the Mozilla Public
       6             :  * License, v. 2.0. If a copy of the MPL was not distributed with this
       7             :  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
       8             :  *
       9             :  * This file incorporates work covered by the following license notice:
      10             :  *
      11             :  *   Licensed to the Apache Software Foundation (ASF) under one or more
      12             :  *   contributor license agreements. See the NOTICE file distributed
      13             :  *   with this work for additional information regarding copyright
      14             :  *   ownership. The ASF licenses this file to you under the Apache
      15             :  *   License, Version 2.0 (the "License"); you may not use this file
      16             :  *   except in compliance with the License. You may obtain a copy of
      17             :  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
      18             :  */
      19             : 
      20             : 
      21             : #include <sal/config.h>
      22             : 
      23             : #include "idlc/astmember.hxx"
      24             : #include "idlc/astoperation.hxx"
      25             : #include "idlc/astservice.hxx"
      26             : #include "idlc/asttype.hxx"
      27             : 
      28          33 : bool AstService::checkLastConstructor() const {
      29          33 :     AstOperation const * last = static_cast< AstOperation const * >(getLast());
      30          96 :     for (DeclList::const_iterator i(getIteratorBegin()); i != getIteratorEnd();
      31             :          ++i)
      32             :     {
      33          68 :         if (*i != last && (*i)->getNodeType() == NT_operation) {
      34           7 :             AstOperation const * ctor = static_cast< AstOperation * >(*i);
      35           7 :             if (ctor->isVariadic() && last->isVariadic()) {
      36           6 :                 return true;
      37             :             }
      38           6 :             sal_uInt32 n = ctor->nMembers();
      39           6 :             if (n == last->nMembers()) {
      40          28 :                 for (DeclList::const_iterator i1(ctor->getIteratorBegin()),
      41           4 :                          i2(last->getIteratorBegin());
      42          16 :                      i1 != ctor->getIteratorEnd(); ++i1, ++i2)
      43             :                 {
      44             :                     sal_Int32 r1;
      45             :                     AstDeclaration const * t1 = deconstructAndResolveTypedefs(
      46           6 :                         static_cast< AstMember * >(*i1)->getType(), &r1);
      47             :                     sal_Int32 r2;
      48             :                     AstDeclaration const * t2 = deconstructAndResolveTypedefs(
      49           6 :                         static_cast< AstMember * >(*i2)->getType(), &r2);
      50           6 :                     if (r1 != r2 || t1->getScopedName() != t2->getScopedName())
      51             :                     {
      52           2 :                         return false;
      53             :                     }
      54             :                 }
      55           2 :                 return true;
      56             :             }
      57             :         }
      58             :     }
      59          28 :     return false;
      60             : }
      61             : 
      62             : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */