Thu, 09 Oct 2008 16:07:38 +0100
6406133: JCDiagnostic.getMessage ignores locale argument
Summary: Compiler API should take into account locale settings
Reviewed-by: jjg
duke@1 | 1 | /* |
xdono@117 | 2 | * Copyright 1999-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@1 | 7 | * published by the Free Software Foundation. Sun designates this |
duke@1 | 8 | * particular file as subject to the "Classpath" exception as provided |
duke@1 | 9 | * by Sun in the LICENSE file that accompanied this code. |
duke@1 | 10 | * |
duke@1 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 15 | * accompanied this code). |
duke@1 | 16 | * |
duke@1 | 17 | * You should have received a copy of the GNU General Public License version |
duke@1 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 20 | * |
duke@1 | 21 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@1 | 22 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@1 | 23 | * have any questions. |
duke@1 | 24 | */ |
duke@1 | 25 | |
duke@1 | 26 | package com.sun.tools.javac.tree; |
duke@1 | 27 | |
duke@1 | 28 | import com.sun.source.tree.Tree; |
duke@1 | 29 | import com.sun.tools.javac.comp.AttrContext; |
duke@1 | 30 | import com.sun.tools.javac.comp.Env; |
duke@1 | 31 | import java.util.Map; |
duke@1 | 32 | import com.sun.tools.javac.util.*; |
duke@1 | 33 | import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition; |
duke@1 | 34 | import com.sun.tools.javac.code.*; |
duke@1 | 35 | import com.sun.tools.javac.tree.JCTree.*; |
duke@1 | 36 | |
duke@1 | 37 | import static com.sun.tools.javac.code.Flags.*; |
duke@1 | 38 | |
duke@1 | 39 | /** Utility class containing inspector methods for trees. |
duke@1 | 40 | * |
duke@1 | 41 | * <p><b>This is NOT part of any API supported by Sun Microsystems. If |
duke@1 | 42 | * you write code that depends on this, you do so at your own risk. |
duke@1 | 43 | * This code and its internal interfaces are subject to change or |
duke@1 | 44 | * deletion without notice.</b> |
duke@1 | 45 | */ |
duke@1 | 46 | public class TreeInfo { |
duke@1 | 47 | protected static final Context.Key<TreeInfo> treeInfoKey = |
duke@1 | 48 | new Context.Key<TreeInfo>(); |
duke@1 | 49 | |
duke@1 | 50 | public static TreeInfo instance(Context context) { |
duke@1 | 51 | TreeInfo instance = context.get(treeInfoKey); |
duke@1 | 52 | if (instance == null) |
duke@1 | 53 | instance = new TreeInfo(context); |
duke@1 | 54 | return instance; |
duke@1 | 55 | } |
duke@1 | 56 | |
duke@1 | 57 | /** The names of all operators. |
duke@1 | 58 | */ |
duke@1 | 59 | private Name[] opname = new Name[JCTree.MOD - JCTree.POS + 1]; |
duke@1 | 60 | |
duke@1 | 61 | private TreeInfo(Context context) { |
duke@1 | 62 | context.put(treeInfoKey, this); |
duke@1 | 63 | |
jjg@113 | 64 | Names names = Names.instance(context); |
duke@1 | 65 | opname[JCTree.POS - JCTree.POS] = names.fromString("+"); |
duke@1 | 66 | opname[JCTree.NEG - JCTree.POS] = names.hyphen; |
duke@1 | 67 | opname[JCTree.NOT - JCTree.POS] = names.fromString("!"); |
duke@1 | 68 | opname[JCTree.COMPL - JCTree.POS] = names.fromString("~"); |
duke@1 | 69 | opname[JCTree.PREINC - JCTree.POS] = names.fromString("++"); |
duke@1 | 70 | opname[JCTree.PREDEC - JCTree.POS] = names.fromString("--"); |
duke@1 | 71 | opname[JCTree.POSTINC - JCTree.POS] = names.fromString("++"); |
duke@1 | 72 | opname[JCTree.POSTDEC - JCTree.POS] = names.fromString("--"); |
duke@1 | 73 | opname[JCTree.NULLCHK - JCTree.POS] = names.fromString("<*nullchk*>"); |
duke@1 | 74 | opname[JCTree.OR - JCTree.POS] = names.fromString("||"); |
duke@1 | 75 | opname[JCTree.AND - JCTree.POS] = names.fromString("&&"); |
duke@1 | 76 | opname[JCTree.EQ - JCTree.POS] = names.fromString("=="); |
duke@1 | 77 | opname[JCTree.NE - JCTree.POS] = names.fromString("!="); |
duke@1 | 78 | opname[JCTree.LT - JCTree.POS] = names.fromString("<"); |
duke@1 | 79 | opname[JCTree.GT - JCTree.POS] = names.fromString(">"); |
duke@1 | 80 | opname[JCTree.LE - JCTree.POS] = names.fromString("<="); |
duke@1 | 81 | opname[JCTree.GE - JCTree.POS] = names.fromString(">="); |
duke@1 | 82 | opname[JCTree.BITOR - JCTree.POS] = names.fromString("|"); |
duke@1 | 83 | opname[JCTree.BITXOR - JCTree.POS] = names.fromString("^"); |
duke@1 | 84 | opname[JCTree.BITAND - JCTree.POS] = names.fromString("&"); |
duke@1 | 85 | opname[JCTree.SL - JCTree.POS] = names.fromString("<<"); |
duke@1 | 86 | opname[JCTree.SR - JCTree.POS] = names.fromString(">>"); |
duke@1 | 87 | opname[JCTree.USR - JCTree.POS] = names.fromString(">>>"); |
duke@1 | 88 | opname[JCTree.PLUS - JCTree.POS] = names.fromString("+"); |
duke@1 | 89 | opname[JCTree.MINUS - JCTree.POS] = names.hyphen; |
duke@1 | 90 | opname[JCTree.MUL - JCTree.POS] = names.asterisk; |
duke@1 | 91 | opname[JCTree.DIV - JCTree.POS] = names.slash; |
duke@1 | 92 | opname[JCTree.MOD - JCTree.POS] = names.fromString("%"); |
duke@1 | 93 | } |
duke@1 | 94 | |
duke@1 | 95 | |
duke@1 | 96 | /** Return name of operator with given tree tag. |
duke@1 | 97 | */ |
duke@1 | 98 | public Name operatorName(int tag) { |
duke@1 | 99 | return opname[tag - JCTree.POS]; |
duke@1 | 100 | } |
duke@1 | 101 | |
duke@1 | 102 | /** Is tree a constructor declaration? |
duke@1 | 103 | */ |
duke@1 | 104 | public static boolean isConstructor(JCTree tree) { |
duke@1 | 105 | if (tree.getTag() == JCTree.METHODDEF) { |
duke@1 | 106 | Name name = ((JCMethodDecl) tree).name; |
jjg@113 | 107 | return name == name.table.names.init; |
duke@1 | 108 | } else { |
duke@1 | 109 | return false; |
duke@1 | 110 | } |
duke@1 | 111 | } |
duke@1 | 112 | |
duke@1 | 113 | /** Is there a constructor declaration in the given list of trees? |
duke@1 | 114 | */ |
duke@1 | 115 | public static boolean hasConstructors(List<JCTree> trees) { |
duke@1 | 116 | for (List<JCTree> l = trees; l.nonEmpty(); l = l.tail) |
duke@1 | 117 | if (isConstructor(l.head)) return true; |
duke@1 | 118 | return false; |
duke@1 | 119 | } |
duke@1 | 120 | |
duke@1 | 121 | /** Is statement an initializer for a synthetic field? |
duke@1 | 122 | */ |
duke@1 | 123 | public static boolean isSyntheticInit(JCTree stat) { |
duke@1 | 124 | if (stat.getTag() == JCTree.EXEC) { |
duke@1 | 125 | JCExpressionStatement exec = (JCExpressionStatement)stat; |
duke@1 | 126 | if (exec.expr.getTag() == JCTree.ASSIGN) { |
duke@1 | 127 | JCAssign assign = (JCAssign)exec.expr; |
duke@1 | 128 | if (assign.lhs.getTag() == JCTree.SELECT) { |
duke@1 | 129 | JCFieldAccess select = (JCFieldAccess)assign.lhs; |
duke@1 | 130 | if (select.sym != null && |
duke@1 | 131 | (select.sym.flags() & SYNTHETIC) != 0) { |
duke@1 | 132 | Name selected = name(select.selected); |
jjg@113 | 133 | if (selected != null && selected == selected.table.names._this) |
duke@1 | 134 | return true; |
duke@1 | 135 | } |
duke@1 | 136 | } |
duke@1 | 137 | } |
duke@1 | 138 | } |
duke@1 | 139 | return false; |
duke@1 | 140 | } |
duke@1 | 141 | |
duke@1 | 142 | /** If the expression is a method call, return the method name, null |
duke@1 | 143 | * otherwise. */ |
duke@1 | 144 | public static Name calledMethodName(JCTree tree) { |
duke@1 | 145 | if (tree.getTag() == JCTree.EXEC) { |
duke@1 | 146 | JCExpressionStatement exec = (JCExpressionStatement)tree; |
duke@1 | 147 | if (exec.expr.getTag() == JCTree.APPLY) { |
duke@1 | 148 | Name mname = TreeInfo.name(((JCMethodInvocation) exec.expr).meth); |
duke@1 | 149 | return mname; |
duke@1 | 150 | } |
duke@1 | 151 | } |
duke@1 | 152 | return null; |
duke@1 | 153 | } |
duke@1 | 154 | |
duke@1 | 155 | /** Is this a call to this or super? |
duke@1 | 156 | */ |
duke@1 | 157 | public static boolean isSelfCall(JCTree tree) { |
duke@1 | 158 | Name name = calledMethodName(tree); |
duke@1 | 159 | if (name != null) { |
jjg@113 | 160 | Names names = name.table.names; |
duke@1 | 161 | return name==names._this || name==names._super; |
duke@1 | 162 | } else { |
duke@1 | 163 | return false; |
duke@1 | 164 | } |
duke@1 | 165 | } |
duke@1 | 166 | |
duke@1 | 167 | /** Is this a call to super? |
duke@1 | 168 | */ |
duke@1 | 169 | public static boolean isSuperCall(JCTree tree) { |
duke@1 | 170 | Name name = calledMethodName(tree); |
duke@1 | 171 | if (name != null) { |
jjg@113 | 172 | Names names = name.table.names; |
duke@1 | 173 | return name==names._super; |
duke@1 | 174 | } else { |
duke@1 | 175 | return false; |
duke@1 | 176 | } |
duke@1 | 177 | } |
duke@1 | 178 | |
duke@1 | 179 | /** Is this a constructor whose first (non-synthetic) statement is not |
duke@1 | 180 | * of the form this(...)? |
duke@1 | 181 | */ |
duke@1 | 182 | public static boolean isInitialConstructor(JCTree tree) { |
duke@1 | 183 | JCMethodInvocation app = firstConstructorCall(tree); |
duke@1 | 184 | if (app == null) return false; |
duke@1 | 185 | Name meth = name(app.meth); |
jjg@113 | 186 | return meth == null || meth != meth.table.names._this; |
duke@1 | 187 | } |
duke@1 | 188 | |
duke@1 | 189 | /** Return the first call in a constructor definition. */ |
duke@1 | 190 | public static JCMethodInvocation firstConstructorCall(JCTree tree) { |
duke@1 | 191 | if (tree.getTag() != JCTree.METHODDEF) return null; |
duke@1 | 192 | JCMethodDecl md = (JCMethodDecl) tree; |
jjg@113 | 193 | Names names = md.name.table.names; |
duke@1 | 194 | if (md.name != names.init) return null; |
duke@1 | 195 | if (md.body == null) return null; |
duke@1 | 196 | List<JCStatement> stats = md.body.stats; |
duke@1 | 197 | // Synthetic initializations can appear before the super call. |
duke@1 | 198 | while (stats.nonEmpty() && isSyntheticInit(stats.head)) |
duke@1 | 199 | stats = stats.tail; |
duke@1 | 200 | if (stats.isEmpty()) return null; |
duke@1 | 201 | if (stats.head.getTag() != JCTree.EXEC) return null; |
duke@1 | 202 | JCExpressionStatement exec = (JCExpressionStatement) stats.head; |
duke@1 | 203 | if (exec.expr.getTag() != JCTree.APPLY) return null; |
duke@1 | 204 | return (JCMethodInvocation)exec.expr; |
duke@1 | 205 | } |
duke@1 | 206 | |
duke@1 | 207 | /** Return true if a tree represents the null literal. */ |
duke@1 | 208 | public static boolean isNull(JCTree tree) { |
duke@1 | 209 | if (tree.getTag() != JCTree.LITERAL) |
duke@1 | 210 | return false; |
duke@1 | 211 | JCLiteral lit = (JCLiteral) tree; |
duke@1 | 212 | return (lit.typetag == TypeTags.BOT); |
duke@1 | 213 | } |
duke@1 | 214 | |
duke@1 | 215 | /** The position of the first statement in a block, or the position of |
duke@1 | 216 | * the block itself if it is empty. |
duke@1 | 217 | */ |
duke@1 | 218 | public static int firstStatPos(JCTree tree) { |
duke@1 | 219 | if (tree.getTag() == JCTree.BLOCK && ((JCBlock) tree).stats.nonEmpty()) |
duke@1 | 220 | return ((JCBlock) tree).stats.head.pos; |
duke@1 | 221 | else |
duke@1 | 222 | return tree.pos; |
duke@1 | 223 | } |
duke@1 | 224 | |
duke@1 | 225 | /** The end position of given tree, if it is a block with |
duke@1 | 226 | * defined endpos. |
duke@1 | 227 | */ |
duke@1 | 228 | public static int endPos(JCTree tree) { |
duke@1 | 229 | if (tree.getTag() == JCTree.BLOCK && ((JCBlock) tree).endpos != Position.NOPOS) |
duke@1 | 230 | return ((JCBlock) tree).endpos; |
duke@1 | 231 | else if (tree.getTag() == JCTree.SYNCHRONIZED) |
duke@1 | 232 | return endPos(((JCSynchronized) tree).body); |
duke@1 | 233 | else if (tree.getTag() == JCTree.TRY) { |
duke@1 | 234 | JCTry t = (JCTry) tree; |
duke@1 | 235 | return endPos((t.finalizer != null) |
duke@1 | 236 | ? t.finalizer |
duke@1 | 237 | : t.catchers.last().body); |
duke@1 | 238 | } else |
duke@1 | 239 | return tree.pos; |
duke@1 | 240 | } |
duke@1 | 241 | |
duke@1 | 242 | |
duke@1 | 243 | /** Get the start position for a tree node. The start position is |
duke@1 | 244 | * defined to be the position of the first character of the first |
duke@1 | 245 | * token of the node's source text. |
duke@1 | 246 | * @param tree The tree node |
duke@1 | 247 | */ |
duke@1 | 248 | public static int getStartPos(JCTree tree) { |
duke@1 | 249 | if (tree == null) |
duke@1 | 250 | return Position.NOPOS; |
duke@1 | 251 | |
duke@1 | 252 | switch(tree.getTag()) { |
duke@1 | 253 | case(JCTree.APPLY): |
duke@1 | 254 | return getStartPos(((JCMethodInvocation) tree).meth); |
duke@1 | 255 | case(JCTree.ASSIGN): |
duke@1 | 256 | return getStartPos(((JCAssign) tree).lhs); |
duke@1 | 257 | case(JCTree.BITOR_ASG): case(JCTree.BITXOR_ASG): case(JCTree.BITAND_ASG): |
duke@1 | 258 | case(JCTree.SL_ASG): case(JCTree.SR_ASG): case(JCTree.USR_ASG): |
duke@1 | 259 | case(JCTree.PLUS_ASG): case(JCTree.MINUS_ASG): case(JCTree.MUL_ASG): |
duke@1 | 260 | case(JCTree.DIV_ASG): case(JCTree.MOD_ASG): |
duke@1 | 261 | return getStartPos(((JCAssignOp) tree).lhs); |
duke@1 | 262 | case(JCTree.OR): case(JCTree.AND): case(JCTree.BITOR): |
duke@1 | 263 | case(JCTree.BITXOR): case(JCTree.BITAND): case(JCTree.EQ): |
duke@1 | 264 | case(JCTree.NE): case(JCTree.LT): case(JCTree.GT): |
duke@1 | 265 | case(JCTree.LE): case(JCTree.GE): case(JCTree.SL): |
duke@1 | 266 | case(JCTree.SR): case(JCTree.USR): case(JCTree.PLUS): |
duke@1 | 267 | case(JCTree.MINUS): case(JCTree.MUL): case(JCTree.DIV): |
duke@1 | 268 | case(JCTree.MOD): |
duke@1 | 269 | return getStartPos(((JCBinary) tree).lhs); |
duke@1 | 270 | case(JCTree.CLASSDEF): { |
duke@1 | 271 | JCClassDecl node = (JCClassDecl)tree; |
duke@1 | 272 | if (node.mods.pos != Position.NOPOS) |
duke@1 | 273 | return node.mods.pos; |
duke@1 | 274 | break; |
duke@1 | 275 | } |
duke@1 | 276 | case(JCTree.CONDEXPR): |
duke@1 | 277 | return getStartPos(((JCConditional) tree).cond); |
duke@1 | 278 | case(JCTree.EXEC): |
duke@1 | 279 | return getStartPos(((JCExpressionStatement) tree).expr); |
duke@1 | 280 | case(JCTree.INDEXED): |
duke@1 | 281 | return getStartPos(((JCArrayAccess) tree).indexed); |
duke@1 | 282 | case(JCTree.METHODDEF): { |
duke@1 | 283 | JCMethodDecl node = (JCMethodDecl)tree; |
duke@1 | 284 | if (node.mods.pos != Position.NOPOS) |
duke@1 | 285 | return node.mods.pos; |
duke@1 | 286 | if (node.typarams.nonEmpty()) // List.nil() used for no typarams |
duke@1 | 287 | return getStartPos(node.typarams.head); |
duke@1 | 288 | return node.restype == null ? node.pos : getStartPos(node.restype); |
duke@1 | 289 | } |
duke@1 | 290 | case(JCTree.SELECT): |
duke@1 | 291 | return getStartPos(((JCFieldAccess) tree).selected); |
duke@1 | 292 | case(JCTree.TYPEAPPLY): |
duke@1 | 293 | return getStartPos(((JCTypeApply) tree).clazz); |
duke@1 | 294 | case(JCTree.TYPEARRAY): |
duke@1 | 295 | return getStartPos(((JCArrayTypeTree) tree).elemtype); |
duke@1 | 296 | case(JCTree.TYPETEST): |
duke@1 | 297 | return getStartPos(((JCInstanceOf) tree).expr); |
duke@1 | 298 | case(JCTree.POSTINC): |
duke@1 | 299 | case(JCTree.POSTDEC): |
duke@1 | 300 | return getStartPos(((JCUnary) tree).arg); |
duke@1 | 301 | case(JCTree.VARDEF): { |
duke@1 | 302 | JCVariableDecl node = (JCVariableDecl)tree; |
duke@1 | 303 | if (node.mods.pos != Position.NOPOS) { |
duke@1 | 304 | return node.mods.pos; |
duke@1 | 305 | } else { |
duke@1 | 306 | return getStartPos(node.vartype); |
duke@1 | 307 | } |
duke@1 | 308 | } |
duke@1 | 309 | case(JCTree.ERRONEOUS): { |
duke@1 | 310 | JCErroneous node = (JCErroneous)tree; |
duke@1 | 311 | if (node.errs != null && node.errs.nonEmpty()) |
duke@1 | 312 | return getStartPos(node.errs.head); |
duke@1 | 313 | } |
duke@1 | 314 | } |
duke@1 | 315 | return tree.pos; |
duke@1 | 316 | } |
duke@1 | 317 | |
duke@1 | 318 | /** The end position of given tree, given a table of end positions generated by the parser |
duke@1 | 319 | */ |
duke@1 | 320 | public static int getEndPos(JCTree tree, Map<JCTree, Integer> endPositions) { |
duke@1 | 321 | if (tree == null) |
duke@1 | 322 | return Position.NOPOS; |
duke@1 | 323 | |
duke@1 | 324 | if (endPositions == null) { |
duke@1 | 325 | // fall back on limited info in the tree |
duke@1 | 326 | return endPos(tree); |
duke@1 | 327 | } |
duke@1 | 328 | |
duke@1 | 329 | Integer mapPos = endPositions.get(tree); |
duke@1 | 330 | if (mapPos != null) |
duke@1 | 331 | return mapPos; |
duke@1 | 332 | |
duke@1 | 333 | switch(tree.getTag()) { |
duke@1 | 334 | case(JCTree.BITOR_ASG): case(JCTree.BITXOR_ASG): case(JCTree.BITAND_ASG): |
duke@1 | 335 | case(JCTree.SL_ASG): case(JCTree.SR_ASG): case(JCTree.USR_ASG): |
duke@1 | 336 | case(JCTree.PLUS_ASG): case(JCTree.MINUS_ASG): case(JCTree.MUL_ASG): |
duke@1 | 337 | case(JCTree.DIV_ASG): case(JCTree.MOD_ASG): |
duke@1 | 338 | return getEndPos(((JCAssignOp) tree).rhs, endPositions); |
duke@1 | 339 | case(JCTree.OR): case(JCTree.AND): case(JCTree.BITOR): |
duke@1 | 340 | case(JCTree.BITXOR): case(JCTree.BITAND): case(JCTree.EQ): |
duke@1 | 341 | case(JCTree.NE): case(JCTree.LT): case(JCTree.GT): |
duke@1 | 342 | case(JCTree.LE): case(JCTree.GE): case(JCTree.SL): |
duke@1 | 343 | case(JCTree.SR): case(JCTree.USR): case(JCTree.PLUS): |
duke@1 | 344 | case(JCTree.MINUS): case(JCTree.MUL): case(JCTree.DIV): |
duke@1 | 345 | case(JCTree.MOD): |
duke@1 | 346 | return getEndPos(((JCBinary) tree).rhs, endPositions); |
duke@1 | 347 | case(JCTree.CASE): |
duke@1 | 348 | return getEndPos(((JCCase) tree).stats.last(), endPositions); |
duke@1 | 349 | case(JCTree.CATCH): |
duke@1 | 350 | return getEndPos(((JCCatch) tree).body, endPositions); |
duke@1 | 351 | case(JCTree.CONDEXPR): |
duke@1 | 352 | return getEndPos(((JCConditional) tree).falsepart, endPositions); |
duke@1 | 353 | case(JCTree.FORLOOP): |
duke@1 | 354 | return getEndPos(((JCForLoop) tree).body, endPositions); |
duke@1 | 355 | case(JCTree.FOREACHLOOP): |
duke@1 | 356 | return getEndPos(((JCEnhancedForLoop) tree).body, endPositions); |
duke@1 | 357 | case(JCTree.IF): { |
duke@1 | 358 | JCIf node = (JCIf)tree; |
duke@1 | 359 | if (node.elsepart == null) { |
duke@1 | 360 | return getEndPos(node.thenpart, endPositions); |
duke@1 | 361 | } else { |
duke@1 | 362 | return getEndPos(node.elsepart, endPositions); |
duke@1 | 363 | } |
duke@1 | 364 | } |
duke@1 | 365 | case(JCTree.LABELLED): |
duke@1 | 366 | return getEndPos(((JCLabeledStatement) tree).body, endPositions); |
duke@1 | 367 | case(JCTree.MODIFIERS): |
duke@1 | 368 | return getEndPos(((JCModifiers) tree).annotations.last(), endPositions); |
duke@1 | 369 | case(JCTree.SYNCHRONIZED): |
duke@1 | 370 | return getEndPos(((JCSynchronized) tree).body, endPositions); |
duke@1 | 371 | case(JCTree.TOPLEVEL): |
duke@1 | 372 | return getEndPos(((JCCompilationUnit) tree).defs.last(), endPositions); |
duke@1 | 373 | case(JCTree.TRY): { |
duke@1 | 374 | JCTry node = (JCTry)tree; |
duke@1 | 375 | if (node.finalizer != null) { |
duke@1 | 376 | return getEndPos(node.finalizer, endPositions); |
duke@1 | 377 | } else if (!node.catchers.isEmpty()) { |
duke@1 | 378 | return getEndPos(node.catchers.last(), endPositions); |
duke@1 | 379 | } else { |
duke@1 | 380 | return getEndPos(node.body, endPositions); |
duke@1 | 381 | } |
duke@1 | 382 | } |
duke@1 | 383 | case(JCTree.WILDCARD): |
duke@1 | 384 | return getEndPos(((JCWildcard) tree).inner, endPositions); |
duke@1 | 385 | case(JCTree.TYPECAST): |
duke@1 | 386 | return getEndPos(((JCTypeCast) tree).expr, endPositions); |
duke@1 | 387 | case(JCTree.TYPETEST): |
duke@1 | 388 | return getEndPos(((JCInstanceOf) tree).clazz, endPositions); |
duke@1 | 389 | case(JCTree.POS): |
duke@1 | 390 | case(JCTree.NEG): |
duke@1 | 391 | case(JCTree.NOT): |
duke@1 | 392 | case(JCTree.COMPL): |
duke@1 | 393 | case(JCTree.PREINC): |
duke@1 | 394 | case(JCTree.PREDEC): |
duke@1 | 395 | return getEndPos(((JCUnary) tree).arg, endPositions); |
duke@1 | 396 | case(JCTree.WHILELOOP): |
duke@1 | 397 | return getEndPos(((JCWhileLoop) tree).body, endPositions); |
duke@1 | 398 | case(JCTree.ERRONEOUS): { |
duke@1 | 399 | JCErroneous node = (JCErroneous)tree; |
duke@1 | 400 | if (node.errs != null && node.errs.nonEmpty()) |
duke@1 | 401 | return getEndPos(node.errs.last(), endPositions); |
duke@1 | 402 | } |
duke@1 | 403 | } |
duke@1 | 404 | return Position.NOPOS; |
duke@1 | 405 | } |
duke@1 | 406 | |
duke@1 | 407 | |
duke@1 | 408 | /** A DiagnosticPosition with the preferred position set to the |
duke@1 | 409 | * end position of given tree, if it is a block with |
duke@1 | 410 | * defined endpos. |
duke@1 | 411 | */ |
duke@1 | 412 | public static DiagnosticPosition diagEndPos(final JCTree tree) { |
duke@1 | 413 | final int endPos = TreeInfo.endPos(tree); |
duke@1 | 414 | return new DiagnosticPosition() { |
duke@1 | 415 | public JCTree getTree() { return tree; } |
duke@1 | 416 | public int getStartPosition() { return TreeInfo.getStartPos(tree); } |
duke@1 | 417 | public int getPreferredPosition() { return endPos; } |
duke@1 | 418 | public int getEndPosition(Map<JCTree, Integer> endPosTable) { |
duke@1 | 419 | return TreeInfo.getEndPos(tree, endPosTable); |
duke@1 | 420 | } |
duke@1 | 421 | }; |
duke@1 | 422 | } |
duke@1 | 423 | |
duke@1 | 424 | /** The position of the finalizer of given try/synchronized statement. |
duke@1 | 425 | */ |
duke@1 | 426 | public static int finalizerPos(JCTree tree) { |
duke@1 | 427 | if (tree.getTag() == JCTree.TRY) { |
duke@1 | 428 | JCTry t = (JCTry) tree; |
duke@1 | 429 | assert t.finalizer != null; |
duke@1 | 430 | return firstStatPos(t.finalizer); |
duke@1 | 431 | } else if (tree.getTag() == JCTree.SYNCHRONIZED) { |
duke@1 | 432 | return endPos(((JCSynchronized) tree).body); |
duke@1 | 433 | } else { |
duke@1 | 434 | throw new AssertionError(); |
duke@1 | 435 | } |
duke@1 | 436 | } |
duke@1 | 437 | |
duke@1 | 438 | /** Find the position for reporting an error about a symbol, where |
duke@1 | 439 | * that symbol is defined somewhere in the given tree. */ |
duke@1 | 440 | public static int positionFor(final Symbol sym, final JCTree tree) { |
duke@1 | 441 | JCTree decl = declarationFor(sym, tree); |
duke@1 | 442 | return ((decl != null) ? decl : tree).pos; |
duke@1 | 443 | } |
duke@1 | 444 | |
duke@1 | 445 | /** Find the position for reporting an error about a symbol, where |
duke@1 | 446 | * that symbol is defined somewhere in the given tree. */ |
duke@1 | 447 | public static DiagnosticPosition diagnosticPositionFor(final Symbol sym, final JCTree tree) { |
duke@1 | 448 | JCTree decl = declarationFor(sym, tree); |
duke@1 | 449 | return ((decl != null) ? decl : tree).pos(); |
duke@1 | 450 | } |
duke@1 | 451 | |
duke@1 | 452 | /** Find the declaration for a symbol, where |
duke@1 | 453 | * that symbol is defined somewhere in the given tree. */ |
duke@1 | 454 | public static JCTree declarationFor(final Symbol sym, final JCTree tree) { |
duke@1 | 455 | class DeclScanner extends TreeScanner { |
duke@1 | 456 | JCTree result = null; |
duke@1 | 457 | public void scan(JCTree tree) { |
duke@1 | 458 | if (tree!=null && result==null) |
duke@1 | 459 | tree.accept(this); |
duke@1 | 460 | } |
duke@1 | 461 | public void visitTopLevel(JCCompilationUnit that) { |
duke@1 | 462 | if (that.packge == sym) result = that; |
duke@1 | 463 | else super.visitTopLevel(that); |
duke@1 | 464 | } |
duke@1 | 465 | public void visitClassDef(JCClassDecl that) { |
duke@1 | 466 | if (that.sym == sym) result = that; |
duke@1 | 467 | else super.visitClassDef(that); |
duke@1 | 468 | } |
duke@1 | 469 | public void visitMethodDef(JCMethodDecl that) { |
duke@1 | 470 | if (that.sym == sym) result = that; |
duke@1 | 471 | else super.visitMethodDef(that); |
duke@1 | 472 | } |
duke@1 | 473 | public void visitVarDef(JCVariableDecl that) { |
duke@1 | 474 | if (that.sym == sym) result = that; |
duke@1 | 475 | else super.visitVarDef(that); |
duke@1 | 476 | } |
duke@1 | 477 | } |
duke@1 | 478 | DeclScanner s = new DeclScanner(); |
duke@1 | 479 | tree.accept(s); |
duke@1 | 480 | return s.result; |
duke@1 | 481 | } |
duke@1 | 482 | |
duke@1 | 483 | public static Env<AttrContext> scopeFor(JCTree node, JCCompilationUnit unit) { |
duke@1 | 484 | return scopeFor(pathFor(node, unit)); |
duke@1 | 485 | } |
duke@1 | 486 | |
duke@1 | 487 | public static Env<AttrContext> scopeFor(List<JCTree> path) { |
duke@1 | 488 | // TODO: not implemented yet |
duke@1 | 489 | throw new UnsupportedOperationException("not implemented yet"); |
duke@1 | 490 | } |
duke@1 | 491 | |
duke@1 | 492 | public static List<JCTree> pathFor(final JCTree node, final JCCompilationUnit unit) { |
duke@1 | 493 | class Result extends Error { |
duke@1 | 494 | static final long serialVersionUID = -5942088234594905625L; |
duke@1 | 495 | List<JCTree> path; |
duke@1 | 496 | Result(List<JCTree> path) { |
duke@1 | 497 | this.path = path; |
duke@1 | 498 | } |
duke@1 | 499 | } |
duke@1 | 500 | class PathFinder extends TreeScanner { |
duke@1 | 501 | List<JCTree> path = List.nil(); |
duke@1 | 502 | public void scan(JCTree tree) { |
duke@1 | 503 | if (tree != null) { |
duke@1 | 504 | path = path.prepend(tree); |
duke@1 | 505 | if (tree == node) |
duke@1 | 506 | throw new Result(path); |
duke@1 | 507 | super.scan(tree); |
duke@1 | 508 | path = path.tail; |
duke@1 | 509 | } |
duke@1 | 510 | } |
duke@1 | 511 | } |
duke@1 | 512 | try { |
duke@1 | 513 | new PathFinder().scan(unit); |
duke@1 | 514 | } catch (Result result) { |
duke@1 | 515 | return result.path; |
duke@1 | 516 | } |
duke@1 | 517 | return List.nil(); |
duke@1 | 518 | } |
duke@1 | 519 | |
duke@1 | 520 | /** Return the statement referenced by a label. |
duke@1 | 521 | * If the label refers to a loop or switch, return that switch |
duke@1 | 522 | * otherwise return the labelled statement itself |
duke@1 | 523 | */ |
duke@1 | 524 | public static JCTree referencedStatement(JCLabeledStatement tree) { |
duke@1 | 525 | JCTree t = tree; |
duke@1 | 526 | do t = ((JCLabeledStatement) t).body; |
duke@1 | 527 | while (t.getTag() == JCTree.LABELLED); |
duke@1 | 528 | switch (t.getTag()) { |
duke@1 | 529 | case JCTree.DOLOOP: case JCTree.WHILELOOP: case JCTree.FORLOOP: case JCTree.FOREACHLOOP: case JCTree.SWITCH: |
duke@1 | 530 | return t; |
duke@1 | 531 | default: |
duke@1 | 532 | return tree; |
duke@1 | 533 | } |
duke@1 | 534 | } |
duke@1 | 535 | |
duke@1 | 536 | /** Skip parens and return the enclosed expression |
duke@1 | 537 | */ |
duke@1 | 538 | public static JCExpression skipParens(JCExpression tree) { |
duke@1 | 539 | while (tree.getTag() == JCTree.PARENS) { |
duke@1 | 540 | tree = ((JCParens) tree).expr; |
duke@1 | 541 | } |
duke@1 | 542 | return tree; |
duke@1 | 543 | } |
duke@1 | 544 | |
duke@1 | 545 | /** Skip parens and return the enclosed expression |
duke@1 | 546 | */ |
duke@1 | 547 | public static JCTree skipParens(JCTree tree) { |
duke@1 | 548 | if (tree.getTag() == JCTree.PARENS) |
duke@1 | 549 | return skipParens((JCParens)tree); |
duke@1 | 550 | else |
duke@1 | 551 | return tree; |
duke@1 | 552 | } |
duke@1 | 553 | |
duke@1 | 554 | /** Return the types of a list of trees. |
duke@1 | 555 | */ |
duke@1 | 556 | public static List<Type> types(List<? extends JCTree> trees) { |
duke@1 | 557 | ListBuffer<Type> ts = new ListBuffer<Type>(); |
duke@1 | 558 | for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail) |
duke@1 | 559 | ts.append(l.head.type); |
duke@1 | 560 | return ts.toList(); |
duke@1 | 561 | } |
duke@1 | 562 | |
duke@1 | 563 | /** If this tree is an identifier or a field or a parameterized type, |
duke@1 | 564 | * return its name, otherwise return null. |
duke@1 | 565 | */ |
duke@1 | 566 | public static Name name(JCTree tree) { |
duke@1 | 567 | switch (tree.getTag()) { |
duke@1 | 568 | case JCTree.IDENT: |
duke@1 | 569 | return ((JCIdent) tree).name; |
duke@1 | 570 | case JCTree.SELECT: |
duke@1 | 571 | return ((JCFieldAccess) tree).name; |
duke@1 | 572 | case JCTree.TYPEAPPLY: |
duke@1 | 573 | return name(((JCTypeApply) tree).clazz); |
duke@1 | 574 | default: |
duke@1 | 575 | return null; |
duke@1 | 576 | } |
duke@1 | 577 | } |
duke@1 | 578 | |
duke@1 | 579 | /** If this tree is a qualified identifier, its return fully qualified name, |
duke@1 | 580 | * otherwise return null. |
duke@1 | 581 | */ |
duke@1 | 582 | public static Name fullName(JCTree tree) { |
duke@1 | 583 | tree = skipParens(tree); |
duke@1 | 584 | switch (tree.getTag()) { |
duke@1 | 585 | case JCTree.IDENT: |
duke@1 | 586 | return ((JCIdent) tree).name; |
duke@1 | 587 | case JCTree.SELECT: |
duke@1 | 588 | Name sname = fullName(((JCFieldAccess) tree).selected); |
duke@1 | 589 | return sname == null ? null : sname.append('.', name(tree)); |
duke@1 | 590 | default: |
duke@1 | 591 | return null; |
duke@1 | 592 | } |
duke@1 | 593 | } |
duke@1 | 594 | |
duke@1 | 595 | public static Symbol symbolFor(JCTree node) { |
duke@1 | 596 | node = skipParens(node); |
duke@1 | 597 | switch (node.getTag()) { |
duke@1 | 598 | case JCTree.CLASSDEF: |
duke@1 | 599 | return ((JCClassDecl) node).sym; |
duke@1 | 600 | case JCTree.METHODDEF: |
duke@1 | 601 | return ((JCMethodDecl) node).sym; |
duke@1 | 602 | case JCTree.VARDEF: |
duke@1 | 603 | return ((JCVariableDecl) node).sym; |
duke@1 | 604 | default: |
duke@1 | 605 | return null; |
duke@1 | 606 | } |
duke@1 | 607 | } |
duke@1 | 608 | |
duke@1 | 609 | /** If this tree is an identifier or a field, return its symbol, |
duke@1 | 610 | * otherwise return null. |
duke@1 | 611 | */ |
duke@1 | 612 | public static Symbol symbol(JCTree tree) { |
duke@1 | 613 | tree = skipParens(tree); |
duke@1 | 614 | switch (tree.getTag()) { |
duke@1 | 615 | case JCTree.IDENT: |
duke@1 | 616 | return ((JCIdent) tree).sym; |
duke@1 | 617 | case JCTree.SELECT: |
duke@1 | 618 | return ((JCFieldAccess) tree).sym; |
duke@1 | 619 | case JCTree.TYPEAPPLY: |
duke@1 | 620 | return symbol(((JCTypeApply) tree).clazz); |
duke@1 | 621 | default: |
duke@1 | 622 | return null; |
duke@1 | 623 | } |
duke@1 | 624 | } |
duke@1 | 625 | |
duke@1 | 626 | /** Return true if this is a nonstatic selection. */ |
duke@1 | 627 | public static boolean nonstaticSelect(JCTree tree) { |
duke@1 | 628 | tree = skipParens(tree); |
duke@1 | 629 | if (tree.getTag() != JCTree.SELECT) return false; |
duke@1 | 630 | JCFieldAccess s = (JCFieldAccess) tree; |
duke@1 | 631 | Symbol e = symbol(s.selected); |
duke@1 | 632 | return e == null || (e.kind != Kinds.PCK && e.kind != Kinds.TYP); |
duke@1 | 633 | } |
duke@1 | 634 | |
duke@1 | 635 | /** If this tree is an identifier or a field, set its symbol, otherwise skip. |
duke@1 | 636 | */ |
duke@1 | 637 | public static void setSymbol(JCTree tree, Symbol sym) { |
duke@1 | 638 | tree = skipParens(tree); |
duke@1 | 639 | switch (tree.getTag()) { |
duke@1 | 640 | case JCTree.IDENT: |
duke@1 | 641 | ((JCIdent) tree).sym = sym; break; |
duke@1 | 642 | case JCTree.SELECT: |
duke@1 | 643 | ((JCFieldAccess) tree).sym = sym; break; |
duke@1 | 644 | default: |
duke@1 | 645 | } |
duke@1 | 646 | } |
duke@1 | 647 | |
duke@1 | 648 | /** If this tree is a declaration or a block, return its flags field, |
duke@1 | 649 | * otherwise return 0. |
duke@1 | 650 | */ |
duke@1 | 651 | public static long flags(JCTree tree) { |
duke@1 | 652 | switch (tree.getTag()) { |
duke@1 | 653 | case JCTree.VARDEF: |
duke@1 | 654 | return ((JCVariableDecl) tree).mods.flags; |
duke@1 | 655 | case JCTree.METHODDEF: |
duke@1 | 656 | return ((JCMethodDecl) tree).mods.flags; |
duke@1 | 657 | case JCTree.CLASSDEF: |
duke@1 | 658 | return ((JCClassDecl) tree).mods.flags; |
duke@1 | 659 | case JCTree.BLOCK: |
duke@1 | 660 | return ((JCBlock) tree).flags; |
duke@1 | 661 | default: |
duke@1 | 662 | return 0; |
duke@1 | 663 | } |
duke@1 | 664 | } |
duke@1 | 665 | |
duke@1 | 666 | /** Return first (smallest) flag in `flags': |
duke@1 | 667 | * pre: flags != 0 |
duke@1 | 668 | */ |
duke@1 | 669 | public static long firstFlag(long flags) { |
duke@1 | 670 | int flag = 1; |
duke@1 | 671 | while ((flag & StandardFlags) != 0 && (flag & flags) == 0) |
duke@1 | 672 | flag = flag << 1; |
duke@1 | 673 | return flag; |
duke@1 | 674 | } |
duke@1 | 675 | |
duke@1 | 676 | /** Return flags as a string, separated by " ". |
duke@1 | 677 | */ |
duke@1 | 678 | public static String flagNames(long flags) { |
duke@1 | 679 | return Flags.toString(flags & StandardFlags).trim(); |
duke@1 | 680 | } |
duke@1 | 681 | |
duke@1 | 682 | /** Operator precedences values. |
duke@1 | 683 | */ |
duke@1 | 684 | public static final int |
duke@1 | 685 | notExpression = -1, // not an expression |
duke@1 | 686 | noPrec = 0, // no enclosing expression |
duke@1 | 687 | assignPrec = 1, |
duke@1 | 688 | assignopPrec = 2, |
duke@1 | 689 | condPrec = 3, |
duke@1 | 690 | orPrec = 4, |
duke@1 | 691 | andPrec = 5, |
duke@1 | 692 | bitorPrec = 6, |
duke@1 | 693 | bitxorPrec = 7, |
duke@1 | 694 | bitandPrec = 8, |
duke@1 | 695 | eqPrec = 9, |
duke@1 | 696 | ordPrec = 10, |
duke@1 | 697 | shiftPrec = 11, |
duke@1 | 698 | addPrec = 12, |
duke@1 | 699 | mulPrec = 13, |
duke@1 | 700 | prefixPrec = 14, |
duke@1 | 701 | postfixPrec = 15, |
duke@1 | 702 | precCount = 16; |
duke@1 | 703 | |
duke@1 | 704 | |
duke@1 | 705 | /** Map operators to their precedence levels. |
duke@1 | 706 | */ |
duke@1 | 707 | public static int opPrec(int op) { |
duke@1 | 708 | switch(op) { |
duke@1 | 709 | case JCTree.POS: |
duke@1 | 710 | case JCTree.NEG: |
duke@1 | 711 | case JCTree.NOT: |
duke@1 | 712 | case JCTree.COMPL: |
duke@1 | 713 | case JCTree.PREINC: |
duke@1 | 714 | case JCTree.PREDEC: return prefixPrec; |
duke@1 | 715 | case JCTree.POSTINC: |
duke@1 | 716 | case JCTree.POSTDEC: |
duke@1 | 717 | case JCTree.NULLCHK: return postfixPrec; |
duke@1 | 718 | case JCTree.ASSIGN: return assignPrec; |
duke@1 | 719 | case JCTree.BITOR_ASG: |
duke@1 | 720 | case JCTree.BITXOR_ASG: |
duke@1 | 721 | case JCTree.BITAND_ASG: |
duke@1 | 722 | case JCTree.SL_ASG: |
duke@1 | 723 | case JCTree.SR_ASG: |
duke@1 | 724 | case JCTree.USR_ASG: |
duke@1 | 725 | case JCTree.PLUS_ASG: |
duke@1 | 726 | case JCTree.MINUS_ASG: |
duke@1 | 727 | case JCTree.MUL_ASG: |
duke@1 | 728 | case JCTree.DIV_ASG: |
duke@1 | 729 | case JCTree.MOD_ASG: return assignopPrec; |
duke@1 | 730 | case JCTree.OR: return orPrec; |
duke@1 | 731 | case JCTree.AND: return andPrec; |
duke@1 | 732 | case JCTree.EQ: |
duke@1 | 733 | case JCTree.NE: return eqPrec; |
duke@1 | 734 | case JCTree.LT: |
duke@1 | 735 | case JCTree.GT: |
duke@1 | 736 | case JCTree.LE: |
duke@1 | 737 | case JCTree.GE: return ordPrec; |
duke@1 | 738 | case JCTree.BITOR: return bitorPrec; |
duke@1 | 739 | case JCTree.BITXOR: return bitxorPrec; |
duke@1 | 740 | case JCTree.BITAND: return bitandPrec; |
duke@1 | 741 | case JCTree.SL: |
duke@1 | 742 | case JCTree.SR: |
duke@1 | 743 | case JCTree.USR: return shiftPrec; |
duke@1 | 744 | case JCTree.PLUS: |
duke@1 | 745 | case JCTree.MINUS: return addPrec; |
duke@1 | 746 | case JCTree.MUL: |
duke@1 | 747 | case JCTree.DIV: |
duke@1 | 748 | case JCTree.MOD: return mulPrec; |
duke@1 | 749 | case JCTree.TYPETEST: return ordPrec; |
duke@1 | 750 | default: throw new AssertionError(); |
duke@1 | 751 | } |
duke@1 | 752 | } |
duke@1 | 753 | |
duke@1 | 754 | static Tree.Kind tagToKind(int tag) { |
duke@1 | 755 | switch (tag) { |
duke@1 | 756 | // Postfix expressions |
duke@1 | 757 | case JCTree.POSTINC: // _ ++ |
duke@1 | 758 | return Tree.Kind.POSTFIX_INCREMENT; |
duke@1 | 759 | case JCTree.POSTDEC: // _ -- |
duke@1 | 760 | return Tree.Kind.POSTFIX_DECREMENT; |
duke@1 | 761 | |
duke@1 | 762 | // Unary operators |
duke@1 | 763 | case JCTree.PREINC: // ++ _ |
duke@1 | 764 | return Tree.Kind.PREFIX_INCREMENT; |
duke@1 | 765 | case JCTree.PREDEC: // -- _ |
duke@1 | 766 | return Tree.Kind.PREFIX_DECREMENT; |
duke@1 | 767 | case JCTree.POS: // + |
duke@1 | 768 | return Tree.Kind.UNARY_PLUS; |
duke@1 | 769 | case JCTree.NEG: // - |
duke@1 | 770 | return Tree.Kind.UNARY_MINUS; |
duke@1 | 771 | case JCTree.COMPL: // ~ |
duke@1 | 772 | return Tree.Kind.BITWISE_COMPLEMENT; |
duke@1 | 773 | case JCTree.NOT: // ! |
duke@1 | 774 | return Tree.Kind.LOGICAL_COMPLEMENT; |
duke@1 | 775 | |
duke@1 | 776 | // Binary operators |
duke@1 | 777 | |
duke@1 | 778 | // Multiplicative operators |
duke@1 | 779 | case JCTree.MUL: // * |
duke@1 | 780 | return Tree.Kind.MULTIPLY; |
duke@1 | 781 | case JCTree.DIV: // / |
duke@1 | 782 | return Tree.Kind.DIVIDE; |
duke@1 | 783 | case JCTree.MOD: // % |
duke@1 | 784 | return Tree.Kind.REMAINDER; |
duke@1 | 785 | |
duke@1 | 786 | // Additive operators |
duke@1 | 787 | case JCTree.PLUS: // + |
duke@1 | 788 | return Tree.Kind.PLUS; |
duke@1 | 789 | case JCTree.MINUS: // - |
duke@1 | 790 | return Tree.Kind.MINUS; |
duke@1 | 791 | |
duke@1 | 792 | // Shift operators |
duke@1 | 793 | case JCTree.SL: // << |
duke@1 | 794 | return Tree.Kind.LEFT_SHIFT; |
duke@1 | 795 | case JCTree.SR: // >> |
duke@1 | 796 | return Tree.Kind.RIGHT_SHIFT; |
duke@1 | 797 | case JCTree.USR: // >>> |
duke@1 | 798 | return Tree.Kind.UNSIGNED_RIGHT_SHIFT; |
duke@1 | 799 | |
duke@1 | 800 | // Relational operators |
duke@1 | 801 | case JCTree.LT: // < |
duke@1 | 802 | return Tree.Kind.LESS_THAN; |
duke@1 | 803 | case JCTree.GT: // > |
duke@1 | 804 | return Tree.Kind.GREATER_THAN; |
duke@1 | 805 | case JCTree.LE: // <= |
duke@1 | 806 | return Tree.Kind.LESS_THAN_EQUAL; |
duke@1 | 807 | case JCTree.GE: // >= |
duke@1 | 808 | return Tree.Kind.GREATER_THAN_EQUAL; |
duke@1 | 809 | |
duke@1 | 810 | // Equality operators |
duke@1 | 811 | case JCTree.EQ: // == |
duke@1 | 812 | return Tree.Kind.EQUAL_TO; |
duke@1 | 813 | case JCTree.NE: // != |
duke@1 | 814 | return Tree.Kind.NOT_EQUAL_TO; |
duke@1 | 815 | |
duke@1 | 816 | // Bitwise and logical operators |
duke@1 | 817 | case JCTree.BITAND: // & |
duke@1 | 818 | return Tree.Kind.AND; |
duke@1 | 819 | case JCTree.BITXOR: // ^ |
duke@1 | 820 | return Tree.Kind.XOR; |
duke@1 | 821 | case JCTree.BITOR: // | |
duke@1 | 822 | return Tree.Kind.OR; |
duke@1 | 823 | |
duke@1 | 824 | // Conditional operators |
duke@1 | 825 | case JCTree.AND: // && |
duke@1 | 826 | return Tree.Kind.CONDITIONAL_AND; |
duke@1 | 827 | case JCTree.OR: // || |
duke@1 | 828 | return Tree.Kind.CONDITIONAL_OR; |
duke@1 | 829 | |
duke@1 | 830 | // Assignment operators |
duke@1 | 831 | case JCTree.MUL_ASG: // *= |
duke@1 | 832 | return Tree.Kind.MULTIPLY_ASSIGNMENT; |
duke@1 | 833 | case JCTree.DIV_ASG: // /= |
duke@1 | 834 | return Tree.Kind.DIVIDE_ASSIGNMENT; |
duke@1 | 835 | case JCTree.MOD_ASG: // %= |
duke@1 | 836 | return Tree.Kind.REMAINDER_ASSIGNMENT; |
duke@1 | 837 | case JCTree.PLUS_ASG: // += |
duke@1 | 838 | return Tree.Kind.PLUS_ASSIGNMENT; |
duke@1 | 839 | case JCTree.MINUS_ASG: // -= |
duke@1 | 840 | return Tree.Kind.MINUS_ASSIGNMENT; |
duke@1 | 841 | case JCTree.SL_ASG: // <<= |
duke@1 | 842 | return Tree.Kind.LEFT_SHIFT_ASSIGNMENT; |
duke@1 | 843 | case JCTree.SR_ASG: // >>= |
duke@1 | 844 | return Tree.Kind.RIGHT_SHIFT_ASSIGNMENT; |
duke@1 | 845 | case JCTree.USR_ASG: // >>>= |
duke@1 | 846 | return Tree.Kind.UNSIGNED_RIGHT_SHIFT_ASSIGNMENT; |
duke@1 | 847 | case JCTree.BITAND_ASG: // &= |
duke@1 | 848 | return Tree.Kind.AND_ASSIGNMENT; |
duke@1 | 849 | case JCTree.BITXOR_ASG: // ^= |
duke@1 | 850 | return Tree.Kind.XOR_ASSIGNMENT; |
duke@1 | 851 | case JCTree.BITOR_ASG: // |= |
duke@1 | 852 | return Tree.Kind.OR_ASSIGNMENT; |
duke@1 | 853 | |
duke@1 | 854 | // Null check (implementation detail), for example, __.getClass() |
duke@1 | 855 | case JCTree.NULLCHK: |
duke@1 | 856 | return Tree.Kind.OTHER; |
duke@1 | 857 | |
duke@1 | 858 | default: |
duke@1 | 859 | return null; |
duke@1 | 860 | } |
duke@1 | 861 | } |
duke@1 | 862 | } |