diff --git a/vpr/src/base/atom_lookup_fwd.h b/vpr/src/base/atom_lookup_fwd.h index b7885a738f3..fc9f7a31c9c 100644 --- a/vpr/src/base/atom_lookup_fwd.h +++ b/vpr/src/base/atom_lookup_fwd.h @@ -3,6 +3,6 @@ class AtomLookup; enum class BlockTnode { - INTERNAL, ///& permutation); -///@brief Convers a truth table to a lut mask (sequence of binary values representing minterms) +///@brief Converts a truth table to a lut mask (sequence of binary values representing minterms) std::vector truth_table_to_lut_mask(const AtomNetlist::TruthTable& truth_table, const size_t num_inputs); /** - * @brief Convers a logic cube (potnetially including don't cares) into + * @brief Converts a logic cube (potnetially including don't cares) into * a sequence of minterm numbers */ std::vector cube_to_minterms(std::vector cube); diff --git a/vpr/src/base/clustered_netlist.h b/vpr/src/base/clustered_netlist.h index ddde85aacc2..f8db125b35a 100644 --- a/vpr/src/base/clustered_netlist.h +++ b/vpr/src/base/clustered_netlist.h @@ -223,7 +223,7 @@ class ClusteredNetlist : public Netlist blk_x_pos; diff --git a/vpr/src/base/gen/README.gen.md b/vpr/src/base/gen/README.gen.md index a237dba3ec7..26b2ff2441b 100644 --- a/vpr/src/base/gen/README.gen.md +++ b/vpr/src/base/gen/README.gen.md @@ -1,3 +1,3 @@ `vpr_constraints_uxsdcxx.h`and `vpr_constraints_uxsdcxx_interface.h` are generated via uxsdcxx and are checked in to -avoid requiring python3 and the uxsdcxx depedencies to build VPR. +avoid requiring python3 and the uxsdcxx dependencies to build VPR. diff --git a/vpr/src/base/netlist.h b/vpr/src/base/netlist.h index 1d78062df40..07fd30c32a1 100644 --- a/vpr/src/base/netlist.h +++ b/vpr/src/base/netlist.h @@ -633,7 +633,7 @@ class Netlist { /** * @brief Removes a pin from the netlist. * - * The pin is marked invalid, and removed from any assoicated nets + * The pin is marked invalid, and removed from any associated nets * @param pin_id The pin_id of the pin to be removed */ void remove_pin(const PinId pin_id); @@ -680,7 +680,7 @@ class Netlist { void remove_net(const NetId net_id); /** - * @brief Removes a connection betwen a net and pin. + * @brief Removes a connection between a net and pin. * * The pin is removed from the net and the pin * will be marked as having no associated net @@ -730,7 +730,7 @@ class Netlist { /** * @brief Finds a block where the block's name contains the * provided input name as a substring. - * The intented use is to find the block id of a + * The intended use is to find the block id of a * hard block without knowing its name in the netlist. Instead * the block's module name in the HDL design can be used as it will * be a substring within its full name in the netlist. @@ -754,7 +754,7 @@ class Netlist { * The clustered netlist class defines another version of this * function that find blocks by checking for a pattern match, * meaning that the input is a pattern string and the pattern - * is looked for ine each block name. + * is looked for in each block name. * * @param name_substring A substring of a block name for which an ID needs * to be found. @@ -765,7 +765,7 @@ class Netlist { BlockId find_block_by_name_fragment(const std::string& name_substring) const; /** - * @brief Returns the PortId of the specifed port if it exists or PortId::INVALID() if not + * @brief Returns the PortId of the specified port if it exists or PortId::INVALID() if not * * @note This method is typically less efficient than searching by a t_model_port * With the overloaded AtomNetlist method @@ -948,21 +948,21 @@ class Netlist { */ /** - * @brief Returns the StringId of the specifed string if it exists or StringId::INVALID() if not + * @brief Returns the StringId of the specified string if it exists or StringId::INVALID() if not * * @param str The string to look for */ StringId find_string(const std::string& str) const; /** - * @brief Returns the BlockId of the specifed block if it exists or BlockId::INVALID() if not + * @brief Returns the BlockId of the specified block if it exists or BlockId::INVALID() if not * * @param name_id : The block name to look for */ BlockId find_block(const StringId name_id) const; /** - * @brief Returns the NetId of the specifed port if it exists or NetId::INVALID() if not + * @brief Returns the NetId of the specified port if it exists or NetId::INVALID() if not * * @param name_id The string ID of the net name to look for */ diff --git a/vpr/src/base/netlist.tpp b/vpr/src/base/netlist.tpp index 5b5563ff16f..e7b2431e6f9 100644 --- a/vpr/src/base/netlist.tpp +++ b/vpr/src/base/netlist.tpp @@ -532,7 +532,7 @@ PinId Netlist::find_pin(const PortId port_id, Bit if (iter == pins_rng.end() || pin_port_bit(*iter) != port_bit) { //Either the end of the pins (i.e. not found), or - //the value does not match (indicating a gap in the indicies, so also not found) + //the value does not match (indicating a gap in the indices, so also not found) return PinId::INVALID(); } else { //Found it @@ -1325,7 +1325,7 @@ void Netlist::rebuild_block_refs(const vtr::vecto VTR_ASSERT_SAFE_MSG(all_valid(pin_collection), "All Ids should be valid"); VTR_ASSERT(pin_collection.size() == size_t(block_num_input_pins_[blk_id] + block_num_output_pins_[blk_id] + block_num_clock_pins_[blk_id])); - //Similarily for ports + //Similarly for ports size_t num_input_ports = count_valid_refs(block_input_ports(blk_id), port_id_map); size_t num_output_ports = count_valid_refs(block_output_ports(blk_id), port_id_map); size_t num_clock_ports = count_valid_refs(block_clock_ports(blk_id), port_id_map); @@ -1710,12 +1710,12 @@ bool Netlist::validate_port_pin_refs() const { //Verify that the pins are listed in increasing order of port bit index, //we rely on this property to perform fast binary searches for pins with specific bit - //indicies + //indices if (first_bit) { prev_bit_index = port_bit_index; first_bit = false; } else if (prev_bit_index >= port_bit_index) { - VPR_FATAL_ERROR(VPR_ERROR_NETLIST, "Port pin indicies are not in ascending order"); + VPR_FATAL_ERROR(VPR_ERROR_NETLIST, "Port pin indices are not in ascending order"); } } } @@ -1909,7 +1909,7 @@ BlockId Netlist::find_block(const typename Netlis template void Netlist::associate_pin_with_block(const PinId pin_id, const PortType type, const BlockId blk_id) { - //Get an interator pointing to where we want to insert + //Get an iterator pointing to where we want to insert pin_iterator iter; if (type == PortType::INPUT) { iter = block_input_pins(blk_id).end(); @@ -1981,7 +1981,7 @@ template void Netlist::associate_port_with_block(const PortId port_id, const PortType type, const BlockId blk_id) { //Associate the port with the blocks inputs/outputs/clocks - //Get an interator pointing to where we want to insert + //Get an iterator pointing to where we want to insert port_iterator iter; if (type == PortType::INPUT) { iter = block_input_ports(blk_id).end(); diff --git a/vpr/src/base/netlist_utils.h b/vpr/src/base/netlist_utils.h index ca421dced7b..1bcfc9f3cab 100644 --- a/vpr/src/base/netlist_utils.h +++ b/vpr/src/base/netlist_utils.h @@ -56,7 +56,7 @@ vtr::vector_map compress_ids(const vtr::vector_map& ids) { * @brief Returns a vector based on 'values', which has had entries * dropped & re-ordered according according to 'id_map'. * - * Each entry in id_map corresponds to the assoicated element in 'values'. + * Each entry in id_map corresponds to the associated element in 'values'. * The value of the id_map entry is the new ID of the entry in values. * * If it is an invalid ID, the element in values is dropped. diff --git a/vpr/src/base/netlist_writer.cpp b/vpr/src/base/netlist_writer.cpp index 3ae23bf78ea..305ab659f0f 100644 --- a/vpr/src/base/netlist_writer.cpp +++ b/vpr/src/base/netlist_writer.cpp @@ -22,9 +22,9 @@ * 'Instance' object to represent the primitive. NetlistWriterVisitor saves these representations for later * output. * - * 'Instance' is an abstract class representing objects which know how to create thier own representation in + * 'Instance' is an abstract class representing objects which know how to create their own representation in * BLIF, Verilog and SDF formats. Most primitives can be represented by the BlackBoxInst class, but special - * primitives like LUTs and Latchs have thier own implementations (LutInst, LatchInst) to handle some of their + * primitives like LUTs and Latchs have their own implementations (LutInst, LatchInst) to handle some of their * unique requirements. * * Once the entire netlist has been traversed the netlist walker will call NetlistWriterVisitor's finish_impl() @@ -35,11 +35,11 @@ * Name Escaping * ============= * One of the challenges in generating netlists is producing consistent naming of netlist elements. - * In particular valid BLIF names, Verilog names and SDF names are not neccessarily the same. + * In particular valid BLIF names, Verilog names and SDF names are not necessarily the same. * As a result we must escape invalid characters/identifiers when producing some formats. * * All name escaping is handled at the output stage (i.e. in the print_*() functions) since it is - * very format dependant. + * very format dependent. * * VPR stores names internally generally following BLIF conventions. As a result these names need * to be escaped when generating Verilog or SDF. This is handled with escape_verilog_identifier() @@ -47,7 +47,7 @@ * * Primitives * ========== - * Verilog netlist generation assumes the existance of appropriate primitives for the various + * Verilog netlist generation assumes the existence of appropriate primitives for the various * atom types (i.e. a LUT_K module, a DFF module etc.). These are currently defined the file * `/vtr_flow/primitives.v`, where `` is the root of the VTR source tree. * @@ -168,7 +168,7 @@ struct DelayTriple { } }; -// This pair cointains the following values: +// This pair contains the following values: // - double: hold, setup or clock-to-q delays of the port // - string: port name of the associated source clock pin of the sequential port typedef std::pair sequential_port_delay_pair; @@ -287,10 +287,10 @@ class Instance { */ virtual void print_blif(std::ostream& os, size_t& unconn_count, int depth = 0) = 0; - ///@brief Print the current instanse in Verilog, see print_blif() for argument descriptions + ///@brief Print the current instance in Verilog, see print_blif() for argument descriptions virtual void print_verilog(std::ostream& os, size_t& unconn_count, int depth = 0) = 0; - ///@brief Print the current instanse in SDF, see print_blif() for argument descriptions + ///@brief Print the current instance in SDF, see print_blif() for argument descriptions virtual void print_sdf(std::ostream& os, int depth = 0) = 0; }; @@ -665,8 +665,8 @@ class BlackBoxInst : public Instance { public: BlackBoxInst(std::string type_name, /// params, /// - std::map attrs, /// + std::map params, /// + std::map attrs, /// std::map> input_port_conns, /// std::map> output_port_conns, /// std::vector timing_arcs, /// make_ram_instance(const t_pb* atom) { @@ -1783,7 +1783,7 @@ class NetlistWriterVisitor : public NetlistVisitor { //Delays // - //We record the souce sink tnodes and thier delays here + //We record the source sink tnodes and their delays here for (tatum::EdgeId edge : timing_ctx.graph->node_out_edges(src_tnode)) { DelayTriple delay_triple = get_edge_delay_triple(edge, *delay_calc_, *timing_ctx.graph); auto sink_tnode = timing_ctx.graph->edge_sink_node(edge); @@ -2820,7 +2820,7 @@ void print_verilog_port(std::ostream& os, size_t& unconn_count, const std::strin // Individual bits os << "{" << "\n"; - for (int ipin = (int)nets.size() - 1; ipin >= 0; --ipin) { //Reverse order to match endianess + for (int ipin = (int)nets.size() - 1; ipin >= 0; --ipin) { //Reverse order to match endianness os << indent(depth + 1); if (nets[ipin].empty()) { //Disconnected @@ -2855,7 +2855,7 @@ std::string escape_verilog_identifier(const std::string identifier) { //The escaped identifiers start with a literal back-slash '\' //followed by the identifier and are terminated by white space // - //We pre-pend the escape back-slash and append a space to avoid + //We prepend the escape back-slash and append a space to avoid //the identifier gobbling up adjacent characters like commas which //are not actually part of the identifier std::string prefix = "\\"; @@ -2883,7 +2883,7 @@ bool is_special_sdf_char(char c) { //Since the spec allows for non-special characters to be escaped (they are treated //normally), we treat $ as a special character to be safe. // - //Note that the spec appears to have rendering errors in the PDF availble + //Note that the spec appears to have rendering errors in the PDF available //on IEEE Xplore, listing the 'LEFT-POINTING DOUBLE ANGLE QUOTATION MARK' //character (decimal code 171) in place of the APOSTROPHE character ' //with decimal code 39 in the special character list. We assume code 39. diff --git a/vpr/src/base/place_and_route.cpp b/vpr/src/base/place_and_route.cpp index 4462fbe1d8e..5adef6398bb 100644 --- a/vpr/src/base/place_and_route.cpp +++ b/vpr/src/base/place_and_route.cpp @@ -102,7 +102,7 @@ int binary_search_place_and_route(const Netlist<>& placement_net_list, current = router_opts.fixed_channel_width + 5 * udsd_multiplier; low = router_opts.fixed_channel_width - 1 * udsd_multiplier; } else { - // Initialize binary serach guess + // Initialize binary search guess if (min_chan_width_hint > 0) { // If the user provided a hint use it as the initial guess @@ -288,7 +288,7 @@ int binary_search_place_and_route(const Netlist<>& placement_net_list, // The binary search above occasionally does not find the minimum routeable channel width. // Sometimes a circuit that will not route in 19 channels will route in 18, due to router flukiness. // If verify_binary_search is set, the code below will ensure that FPGAs with channel widths of - // final-2 and final-3 wil not route successfully. + // final-2 and final-3 will not route successfully. // If one does route successfully, the router keeps trying smaller channel widths until two in a // row (e.g. 8 and 9) fail. diff --git a/vpr/src/base/read_blif.cpp b/vpr/src/base/read_blif.cpp index eed430a6fe9..4de3020a3ba 100644 --- a/vpr/src/base/read_blif.cpp +++ b/vpr/src/base/read_blif.cpp @@ -217,7 +217,7 @@ struct BlifAllocCallback : public blifparse::Callback { VTR_ASSERT(q_model_port->size == 1); VTR_ASSERT(clk_model_port->is_clock); - //We set the initital value as a single entry in the 'truth_table' field + //We set the initial value as a single entry in the 'truth_table' field AtomNetlist::TruthTable truth_table(1); truth_table[0].push_back(to_vtr_logic_value(init)); @@ -361,7 +361,7 @@ struct BlifAllocCallback : public blifparse::Callback { //however we must defer that until all the net drivers //and sinks have been created (otherwise they may not //be properly merged depending on where the .conn is - //delcared). + //declared). // //As a result we record the nets to merge and do the actual merging at //the end of the .model @@ -531,7 +531,7 @@ struct BlifAllocCallback : public blifparse::Callback { return std::make_pair(trimmed_signal_name, bit_index); } - ///@brief Retieves a reference to the currently active .model + ///@brief Retrieves a reference to the currently active .model AtomNetlist& curr_model() { if (blif_models_.empty() || ended_) { vpr_throw(VPR_ERROR_BLIF_F, filename_.c_str(), lineno_, "Expected .model"); diff --git a/vpr/src/base/read_circuit.cpp b/vpr/src/base/read_circuit.cpp index 152a627d77d..cc9e2e1d5ae 100644 --- a/vpr/src/base/read_circuit.cpp +++ b/vpr/src/base/read_circuit.cpp @@ -155,7 +155,7 @@ static void show_circuit_stats(const AtomNetlist& netlist, const LogicalModels& LogicalModelId blk_model_id = netlist.block_model(blk_id); std::string blk_model_name = models.get_model(blk_model_id).name; ++block_type_counts[blk_model_name]; - // If this block is a LUT, also count the occurences of this size of LUT + // If this block is a LUT, also count the occurrences of this size of LUT // for more logging information. if (blk_model_id == names_model_id) { // May have zero (no input LUT) or one input port diff --git a/vpr/src/base/read_netlist.cpp b/vpr/src/base/read_netlist.cpp index d5a5b9e8135..c4126a86ab9 100644 --- a/vpr/src/base/read_netlist.cpp +++ b/vpr/src/base/read_netlist.cpp @@ -816,7 +816,7 @@ static void process_ports(pugi::xml_node Parent, VTR_ASSERT(num_sets == 1 && num_ptrs[0] == 1); int rr_node_index = pb->pb_graph_node->output_pins[out_port][i].pin_count_in_cluster; - //Why does this not use the output pin used to deterimine the rr node index? + //Why does this not use the output pin used to determine the rr node index? pb_route.insert(std::make_pair(rr_node_index, t_pb_route())); pb_route[rr_node_index].driver_pb_pin_id = pin_node[0][0]->pin_count_in_cluster; pb_route[rr_node_index].pb_graph_pin = &pb->pb_graph_node->output_pins[out_port][i]; diff --git a/vpr/src/base/read_options.cpp b/vpr/src/base/read_options.cpp index fca403f89e2..605e89e9c71 100644 --- a/vpr/src/base/read_options.cpp +++ b/vpr/src/base/read_options.cpp @@ -1569,7 +1569,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio gfx_grp.add_argument(args.graphics_commands, "--graphics_commands") .help( - "A set of semi-colon seperated graphics commands. \n" + "A set of semi-colon separated graphics commands. \n" "Commands must be surrounded by quotation marks (e.g. --graphics_commands \"save_graphics place.png\")\n" " Commands:\n" " * save_graphics \n" @@ -2035,7 +2035,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio "is used as a guide, the legalizer may not follow this if it must fill " "the tile more." "\n" - "When this option is set ot auto, VPR will select good values for the " + "When this option is set to auto, VPR will select good values for the " "target density of tiles." "\n" "This option is similar to appack_max_dist_th, where a regex string " @@ -2142,7 +2142,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio pack_grp.add_argument(args.connection_gain_weight, "--connection_gain_weight") .help( "Parameter that weights the absorption of small nets vs signal sharing." - " 0.0 focuses solely on sharing, 1.0 solely on small net absoprtion." + " 0.0 focuses solely on sharing, 1.0 solely on small net absorption." " Only meaningful if --connection_driven_clustering=on") .default_value("0.9") .show_in(argparse::ShowIn::HELP_ONLY); @@ -2665,7 +2665,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio place_timing_grp.add_argument(args.place_tsu_abs_margin, "--place_tsu_abs_margin") .help( - "Specifies an absolute offest added to cell setup times used by the placer." + "Specifies an absolute offset added to cell setup times used by the placer." " This effectively controls whether the placer should try to achieve extra margin on setup paths." " For example a value of 500e-12 corresponds to requesting an extra 500ps of setup margin.") .default_value("0.0") @@ -2854,7 +2854,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio route_timing_grp.add_argument(args.astar_fac, "--astar_fac") .help( "Controls the directedness of the timing-driven router's exploration." - " Values between 1 and 2 are resonable; higher values trade some quality for reduced run-time") + " Values between 1 and 2 are reasonable; higher values trade some quality for reduced run-time") .default_value("1.2") .show_in(argparse::ShowIn::HELP_ONLY); @@ -2862,7 +2862,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio .help( "Controls the directedness of the timing-driven router's exploration." " It is a subtractive adjustment to the lookahead heuristic." - " Values between 0 and 1e-9 are resonable; higher values may increase quality at the expense of run-time.") + " Values between 0 and 1e-9 are reasonable; higher values may increase quality at the expense of run-time.") .default_value("0.0") .show_in(argparse::ShowIn::HELP_ONLY); @@ -2871,7 +2871,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio "Controls the directedness of the timing-driven router's exploration" " when doing router delay profiling of an architecture." " The router delay profiling step is currently used to calculate the place delay matrix lookup." - " Values between 1 and 2 are resonable; higher values trade some quality for reduced run-time") + " Values between 1 and 2 are reasonable; higher values trade some quality for reduced run-time") .default_value("1.2") .show_in(argparse::ShowIn::HELP_ONLY); @@ -3225,7 +3225,7 @@ argparse::ArgumentParser create_arg_parser(const std::string& prog_name, t_optio "'--echo_file on' is set:\n" " * -1: All nodes are dumped into the DOT file\n" " * >= 0: Only the transitive fanin/fanout of the node is dumped (easier to view)\n" - " * a string: Interpretted as a VPR pin name which is converted to a node id, and dumped as above\n") + " * a string: Interpreted as a VPR pin name which is converted to a node id, and dumped as above\n") .default_value("-1") .show_in(argparse::ShowIn::HELP_ONLY); diff --git a/vpr/src/base/read_place.cpp b/vpr/src/base/read_place.cpp index 36f4174af51..f992587ec98 100644 --- a/vpr/src/base/read_place.cpp +++ b/vpr/src/base/read_place.cpp @@ -239,7 +239,7 @@ static std::string read_place_body(std::ifstream& placement_file, //Load the block location // // If the place file corresponds to a 3D architecture, it should contain 5 tokens of actual data, with an optional 6th (commented) token indicating VPR's internal block number. - // If it belongs to 2D architecture file, supported for backward compatability, We should have 4 tokens of actual data, with an optional 5th (commented) token indicating VPR's + // If it belongs to 2D architecture file, supported for backward compatibility, We should have 4 tokens of actual data, with an optional 5th (commented) token indicating VPR's //internal block number int block_name_index = 0; int block_x_index = 1; diff --git a/vpr/src/base/stats.cpp b/vpr/src/base/stats.cpp index 25a0fafcc20..2e0cb1b8ffe 100644 --- a/vpr/src/base/stats.cpp +++ b/vpr/src/base/stats.cpp @@ -473,7 +473,7 @@ void print_wirelen_prob_dist(bool is_flat) { VTR_LOG("\n"); VTR_LOG("Probability distribution of 2-pin net lengths:\n"); VTR_LOG("\n"); - VTR_LOG("Length p(Lenth)\n"); + VTR_LOG("Length p(Length)\n"); av_length = 0; diff --git a/vpr/src/base/vpr_context.h b/vpr/src/base/vpr_context.h index 051e109b4b4..dce08e15040 100644 --- a/vpr/src/base/vpr_context.h +++ b/vpr/src/base/vpr_context.h @@ -502,7 +502,7 @@ struct PlacementContext : public Context { bool f_placer_debug = false; /** - * Set this variable to ture if the type of the bounding box used in placement is of the type cube. If it is false, + * Set this variable to true if the type of the bounding box used in placement is of the type cube. If it is false, * it would mean that per-layer bounding box is used. For the 2D architecture, the cube bounding box would be used. */ bool cube_bb = false; diff --git a/vpr/src/base/vpr_signal_handler.cpp b/vpr/src/base/vpr_signal_handler.cpp index 4f291d600a9..df697a17eaf 100644 --- a/vpr/src/base/vpr_signal_handler.cpp +++ b/vpr/src/base/vpr_signal_handler.cpp @@ -17,7 +17,7 @@ #include "read_place.h" #include "read_route.h" -// Currenly safe_write uses the POSIX write system call. This could be extended to other platforms in the future. +// Currently safe_write uses the POSIX write system call. This could be extended to other platforms in the future. #if defined(__unix__) #include "unistd.h" #endif diff --git a/vpr/src/base/vpr_types.cpp b/vpr/src/base/vpr_types.cpp index f1cd81df6d1..b2eb8507ff6 100644 --- a/vpr/src/base/vpr_types.cpp +++ b/vpr/src/base/vpr_types.cpp @@ -80,7 +80,7 @@ t_ext_pin_util_targets::t_ext_pin_util_targets(const std::vector& s target_ext_pin_util.output_pin_util = vtr::atof(elements[1]); } else { std::stringstream msg; - msg << "Invalid conversion from '" << spec << "' to external pin util (expected either a single float value, or two float values separted by a comma)"; + msg << "Invalid conversion from '" << spec << "' to external pin util (expected either a single float value, or two float values separated by a comma)"; VPR_FATAL_ERROR(VPR_ERROR_PACK, msg.str().c_str()); } @@ -431,7 +431,7 @@ std::string t_pb::hierarchical_type_name() const { * equivalent pins */ BitIndex t_pb::atom_pin_bit_index(const t_pb_graph_pin* gpin) const { - VTR_ASSERT_MSG(is_primitive(), "Atom pin indicies can only be looked up from primitives"); + VTR_ASSERT_MSG(is_primitive(), "Atom pin indices can only be looked up from primitives"); auto iter = pin_rotations_.find(gpin); diff --git a/vpr/src/base/vpr_types.h b/vpr/src/base/vpr_types.h index 4bd8b1557dd..2d0c68b7662 100644 --- a/vpr/src/base/vpr_types.h +++ b/vpr/src/base/vpr_types.h @@ -208,7 +208,7 @@ class t_pack_high_fanout_thresholds { explicit t_pack_high_fanout_thresholds(const std::vector& specs); t_pack_high_fanout_thresholds& operator=(t_pack_high_fanout_thresholds&& other) noexcept; - ///@brief Returns the high fanout threshold of the specifi ed block + ///@brief Returns the high fanout threshold of the specified block int get_threshold(std::string_view block_type_name) const; ///@brief Returns a string describing high fanout thresholds for different block types @@ -860,7 +860,7 @@ enum class e_place_bounding_box_mode { * * Supports the method is_timing_driven(), which allows flexible updates * to the placer algorithms if more timing driven placement strategies - * are added in tht future. This method is used across various placement + * are added in the future. This method is used across various placement * setup files, and it can be useful for major placer routines as well. * * More methods can be added to this class if the placement strategies diff --git a/vpr/src/noc/noc_traffic_flows.h b/vpr/src/noc/noc_traffic_flows.h index f9a59ca4d28..67a0c175b8d 100644 --- a/vpr/src/noc/noc_traffic_flows.h +++ b/vpr/src/noc/noc_traffic_flows.h @@ -55,7 +55,7 @@ struct t_noc_traffic_flow { /** The bandwidth of the information transferred between the two routers. Units in bytes per second. This parameters will be used to update the link usage in the noc model after routing the traffic flow.*/ double traffic_flow_bandwidth; - /** The maximum allowable time to transmit data between thw two routers, in seconds. This parameter will be used to evaluate a router traffic flow.*/ + /** The maximum allowable time to transmit data between the two routers, in seconds. This parameter will be used to evaluate a router traffic flow.*/ double max_traffic_flow_latency; /** Indicates the importance of the traffic flow. Higher priority traffic flows will have more importance and will be more likely to have their latency reduced and constraints met. Range: [0-inf) */ diff --git a/vpr/src/noc/read_xml_noc_traffic_flows_file.cpp b/vpr/src/noc/read_xml_noc_traffic_flows_file.cpp index 2be62047455..1b5c8e36420 100644 --- a/vpr/src/noc/read_xml_noc_traffic_flows_file.cpp +++ b/vpr/src/noc/read_xml_noc_traffic_flows_file.cpp @@ -193,7 +193,7 @@ void verify_traffic_flow_router_modules(const std::string& source_router_name, c } // check if the source and sink routers have the same name if (source_router_name == sink_router_name) { - // Cannot have the source and sink routers have the same name (they need to be different). A flow cant go to a single router. + // Cannot have the source and sink routers have the same name (they need to be different). A flow can't go to a single router. vpr_throw(VPR_ERROR_OTHER, loc_data.filename_c_str(), loc_data.line(single_flow_tag), "Source and sink NoC routers cannot be the same modules."); } } diff --git a/vpr/src/noc/read_xml_noc_traffic_flows_file.h b/vpr/src/noc/read_xml_noc_traffic_flows_file.h index 336e5458710..08ecbf199ec 100644 --- a/vpr/src/noc/read_xml_noc_traffic_flows_file.h +++ b/vpr/src/noc/read_xml_noc_traffic_flows_file.h @@ -117,7 +117,7 @@ int get_traffic_flow_priority(pugi::xml_node single_flow_tag, const pugiutil::lo /** * @brief Checks to see that the two router module names provided in the * traffic flow description are not empty and they dont have the - * same names. The two routers cant be the exact same since a router + * same names. The two routers can't be the exact same since a router * cannot communicate with itself. These names can be partial and not the * exact name of the router blocks. * diff --git a/vpr/src/util/lazy_pop_unique_priority_queue.h b/vpr/src/util/lazy_pop_unique_priority_queue.h index 5bf88f2cef2..691bd0d8399 100644 --- a/vpr/src/util/lazy_pop_unique_priority_queue.h +++ b/vpr/src/util/lazy_pop_unique_priority_queue.h @@ -39,7 +39,7 @@ template class LazyPopUniquePriorityQueue { public: - /** @brief The custom comparsion struct for sorting the items in the priority queue. + /** @brief The custom comparison struct for sorting the items in the priority queue. * A less than comparison will put the item with the highest sort value to the front of the queue. * A greater than comparison will put the item with the lowest sort value to the front of the queue. */ @@ -56,7 +56,7 @@ class LazyPopUniquePriorityQueue { /// @brief The set to store the keys that are in the queue. This is used to ensure uniqueness std::unordered_set content_set; - /// @brief The set to store the delete pending item from the queue refered by the key. + /// @brief The set to store the delete pending item from the queue referred by the key. std::unordered_set delete_pending_set; /** diff --git a/vpr/src/util/vpr_utils.cpp b/vpr/src/util/vpr_utils.cpp index a2562460941..59ac530acd0 100644 --- a/vpr/src/util/vpr_utils.cpp +++ b/vpr/src/util/vpr_utils.cpp @@ -986,7 +986,7 @@ const t_pb_graph_pin* find_pb_graph_pin(const t_pb_graph_node* pb_gnode, const s return nullptr; } -/* Recusively visit through all pb_graph_nodes to populate pb_graph_pin_lookup_from_index */ +/* Recursively visit through all pb_graph_nodes to populate pb_graph_pin_lookup_from_index */ static void load_pb_graph_pin_lookup_from_index_rec(t_pb_graph_pin** pb_graph_pin_lookup_from_index, t_pb_graph_node* pb_graph_node) { for (int iport = 0; iport < pb_graph_node->num_input_ports; iport++) { for (int ipin = 0; ipin < pb_graph_node->num_input_pins[iport]; ipin++) { diff --git a/vpr/src/util/vpr_utils.h b/vpr/src/util/vpr_utils.h index 2423da066dc..c00bab9cd2c 100644 --- a/vpr/src/util/vpr_utils.h +++ b/vpr/src/util/vpr_utils.h @@ -176,7 +176,7 @@ const t_pb_graph_pin* find_pb_graph_pin(const t_pb_graph_node* pb_gnode, const s const t_pb_graph_pin* find_pb_graph_pin(const AtomNetlist& netlist, const AtomPBBimap& atom_pb_lookup, const AtomPinId pin_id); /** - * @brief Retrieves the atom pin associated with a specific CLB and pb_graph_pin. Warning: Not all pb_graph_pins are associated with an atom pin! Only pb_graph_pins on primatives are associated with an AtomPinId. Returns AtomPinId::INVALID() if no atom pin is found. + * @brief Retrieves the atom pin associated with a specific CLB and pb_graph_pin. Warning: Not all pb_graph_pins are associated with an atom pin! Only pb_graph_pins on primitives are associated with an AtomPinId. Returns AtomPinId::INVALID() if no atom pin is found. */ AtomPinId find_atom_pin(ClusterBlockId blk_id, const t_pb_graph_pin* pb_gpin);