Mercurial > hg > truffle
changeset 7521:d4bc143c575a
replaced use of <br> in javadoc with <p>
line wrap: on
line diff
--- a/graal/com.oracle.graal.graph/src/com/oracle/graal/graph/Node.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.graph/src/com/oracle/graal/graph/Node.java Tue Jan 22 21:06:57 2013 +0100 @@ -31,11 +31,11 @@ /** - * This class is the base class for all nodes, it represent a node which can be inserted in a {@link Graph}.<br> + * This class is the base class for all nodes, it represent a node which can be inserted in a {@link Graph}.<p> * Once a node has been added to a graph, it has a graph-unique {@link #id()}. Edges in the subclasses are represented * with annotated fields. There are two kind of edges : {@link Input} and {@link Successor}. If a field, of a type * compatible with {@link Node}, annotated with either {@link Input} and {@link Successor} is not null, then there is an - * edge from this node to the node this field points to.<br> + * edge from this node to the node this field points to.<p> * Nodes which are be value numberable should implement the {@link ValueNumberable} interface. * * <h1>Assertions and Verification</h1>
--- a/graal/com.oracle.graal.java/src/com/oracle/graal/java/BciBlockMapping.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.java/src/com/oracle/graal/java/BciBlockMapping.java Tue Jan 22 21:06:57 2013 +0100 @@ -36,31 +36,31 @@ /** * Builds a mapping between bytecodes and basic blocks and builds a conservative control flow graph (CFG). * It makes one linear passes over the bytecodes to build the CFG where it detects block headers and connects them. - * <br> + * <p> * It also creates exception dispatch blocks for exception handling. These blocks are between a bytecode that might * throw an exception, and the actual exception handler entries, and are later used to create the type checks with the * exception handler catch types. If a bytecode is covered by an exception handler, this bytecode ends the basic block. * This guarantees that a) control flow cannot be transferred to an exception dispatch block in the middle of a block, and * b) that every block has at most one exception dispatch block (which is always the last entry in the successor list). - * <br> + * <p> * If a bytecode is covered by multiple exception handlers, a chain of exception dispatch blocks is created so that * multiple exception handler types can be checked. The chains are re-used if multiple bytecodes are covered by the same * exception handlers. - * <br> + * <p> * Note that exception unwinds, i.e., bytecodes that can throw an exception but the exception is not handled in this method, * do not end a basic block. Not modeling the exception unwind block reduces the complexity of the CFG, and there is no * algorithm yet where the exception unwind block would matter. - * <br> + * <p> * The class also handles subroutines (jsr and ret bytecodes): subroutines are inlined by duplicating the subroutine blocks. * This is limited to simple, structured subroutines with a maximum subroutine nesting of 4. Otherwise, a bailout is thrown. - * <br> + * <p> * Loops in the methods are detected. If a method contains an irreducible loop (a loop with more than one entry), a bailout is * thrown. This simplifies the compiler later on since only structured loops need to be supported. - * <br> + * <p> * A data flow analysis computes the live local variables from the point of view of the interpreter. The result is used later * to prune frame states, i.e., remove local variable entries that are guaranteed to be never used again (even in the case of * deoptimization). - * <br> + * <p> * The algorithms and analysis in this class are conservative and do not use any assumptions or profiling information. */ public final class BciBlockMapping {
--- a/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/FrameMap.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/FrameMap.java Tue Jan 22 21:06:57 2013 +0100 @@ -38,7 +38,7 @@ * Therefore, outgoing arguments are indexed from the stack pointer, while spill slots * are indexed from the beginning of the frame (and the total frame size has to be added * to get the actual offset from the stack pointer). - * <br> + * <p> * This is the format of a stack frame: * <pre> * Base Contents @@ -68,7 +68,7 @@ * </pre> * The spill slot area also includes stack allocated memory blocks (ALLOCA blocks). The size * of such a block may be greater than the size of a normal spill slot or the word size. - * <br> + * <p> * A runtime has two ways to reserve space in the stack frame for its own use: <ul> * <li>A memory block somewhere in the frame of size {@link CodeCacheProvider#getCustomStackAreaSize()}. The offset * to this block is returned in {@link CompilationResult#getCustomStackAreaOffset()}.
--- a/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/LIRInsertionBuffer.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/LIRInsertionBuffer.java Tue Jan 22 21:06:57 2013 +0100 @@ -28,11 +28,11 @@ * A buffer to enqueue updates to a list. This avoids frequent re-sizing of the list and copying of list elements * when insertions are done at multiple positions of the list. Additionally, it ensures that the list is not modified * while it is, e.g., iterated, and instead only modified once after the iteration is done. - * <br> + * <p> * The buffer uses internal data structures to store the enqueued updates. To avoid allocations, a buffer can be re-used. * Call the methods in the following order: * {@link #init}, {@link #append}, {@link #append}, ..., {@link #finish()}, {@link #init}, ... - * <br> + * <p> * Note: This class does not depend on LIRInstruction, so we could make it a generic utility class. */ public final class LIRInsertionBuffer {
--- a/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/LIRInstruction.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.lir/src/com/oracle/graal/lir/LIRInstruction.java Tue Jan 22 21:06:57 2013 +0100 @@ -281,7 +281,7 @@ /** * Iterates all register hints for the specified value, i.e., all preferred candidates for the register to be * assigned to the value. - * <br> + * <p> * Subclasses can override this method. The default implementation processes all Input operands as the hints for * an Output operand, and all Output operands as the hints for an Input operand. *
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/AccessMonitorNode.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/AccessMonitorNode.java Tue Jan 22 21:06:57 2013 +0100 @@ -31,14 +31,14 @@ /** * The {@code AccessMonitorNode} is the base class of both monitor acquisition and release. - * <br> + * <p> * The VM needs information about monitors in the debug information. This information is built from * the nesting level of {@link MonitorEnterNode} when the LIR is constructed. Therefore, monitor * nodes must not be removed from the graph unless it is guaranteed that the nesting level does not change. * For example, you must not remove a {@link MonitorEnterNode} for a thread-local object or for a recursive locking. * Instead, mark the node as {@link #eliminated}. This makes sure that the meta data still contains the complete * locking hierarchy. - * <br> + * <p> * The Java bytecode specification allows non-balanced locking. Graal does not handle such cases and throws a * {@link BailoutException} instead during graph building. */
--- a/graal/com.oracle.graal.phases/src/com/oracle/graal/phases/graph/PostOrderNodeIterator.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.phases/src/com/oracle/graal/phases/graph/PostOrderNodeIterator.java Tue Jan 22 21:06:57 2013 +0100 @@ -28,9 +28,9 @@ import com.oracle.graal.nodes.*; /** - * A PostOrderNodeIterator iterates the fixed nodes of the graph in post order starting from a specified fixed node.<br> + * A PostOrderNodeIterator iterates the fixed nodes of the graph in post order starting from a specified fixed node.<p> * For this iterator the CFG is defined by the classical CFG nodes ({@link ControlSplitNode}, {@link MergeNode}...) and the {@link FixedWithNextNode#next() next} pointers - * of {@link FixedWithNextNode}.<br> + * of {@link FixedWithNextNode}.<p> * While iterating it maintains a user-defined state by calling the methods available in {@link MergeableState}. * * @param <T> the type of {@link MergeableState} handled by this PostOrderNodeIterator
--- a/graal/com.oracle.graal.word/src/com/oracle/graal/word/Pointer.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.word/src/com/oracle/graal/word/Pointer.java Tue Jan 22 21:06:57 2013 +0100 @@ -34,7 +34,7 @@ Object toObject(); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -45,7 +45,7 @@ byte readByte(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -56,7 +56,7 @@ char readChar(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -67,7 +67,7 @@ short readShort(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -78,7 +78,7 @@ int readInt(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -89,7 +89,7 @@ long readLong(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -100,7 +100,7 @@ float readFloat(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -111,7 +111,7 @@ double readDouble(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -122,7 +122,7 @@ Word readWord(WordBase offset); /** - * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -205,9 +205,9 @@ Object readObject(int offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -218,9 +218,9 @@ byte readFinalByte(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -231,9 +231,9 @@ char readFinalChar(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -244,9 +244,9 @@ short readFinalShort(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -257,9 +257,9 @@ int readFinalInt(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -270,9 +270,9 @@ long readFinalLong(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -283,9 +283,9 @@ float readFinalFloat(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -296,9 +296,9 @@ double readFinalDouble(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -309,9 +309,9 @@ Word readFinalWord(WordBase offset); /** - * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Reads the constant memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The caller guarantees that the memory content is final, i.e., never changing. The compiler can therefore - * eliminate memory accesses more aggressively. <br> + * eliminate memory accesses more aggressively. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -322,7 +322,7 @@ Object readFinalObject(WordBase offset); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -333,7 +333,7 @@ void writeByte(WordBase offset, byte val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -344,7 +344,7 @@ void writeChar(WordBase offset, char val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -355,7 +355,7 @@ void writeShort(WordBase offset, Short val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -366,7 +366,7 @@ void writeInt(WordBase offset, int val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -377,7 +377,7 @@ void writeLong(WordBase offset, long val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -388,7 +388,7 @@ void writeFloat(WordBase offset, float val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -399,7 +399,7 @@ void writeDouble(WordBase offset, double val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used). @@ -410,7 +410,7 @@ void writeWord(WordBase offset, WordBase val); /** - * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <br> + * Writes the memory at address {@code (this + offset)}. Both the base address and offset are in bytes. <p> * The offset is always treated as a {@link Signed} value. However, the static type is {@link WordBase} to avoid the * frequent casts to of {@link Unsigned} values (where the caller knows that the highest-order bit of the unsigned * value is never used).
--- a/graal/com.oracle.graal.word/src/com/oracle/graal/word/Unsigned.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.word/src/com/oracle/graal/word/Unsigned.java Tue Jan 22 21:06:57 2013 +0100 @@ -144,7 +144,7 @@ boolean aboveOrEqual(Unsigned val); /** - * Returns a Unsigned whose value is {@code (this + val)}. <br> + * Returns a Unsigned whose value is {@code (this + val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -154,7 +154,7 @@ Unsigned add(int val); /** - * Returns a Unsigned whose value is {@code (this - val)}. <br> + * Returns a Unsigned whose value is {@code (this - val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -164,7 +164,7 @@ Unsigned subtract(int val); /** - * Returns a Unsigned whose value is {@code (this * val)}. <br> + * Returns a Unsigned whose value is {@code (this * val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -174,7 +174,7 @@ Unsigned multiply(int val); /** - * Returns a Unsigned whose value is {@code (this / val)}. <br> + * Returns a Unsigned whose value is {@code (this / val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -184,7 +184,7 @@ Unsigned unsignedDivide(int val); /** - * Returns a Unsigned whose value is {@code (this % val)}. <br> + * Returns a Unsigned whose value is {@code (this % val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -194,7 +194,7 @@ Unsigned unsignedRemainder(int val); /** - * Returns a Unsigned whose value is {@code (this << n)}. <br> + * Returns a Unsigned whose value is {@code (this << n)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -204,7 +204,7 @@ Unsigned shiftLeft(int n); /** - * Returns a Unsigned whose value is {@code (this >>> n)}. No sign extension is performed. <br> + * Returns a Unsigned whose value is {@code (this >>> n)}. No sign extension is performed. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -214,7 +214,7 @@ Unsigned unsignedShiftRight(int n); /** - * Returns a Unsigned whose value is {@code (this & val)}. <br> + * Returns a Unsigned whose value is {@code (this & val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -224,7 +224,7 @@ Unsigned and(int val); /** - * Returns a Unsigned whose value is {@code (this | val)}. <br> + * Returns a Unsigned whose value is {@code (this | val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -234,7 +234,7 @@ Unsigned or(int val); /** - * Returns a Unsigned whose value is {@code (this ^ val)}. <br> + * Returns a Unsigned whose value is {@code (this ^ val)}. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -244,7 +244,7 @@ Unsigned xor(int val); /** - * Compares this Unsigned with the specified value. <br> + * Compares this Unsigned with the specified value. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -254,7 +254,7 @@ boolean belowThan(int val); /** - * Compares this Unsigned with the specified value. <br> + * Compares this Unsigned with the specified value. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -264,7 +264,7 @@ boolean belowOrEqual(int val); /** - * Compares this Unsigned with the specified value. <br> + * Compares this Unsigned with the specified value. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. * @@ -274,7 +274,7 @@ boolean aboveThan(int val); /** - * Compares this Unsigned with the specified value. <br> + * Compares this Unsigned with the specified value. <p> * Note that the right operand is a signed value, while the operation is performed unsigned. Therefore, the result * is only well-defined for positive right operands. *
--- a/graal/com.oracle.graal.word/src/com/oracle/graal/word/Word.java Tue Jan 22 20:47:55 2013 +0100 +++ b/graal/com.oracle.graal.word/src/com/oracle/graal/word/Word.java Tue Jan 22 21:06:57 2013 +0100 @@ -47,6 +47,7 @@ /** * The canonical {@link Operation} represented by a method in the {@link Word} class. */ + // @formatter:off public enum Opcode { NODE_CLASS, COMPARISON, @@ -61,6 +62,7 @@ TO_OBJECT, TO_RAW_VALUE, } + // @formatter:on private static Word box(long val) { return HostedWord.box(val);