qtbindings 4.8.6.3 → 4.8.6.4

data/ext/generator/parser/listnode.cpp

@@ -1,20 +1,20 @@
-/* This file is part of KDevelop
-    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Library General Public
-   License version 2 as published by the Free Software Foundation.
-
-   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 "listnode.h"
-
+/* This file is part of KDevelop
+    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License version 2 as published by the Free Software Foundation.
+
+   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 "listnode.h"
+

data/ext/generator/parser/listnode.h

@@ -1,97 +1,97 @@
-/* This file is part of KDevelop
-    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Library General Public
-   License version 2 as published by the Free Software Foundation.
-
-   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.
-*/
-
-#ifndef LISTNODE_H
-#define LISTNODE_H
-
-#include "memorypool.h"
-
-/**
- * @brief An intrusive list of AST nodes.
- * @note ListNodes inside AST nodes are NOT guarantied to start from the beginning, call toFront.
- */
-template <typename Tp>
-struct ListNode
-{
-  Tp element;
-  int index;
-  mutable const ListNode<Tp> *next;
-
-  static ListNode *create(const Tp &element, pool *p)
-  {
-    ListNode<Tp> *node = new (p->allocate(sizeof(ListNode))) ListNode();
-    node->element = element;
-    node->index = 0;
-    node->next = node;
-
-    return node;
-  }
-
-  static ListNode *create(const ListNode *n1, const Tp &element, pool *p)
-  {
-    ListNode<Tp> *n2 = ListNode::create(element, p);
-
-    n2->index = n1->index + 1;
-    n2->next = n1->next;
-    n1->next = n2;
-
-    return n2;
-  }
-
-  inline const ListNode<Tp> *at(int index) const
-  {
-    const ListNode<Tp> *node = this;
-    while (index != node->index)
-      node = node->next;
-
-    return node;
-  }
-
-  inline bool hasNext() const
-  { return ( next && index < next->index ); }
-
-  inline int count() const
-  { return 1 + toBack()->index; }
-
-  inline const ListNode<Tp> *toFront() const
-  { return toBack()->next; }
-
-  inline const ListNode<Tp> *toBack() const
-  {
-    const ListNode<Tp> *node = this;
-    while (node->hasNext())
-      node = node->next;
-
-    return node;
-  }
-};
-
-template <class Tp>
-inline const ListNode<Tp> *snoc(const ListNode<Tp> *list,
-				const Tp &element, pool *p)
-{
-
-  if (!list)
-    return ListNode<Tp>::create(element, p);
-
-  return ListNode<Tp>::create(list->toBack(), element, p);
-}
-
-#endif // FASTLIST_H
-
-
+/* This file is part of KDevelop
+    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License version 2 as published by the Free Software Foundation.
+
+   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.
+*/
+
+#ifndef LISTNODE_H
+#define LISTNODE_H
+
+#include "memorypool.h"
+
+/**
+ * @brief An intrusive list of AST nodes.
+ * @note ListNodes inside AST nodes are NOT guarantied to start from the beginning, call toFront.
+ */
+template <typename Tp>
+struct ListNode
+{
+  Tp element;
+  int index;
+  mutable const ListNode<Tp> *next;
+
+  static ListNode *create(const Tp &element, pool *p)
+  {
+    ListNode<Tp> *node = new (p->allocate(sizeof(ListNode))) ListNode();
+    node->element = element;
+    node->index = 0;
+    node->next = node;
+
+    return node;
+  }
+
+  static ListNode *create(const ListNode *n1, const Tp &element, pool *p)
+  {
+    ListNode<Tp> *n2 = ListNode::create(element, p);
+
+    n2->index = n1->index + 1;
+    n2->next = n1->next;
+    n1->next = n2;
+
+    return n2;
+  }
+
+  inline const ListNode<Tp> *at(int index) const
+  {
+    const ListNode<Tp> *node = this;
+    while (index != node->index)
+      node = node->next;
+
+    return node;
+  }
+
+  inline bool hasNext() const
+  { return ( next && index < next->index ); }
+
+  inline int count() const
+  { return 1 + toBack()->index; }
+
+  inline const ListNode<Tp> *toFront() const
+  { return toBack()->next; }
+
+  inline const ListNode<Tp> *toBack() const
+  {
+    const ListNode<Tp> *node = this;
+    while (node->hasNext())
+      node = node->next;
+
+    return node;
+  }
+};
+
+template <class Tp>
+inline const ListNode<Tp> *snoc(const ListNode<Tp> *list,
+				const Tp &element, pool *p)
+{
+
+  if (!list)
+    return ListNode<Tp>::create(element, p);
+
+  return ListNode<Tp>::create(list->toBack(), element, p);
+}
+
+#endif // FASTLIST_H
+
+

