Return a copy of this <code>this</code> with the <code>abstract</code> flag clear.

Constructors should memoize their return value. Call clearCache() to force recomputations if body has changed and setBody() hasn't been called again.

Return a copy of this <code>this</code> with the <code>strictfp</code> flag clear.

Clones the current body, making deep copies of the contents.

Actually collapse the SCCs in the PAG.

Combine two <code>Item</code>s together, when the information contained in both items is true. Thus, for example, in a not-null analysis, where <code>

Utility method that produces a new map from the {@link Unit}s of this graph's body to the union of the values stored in the two argument {@link Map}s,

Invoke the Polyglot compiler, with the given command line arguments.

Get the encoded compiler version used to compile the source.

---------------------------------------------*/

compute attributes

compute list of xml filenames

compute top-level names

Orders in pseudo-topological order. @param g a DirectedGraph instance we want to order the nodes for. @return an ordered list of the graph

Orders in pseudo-topological order. @param g a DirectedGraph instance we want to order the nodes for. @return an ordered list of the graph

Computes the possibly refined set of reaching objects for l.

Compute the closure of the set using the LALR closure rules. Basically for every item of the form: <pre> [L ::= a N alpha, l] </pre> (where N i

only lets concrete references through. A concrete reference is either an array-ref or a field-ref.<br> returns <code>null</code> if <code>val</code> a

Conservative constructor for unanalysable calls. <p>Note: this gives a valid summary for all native methods, including Thread.start(). @param withEf

Checks if a graph's edge set is consistent. @param g the {@link DirectedGraph} whose edge set is to be checked. @return <tt>true</tt> if <tt>g</tt>'

Set the local's constant value.

Set the constant value of the field. @param value the constant value. Should be an instance of String, Boolean, Byte, Short, Character, Integer, Long

Default implementation constructing a PseudoTopologicalOrderer. @return an Orderer to order the nodes for the fixed-point iteration

The constructor type object. This field may not be valid until after signature disambiguation.

The constructor that is called. This field may not be valid until after type checking.

Get the constructorInstance of the constructor.

Set the containing class of the constructor.

Returns true iff the set contains n.

Returns true if some method in this class has an active Baf body.

@return true if the graph contains an edge the 2 nodes false otherwise.

@param node node that we want to know if the graph constains. @return true if the graph contains the node. false otherwise.

Target of a continue statement in the loop body.

Copy the CFGBuilder.

{@inheritDoc}