/*consume=*/true);

    if (status->status.ok()) {
      // Run shape inference function for newly added node.
      status->status = desc->graph->refiner.AddNode(ret);
    }
    if (status->status.ok()) {
      // Add the node to the name-to-node mapping.
      desc->graph->name_map[ret->name()] = ret;
    } else if (ret != nullptr) {

  // Serialize to GraphDef.
  GraphDef graph_def2;
  ASSERT_TRUE(GetGraphDef(graph, &graph_def2));

  // Compare with first GraphDef + added NodeDef.
  NodeDef* added_node = graph_def.add_node();
  *added_node = node_def;
  EXPECT_EQ(graph_def.DebugString(), graph_def2.DebugString());

  // Look up some nodes by name.
  TF_Operation* neg2 = TF_GraphOperationByName(graph, "neg");

t.Run(fmt.Sprintf("line %d", lineNum), func(t *testing.T) { if A == "0" || B == "0" { t.Skip("skipping test with zero input") } if LCM == "1" { t.Skip("skipping test with LCM=1") } p, _ := bigmod.NewModulus(addOne(decodeHex(t, A))) a, _ := bigmod.NewNat().SetBytes(decodeHex(t, A), p) q, _ := bigmod.NewModulus(addOne(decodeHex(t, B))) b, _ := bigmod.NewNat().SetBytes(decodeHex(t, B), q) gcd, err := bigmod.NewNat().GCDVarTime(a, b) // GCD doesn't work if a and b are both even, but LCM handles it. if err == nil...

t.Run(fmt.Sprintf("line %d", lineNum), func(t *testing.T) { if A == "0" || B == "0" { t.Skip("skipping test with zero input") } if LCM == "1" { t.Skip("skipping test with LCM=1") } p, _ := bigmod.NewModulus(addOne(decodeHex(t, A))) a, _ := bigmod.NewNat().SetBytes(decodeHex(t, A), p) q, _ := bigmod.NewModulus(addOne(decodeHex(t, B))) b, _ := bigmod.NewNat().SetBytes(decodeHex(t, B), q) gcd, err := bigmod.NewNat().GCDVarTime(a, b) // GCD doesn't work if a and b are both even, but LCM handles it. if err == nil...