By onnx checker. check_ Common errors detected by model

error 1：“Field 'name' of graph is required to be non-empty.”

solve ： Yes model.graph.name assignment .

error 2：“Nodes in a graph must be topologically sorted, however input ...”

solve ： Adjust node order , Ensure that the input of each node exists before it .

The reference codes are as follows ：

def check_update_model(model):
    if (model.graph.name == ''):
        model.graph.name = 'tackle_checker_error'
        
    try:
        onnx.checker.check_model(model)
    except onnx.checker.ValidationError as e:
        print("model is invalid: %s"%(e))
        #  At present, only this error is considered “ Nodes in a graph must be topologically sorted, however input ...”,
        #  There is a problem with the node order of the model ,onnxruntime  It can be inferred , For other engines like  trt It can be inferred , Adjust the node order .
    else:
        return model
            
    print('update model ...')
    new_model = onnx.ModelProto(ir_version=model.ir_version,
                                producer_name=model.producer_name,
                                producer_version=model.producer_version,
                                opset_import=model.opset_import)
    
    new_model.graph.name = model.graph.name
    #  Only consider the case that the model is single input and single output .
    #  There is no need for  copy.deepcopy(model.graph.input[0]), python  It's written time copy.
    new_model.graph.input.append(model.graph.input[0])
    new_model.graph.output.append(model.graph.output[0])
    
    list_total_input_name = [model.graph.input[0].name]
    for weight in model.graph.initializer:
        new_model.graph.initializer.append(weight)
        list_total_input_name.append(weight.name)
        
    list_nodes_invalid = []
    for node in model.graph.node:
        node_invalid = False
        for node_input_name in node.input:
            if (list_total_input_name.count(node_input_name) == 0):
                list_nodes_invalid.append(node)
                node_invalid = True
                break
        if (node_invalid):
            continue
        for node_output_name in node.output:
            list_total_input_name.append(node_output_name)
        new_model.graph.node.append(node)
    
    for node in list_nodes_invalid:
        for node_input_name in node.input:
            assert list_total_input_name.count(node_input_name) > 0
        for node_output_name in node.output:
            list_total_input_name.append(node_output_name)
        new_model.graph.node.append(node)
        
    return new_model