codeActionSucceeded = true;

const changes = textChanges.ChangeTracker.with(context, (t) => convertToAsyncFunction(t, context.sourceFile, context.span.start, context.program.getTypeChecker()));

return codeActionSucceeded ? [createCodeFixAction(fixId, changes, Diagnostics.Convert_to_async_function, fixId, Diagnostics.Convert_all_to_async_functions)] : [];

readonly kind: SynthBindingNameKind.BindingPattern;

readonly elements: readonly SynthBindingName[];

readonly bindingPattern: BindingPattern;

readonly types: Type[];

readonly kind: SynthBindingNameKind.Identifier;

readonly identifier: Identifier;

readonly types: Type[];

/** A declaration for this identifier has already been generated */

hasBeenDeclared: boolean;

hasBeenReferenced: boolean;

readonly checker: TypeChecker;

readonly synthNamesMap: ESMap<string, SynthIdentifier>; // keys are the symbol id of the identifier

readonly setOfExpressionsToReturn: ReadonlySet<number>; // keys are the node ids of the expressions

readonly isInJSFile: boolean;

readonly expression: PropertyAccessExpression & {

readonly escapedText: Name;

};

// get the function declaration - returns a promise

const tokenAtPosition = getTokenAtPosition(sourceFile, position);

let functionToConvert: FunctionLikeDeclaration | undefined;

// if the parent of a FunctionLikeDeclaration is a variable declaration, the convertToAsync diagnostic will be reported on the variable name

if (isIdentifier(tokenAtPosition) && isVariableDeclaration(tokenAtPosition.parent) &&

tokenAtPosition.parent.initializer && isFunctionLikeDeclaration(tokenAtPosition.parent.initializer)) {

functionToConvert = tokenAtPosition.parent.initializer;

}

else {

functionToConvert = tryCast(getContainingFunction(getTokenAtPosition(sourceFile, position)), canBeConvertedToAsync);

}

if (!functionToConvert) {

return;

}

const synthNamesMap = new Map<string, SynthIdentifier>();

const isInJavascript = isInJSFile(functionToConvert);

const setOfExpressionsToReturn = getAllPromiseExpressionsToReturn(functionToConvert, checker);

const functionToConvertRenamed = renameCollidingVarNames(functionToConvert, checker, synthNamesMap);

if (!returnsPromise(functionToConvertRenamed, checker)) {

return;

}

const returnStatements = functionToConvertRenamed.body && isBlock(functionToConvertRenamed.body) ? getReturnStatementsWithPromiseHandlers(functionToConvertRenamed.body, checker) : emptyArray;

const transformer: Transformer = { checker, synthNamesMap, setOfExpressionsToReturn, isInJSFile: isInJavascript };

if (!returnStatements.length) {

return;

}

const pos = functionToConvert.modifiers ? functionToConvert.modifiers.end :

functionToConvert.decorators ? skipTrivia(sourceFile.text, functionToConvert.decorators.end) :

functionToConvert.getStart(sourceFile);

const options = functionToConvert.modifiers ? { prefix: " " } : { suffix: " " };

changes.insertModifierAt(sourceFile, pos, SyntaxKind.AsyncKeyword, options);

for (const returnStatement of returnStatements) {

forEachChild(returnStatement, function visit(node) {

if (isCallExpression(node)) {

const newNodes = transformExpression(node, node, transformer, /*hasContinuation*/ false);

if (hasFailed()) {

return true; // return something truthy to shortcut out of more work

}

changes.replaceNodeWithNodes(sourceFile, returnStatement, newNodes);

}

else if (!isFunctionLike(node)) {

forEachChild(node, visit);

if (hasFailed()) {

return true; // return something truthy to shortcut out of more work

}

}

});

if (hasFailed()) {

return; // shortcut out of more work

}

}

const res: ReturnStatement[] = [];

forEachReturnStatement(body, ret => {

if (isReturnStatementWithFixablePromiseHandler(ret, checker)) res.push(ret);

});

