DASCA
/
WALA
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

"<bf>" is not a valid HTML tag, but "<b>" is

This commit is contained in:
Ben Liblit 2017-12-19 13:24:08 -06:00
parent f60c164ec1
commit 6beaac98bd
5 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
com.ibm.wala.core/src/com/ibm/wala/cfg/Util.java
View File

@ -153,7 +153,7 @@ public class Util {
* constants c1 and c2, respectively.
*
* Callers must resolve the constant values from the {@link SymbolTable}
* before calling this method. These integers are <bf>not</bf> value numbers;
* before calling this method. These integers are <b>not</b> value numbers;
*/
public static <I, T extends IBasicBlock<I>> T resolveBranch(ControlFlowGraph<I, T> G, T bb, int c1, int c2) {
SSAConditionalBranchInstruction c = (SSAConditionalBranchInstruction) getLastInstruction(G, bb);

8
com.ibm.wala.core/src/com/ibm/wala/ipa/modref/ModRef.java
View File

@ -95,7 +95,7 @@ public class ModRef<T extends InstanceKey> {
}
/**
* For each call graph node, what heap locations (as determined by a heap model) may it write, <bf> NOT </bf> including its
* For each call graph node, what heap locations (as determined by a heap model) may it write, <b> NOT </b> including its
* callees transitively
*
* @param heapExclude
@ -106,7 +106,7 @@ public class ModRef<T extends InstanceKey> {
}
/**
* For each call graph node, what heap locations (as determined by a heap model) may it read, <bf> NOT </bf> including its callees
* For each call graph node, what heap locations (as determined by a heap model) may it read, <b> NOT </b> including its callees
* transitively
*
* @param heapExclude
@ -119,7 +119,7 @@ public class ModRef<T extends InstanceKey> {
return new DelegatingExtendedHeapModel(pa.getHeapModel());
}
/**
* For a call graph node, what heap locations (as determined by a heap model) may it write, <bf> NOT </bf> including it's callees
* For a call graph node, what heap locations (as determined by a heap model) may it write, <b> NOT </b> including it's callees
* transitively
*
* @param heapExclude
@ -142,7 +142,7 @@ public class ModRef<T extends InstanceKey> {
}
/**
* For a call graph node, what heap locations (as determined by a heap model) may it read, <bf> NOT </bf> including it's callees
* For a call graph node, what heap locations (as determined by a heap model) may it read, <b> NOT </b> including it's callees
* transitively
*/
private Collection<PointerKey> scanNodeForRef(final CGNode n, final PointerAnalysis<T> pa, HeapExclusions heapExclude) {

4
com.ibm.wala.core/src/com/ibm/wala/ipa/slicer/PDG.java
View File

@ -161,7 +161,7 @@ public class PDG<T extends InstanceKey> implements NumberedGraph<Statement> {
/**
* WARNING: Since we're using a {@link HashMap} of {@link SSAInstruction}s, and equals() of {@link SSAInstruction} assumes a
* canonical representative for each instruction, we <bf>must</bf> ensure that we use the same IR object throughout
* canonical representative for each instruction, we <b>must</b> ensure that we use the same IR object throughout
* initialization!!
*/
private void populate() {
@ -786,7 +786,7 @@ public class PDG<T extends InstanceKey> implements NumberedGraph<Statement> {
/**
* Wrap an {@link SSAInstruction} in a {@link Statement}. WARNING: Since we're using a {@link HashMap} of {@link SSAInstruction}s,
* and equals() of {@link SSAInstruction} assumes a canonical representative for each instruction, we <bf>must</bf> ensure that we
* and equals() of {@link SSAInstruction} assumes a canonical representative for each instruction, we <b>must</b> ensure that we
* use the same IR object throughout initialization!!
*/
private Statement ssaInstruction2Statement(SSAInstruction s, IR ir, Map<SSAInstruction, Integer> instructionIndices) {

4
com.ibm.wala.core/src/com/ibm/wala/ipa/slicer/SDG.java
View File

@ -197,7 +197,7 @@ public class SDG<T extends InstanceKey> extends AbstractNumberedGraph<Statement>
}
/**
* iterate over the nodes <bf>without</bf> constructing any new ones. Use with extreme care. May break graph traversals that
* iterate over the nodes <b>without</b> constructing any new ones. Use with extreme care. May break graph traversals that
* lazily add more nodes.
*/
@Override
@ -260,7 +260,7 @@ public class SDG<T extends InstanceKey> extends AbstractNumberedGraph<Statement>
}
/**
* iterate over the nodes <bf>without</bf> constructing any new ones. Use with extreme care. May break graph traversals that
* iterate over the nodes <b>without</b> constructing any new ones. Use with extreme care. May break graph traversals that
* lazily add more nodes.
*/
Iterator<? extends Statement> iterateLazyNodes() {

2
com.ibm.wala.core/src/com/ibm/wala/types/TypeReference.java
View File

@ -579,8 +579,8 @@ public final class TypeReference implements Serializable {
* TypeReferences are canonical. However, note that two TypeReferences can be non-equal, yet still represent the same
* IClass.
*
* These two TypeReference are <bf>NOT</bf> equal(), but they both represent the IClass which is named
* For example, the there can be two TypeReferences &lt;Application,java.lang.Object&gt; and &lt;Primordial,java.lang.Object&gt;.
* These two TypeReference are <b>NOT</b> equal(), but they both represent the IClass which is named
* &lt;Primordial,java.lang.Object&gt;
*/
@Override