-t table -N chain
-t table -A chain -f foo -b bar
-t table -I chain 2 -f foo -b bar
-t table -A chain -f foo -b baz

* table
-N chain
-A chain -f foo -b bar
-I chain 2 -f foo -b bar
-I chain 1 -f foo -b bar

* nat
-A PREROUTING -f foo -b bar
COMMIT
* table
-N chain
-A chain -f foo -b bar
-I chain 2 -f foo -b bar
-A chain -f foo -b baz

  return %outputs_20 : tensor<?x?x4xf32>
}

// -----

// Test a while to map_fn conversion in which the passed in max_iterations 
// is not in typical location of %arg3 and there are identify chains in function bodies.

// CHECK-LABEL: @map_while_cond_170

Austin Clements <******@****.***> 1683216807 -0400

		dwarf.Uleb128put(d, lsDwsym, int64(files[k].dir))
		lsu.AddUint8(0) // mtime
		lsu.AddUint8(0) // length
	}
	lsu.AddUint8(0) // terminator
}

// writelines collects up and chains together the symbols needed to
// form the DWARF line table for the specified compilation unit,
// returning a list of symbols. The returned list will include an

//
// We skip missing-package errors earlier in the process, since we want to
// resolve pathSets ourselves, but at that point, we don't have enough context
// to log the package-import chains leading to each error.
func (r *resolver) checkPackageProblems(ctx context.Context, pkgPatterns []string) {
	defer base.ExitIfErrors()

	// Gather information about modules we might want to load retractions and

Jacek Ewertowski <******@****.***> 1666353045 +0200

Oliver Liu <******@****.***> 1523299220 -0700

Tao Li <******@****.***> 1518720412 -0800