原先对koa的认知停留在使用上面,最近在阅读koa2的源码,发现koa2的洋葱模型实现原理很简单,核心代码在koa-compose里面,竟然只有几十行:
function compose (middleware) {
if (!Array.isArray(middleware)) throw new TypeError('Middleware stack must be an array!')
for (const fn of middleware) {
if (typeof fn !== 'function') throw new TypeError('Middleware must be composed of functions!')
}
return function (context, next) {
// last called middleware #
let index = -1
return dispatch(0)
function dispatch (i) {
if (i <= index) return Promise.reject(new Error('next() called multiple times'))
index = i
let fn = middleware[i]
if (i === middleware.length) fn = next
if (!fn) return Promise.resolve()
try {
return Promise.resolve(fn(context, dispatch.bind(null, i + 1)));
} catch (err) {
return Promise.reject(err)
}
}
}
}
其中,compose函数,负责处理注册的所有中间件,我们使用以下方式注册中间件(middleware)
app.use(async (ctx, next)=>{
// code
await next();
// code
})
app.use(async (ctx, next)=>{
// code
await next();
// code
})
那么,koa2是如何处理注册的中间件,并实现它的洋葱模型呢? koa2会将注册的所有中间件函数,放在数组middleware中,使用koa-compose,处理moddleware这个数组。
下面就是对compose函数的解析。
function compose (middleware) {
// 容错判断,如果middleware不是数组,或者元素不是函数,则抛异常
if (!Array.isArray(middleware)) throw new TypeError('Middleware stack must be an array!')
for (const fn of middleware) {
if (typeof fn !== 'function') throw new TypeError('Middleware must be composed of functions!')
}
// compose函数最终返回一个闭包函数
return function (context, next) {
// last called middleware #
let index = -1
return dispatch(0)
// 使用递归操作,将各个function作为前一个function的next参数传递过去
function dispatch (i) {
if (i <= index) return Promise.reject(new Error('next() called multiple times'))
index = i
let fn = middleware[i]
if (i === middleware.length) fn = next
if (!fn) return Promise.resolve()
try {
return Promise.resolve(fn(context, dispatch.bind(null, i + 1)));
} catch (err) {
return Promise.reject(err)
}
}
}
}