@@ -1124,7 +1124,7 @@ void Node::ForEachDef(std::function<void(const onnxruntime::NodeArg&, bool is_in
1124
1124
// Version ir_version,
1125
1125
// std::unique_ptr<Graph>& new_graph) {
1126
1126
// // create instance. need to call private ctor so can't use make_unique
1127
- // GSL_SUPPRESS(r .11)
1127
+ // GSL_SUPPRESS(r.11)
1128
1128
// new_graph.reset(new Graph(nullptr, &graph_proto, domain_to_version, ir_version));
1129
1129
//
1130
1130
// // as we just loaded from file we want to fully initialize/Resolve, but not let that change
@@ -1566,7 +1566,7 @@ void Graph::RemoveEdge(NodeIndex src_node_index, NodeIndex dst_node_index, int s
1566
1566
#endif // !defined(ORT_MINIMAL_BUILD) || defined(ORT_EXTENDED_MINIMAL_BUILD)
1567
1567
1568
1568
#if !defined(ORT_MINIMAL_BUILD)
1569
- GSL_SUPPRESS (es .84 ) // ignoring return value from unordered_map::insert causes noisy complaint
1569
+ GSL_SUPPRESS (es.84 ) // ignoring return value from unordered_map::insert causes noisy complaint
1570
1570
Status Graph::BuildConnections(std::unordered_set<std::string>& outer_scope_node_args_consumed) {
1571
1571
// recurse into subgraphs first so we can update any nodes in this graph that are used by those subgraphs
1572
1572
if (!resolve_context_.nodes_with_subgraphs .empty ()) {
@@ -1845,7 +1845,7 @@ void Graph::KahnsTopologicalSort(const std::function<void(const Node*)>& enter,
1845
1845
}
1846
1846
}
1847
1847
1848
- GSL_SUPPRESS (es .84 ) // noisy warning about ignoring return value from insert(...)
1848
+ GSL_SUPPRESS (es.84 ) // noisy warning about ignoring return value from insert(...)
1849
1849
Status Graph::PerformTopologicalSortAndCheckIsAcyclic() {
1850
1850
nodes_in_topological_order_.clear ();
1851
1851
std::unordered_set<NodeIndex> downstream_nodes; // nodes downstream of the node we're currently checking
@@ -2209,7 +2209,7 @@ Status Graph::UpdateShapeInference(Node& node) {
2209
2209
}
2210
2210
2211
2211
// Implementation of type-inference and type-checking for a single node
2212
- GSL_SUPPRESS (f .23 ) // spurious warning about inferred_type never being checked for null
2212
+ GSL_SUPPRESS (f.23 ) // spurious warning about inferred_type never being checked for null
2213
2213
Status Graph::InferAndVerifyTypeMatch(Node& node, const OpSchema& op, const ResolveOptions& options) {
2214
2214
auto & node_name = node.Name ();
2215
2215
@@ -2650,7 +2650,7 @@ Status Graph::VerifyInputAndInitializerNames() {
2650
2650
}
2651
2651
2652
2652
for (auto & initializer_pair : name_to_initial_tensor_) {
2653
- GSL_SUPPRESS (es .84 )
2653
+ GSL_SUPPRESS (es.84 )
2654
2654
inputs_and_initializers.insert (initializer_pair.first );
2655
2655
// Initializers are expected to be included in inputs (according to ONNX spec).
2656
2656
// onnxruntime relaxes this constraint. No duplicate-name check here.
@@ -3314,7 +3314,7 @@ bool Graph::AddControlEdge(NodeIndex src_node_index, NodeIndex dst_node_index) {
3314
3314
return false ;
3315
3315
}
3316
3316
3317
- GSL_SUPPRESS (es .84 ) { // ignoring return from insert()
3317
+ GSL_SUPPRESS (es.84 ) { // ignoring return from insert()
3318
3318
nodes_[src_node_index]->MutableRelationships ().output_edges .insert (Node::EdgeEnd (*nodes_[dst_node_index]));
3319
3319
nodes_[dst_node_index]->MutableRelationships ().input_edges .insert (Node::EdgeEnd (*nodes_[src_node_index]));
3320
3320
nodes_[dst_node_index]->MutableRelationships ().control_inputs .insert (nodes_[src_node_index]->Name ());
@@ -3651,7 +3651,7 @@ void Graph::ComputeOverridableInitializers() {
3651
3651
3652
3652
#if !defined(ORT_MINIMAL_BUILD)
3653
3653
3654
- GSL_SUPPRESS (es .84 ) // warning about ignoring return value from insert(...)
3654
+ GSL_SUPPRESS (es.84 ) // warning about ignoring return value from insert(...)
3655
3655
Status Graph::SetGraphInputsOutputs () {
3656
3656
// If loaded from a model file, we start from the specified inputs and
3657
3657
// outputs set earlier by InitializeStateFromModelFileGraphProto().
@@ -3837,7 +3837,7 @@ Status Graph::PopulateNodeArgToProducerConsumerLookupsFromNodes() {
3837
3837
}
3838
3838
3839
3839
// calling private ctor
3840
- GSL_SUPPRESS (r .11 )
3840
+ GSL_SUPPRESS (r.11 )
3841
3841
gsl::not_null<Node*> Graph::AllocateNode () {
3842
3842
ORT_ENFORCE (nodes_.size () < static_cast <unsigned int >(std::numeric_limits<int >::max ()));
3843
3843
std::unique_ptr<Node> new_node (new Node (nodes_.size (), *this ));
0 commit comments