return res;

if (!func.body) {

return new Set();

}

const setOfExpressionsToReturn = new Set<number>();

forEachChild(func.body, function visit(node: Node) {

if (isPromiseReturningCallExpression(node, checker, "then")) {

setOfExpressionsToReturn.add(getNodeId(node));

forEach(node.arguments, visit);

}

else if (isPromiseReturningCallExpression(node, checker, "catch") ||

isPromiseReturningCallExpression(node, checker, "finally")) {

setOfExpressionsToReturn.add(getNodeId(node));

// if .catch() or .finally() is the last call in the chain, move leftward in the chain until we hit something else that should be returned

forEachChild(node, visit);

}

else if (isPromiseTypedExpression(node, checker)) {

setOfExpressionsToReturn.add(getNodeId(node));

// don't recurse here, since we won't refactor any children or arguments of the expression

}

else {

forEachChild(node, visit);

}

});

return setOfExpressionsToReturn;

if (!isCallExpression(node)) return false;

const isExpressionOfName = hasPropertyAccessExpressionWithName(node, name);

const nodeType = isExpressionOfName && checker.getTypeAtLocation(node);

return !!(nodeType && checker.getPromisedTypeOfPromise(nodeType));

if (node.expression.name.escapedText === "finally") {

// for a `finally`, there's no type argument

return undefined;

}

// If the call to `then` or `catch` comes from the global `Promise` or `PromiseLike` type, we can safely use the

// type argument supplied for the callback. For other promise types we would need a more complex heuristic to determine

// which type argument is safe to use as an annotation.

const promiseType = checker.getTypeAtLocation(node.expression.expression);

if (isReferenceToType(promiseType, checker.getPromiseType()) ||

isReferenceToType(promiseType, checker.getPromiseLikeType())) {

if (node.expression.name.escapedText === "then") {

if (callback === elementAt(node.arguments, 0)) {

// for the `onfulfilled` callback, use the first type argument

return elementAt(node.typeArguments, 0);

}

else if (callback === elementAt(node.arguments, 1)) {

// for the `onrejected` callback, use the second type argument

return elementAt(node.typeArguments, 1);

}

}

else {

return elementAt(node.typeArguments, 0);

}

}

const identsToRenameMap = new Map<string, Identifier>(); // key is the symbol id

const collidingSymbolMap = createMultiMap<Symbol>();

forEachChild(nodeToRename, function visit(node: Node) {

if (!isIdentifier(node)) {

forEachChild(node, visit);

return;

}

const symbol = checker.getSymbolAtLocation(node);

if (symbol) {

const type = checker.getTypeAtLocation(node);

// Note - the choice of the last call signature is arbitrary

const lastCallSignature = getLastCallSignature(type, checker);

const symbolIdString = getSymbolId(symbol).toString();

// If the identifier refers to a function, we want to add the new synthesized variable for the declaration. Example:

// fetch('...').then(response => { ... })

// will eventually become

// const response = await fetch('...')

// so we push an entry for 'response'.

if (lastCallSignature && !isParameter(node.parent) && !isFunctionLikeDeclaration(node.parent) && !synthNamesMap.has(symbolIdString)) {

const firstParameter = firstOrUndefined(lastCallSignature.parameters);

const ident = firstParameter?.valueDeclaration

&& isParameter(firstParameter.valueDeclaration)

&& tryCast(firstParameter.valueDeclaration.name, isIdentifier)

|| factory.createUniqueName("result", GeneratedIdentifierFlags.Optimistic);

const synthName = getNewNameIfConflict(ident, collidingSymbolMap);

synthNamesMap.set(symbolIdString, synthName);

collidingSymbolMap.add(ident.text, symbol);

}

// We only care about identifiers that are parameters, variable declarations, or binding elements

else if (node.parent && (isParameter(node.parent) || isVariableDeclaration(node.parent) || isBindingElement(node.parent))) {

const originalName = node.text;

const collidingSymbols = collidingSymbolMap.get(originalName);

// if the identifier name conflicts with a different identifier that we've already seen

if (collidingSymbols && collidingSymbols.some(prevSymbol => prevSymbol !== symbol)) {

const newName = getNewNameIfConflict(node, collidingSymbolMap);

identsToRenameMap.set(symbolIdString, newName.identifier);

synthNamesMap.set(symbolIdString, newName);

collidingSymbolMap.add(originalName, symbol);

}

else {

const identifier = getSynthesizedDeepClone(node);

synthNamesMap.set(symbolIdString, createSynthIdentifier(identifier));

collidingSymbolMap.add(originalName, symbol);

}

}

}

});

