|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the qt3to4 porting application of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include "replacetoken.h" |
|
43 #include "tokenreplacements.h" |
|
44 #include <QByteArray> |
|
45 |
|
46 QT_BEGIN_NAMESPACE |
|
47 |
|
48 /* |
|
49 Add an entry to the tokenRuleLookup map for each token replacement rule. |
|
50 */ |
|
51 ReplaceToken::ReplaceToken(const QList<TokenReplacement*> &tokenReplacementRules) |
|
52 :tokenReplacementRules(tokenReplacementRules) |
|
53 { |
|
54 foreach (TokenReplacement* rep, tokenReplacementRules) { |
|
55 QByteArray key = rep->getReplaceKey(); |
|
56 if(!key.isEmpty()) { |
|
57 tokenRuleLookup.insert(key, rep); |
|
58 } |
|
59 } |
|
60 } |
|
61 |
|
62 TextReplacements ReplaceToken::getTokenTextReplacements(const TokenEngine::TokenContainer &container) |
|
63 { |
|
64 TextReplacements textReplacements; |
|
65 |
|
66 int t=0; |
|
67 const int numTokens = container.count(); |
|
68 while(t < numTokens) { |
|
69 QByteArray tokenText = container.text(t); |
|
70 bool changed = false; |
|
71 |
|
72 if(isPreprocessorDirective(tokenText)) { |
|
73 foreach(TokenReplacement *tokenReplacementRule, tokenReplacementRules) { |
|
74 if(!changed) |
|
75 changed = tokenReplacementRule->doReplace(container, t, textReplacements); |
|
76 if(changed) |
|
77 break; |
|
78 } |
|
79 } else if (isInterestingToken(tokenText.trimmed())) { |
|
80 foreach (TokenReplacement* value, tokenRuleLookup.values(tokenText)) { |
|
81 changed = value->doReplace(container, t, textReplacements); |
|
82 if(changed) { |
|
83 goto end; |
|
84 } |
|
85 } |
|
86 } |
|
87 end: |
|
88 ++t; |
|
89 } |
|
90 return textReplacements; |
|
91 } |
|
92 |
|
93 bool ReplaceToken::isInterestingToken(const QByteArray &text) |
|
94 { |
|
95 return !(text.isEmpty() || text==";" || text=="(" || text==")" || text=="{" || text=="}" || text=="=" |
|
96 || text=="+=" || text=="-=" || text=="if" || text=="then" || text=="else" |
|
97 ); |
|
98 } |
|
99 |
|
100 bool ReplaceToken::isPreprocessorDirective(const QByteArray &token) |
|
101 { |
|
102 return (token[0]=='#'); |
|
103 } |
|
104 |
|
105 QT_END_NAMESPACE |