//
			// If x and y were compared before, they must be equal
			// (if they were not, the recursion would have stopped);
			// search the ifacePair stack for the same pair.
			//
			// This is a quadratic algorithm, but in practice these stacks
			// are extremely short (bounded by the nesting depth of interface
			// type declarations that recur via parameter types, an extremely

		if v == "2" {
			// Obtain the caller stack. (This is equivalent to runtime/debug.Stack,
			// copied to avoid importing the whole package.)
			stack := make([]byte, 1024)
			for {
				n := runtime.Stack(stack, false)
				if n < len(stack) {
					stack = stack[:n]
					break
				}
				stack = make([]byte, 2*len(stack))
			}

			if i := bytes.Index(stack, []byte("\nos/exec.Command(")); i >= 0 {

    local variables.

    This pass requires that the full shape of the stack can be inferred: 1) the
    maximum size needs to be a constant and 2) a push op can be found with a
    known shape, and all push ops need to have the same shape.

    A stack creation op "tf.StackV2" will be turned in to two zero-initialized
    variables, for the buffer and current size. Each push will be turned into
    ```mlir

    Arg<TF_Tensor, [{The tensor to be pushed onto the stack.}]>:$elem,

    DefaultValuedOptionalAttr<BoolAttr, "false">:$swap_memory
  );

  let results = (outs
    Res<TF_Tensor, [{The same tensor as the input 'elem'.}]>:$output
  );

  TF_DerivedOperandTypeAttr T = TF_DerivedOperandTypeAttr<1>;
}

	stksize    int64                // stack size for current frame
	stkptrsize int64                // prefix of stack containing pointers

	// alignment for current frame.
	// NOTE: when stkalign > PtrSize, currently this only ensures the offsets of
	// objects in the stack frame are aligned. The stack pointer is still aligned
	// only PtrSize.
	stkalign int64