You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

ModifiersPattern.java 3.0KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  1. /* *******************************************************************
  2. * Copyright (c) 2002 Palo Alto Research Center, Incorporated (PARC).
  3. * All rights reserved.
  4. * This program and the accompanying materials are made available
  5. * under the terms of the Eclipse Public License v 2.0
  6. * which accompanies this distribution and is available at
  7. * https://www.eclipse.org/org/documents/epl-2.0/EPL-2.0.txt
  8. *
  9. * Contributors:
  10. * PARC initial implementation
  11. * ******************************************************************/
  12. package org.aspectj.weaver.patterns;
  13. import java.io.IOException;
  14. import java.lang.reflect.Modifier;
  15. import java.util.HashMap;
  16. import java.util.Map;
  17. import org.aspectj.weaver.CompressingDataOutputStream;
  18. import org.aspectj.weaver.VersionedDataInputStream;
  19. public class ModifiersPattern extends PatternNode {
  20. private int requiredModifiers;
  21. private int forbiddenModifiers;
  22. public static final ModifiersPattern ANY = new ModifiersPattern(0, 0);
  23. private static Map<String, Integer> modifierFlags = null;
  24. static {
  25. modifierFlags = new HashMap<>();
  26. int flag = 1;
  27. while (flag <= Modifier.STRICT) {
  28. String flagName = Modifier.toString(flag);
  29. modifierFlags.put(flagName, flag);
  30. flag = flag << 1;
  31. }
  32. /* Modifier.SYNTHETIC */
  33. modifierFlags.put("synthetic", 0x1000);
  34. }
  35. public ModifiersPattern(int requiredModifiers, int forbiddenModifiers) {
  36. this.requiredModifiers = requiredModifiers;
  37. this.forbiddenModifiers = forbiddenModifiers;
  38. }
  39. public String toString() {
  40. if (this == ANY) {
  41. return "";
  42. }
  43. String ret = Modifier.toString(requiredModifiers);
  44. if (forbiddenModifiers == 0) {
  45. return ret;
  46. } else {
  47. return ret + " !" + Modifier.toString(forbiddenModifiers);
  48. }
  49. }
  50. public boolean equals(Object other) {
  51. if (!(other instanceof ModifiersPattern)) {
  52. return false;
  53. }
  54. ModifiersPattern o = (ModifiersPattern) other;
  55. return o.requiredModifiers == this.requiredModifiers && o.forbiddenModifiers == this.forbiddenModifiers;
  56. }
  57. public int hashCode() {
  58. int result = 17;
  59. result = 37 * result + requiredModifiers;
  60. result = 37 * result + forbiddenModifiers;
  61. return result;
  62. }
  63. public boolean matches(int modifiers) {
  64. return ((modifiers & requiredModifiers) == requiredModifiers) && ((modifiers & forbiddenModifiers) == 0);
  65. }
  66. public static ModifiersPattern read(VersionedDataInputStream s) throws IOException {
  67. int requiredModifiers = s.readShort();
  68. int forbiddenModifiers = s.readShort();
  69. if (requiredModifiers == 0 && forbiddenModifiers == 0) {
  70. return ANY;
  71. }
  72. return new ModifiersPattern(requiredModifiers, forbiddenModifiers);
  73. }
  74. public void write(CompressingDataOutputStream s) throws IOException {
  75. // s.writeByte(MODIFIERS_PATTERN);
  76. s.writeShort(requiredModifiers);
  77. s.writeShort(forbiddenModifiers);
  78. }
  79. public static int getModifierFlag(String name) {
  80. Integer flag = modifierFlags.get(name);
  81. if (flag == null) {
  82. return -1;
  83. }
  84. return flag;
  85. }
  86. public Object accept(PatternNodeVisitor visitor, Object data) {
  87. return visitor.visit(this, data);
  88. }
  89. }