data/ext/generator/parser/memorypool.cpp

@@ -1,20 +1,20 @@
-/* This file is part of KDevelop
-    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Library General Public
-   License version 2 as published by the Free Software Foundation.
-
-   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 "memorypool.h"
-
+/* This file is part of KDevelop
+    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License version 2 as published by the Free Software Foundation.
+
+   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 "memorypool.h"
+

data/ext/generator/parser/memorypool.h

@@ -1,41 +1,41 @@
-/* This file is part of KDevelop
-    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Library General Public
-   License version 2 as published by the Free Software Foundation.
-
-   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.
-*/
-
-#ifndef MEMORYPOOL_H
-#define MEMORYPOOL_H
-
-#include "rxx_allocator.h"
-#include <cstring>
-
-/**Memory pool for chars.*/
-class pool
-{
-  rxx_allocator<char> __alloc;
-
-public:
-  /**Allocates the @p size bytes in the pool.*/
-  inline void *allocate(std::size_t __size);
-};
-
-inline void *pool::allocate(std::size_t __size)
-{
-  return __alloc.allocate(__size);
-}
-
-#endif // MEMORYPOOL_H
-
+/* This file is part of KDevelop
+    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License version 2 as published by the Free Software Foundation.
+
+   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.
+*/
+
+#ifndef MEMORYPOOL_H
+#define MEMORYPOOL_H
+
+#include "rxx_allocator.h"
+#include <cstring>
+
+/**Memory pool for chars.*/
+class pool
+{
+  rxx_allocator<char> __alloc;
+
+public:
+  /**Allocates the @p size bytes in the pool.*/
+  inline void *allocate(std::size_t __size);
+};
+
+inline void *pool::allocate(std::size_t __size)
+{
+  return __alloc.allocate(__size);
+}
+
+#endif // MEMORYPOOL_H
+

data/ext/generator/parser/name_compiler.cpp