return getSynthesizedDeepCloneWithReplacements(nodeToRename, /*includeTrivia*/ true, original => {

if (isBindingElement(original) && isIdentifier(original.name) && isObjectBindingPattern(original.parent)) {

const symbol = checker.getSymbolAtLocation(original.name);

const renameInfo = symbol && identsToRenameMap.get(String(getSymbolId(symbol)));

if (renameInfo && renameInfo.text !== (original.name || original.propertyName).getText()) {

return factory.createBindingElement(

original.dotDotDotToken,

original.propertyName || original.name,

renameInfo,

original.initializer);

}

}

else if (isIdentifier(original)) {

const symbol = checker.getSymbolAtLocation(original);

const renameInfo = symbol && identsToRenameMap.get(String(getSymbolId(symbol)));

if (renameInfo) {

return factory.createIdentifier(renameInfo.text);

}

}

});

const numVarsSameName = (originalNames.get(name.text) || emptyArray).length;

const identifier = numVarsSameName === 0 ? name : factory.createIdentifier(name.text + "_" + numVarsSameName);

return createSynthIdentifier(identifier);

if (isPromiseReturningCallExpression(node, transformer.checker, "then")) {

return transformThen(node, elementAt(node.arguments, 0), elementAt(node.arguments, 1), transformer, hasContinuation, continuationArgName);

}

if (isPromiseReturningCallExpression(node, transformer.checker, "catch")) {

return transformCatch(node, elementAt(node.arguments, 0), transformer, hasContinuation, continuationArgName);

}

if (isPromiseReturningCallExpression(node, transformer.checker, "finally")) {

return transformFinally(node, elementAt(node.arguments, 0), transformer, hasContinuation, continuationArgName);

}

if (isPropertyAccessExpression(node)) {

return transformExpression(returnContextNode, node.expression, transformer, hasContinuation, continuationArgName);

}

const nodeType = transformer.checker.getTypeAtLocation(node);

if (nodeType && transformer.checker.getPromisedTypeOfPromise(nodeType)) {

Debug.assertNode(getOriginalNode(node).parent, isPropertyAccessExpression);

return transformPromiseExpressionOfPropertyAccess(returnContextNode, node, transformer, hasContinuation, continuationArgName);

}

return silentFail();

if (node.kind === SyntaxKind.NullKeyword) return true;

if (isIdentifier(node) && !isGeneratedIdentifier(node) && idText(node) === "undefined") {

const symbol = checker.getSymbolAtLocation(node);

return !symbol || checker.isUndefinedSymbol(symbol);

}

return false;

let possibleNameForVarDecl: SynthIdentifier | undefined;

// If there is another call in the chain after the .catch() or .finally() we are transforming, we will need to save the result of both paths

// (try block and catch/finally block). To do this, we will need to synthesize a variable that we were not aware of while we were adding

// identifiers to the synthNamesMap. We will use the continuationArgName and then update the synthNamesMap with a new variable name for

// the next transformation step

