Line 0
Link Here
|
|
|
1 |
/* |
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
3 |
* |
4 |
* Copyright 2013 Oracle and/or its affiliates. All rights reserved. |
5 |
* |
6 |
* Oracle and Java are registered trademarks of Oracle and/or its affiliates. |
7 |
* Other names may be trademarks of their respective owners. |
8 |
* |
9 |
* The contents of this file are subject to the terms of either the GNU |
10 |
* General Public License Version 2 only ("GPL") or the Common |
11 |
* Development and Distribution License("CDDL") (collectively, the |
12 |
* "License"). You may not use this file except in compliance with the |
13 |
* License. You can obtain a copy of the License at |
14 |
* http://www.netbeans.org/cddl-gplv2.html |
15 |
* or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the |
16 |
* specific language governing permissions and limitations under the |
17 |
* License. When distributing the software, include this License Header |
18 |
* Notice in each file and include the License file at |
19 |
* nbbuild/licenses/CDDL-GPL-2-CP. Oracle designates this |
20 |
* particular file as subject to the "Classpath" exception as provided |
21 |
* by Oracle in the GPL Version 2 section of the License file that |
22 |
* accompanied this code. If applicable, add the following below the |
23 |
* License Header, with the fields enclosed by brackets [] replaced by |
24 |
* your own identifying information: |
25 |
* "Portions Copyrighted [year] [name of copyright owner]" |
26 |
* |
27 |
* If you wish your version of this file to be governed by only the CDDL |
28 |
* or only the GPL Version 2, indicate your decision by adding |
29 |
* "[Contributor] elects to include this software in this distribution |
30 |
* under the [CDDL or GPL Version 2] license." If you do not indicate a |
31 |
* single choice of license, a recipient has the option to distribute |
32 |
* your version of this file under either the CDDL, the GPL Version 2 or |
33 |
* to extend the choice of license to its licensees as provided above. |
34 |
* However, if you add GPL Version 2 code and therefore, elected the GPL |
35 |
* Version 2 license, then the option applies only if the new code is |
36 |
* made subject to such option by the copyright holder. |
37 |
* |
38 |
* Contributor(s): |
39 |
* |
40 |
* Portions Copyrighted 2013 Sun Microsystems, Inc. |
41 |
*/ |
42 |
package org.openide.util; |
43 |
|
44 |
import java.util.Collections; |
45 |
import java.util.HashSet; |
46 |
import java.util.Set; |
47 |
|
48 |
/** |
49 |
* Array of stack trace elements may be used for logging of unique stack traces only |
50 |
* (for frequent problematic code invocations). |
51 |
* |
52 |
* @author Miloslav Metelka |
53 |
*/ |
54 |
public class StackElementArray { |
55 |
|
56 |
public static Set<StackElementArray> createSet() { |
57 |
return Collections.synchronizedSet(new HashSet<StackElementArray>()); |
58 |
} |
59 |
|
60 |
public static boolean addStackIfNew(Set<StackElementArray> stacks, int stackCompareSize) { |
61 |
StackTraceElement[] stackElems = new Exception().getStackTrace(); |
62 |
int startIndex = 2; // For faster comparison cut of first two (this method and the caller's place) |
63 |
int endIndex = Math.min(stackElems.length, startIndex + stackCompareSize); |
64 |
StackTraceElement[] compareElems = new StackTraceElement[endIndex - startIndex]; |
65 |
System.arraycopy(stackElems, startIndex, compareElems, 0, endIndex - startIndex); |
66 |
StackElementArray stackElementArray = new StackElementArray(compareElems); |
67 |
if (!stacks.contains(stackElementArray)) { |
68 |
stacks.add(stackElementArray); |
69 |
return true; |
70 |
} |
71 |
return false; |
72 |
} |
73 |
|
74 |
private final StackTraceElement[] stackTrace; |
75 |
|
76 |
private final int hashCode; |
77 |
|
78 |
private StackElementArray(StackTraceElement[] stackTrace) { |
79 |
this.stackTrace = stackTrace; |
80 |
int hc = 0; |
81 |
for (StackTraceElement stackTrace1 : stackTrace) { |
82 |
hc ^= stackTrace1.hashCode(); |
83 |
} |
84 |
hashCode = hc; |
85 |
} |
86 |
|
87 |
int length() { |
88 |
return stackTrace.length; |
89 |
} |
90 |
|
91 |
StackTraceElement element(int i) { |
92 |
return stackTrace[i]; |
93 |
} |
94 |
|
95 |
@Override |
96 |
public int hashCode() { |
97 |
return hashCode; |
98 |
} |
99 |
|
100 |
@Override |
101 |
public boolean equals(Object obj) { |
102 |
if (obj == this) { |
103 |
return true; |
104 |
} |
105 |
if (!(obj instanceof StackElementArray)) { |
106 |
return false; |
107 |
} |
108 |
StackElementArray sea = (StackElementArray) obj; |
109 |
if (sea.length() != length()) { |
110 |
return false; |
111 |
} |
112 |
for (int i = 0; i < stackTrace.length; i++) { |
113 |
if (!element(i).equals(sea.element(i))) { |
114 |
return false; |
115 |
} |
116 |
} |
117 |
return true; |
118 |
} |
119 |
|
120 |
} |