yetangitu/ghidra
1
0
Fork 0
mirror of https://github.com/NationalSecurityAgency/ghidra.git synced 2025-10-05 19:42:36 +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/Features/FunctionGraph/src/main/help/help/topics/FunctionGraphPlugin/Function_Graph.html
View file

@ -906,7 +906,7 @@
the scroll wheel was used to zoom. Now there is an option to restore that behavior, the
<B>Scroll Wheel Pans</B> option. When this option is on, you can zoom by holding the
<TT><B>Control</B></TT> key (<TT><B>Command</B></TT> key on the Mac) while using the scroll
wheel. Alternatively, you can move the graph left to right using the mouse while while
wheel. Alternatively, you can move the graph left to right using the mouse while
holding <TT><B>Control-Alt</B></TT>.</P>
<P>The satellite viewer may also be used to move the primary graphs view by dragging and

2
Ghidra/Features/FunctionGraph/src/main/java/ghidra/app/plugin/core/functiongraph/graph/layout/flowchart/ColSegmentList.java
View file

@ -63,7 +63,7 @@ public class ColSegmentList<E> {
}
/**
* Checks if the the range of y values in a given column segment list intersects the
* Checks if the range of y values in a given column segment list intersects the
* range of y values in this column segment.
* @param other the column segment list to compare
* @return true if they intersect ranges.

4
Ghidra/Features/FunctionGraph/src/main/java/ghidra/app/plugin/core/functiongraph/graph/layout/flowchart/ColumnSegment.java
View file

@ -101,7 +101,7 @@ public class ColumnSegment<E> extends EdgeSegment<E> {
//
// NOTE: Segments are compared by following the next or previous segments until one of the
// segments definitively determines the order. When comparing segments in a particular
// direction, is is important not to directly call the compareTo methods as that could result
// direction, it is important not to directly call the compareTo methods as that could result
// in an infinite loop. Instead, when comparing in a particular direction, just directly
// use the appropriate direction comparison so that it will follow that direction until
// it finds a difference or it simply returns 0, in which case the original to
@ -127,7 +127,7 @@ public class ColumnSegment<E> extends EdgeSegment<E> {
// NOTE: Segments are compared by following the next or previous segments until one of the
// segments definitively determines the order. When comparing segments in a particular
// direction, is is important not to directly call the compareTo methods as that could result
// direction, it is important not to directly call the compareTo methods as that could result
// in an infinite loop. Instead, when comparing in a particular direction, just directly
// use the appropriate direction comparison so that it will follow that direction until
// it finds a difference or it simply returns 0, in which case the original

2
Ghidra/Features/FunctionGraph/src/main/java/ghidra/app/plugin/core/functiongraph/graph/layout/flowchart/OrthogonalEdgeRouter.java
View file

@ -115,7 +115,7 @@ public class OrthogonalEdgeRouter<V extends VisualVertex, E extends VisualEdge<V
// default the range is empty, allowing any column.
GridRange excludedRange = excludedColumnsFunction.apply(e);
// try each each left and right column expanding outwards, starting at the columns of
// try each left and right column expanding outwards, starting at the columns of
// the start and end vertex.
for (int i = 1; i <= startCol; i++) {
int left = startCol - i;

4
Ghidra/Features/FunctionGraph/src/main/java/ghidra/app/plugin/core/functiongraph/graph/layout/flowchart/OrthogonalGridSizer.java
View file

@ -48,13 +48,13 @@ import ghidra.graph.viewer.layout.*;
* vertices. Since the height of a vertex is assigned completely to one row, that row's height
* is simply the maximum height of all the vertices in that row, plus any row padding.
* <P>
* Column sizing is more complicated. The width of any column is going to be the the max of either
* Column sizing is more complicated. The width of any column is going to be the max of either
* 1) vertices that half extend from the left + the thickness of edges that extend the right, OR
* 2) vertices that half extend from the right + the thickness of edges the extend from the left.
* Also, column padding is applied differently. For columns, padding is not just added to the
* column width like in rows. Instead, it acts as a minimum "edge thickness". In other words if the
* edge thickness is less than the padding, the edge thickness doesn't make the gaps bigger. Only if
* the edge thickness is greater the the column padding, then it determines the gap and the
* the edge thickness is greater than the column padding, then it determines the gap and the
* column padding contributes nothing.
*
* @param <V> the vertex type

4
Ghidra/Features/FunctionGraph/src/main/java/ghidra/app/plugin/core/functiongraph/graph/layout/flowchart/RowSegment.java
View file

@ -97,7 +97,7 @@ public class RowSegment<E> extends EdgeSegment<E> {
//
// NOTE: Segments are compared by following the next or previous segments until one of the
// segments definitively determines the order. When comparing segments in a particular
// direction, is is important not to directly call the compareTo methods as that could result
// direction, it is important not to directly call the compareTo methods as that could result
// in an infinite loop. Instead, when comparing in a particular direction, just directly
// use the appropriate direction comparison so that it will follow that direction until
// it finds a difference or it simply returns 0, in which case the original to
@ -123,7 +123,7 @@ public class RowSegment<E> extends EdgeSegment<E> {
// NOTE: Segments are compared by following the next or previous segments until one of the
// segments definitively determines the order. When comparing segments in a particular
// direction, is is important not to directly call the compareTo methods as that could result
// direction, it is important not to directly call the compareTo methods as that could result
// in an infinite loop. Instead, when comparing in a particular direction, just directly
// use the appropriate direction comparison so that it will follow that direction until
// it finds a difference or it simply returns 0, in which case the original to

2
Ghidra/Features/FunctionGraph/src/test.slow/java/ghidra/app/plugin/core/functiongraph/AbstractFunctionGraphTest.java
View file

@ -1405,7 +1405,7 @@ public abstract class AbstractFunctionGraphTest extends AbstractGhidraHeadedInte
assertVerticesRemoved(graph, ungroupedVertices);
assertEdgesRemoved(graph, ungroupedEdges);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex =
validateNewGroupedVertexFromVertices(functionGraph, ungroupedVertices,

10
Ghidra/Features/FunctionGraph/src/test.slow/java/ghidra/app/plugin/core/functiongraph/FunctionGraphGroupVertices1Test.java
View file

@ -84,7 +84,7 @@ public class FunctionGraphGroupVertices1Test extends AbstractFunctionGraphTest {
group(ungroupedVertices);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);
@ -202,7 +202,7 @@ public class FunctionGraphGroupVertices1Test extends AbstractFunctionGraphTest {
group(ungroupedVertices);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);
@ -264,7 +264,7 @@ public class FunctionGraphGroupVertices1Test extends AbstractFunctionGraphTest {
//printEdges(ungroupedEdges);
group(ungroupedVertices);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex innerGroupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);
@ -408,7 +408,7 @@ public class FunctionGraphGroupVertices1Test extends AbstractFunctionGraphTest {
assertVerticesRemoved(graph, ungroupedVertices);
assertEdgesRemoved(graph, ungroupedEdges);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);
@ -861,7 +861,7 @@ public class FunctionGraphGroupVertices1Test extends AbstractFunctionGraphTest {
assertVerticesRemoved(graph, ungroupedVertices);
assertEdgesRemoved(graph, ungroupedEdges);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex =
validateNewGroupedVertexFromVertices(functionGraph, ungroupedVertices,

4
Ghidra/Features/FunctionGraph/src/test.slow/java/ghidra/app/plugin/core/functiongraph/FunctionGraphGroupVertices2Test.java
View file

@ -60,7 +60,7 @@ public class FunctionGraphGroupVertices2Test extends AbstractFunctionGraphTest {
assertVerticesRemoved(graph, ungroupedVertices);
assertEdgesRemoved(graph, ungroupedEdges);
// -1 because one one of the edges was between two of the vertices being grouped
// -1 because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);
@ -89,7 +89,7 @@ public class FunctionGraphGroupVertices2Test extends AbstractFunctionGraphTest {
group(ungroupedVertices);
// (size - 1) because one one of the edges was between two of the vertices being grouped
// (size - 1) because one of the edges was between two of the vertices being grouped
int expectedGroupedEdgeCount = ungroupedEdges.size() - 1;
GroupedFunctionGraphVertex groupedVertex = validateNewGroupedVertexFromVertices(
functionGraph, ungroupedVertices, expectedGroupedEdgeCount);