if (continuationArgName && !shouldReturn(node, transformer)) {

if (isSynthIdentifier(continuationArgName)) {

possibleNameForVarDecl = continuationArgName;

transformer.synthNamesMap.forEach((val, key) => {

if (val.identifier.text === continuationArgName.identifier.text) {

const newSynthName = createUniqueSynthName(continuationArgName);

transformer.synthNamesMap.set(key, newSynthName);

}

});

}

else {

possibleNameForVarDecl = createSynthIdentifier(factory.createUniqueName("result", GeneratedIdentifierFlags.Optimistic), continuationArgName.types);

}

// We are about to write a 'let' variable declaration, but `transformExpression` for both

// the try block and catch/finally block will assign to this name. Setting this flag indicates

// that future assignments should be written as `name = value` instead of `const name = value`.

declareSynthIdentifier(possibleNameForVarDecl);

}

return possibleNameForVarDecl;

const statements: Statement[] = [];

// In order to avoid an implicit any, we will synthesize a type for the declaration using the unions of the types of both paths (try block and catch block)

let varDeclIdentifier: Identifier | undefined;

if (possibleNameForVarDecl && !shouldReturn(node, transformer)) {

varDeclIdentifier = getSynthesizedDeepClone(declareSynthIdentifier(possibleNameForVarDecl));

const typeArray: Type[] = possibleNameForVarDecl.types;

const unionType = transformer.checker.getUnionType(typeArray, UnionReduction.Subtype);

const unionTypeNode = transformer.isInJSFile ? undefined : transformer.checker.typeToTypeNode(unionType, /*enclosingDeclaration*/ undefined, /*flags*/ undefined);

const varDecl = [factory.createVariableDeclaration(varDeclIdentifier, /*exclamationToken*/ undefined, unionTypeNode)];

const varDeclList = factory.createVariableStatement(/*modifiers*/ undefined, factory.createVariableDeclarationList(varDecl, NodeFlags.Let));

statements.push(varDeclList);

}

statements.push(tryStatement);

if (continuationArgName && varDeclIdentifier && isSynthBindingPattern(continuationArgName)) {

statements.push(factory.createVariableStatement(

/*modifiers*/ undefined,

factory.createVariableDeclarationList([

factory.createVariableDeclaration(

getSynthesizedDeepClone(declareSynthBindingPattern(continuationArgName)),

/*exclamationToken*/ undefined,

/*type*/ undefined,

varDeclIdentifier

)],

NodeFlags.Const)));

}

return statements;

if (!onFinally || isNullOrUndefined(transformer, onFinally)) {

// Ignore this call as it has no effect on the result

return transformExpression(/* returnContextNode */ node, node.expression.expression, transformer, hasContinuation, continuationArgName);

}

const possibleNameForVarDecl = getPossibleNameForVarDecl(node, transformer, continuationArgName);

// Transform the left-hand-side of `.finally` into an array of inlined statements. We pass `true` for hasContinuation as `node` is the outer continuation.

const inlinedLeftHandSide = transformExpression(/*returnContextNode*/ node, node.expression.expression, transformer, /*hasContinuation*/ true, possibleNameForVarDecl);

if (hasFailed()) return silentFail(); // shortcut out of more work

// Transform the callback argument into an array of inlined statements. We pass whether we have an outer continuation here

// as that indicates whether `return` is valid.

const inlinedCallback = transformCallbackArgument(onFinally, hasContinuation, /*continuationArgName*/ undefined, /*argName*/ undefined, node, transformer);

if (hasFailed()) return silentFail(); // shortcut out of more work

const tryBlock = factory.createBlock(inlinedLeftHandSide);

const finallyBlock = factory.createBlock(inlinedCallback);

const tryStatement = factory.createTryStatement(tryBlock, /*catchClause*/ undefined, finallyBlock);

return finishCatchOrFinallyTransform(node, transformer, tryStatement, possibleNameForVarDecl, continuationArgName);

if (!onRejected || isNullOrUndefined(transformer, onRejected)) {

// Ignore this call as it has no effect on the result

return transformExpression(/* returnContextNode */ node, node.expression.expression, transformer, hasContinuation, continuationArgName);

}

