| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -14,7 +14,7 @@ | |||
| 14 | 14 | // thread states within each bucket. | |
| 15 | 15 | // | |
| 16 | 16 | // The queueing thread uses the eval breaker mechanism to notify the owning | |
| 17 | - // thread that it has objects to merge. Additionaly, all queued objects are | ||
| 17 | + // thread that it has objects to merge. Additionally, all queued objects are | ||
| 18 | 18 | // merged during GC. | |
| 19 | 19 | #include "Python.h" | |
| 20 | 20 | #include "pycore_object.h" // _Py_ExplicitMergeRefcount | |
@@ -197,7 +197,7 @@ _Py_brc_after_fork(PyInterpreterState *interp) | |||
| 197 | 197 | { | |
| 198 | 198 | // Unlock all bucket mutexes. Some of the buckets may be locked because | |
| 199 | 199 | // locks can be handed off to a parked thread (see lock.c). We don't have | |
| 200 | - // to worry about consistency here, becuase no thread can be actively | ||
| 200 | + // to worry about consistency here, because no thread can be actively | ||
| 201 | 201 | // modifying a bucket, but it might be paused (not yet woken up) on a | |
| 202 | 202 | // PyMutex_Lock while holding that lock. | |
| 203 | 203 | for (Py_ssize_t i = 0; i < _Py_BRC_NUM_BUCKETS; i++) { | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -1478,7 +1478,7 @@ initialize_locals(PyThreadState *tstate, PyFunctionObject *func, | |||
| 1478 | 1478 | localsplus[total_args] = u; | |
| 1479 | 1479 | } | |
| 1480 | 1480 | else if (argcount > n) { | |
| 1481 | - /* Too many postional args. Error is reported later */ | ||
| 1481 | + /* Too many positional args. Error is reported later */ | ||
| 1482 | 1482 | for (j = n; j < argcount; j++) { | |
| 1483 | 1483 | Py_DECREF(args[j]); | |
| 1484 | 1484 | } | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -2861,7 +2861,7 @@ _PyCfg_OptimizedCfgToInstructionSequence(cfg_builder *g, | |||
| 2861 | 2861 | } | |
| 2862 | 2862 | ||
| 2863 | 2863 | /* This is used by _PyCompile_Assemble to fill in the jump and exception | |
| 2864 | - * targets in a synthetic CFG (which is not the ouptut of the builtin compiler). | ||
| 2864 | + * targets in a synthetic CFG (which is not the output of the builtin compiler). | ||
| 2865 | 2865 | */ | |
| 2866 | 2866 | int | |
| 2867 | 2867 | _PyCfg_JumpLabelsToTargets(cfg_builder *g) | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -1,5 +1,5 @@ | |||
| 1 | 1 | // This implements the reference cycle garbage collector. | |
| 2 | - // The Python module inteface to the collector is in gcmodule.c. | ||
| 2 | + // The Python module interface to the collector is in gcmodule.c. | ||
| 3 | 3 | // See https://devguide.python.org/internals/garbage-collector/ | |
| 4 | 4 | ||
| 5 | 5 | #include "Python.h" | |
@@ -1260,7 +1260,7 @@ gc_list_set_space(PyGC_Head *list, int space) | |||
| 1260 | 1260 | * the incremental collector must progress through the old | |
| 1261 | 1261 | * space faster than objects are added to the old space. | |
| 1262 | 1262 | * | |
| 1263 | - * Each young or incremental collection adds a numebr of | ||
| 1263 | + * Each young or incremental collection adds a number of | ||
| 1264 | 1264 | * objects, S (for survivors) to the old space, and | |
| 1265 | 1265 | * incremental collectors scan I objects from the old space. | |
| 1266 | 1266 | * I > S must be true. We also want I > S * N to be where | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -1961,7 +1961,7 @@ import_run_extension(PyThreadState *tstate, PyModInitFunction p0, | |||
| 1961 | 1961 | * | |
| 1962 | 1962 | * However, for single-phase init the module's init function will | |
| 1963 | 1963 | * create the module, create other objects (and allocate other | |
| 1964 | - * memory), populate it and its module state, and initialze static | ||
| 1964 | + * memory), populate it and its module state, and initialize static | ||
| 1965 | 1965 | * types. Some modules store other objects and data in global C | |
| 1966 | 1966 | * variables and register callbacks with the runtime/stdlib or | |
| 1967 | 1967 | * even external libraries (which is part of why we can't just | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -1455,7 +1455,7 @@ PyUnstable_Optimizer_NewCounter(void) | |||
| 1455 | 1455 | ||
| 1456 | 1456 | /* We use a bloomfilter with k = 6, m = 256 | |
| 1457 | 1457 | * The choice of k and the following constants | |
| 1458 | - * could do with a more rigourous analysis, | ||
| 1458 | + * could do with a more rigorous analysis, | ||
| 1459 | 1459 | * but here is a simple analysis: | |
| 1460 | 1460 | * | |
| 1461 | 1461 | * We want to keep the false positive rate low. | |
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
@@ -87,4 +87,4 @@ Tier 2 IR entries are all the same size; there is no equivalent to `EXTENDED_ARG | |||
| 87 | 87 | ||
| 88 | 88 | - **opcode**: Sometimes the same as a Tier 1 opcode, sometimes a separate micro opcode. Tier 2 opcodes are 9 bits (as opposed to Tier 1 opcodes, which fit in 8 bits). By convention, Tier 2 opcode names start with `_`. | |
| 89 | 89 | - **oparg**: The argument. Usually the same as the Tier 1 oparg after expansion of `EXTENDED_ARG` prefixes. Up to 32 bits. | |
| 90 | - - **operand**: An aditional argument, Typically the value of *one* cache item from the Tier 1 inline cache, up to 64 bits. | ||
| 90 | + - **operand**: An additional argument, Typically the value of *one* cache item from the Tier 1 inline cache, up to 64 bits. | ||
| Back | FazBrowse Home | New Git URL |
0 commit comments