@@ -1,190 +1,190 @@
-/* This file is part of KDevelop
-    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Library General Public
-   License version 2 as published by the Free Software Foundation.
-
-   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.
-*/
-
-//krazy:excludeall=cpp
-
-#include "name_compiler.h"
-#include "type_compiler.h"
-#include "lexer.h"
-#include "symbol.h"
-#include "parsesession.h"
-#include "tokens.h"
-
-#include <QtCore/qdebug.h>
-
-///@todo this is very expensive
-QString decode(ParseSession* session, AST* ast, bool without_spaces = false)
-{
-  QString ret;
-  if( without_spaces ) {
-    //Decode operator-names without spaces for now, since we rely on it in other places.
-    ///@todo change this, here and in all the places that rely on it. Operators should then by written like "operator [ ]"(space between each token)
-    for( size_t a = ast->start_token; a < ast->end_token; a++ ) {
-      ret += session->token_stream->token(a).symbolString();
-    }
-  } else {
-    for( size_t a = ast->start_token; a < ast->end_token; a++ ) {
-      ret += session->token_stream->token(a).symbolString() + ' ';
-    }
-  }
-  return ret;
-}
-
-/*uint parseConstVolatile(ParseSession* session, const ListNode<std::size_t> *cv)
-{
-  uint ret = AbstractType::NoModifiers;
-
-  if (cv) {
-    const ListNode<std::size_t> *it = cv->toFront();
-    const ListNode<std::size_t> *end = it;
-    do {
-      int kind = session->token_stream->kind(it->element);
-      if (kind == Token_const)
-        ret |= AbstractType::ConstModifier;
-      else if (kind == Token_volatile)
-        ret |= AbstractType::VolatileModifier;
-
-      it = it->next;
-    } while (it != end);
-  }
-
-  return ret;
-}*/
-
-/*IndexedTypeIdentifier typeIdentifierFromTemplateArgument(ParseSession* session, TemplateArgumentAST *node)
-{
-  IndexedTypeIdentifier id;
-  if(node->expression) {
-    id = IndexedTypeIdentifier(decode(session, node), true);
-  }else if(node->type_id) {
-    //Parse the pointer operators
-    TypeCompiler tc(session);
-    tc.run(node->type_id->type_specifier);
-    id = IndexedTypeIdentifier(tc.identifier());
-    //node->type_id->type_specifier->cv
-    
-    if(node->type_id->type_specifier)
-      id.setIsConstant(parseConstVolatile(session, node->type_id->type_specifier->cv) & AbstractType::ConstModifier);
-    
-    if(node->type_id->declarator && node->type_id->declarator->ptr_ops)
-    {
-      const ListNode<PtrOperatorAST*> *it = node->type_id->declarator->ptr_ops->toFront();
-      const ListNode<PtrOperatorAST*> *end = it; ///@todo check ordering, eventually walk the list in reversed order
-      do
-        {
-          if(it->element && it->element->op) { ///@todo What about ptr-to-member?
-            static IndexedString ref('&');
-            if( session->token_stream->token(it->element->op).symbol() == ref) {
-              //We're handling a 'reference'
-              id.setIsReference(true);
-            } else {
-              //We're handling a real pointer
-              id.setPointerDepth(id.pointerDepth()+1);
-
-              if(it->element->cv) {
-                id.setIsConstPointer(id.pointerDepth()-1, parseConstVolatile(session, it->element->cv) & AbstractType::ConstModifier);
-              }
-            }
-          }
-          it = it->next;
-        }
-      while (it != end);
-    }
-  }
-  return id;
-}*/
-
-NameCompiler::NameCompiler(ParseSession* session)
-  : m_session(session)
-{
-}
-
-void NameCompiler::internal_run(AST *node)
-{
-  m_name.clear();
-  visit(node);
-}
-
-void NameCompiler::visitUnqualifiedName(UnqualifiedNameAST *node)
-{
-  IndexedString tmp_name;
-
-  if (node->id)
-    tmp_name = m_session->token_stream->token(node->id).symbol();
-
-  if (node->tilde)
-    tmp_name = IndexedString('~' + tmp_name.byteArray());
-
-  if (OperatorFunctionIdAST *op_id = node->operator_id)
-    {
-#if defined(__GNUC__)
-#warning "NameCompiler::visitUnqualifiedName() -- implement me"
-#endif
-      static QString operatorString("operator");
-      QString tmp = operatorString;
-
-      if (op_id->op && op_id->op->op)
-        tmp +=  decode(m_session, op_id->op, true);
-      else
-        tmp += QLatin1String("{...cast...}");
-
-      tmp_name = IndexedString(tmp);
-      m_typeSpecifier = op_id->type_specifier;
-    }
-
-  m_currentIdentifier = tmp_name.str();
-  m_name.push_back(m_currentIdentifier);
-  if (node->template_arguments)
-    {
-      visitNodes(this, node->template_arguments);
-    }/*else if(node->end_token == node->start_token + 3 && node->id == node->start_token && m_session->token_stream->token(node->id+1).symbol() == KDevelop::IndexedString('<')) {
-      ///@todo Represent this nicer in the AST
-      ///It's probably a type-specifier with instantiation of the default-parameter, like "Bla<>".
-      m_currentIdentifier.appendTemplateIdentifier( IndexedTypeIdentifier() );
-    }*/
-}
-
-TypeSpecifierAST* NameCompiler::lastTypeSpecifier() const {
-  return m_typeSpecifier;
-}
-
-void NameCompiler::visitTemplateArgument(TemplateArgumentAST *node)
-{
-    TypeCompiler tc(m_session);
-    tc.run(node->type_id->type_specifier);
-    if (tc.isIntegral())
-        m_templateArgs << tc.qualifiedName().join(" ");
-    else
-        m_templateArgs << tc.qualifiedName().join("::");
-//   m_currentIdentifier.appendTemplateIdentifier( typeIdentifierFromTemplateArgument(m_session, node) );
-}
-
-/*const QualifiedIdentifier& NameCompiler::identifier() const
-{
-  return *_M_name;
-}*/
-
-void NameCompiler::run(NameAST *node/*, QualifiedIdentifier* target*/)
-{
-//   if(target)
-//     _M_name = target;
-//   else
-//     _M_name = &m_localName;
-    
-  m_typeSpecifier = 0; internal_run(node); /*if(node && node->global) _M_name->setExplicitlyGlobal( node->global );*/
-}
+/* This file is part of KDevelop
+    Copyright 2002-2005 Roberto Raggi <roberto@kdevelop.org>
+
+   This library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Library General Public
+   License version 2 as published by the Free Software Foundation.
+
+   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.
+*/
+
+//krazy:excludeall=cpp
+
+#include "name_compiler.h"
+#include "type_compiler.h"
+#include "lexer.h"
+#include "symbol.h"
+#include "parsesession.h"
+#include "tokens.h"
+
+#include <QtCore/qdebug.h>
+
+///@todo this is very expensive
+QString decode(ParseSession* session, AST* ast, bool without_spaces = false)
+{
+  QString ret;
+  if( without_spaces ) {
+    //Decode operator-names without spaces for now, since we rely on it in other places.
+    ///@todo change this, here and in all the places that rely on it. Operators should then by written like "operator [ ]"(space between each token)
+    for( size_t a = ast->start_token; a < ast->end_token; a++ ) {
+      ret += session->token_stream->token(a).symbolString();
+    }
+  } else {
+    for( size_t a = ast->start_token; a < ast->end_token; a++ ) {
+      ret += session->token_stream->token(a).symbolString() + ' ';
+    }
+  }
+  return ret;
+}
+
+/*uint parseConstVolatile(ParseSession* session, const ListNode<std::size_t> *cv)
+{
+  uint ret = AbstractType::NoModifiers;
+
+  if (cv) {
+    const ListNode<std::size_t> *it = cv->toFront();
+    const ListNode<std::size_t> *end = it;
+    do {
+      int kind = session->token_stream->kind(it->element);
+      if (kind == Token_const)
+        ret |= AbstractType::ConstModifier;
+      else if (kind == Token_volatile)
+        ret |= AbstractType::VolatileModifier;
+
+      it = it->next;
+    } while (it != end);
+  }
+
+  return ret;
+}*/
+
+/*IndexedTypeIdentifier typeIdentifierFromTemplateArgument(ParseSession* session, TemplateArgumentAST *node)
+{
+  IndexedTypeIdentifier id;
+  if(node->expression) {
+    id = IndexedTypeIdentifier(decode(session, node), true);
+  }else if(node->type_id) {
+    //Parse the pointer operators
+    TypeCompiler tc(session);
+    tc.run(node->type_id->type_specifier);
+    id = IndexedTypeIdentifier(tc.identifier());
+    //node->type_id->type_specifier->cv
+    
+    if(node->type_id->type_specifier)
+      id.setIsConstant(parseConstVolatile(session, node->type_id->type_specifier->cv) & AbstractType::ConstModifier);
+    
+    if(node->type_id->declarator && node->type_id->declarator->ptr_ops)
+    {
+      const ListNode<PtrOperatorAST*> *it = node->type_id->declarator->ptr_ops->toFront();
+      const ListNode<PtrOperatorAST*> *end = it; ///@todo check ordering, eventually walk the list in reversed order
+      do
+        {
+          if(it->element && it->element->op) { ///@todo What about ptr-to-member?
+            static IndexedString ref('&');
+            if( session->token_stream->token(it->element->op).symbol() == ref) {
+              //We're handling a 'reference'
+              id.setIsReference(true);
+            } else {
+              //We're handling a real pointer
+              id.setPointerDepth(id.pointerDepth()+1);
+
+              if(it->element->cv) {
+                id.setIsConstPointer(id.pointerDepth()-1, parseConstVolatile(session, it->element->cv) & AbstractType::ConstModifier);
+              }
+            }
+          }
+          it = it->next;
+        }
+      while (it != end);
+    }
+  }
+  return id;
+}*/
+
+NameCompiler::NameCompiler(ParseSession* session)
+  : m_session(session)
+{
+}
+
+void NameCompiler::internal_run(AST *node)
+{
+  m_name.clear();
+  visit(node);
+}
+
+void NameCompiler::visitUnqualifiedName(UnqualifiedNameAST *node)
+{
+  IndexedString tmp_name;
+
+  if (node->id)
+    tmp_name = m_session->token_stream->token(node->id).symbol();
+
+  if (node->tilde)
+    tmp_name = IndexedString('~' + tmp_name.byteArray());
+
+  if (OperatorFunctionIdAST *op_id = node->operator_id)
+    {
+#if defined(__GNUC__)
+#warning "NameCompiler::visitUnqualifiedName() -- implement me"
+#endif
+      static QString operatorString("operator");
+      QString tmp = operatorString;
+
+      if (op_id->op && op_id->op->op)
+        tmp +=  decode(m_session, op_id->op, true);
+      else
+        tmp += QLatin1String("{...cast...}");
+
+      tmp_name = IndexedString(tmp);
+      m_typeSpecifier = op_id->type_specifier;
+    }
+
+  m_currentIdentifier = tmp_name.str();
+  m_name.push_back(m_currentIdentifier);
+  if (node->template_arguments)
+    {
+      visitNodes(this, node->template_arguments);
+    }/*else if(node->end_token == node->start_token + 3 && node->id == node->start_token && m_session->token_stream->token(node->id+1).symbol() == KDevelop::IndexedString('<')) {
+      ///@todo Represent this nicer in the AST
+      ///It's probably a type-specifier with instantiation of the default-parameter, like "Bla<>".
+      m_currentIdentifier.appendTemplateIdentifier( IndexedTypeIdentifier() );
+    }*/
+}
+
+TypeSpecifierAST* NameCompiler::lastTypeSpecifier() const {
+  return m_typeSpecifier;
+}
+
+void NameCompiler::visitTemplateArgument(TemplateArgumentAST *node)
+{
+    TypeCompiler tc(m_session);
+    tc.run(node->type_id->type_specifier);
+    if (tc.isIntegral())
+        m_templateArgs << tc.qualifiedName().join(" ");
+    else
+        m_templateArgs << tc.qualifiedName().join("::");
+//   m_currentIdentifier.appendTemplateIdentifier( typeIdentifierFromTemplateArgument(m_session, node) );
+}
+
+/*const QualifiedIdentifier& NameCompiler::identifier() const
+{
+  return *_M_name;
+}*/
+
+void NameCompiler::run(NameAST *node/*, QualifiedIdentifier* target*/)
+{
+//   if(target)
+//     _M_name = target;
+//   else
+//     _M_name = &m_localName;
+    
+  m_typeSpecifier = 0; internal_run(node); /*if(node && node->global) _M_name->setExplicitlyGlobal( node->global );*/
+}