const inputArgName = getArgBindingName(onRejected, transformer);

const possibleNameForVarDecl = getPossibleNameForVarDecl(node, transformer, continuationArgName);

// Transform the left-hand-side of `.then`/`.catch` into an array of inlined statements. We pass `true` for hasContinuation as `node` is the outer continuation.

const inlinedLeftHandSide = transformExpression(/*returnContextNode*/ node, node.expression.expression, transformer, /*hasContinuation*/ true, possibleNameForVarDecl);

if (hasFailed()) return silentFail(); // shortcut out of more work

// Transform the callback argument into an array of inlined statements. We pass whether we have an outer continuation here

// as that indicates whether `return` is valid.

const inlinedCallback = transformCallbackArgument(onRejected, hasContinuation, possibleNameForVarDecl, inputArgName, node, transformer);

if (hasFailed()) return silentFail(); // shortcut out of more work

const tryBlock = factory.createBlock(inlinedLeftHandSide);

const catchClause = factory.createCatchClause(inputArgName && getSynthesizedDeepClone(declareSynthBindingName(inputArgName)), factory.createBlock(inlinedCallback));

const tryStatement = factory.createTryStatement(tryBlock, catchClause, /*finallyBlock*/ undefined);

return finishCatchOrFinallyTransform(node, transformer, tryStatement, possibleNameForVarDecl, continuationArgName);

if (!onFulfilled || isNullOrUndefined(transformer, onFulfilled)) {

// If we don't have an `onfulfilled` callback, try treating this as a `.catch`.

return transformCatch(node, onRejected, transformer, hasContinuation, continuationArgName);

}

// We don't currently support transforming a `.then` with both onfulfilled and onrejected handlers, per GH#38152.

if (onRejected && !isNullOrUndefined(transformer, onRejected)) {

return silentFail();

}

const inputArgName = getArgBindingName(onFulfilled, transformer);

// Transform the left-hand-side of `.then` into an array of inlined statements. We pass `true` for hasContinuation as `node` is the outer continuation.

const inlinedLeftHandSide = transformExpression(node.expression.expression, node.expression.expression, transformer, /*hasContinuation*/ true, inputArgName);

if (hasFailed()) return silentFail(); // shortcut out of more work

// Transform the callback argument into an array of inlined statements. We pass whether we have an outer continuation here

// as that indicates whether `return` is valid.

const inlinedCallback = transformCallbackArgument(onFulfilled, hasContinuation, continuationArgName, inputArgName, node, transformer);

if (hasFailed()) return silentFail(); // shortcut out of more work

return concatenate(inlinedLeftHandSide, inlinedCallback);

if (shouldReturn(returnContextNode, transformer)) {

let returnValue = getSynthesizedDeepClone(node);

if (hasContinuation) {

returnValue = factory.createAwaitExpression(returnValue);

}

return [factory.createReturnStatement(returnValue)];

}

return createVariableOrAssignmentOrExpressionStatement(continuationArgName, factory.createAwaitExpression(node), /*typeAnnotation*/ undefined);

if (!variableName || isEmptyBindingName(variableName)) {

// if there's no argName to assign to, there still might be side effects

return [factory.createExpressionStatement(rightHandSide)];

}

if (isSynthIdentifier(variableName) && variableName.hasBeenDeclared) {

// if the variable has already been declared, we don't need "let" or "const"

return [factory.createExpressionStatement(factory.createAssignment(getSynthesizedDeepClone(referenceSynthIdentifier(variableName)), rightHandSide))];

}

return [

factory.createVariableStatement(

/*modifiers*/ undefined,

factory.createVariableDeclarationList([

factory.createVariableDeclaration(

getSynthesizedDeepClone(declareSynthBindingName(variableName)),

/*exclamationToken*/ undefined,

typeAnnotation,

rightHandSide)],

NodeFlags.Const))];

