yetangitu/ghidra
1
0
Fork 0
mirror of https://github.com/NationalSecurityAgency/ghidra.git synced 2025-10-04 10:19:23 +02:00
Code Issues Releases Wiki Activity

Many typo's

Browse source 
These were found using the command below searching for duplicated words,
and manually going through the results to remove the false positives and
reword the true positives. Sometimes I removed the doubled word and
sometimes I replaced the duplicated word.

The grep command:
grep -nIEr '\b([a-zA-Z]+)[[:space:]*]+\1\b' ./Ghidra
This commit is contained in:
Luke Serné 2025-04-19 18:06:41 +02:00
parent b7e91e80a2
commit 8303061629
252 changed files with 312 additions and 314 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/processors/generic/Operand.java
View file

@ -80,7 +80,7 @@ public class Operand implements Serializable {
/**
* Returns previously computed handle for this operand. Should not
* be called before the full version of getHandle, where Position and and
* be called before the full version of getHandle, where Position and an
* offset are specified.
* @return Handle
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/pcodeCPort/address/Address.java
View file

@ -27,7 +27,7 @@ import ghidra.pcodeCPort.utils.AddrSpaceToIdSymmetryMap;
//cpui_mach_addr is expected to print itself and read itself. It can take
//a size as a "suggestion" for how it should print itself
//All addresses are absolute and there are are no registers in CPUI. However,
//All addresses are absolute and there are no registers in CPUI. However,
//all addresses are prefixed with an "immutable" pointer, which can
//specify a separate RAM space, a register space, an i/o space etc. Thus
//a translation from a real machine language will typically simulate registers

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/pcodeCPort/utils/WeakHashMap2.java
View file

@ -213,7 +213,7 @@ public class WeakHashMap2<K, V> extends AbstractMap<K, V> {
* mapped
*
* @return The previous value to which this key was mapped, or
* <code>null</code> if if there was no mapping for the key
* <code>null</code> if there was no mapping for the key
*/
@Override
public V put(K key, V value) {

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/database/code/CodeManager.java
View file

@ -3161,7 +3161,7 @@ public class CodeManager implements ErrorHandler, ManagerDB {
// TODO: for now we will assume that all keys within defined memory blocks are known.
// When a memory block is created, only its start address key is generated, if the
// block spans a 32-bit boundary, null may be returned for all addresses beyond that
// boundary. A recent fix was added to the memory map to ensure ensure that we can
// boundary. A recent fix was added to the memory map to ensure that we can
// handle blocks which are at least 32-bits in size by ensuring that the end address
// key is also generated.
return null;

6
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/database/code/DataDBAdapter.java
View file

@ -137,13 +137,13 @@ abstract class DataDBAdapter {
abstract DBRecord getRecord(long key) throws IOException;
/**
* Get the record before the given address address.
* Get the record before the given address {@code addr}.
* @throws IOException if there was a problem accessing the database
*/
abstract DBRecord getRecordBefore(Address addr) throws IOException;
/**
* Get a record iterator starting at the given address address.
* Get a record iterator starting at the given address {@code addr}.
* @throws IOException if there was a problem accessing the database
*/
abstract RecordIterator getRecords(Address addr, boolean forward) throws IOException;
@ -176,7 +176,7 @@ abstract class DataDBAdapter {
abstract int getRecordCount() throws IOException;
/**
* Get the record at or before the given address address.
* Get the record at or before the given address {@code addr}.
* @param addr
* @throws IOException if there was a problem accessing the database
* @return

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/database/data/EnumDB.java
View file

@ -917,7 +917,7 @@ class EnumDB extends DataTypeDB implements Enum {
boolean hasNegativeValues = minValue < 0;
// check the min and max values in this enum to see if they fit in 1 byte enum, then
// 2 byte enum, then 4 byte enum. If the min min and max values fit, then all other values
// 2 byte enum, then 4 byte enum. If the min and max values fit, then all other values
// will fit as well
for (int size = 1; size < 8; size *= 2) {
long minPossible = getMinPossibleValue(size, hasNegativeValues);

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/database/util/AddressRangeMapDB.java
View file

@ -494,7 +494,7 @@ public class AddressRangeMapDB implements DBListener {
}
/**
* Notification that that something may have changed (undo/redo/image base change) and we need
* Notification that something may have changed (undo/redo/image base change) and we need
* to invalidate our cache and possibly have a wrapping record again.
*/
public void invalidate() {

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/database/util/AddressRangeMapIterator.java
View file

@ -253,7 +253,7 @@ class AddressRangeMapIterator implements AddressRangeIterator {
/**
* Make sure the range is within the iterator's given start and end range. This really only
* matters for the first and last range returned by the iterator, but it hard to know when
* the given range is the first or last, just just trim all returned ranges.
* the given range is the first or last, just trim all returned ranges.
* @param range the range to be trimmed
* @return the trimmed address range
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/disassemble/Disassembler.java
View file

@ -963,7 +963,7 @@ public class Disassembler implements DisassemblerConflictHandler {
}
// if fall-through already exists in another block - check for conflict
// and terminate terminate block
// and terminate block
if (!block.isEmpty() && instructionSet != null &&
instructionSet.containsBlockAt(addr)) {
existingBlockStartInstr = instructionSet.getInstructionAt(addr);

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/address/AddressSet.java
View file

@ -1308,7 +1308,7 @@ public class AddressSet implements AddressSetView {
Address end = addressRange.getMaxAddress();
AddressIterator it = getAddresses(start, true);
if (!it.hasNext()) {
break; // end of this this set reached, so not possible match.
break; // end of this set has been reached, so not possible match.
}
Address addr = it.next();
if (addr.compareTo(end) <= 0) {

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/address/AddressSetMapping.java
View file

@ -101,7 +101,7 @@ public class AddressSetMapping {
}
/**
* Check if the given index in in the "current range".
* Check if the given index in the "current range".
* @param index the index to check
*/
private boolean indexInCurrentRange(int index) {

4
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/address/AddressSpace.java
View file

@ -438,13 +438,13 @@ public interface AddressSpace extends Comparable<AddressSpace> {
public boolean isMemorySpace();
/**
* Returns true if this space represents represents a Loaded Memory
* Returns true if this space represents a Loaded Memory
* region (e.g., processor RAM).
*/
public boolean isLoadedMemorySpace();
/**
* Returns true if this space represents represents a Non-Loaded storage region
* Returns true if this space represents a Non-Loaded storage region
* for retaining non-loaded file data (e.g., OTHER)
*/
public boolean isNonLoadedMemorySpace();

4
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/data/ArrayDataType.java
View file

@ -52,7 +52,7 @@ public class ArrayDataType extends DataTypeImpl implements Array {
* Constructs a new Array dataType. The specified datatype's {@link DataTypeManager} will
* be used for its data organization.
* @param dataType the dataType of the elements in the array. {@link FactoryDataType} and
* {@link Dynamic}, where {@link Dynamic#canSpecifyLength()} is false, are not not permitted.
* {@link Dynamic}, where {@link Dynamic#canSpecifyLength()} is false, are not permitted.
* @param numElements the number of elements in the array (0 is permitted).
* @param elementLength the length of an individual element in the array. This value
* is only used for {@link Dynamic} dataType where {@link Dynamic#canSpecifyLength()}
@ -67,7 +67,7 @@ public class ArrayDataType extends DataTypeImpl implements Array {
/**
* Constructs a new Array dataType.
* @param dataType the dataType of the elements in the array. {@link FactoryDataType} and
* {@link Dynamic}, where {@link Dynamic#canSpecifyLength()} is false, are not not permitted.
* {@link Dynamic}, where {@link Dynamic#canSpecifyLength()} is false, are not permitted.
* @param numElements the number of elements in the array (0 is permitted).
* @param elementLength the length of an individual element in the array. This value
* is only used for {@link Dynamic} dataType where {@link Dynamic#canSpecifyLength()}

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/data/Composite.java
View file

@ -119,7 +119,7 @@ public interface Composite extends DataType {
/**
* Adds a new bitfield to the end of this composite. This method is intended
* to be used with packed structures/unions only where the bitfield will be
* appropriately packed. The minimum storage storage byte size will be applied.
* appropriately packed. The minimum storage byte size will be applied.
* It will not provide useful results for composites with packing disabled.
* @param baseDataType the bitfield base datatype (certain restrictions apply).
* @param bitSize the bitfield size in bits

4
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/data/DataTypeComponent.java
View file

@ -176,8 +176,8 @@ public interface DataTypeComponent {
}
/**
* Returns true if this this component is not defined. It is just a placeholder.
* @return true if this this component is not defined. It is just a placeholder.
* Returns true if this component is not defined. It is just a placeholder.
* @return true if this component is not defined. It is just a placeholder.
*/
public boolean isUndefined();

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/data/Enum.java
View file

@ -154,7 +154,7 @@ public interface Enum extends DataType {
/**
* Returns the smallest length (size in bytes) this enum can be and still represent all of
* it's current values. Note that that this will only return powers of 2 (1,2,4, or 8)
* it's current values. Note that this will only return powers of 2 (1,2,4, or 8)
* @return the smallest length (size in bytes) this enum can be and still represent all of
* it's current values
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/data/EnumDataType.java
View file

@ -311,7 +311,7 @@ public class EnumDataType extends GenericDataType implements Enum {
boolean hasNegativeValues = minValue < 0;
// check the min and max values in this enum to see if they fit in 1 byte enum, then
// 2 byte enum, then 4 byte enum. If the min min and max values fit, then all other values
// 2 byte enum, then 4 byte enum. If the min and max values fit, then all other values
// will fit as well
for (int size = 1; size < 8; size *= 2) {
long minPossible = getMinPossibleValue(size, hasNegativeValues);

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/CodeUnitIterator.java
View file

@ -20,7 +20,7 @@ import java.util.Iterator;
import util.CollectionUtils;
/**
* Interface to define an iterator over over some set of code units.
* Interface to define an iterator over some set of code units.
*
* @see CollectionUtils#asIterable
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/Data.java
View file

@ -138,7 +138,7 @@ public interface Data extends CodeUnit, Settings {
public String getComponentPathName();
/**
* Returns true if this is a pointer, implies getValue() will will return an Object that is an
* Returns true if this is a pointer, which implies getValue() will return an Object that is an
* Address.
* @return true if a pointer
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/DataIterator.java
View file

@ -21,7 +21,7 @@ import java.util.Iterator;
import util.CollectionUtils;
/**
* Interface to define an iterator over over some set of Data.
* Interface to define an iterator over some set of Data.
*
* @see CollectionUtils#asIterable
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/FunctionTagChangeSet.java
View file

@ -33,7 +33,7 @@ public interface FunctionTagChangeSet extends ChangeSet {
/**
* Indicates that a tag has been created.
*
* @param id id the id of the tag (from {@link ghidra.program.database.function.FunctionTagAdapter FunctionTagAdapter})
* @param id the id of the tag (from {@link ghidra.program.database.function.FunctionTagAdapter FunctionTagAdapter})
*/
void tagCreated(long id);

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/InstructionIterator.java
View file

@ -20,7 +20,7 @@ import java.util.Iterator;
import util.CollectionUtils;
/**
* Interface to define an iterator over over some set of instructions.
* Interface to define an iterator over some set of instructions.
*
* @see CollectionUtils#asIterable
*/

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/Listing.java
View file

@ -62,7 +62,7 @@ public interface Listing {
public CodeUnit getCodeUnitContaining(Address addr);
/**
* get the next code unit that starts an an address that is greater than the
* get the next code unit that starts at an address that is greater than the
* given address. The search will include instructions, defined data, and
* undefined data.
*

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/program/model/listing/ProgramUserData.java
View file

@ -131,7 +131,7 @@ public interface ProgramUserData extends UserData {
/**
* Get the Options for the given optionsName
* @param optionsName the name of the options options to retrieve
* @param optionsName the name of the options to retrieve
* @return The options for the given name
*/
public Options getOptions(String optionsName);

2
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/service/graph/GraphDisplayListener.java
View file

@ -40,7 +40,7 @@ public interface GraphDisplayListener {
* instance of this GraphDisplayListener
*
* @param graphDisplay the new {@link GraphDisplay} the new listener will support
* @return A new instance of a GraphDisplayListener that is the same type as as the instance
* @return A new instance of a GraphDisplayListener that is the same type as the instance
* on which it is called
*/
public GraphDisplayListener cloneWith(GraphDisplay graphDisplay);