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