1 /***
2  * ASM: a very small and fast Java bytecode manipulation framework
3  * Copyright (c) 2000-2011 INRIA, France Telecom
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  * 3. Neither the name of the copyright holders nor the names of its
15  *    contributors may be used to endorse or promote products derived from
16  *    this software without specific prior written permission.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
22  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
28  * THE POSSIBILITY OF SUCH DAMAGE.
29  */
30 package com.sleepycat.asm;
31 
32 /**
33  * Information about an exception handler block.
34  *
35  * @author Eric Bruneton
36  */
37 class Handler {
38 
39     /**
40      * Beginning of the exception handler's scope (inclusive).
41      */
42     Label start;
43 
44     /**
45      * End of the exception handler's scope (exclusive).
46      */
47     Label end;
48 
49     /**
50      * Beginning of the exception handler's code.
51      */
52     Label handler;
53 
54     /**
55      * Internal name of the type of exceptions handled by this handler, or
56      * <tt>null</tt> to catch any exceptions.
57      */
58     String desc;
59 
60     /**
61      * Constant pool index of the internal name of the type of exceptions
62      * handled by this handler, or 0 to catch any exceptions.
63      */
64     int type;
65 
66     /**
67      * Next exception handler block info.
68      */
69     Handler next;
70 
71     /**
72      * Removes the range between start and end from the given exception
73      * handlers.
74      *
75      * @param h an exception handler list.
76      * @param start the start of the range to be removed.
77      * @param end the end of the range to be removed. Maybe null.
78      * @return the exception handler list with the start-end range removed.
79      */
remove(Handler h, Label start, Label end)80     static Handler remove(Handler h, Label start, Label end) {
81         if (h == null) {
82             return null;
83         } else {
84             h.next = remove(h.next, start, end);
85         }
86         int hstart = h.start.position;
87         int hend = h.end.position;
88         int s = start.position;
89         int e = end == null ? Integer.MAX_VALUE : end.position;
90         // if [hstart,hend[ and [s,e[ intervals intersect...
91         if (s < hend && e > hstart) {
92             if (s <= hstart) {
93                 if (e >= hend) {
94                     // [hstart,hend[ fully included in [s,e[, h removed
95                     h = h.next;
96                 } else {
97                     // [hstart,hend[ minus [s,e[ = [e,hend[
98                     h.start = end;
99                 }
100             } else if (e >= hend) {
101                 // [hstart,hend[ minus [s,e[ = [hstart,s[
102                 h.end = start;
103             } else {
104                 // [hstart,hend[ minus [s,e[ = [hstart,s[ + [e,hend[
105                 Handler g = new Handler();
106                 g.start = end;
107                 g.end = h.end;
108                 g.handler = h.handler;
109                 g.desc = h.desc;
110                 g.type = h.type;
111                 g.next = h.next;
112                 h.end = start;
113                 h.next = g;
114             }
115         }
116         return h;
117     }
118 }
119