if (typeAnnotation && expressionToReturn) {

const name = factory.createUniqueName("result", GeneratedIdentifierFlags.Optimistic);

return [

...createVariableOrAssignmentOrExpressionStatement(createSynthIdentifier(name), expressionToReturn, typeAnnotation),

factory.createReturnStatement(name)

];

}

return [factory.createReturnStatement(expressionToReturn)];

switch (func.kind) {

case SyntaxKind.NullKeyword:

// do not produce a transformed statement for a null argument

break;

case SyntaxKind.PropertyAccessExpression:

case SyntaxKind.Identifier: // identifier includes undefined

if (!inputArgName) {

// undefined was argument passed to promise handler

break;

}

const synthCall = factory.createCallExpression(getSynthesizedDeepClone(func as Identifier | PropertyAccessExpression), /*typeArguments*/ undefined, isSynthIdentifier(inputArgName) ? [referenceSynthIdentifier(inputArgName)] : []);

if (shouldReturn(parent, transformer)) {

return maybeAnnotateAndReturn(synthCall, getExplicitPromisedTypeOfPromiseReturningCallExpression(parent, func, transformer.checker));

}

const type = transformer.checker.getTypeAtLocation(func);

const callSignatures = transformer.checker.getSignaturesOfType(type, SignatureKind.Call);

if (!callSignatures.length) {

// if identifier in handler has no call signatures, it's invalid

return silentFail();

}

const returnType = callSignatures[0].getReturnType();

const varDeclOrAssignment = createVariableOrAssignmentOrExpressionStatement(continuationArgName, factory.createAwaitExpression(synthCall), getExplicitPromisedTypeOfPromiseReturningCallExpression(parent, func, transformer.checker));

if (continuationArgName) {

continuationArgName.types.push(transformer.checker.getAwaitedType(returnType) || returnType);

}

return varDeclOrAssignment;

case SyntaxKind.FunctionExpression:

case SyntaxKind.ArrowFunction: {

const funcBody = (func as FunctionExpression | ArrowFunction).body;

const returnType = getLastCallSignature(transformer.checker.getTypeAtLocation(func), transformer.checker)?.getReturnType();

// Arrow functions with block bodies { } will enter this control flow

if (isBlock(funcBody)) {

let refactoredStmts: Statement[] = [];

let seenReturnStatement = false;

for (const statement of funcBody.statements) {

if (isReturnStatement(statement)) {

seenReturnStatement = true;

if (isReturnStatementWithFixablePromiseHandler(statement, transformer.checker)) {

refactoredStmts = refactoredStmts.concat(transformReturnStatementWithFixablePromiseHandler(transformer, statement, hasContinuation, continuationArgName));

}

else {

const possiblyAwaitedRightHandSide = returnType && statement.expression ? getPossiblyAwaitedRightHandSide(transformer.checker, returnType, statement.expression) : statement.expression;

refactoredStmts.push(...maybeAnnotateAndReturn(possiblyAwaitedRightHandSide, getExplicitPromisedTypeOfPromiseReturningCallExpression(parent, func, transformer.checker)));

}

}

else if (hasContinuation && forEachReturnStatement(statement, returnTrue)) {

// If there is a nested `return` in a callback that has a trailing continuation, we don't transform it as the resulting complexity is too great. For example:

//

// source | result

// -------------------------------------| ---------------------------------------

// function f(): Promise<number> { | async function f9(): Promise<number> {

// return foo().then(() => { | await foo();

// if (Math.random()) { | if (Math.random()) {

// return 1; | return 1; // incorrect early return

// } | }

// return 2; | return 2; // incorrect early return

// }).then(a => { | const a = undefined;

// return a + 1; | return a + 1;

// }); | }

// } |

//

// However, branching returns in the outermost continuation are acceptable as no other continuation follows it:

//

// source | result

//--------------------------------------|---------------------------------------

// function f() { | async function f() {

// return foo().then(res => { | const res = await foo();

// if (res.ok) { | if (res.ok) {

// return 1; | return 1;

// } | }

// else { | else {

// if (res.buffer.length > 5) { | if (res.buffer.length > 5) {

// return 2; | return 2;

// } | }

// else { | else {

// return 3; | return 3;

// } | }

// } | }

// }); | }

// } |

//

// We may improve this in the future, but for now the heuristics are too complex

return silentFail();

}

else {

refactoredStmts.push(statement);

}

}

return shouldReturn(parent, transformer)

? refactoredStmts.map(s => getSynthesizedDeepClone(s))

: removeReturns(

refactoredStmts,

continuationArgName,

transformer,

seenReturnStatement);

}

else {

const inlinedStatements = isFixablePromiseHandler(funcBody, transformer.checker) ?

transformReturnStatementWithFixablePromiseHandler(transformer, factory.createReturnStatement(funcBody), hasContinuation, continuationArgName) :

emptyArray;

if (inlinedStatements.length > 0) {

return inlinedStatements;

}

if (returnType) {

const possiblyAwaitedRightHandSide = getPossiblyAwaitedRightHandSide(transformer.checker, returnType, funcBody);

if (!shouldReturn(parent, transformer)) {

const transformedStatement = createVariableOrAssignmentOrExpressionStatement(continuationArgName, possiblyAwaitedRightHandSide, /*typeAnnotation*/ undefined);

if (continuationArgName) {

continuationArgName.types.push(transformer.checker.getAwaitedType(returnType) || returnType);

}

return transformedStatement;

}

else {

return maybeAnnotateAndReturn(possiblyAwaitedRightHandSide, getExplicitPromisedTypeOfPromiseReturningCallExpression(parent, func, transformer.checker));

}

}

else {

return silentFail();

}

}

}

default:

// If no cases apply, we've found a transformation body we don't know how to handle, so the refactoring should no-op to avoid deleting code.

return silentFail();

}

