aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorbikinibabe <amberwelch@unomaha.edu>2015-01-31 15:07:55 -0500
committerCory Fields <cory-nospam-@coryfields.com>2015-01-31 17:38:28 -0500
commitee932025c1a318943a6b101be9fe7a4a2e10648c (patch)
treecca272581d2cb6b9bf39283f3e4ab26da032a4fc
parent1fa89a54e8c207564ea7acd262e6389174feaed9 (diff)
downloadbitcoin-ee932025c1a318943a6b101be9fe7a4a2e10648c.tar.xz
Changed pronouns for correctness and inclusivity
-rw-r--r--doc/build-unix.md2
-rwxr-xr-xqa/rpc-tests/wallet.py2
-rw-r--r--src/checkqueue.h2
3 files changed, 3 insertions, 3 deletions
diff --git a/doc/build-unix.md b/doc/build-unix.md
index 5f60dff06c..0984f689a8 100644
--- a/doc/build-unix.md
+++ b/doc/build-unix.md
@@ -196,7 +196,7 @@ Hardening enables the following features:
* Position Independent Executable
Build position independent code to take advantage of Address Space Layout Randomization
offered by some kernels. An attacker who is able to cause execution of code at an arbitrary
- memory location is thwarted if he doesn't know where anything useful is located.
+ memory location is thwarted if he or she doesn't know where anything useful is located.
The stack and heap are randomly located by default but this allows the code section to be
randomly located as well.
diff --git a/qa/rpc-tests/wallet.py b/qa/rpc-tests/wallet.py
index f280ac380e..3e63493dc6 100755
--- a/qa/rpc-tests/wallet.py
+++ b/qa/rpc-tests/wallet.py
@@ -61,7 +61,7 @@ class WalletTest (BitcoinTestFramework):
walletinfo = self.nodes[0].getwalletinfo()
assert_equal(walletinfo['immature_balance'], 0)
- # Have node0 mine a block, thus he will collect his own fee.
+ # Have node0 mine a block, thus they will collect their own fee.
self.nodes[0].setgenerate(True, 1)
self.sync_all()
diff --git a/src/checkqueue.h b/src/checkqueue.h
index b8e2a17c76..7ca825c16f 100644
--- a/src/checkqueue.h
+++ b/src/checkqueue.h
@@ -81,7 +81,7 @@ private:
fAllOk &= fOk;
nTodo -= nNow;
if (nTodo == 0 && !fMaster)
- // We processed the last element; inform the master he can exit and return the result
+ // We processed the last element; inform the master he or she can exit and return the result
condMaster.notify_one();
} else {
// first iteration