return emptyArray;

const ret: Statement[] = [];

for (const stmt of stmts) {

if (isReturnStatement(stmt)) {

if (stmt.expression) {

const possiblyAwaitedExpression = isPromiseTypedExpression(stmt.expression, transformer.checker) ? factory.createAwaitExpression(stmt.expression) : stmt.expression;

if (prevArgName === undefined) {

ret.push(factory.createExpressionStatement(possiblyAwaitedExpression));

}

else if (isSynthIdentifier(prevArgName) && prevArgName.hasBeenDeclared) {

ret.push(factory.createExpressionStatement(factory.createAssignment(referenceSynthIdentifier(prevArgName), possiblyAwaitedExpression)));

}

else {

ret.push(factory.createVariableStatement(/*modifiers*/ undefined,

(factory.createVariableDeclarationList([factory.createVariableDeclaration(declareSynthBindingName(prevArgName), /*exclamationToken*/ undefined, /*type*/ undefined, possiblyAwaitedExpression)], NodeFlags.Const))));

}

}

}

else {

ret.push(getSynthesizedDeepClone(stmt));

}

}

// if block has no return statement, need to define prevArgName as undefined to prevent undeclared variables

if (!seenReturnStatement && prevArgName !== undefined) {

ret.push(factory.createVariableStatement(/*modifiers*/ undefined,

(factory.createVariableDeclarationList([factory.createVariableDeclaration(declareSynthBindingName(prevArgName), /*exclamationToken*/ undefined, /*type*/ undefined, factory.createIdentifier("undefined"))], NodeFlags.Const))));

}

return ret;

let innerCbBody: Statement[] = [];

forEachChild(innerRetStmt, function visit(node) {

if (isCallExpression(node)) {

const temp = transformExpression(node, node, transformer, hasContinuation, continuationArgName);

innerCbBody = innerCbBody.concat(temp);

if (innerCbBody.length > 0) {

return;

}

}

else if (!isFunctionLike(node)) {

forEachChild(node, visit);

}