Press n or j to go to the next uncovered block, b, p or k for the previous block.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 | 2x 2x 2x 2x 2x 2x 55x 14x 14x 41x 41x 33x 33x 33x 33x 31x 55x 55x 55x 55x 56x 56x 50x 56x 21x 21x 21x 21x 21x 21x 21x 21x 17x 17x 17x 17x 17x 21x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 4x 21x 21x 35x 56x 55x 55x 141x 141x 141x 135x 135x 126x 126x 126x 126x 126x 135x 15x 15x 15x 15x 15x 41x 41x 2x 42x 42x 42x 42x 39x 5x 38x 38x 42x 36x 36x 42x 2x 2x 144x 144x 114x 30x 24x 6x 6x 144x 144x 2x 2x 2x 135x 135x 1x 1x 135x 2x 2x 132x 135x 135x 135x 8x 8x 8x 135x 261x 261x 147x 147x 147x 101x 147x 3x 3x 147x 43x 43x 43x 43x 43x 2x 2x 41x 41x 41x 41x 43x 1x 1x 40x 40x 2x 2x 2x 43x 2x 2x 43x 147x 261x 211x 211x 211x 129x 75x 75x 129x 129x 7x 7x 129x 211x 246x 261x 135x 135x 264x 264x 264x 264x 264x 264x 264x 264x 208x 264x 41x 264x 264x 264x 15x 264x 264x 264x 264x 208x 208x 208x 208x 208x 208x 208x 120x 120x 81x 81x 72x 72x 120x 39x 36x 36x 13x 13x 13x 13x 13x 23x 23x 1x 36x 1x 1x 22x 24x 17x 17x 15x 17x 2x 2x 17x 17x 17x 17x 39x 1x 3x 2x 2x 2x 2x 39x 120x 208x 208x 208x 3x 208x 205x 159x 159x 205x 208x 190x 190x 208x 208x 70x 70x 55x 70x 15x 15x 75x 30x 30x 75x 15x 75x 30x 30x 15x 15x 15x 70x | /** * This module is Node-only. */ import { CREATE_STATIC, type CacheExpression, ConstantTypes, type ElementNode, ElementTypes, type ExpressionNode, type HoistTransform, Namespaces, NodeTypes, type PlainElementNode, type SimpleExpressionNode, type TemplateChildNode, type TextCallNode, type TransformContext, createCallExpression, isStaticArgOf, } from '@vue/compiler-core' import { escapeHtml, isArray, isBooleanAttr, isKnownHtmlAttr, isKnownMathMLAttr, isKnownSvgAttr, isString, isSymbol, isVoidTag, makeMap, normalizeClass, normalizeStyle, stringifyStyle, toDisplayString, } from '@vue/shared' export enum StringifyThresholds { ELEMENT_WITH_BINDING_COUNT = 5, NODE_COUNT = 20, } type StringifiableNode = PlainElementNode | TextCallNode /** * Regex for replacing placeholders for embedded constant variables * (e.g. import URL string constants generated by compiler-sfc) */ const expReplaceRE = /__VUE_EXP_START__(.*?)__VUE_EXP_END__/g /** * Turn eligible hoisted static trees into stringified static nodes, e.g. * * ```js * const _hoisted_1 = createStaticVNode(`<div class="foo">bar</div>`) * ``` * * A single static vnode can contain stringified content for **multiple** * consecutive nodes (element and plain text), called a "chunk". * `@vue/runtime-dom` will create the content via innerHTML in a hidden * container element and insert all the nodes in place. The call must also * provide the number of nodes contained in the chunk so that during hydration * we can know how many nodes the static vnode should adopt. * * The optimization scans a children list that contains hoisted nodes, and * tries to find the largest chunk of consecutive hoisted nodes before running * into a non-hoisted node or the end of the list. A chunk is then converted * into a single static vnode and replaces the hoisted expression of the first * node in the chunk. Other nodes in the chunk are considered "merged" and * therefore removed from both the hoist list and the children array. * * This optimization is only performed in Node.js. */ export const stringifyStatic: HoistTransform = (children, context, parent) => { // bail stringification for slot content if (context.scopes.vSlot > 0) { return } const isParentCached = parent.type === NodeTypes.ELEMENT && parent.codegenNode && parent.codegenNode.type === NodeTypes.VNODE_CALL && parent.codegenNode.children && !isArray(parent.codegenNode.children) && parent.codegenNode.children.type === NodeTypes.JS_CACHE_EXPRESSION let nc = 0 // current node count let ec = 0 // current element with binding count const currentChunk: StringifiableNode[] = [] const stringifyCurrentChunk = (currentIndex: number): number => { if ( nc >= StringifyThresholds.NODE_COUNT || ec >= StringifyThresholds.ELEMENT_WITH_BINDING_COUNT ) { // combine all currently eligible nodes into a single static vnode call const staticCall = createCallExpression(context.helper(CREATE_STATIC), [ JSON.stringify( currentChunk.map(node => stringifyNode(node, context)).join(''), ).replace(expReplaceRE, `" + $1 + "`), // the 2nd argument indicates the number of DOM nodes this static vnode // will insert / hydrate String(currentChunk.length), ]) const deleteCount = currentChunk.length - 1 if (isParentCached) { // if the parent is cached, then `children` is also the value of the // CacheExpression. Just replace the corresponding range in the cached // list with staticCall. children.splice( currentIndex - currentChunk.length, currentChunk.length, // @ts-expect-error staticCall, ) } else { // replace the first node's hoisted expression with the static vnode call ;(currentChunk[0].codegenNode as CacheExpression).value = staticCall if (currentChunk.length > 1) { // remove merged nodes from children children.splice(currentIndex - currentChunk.length + 1, deleteCount) // also adjust index for the remaining cache items const cacheIndex = context.cached.indexOf( currentChunk[currentChunk.length - 1] .codegenNode as CacheExpression, ) if (cacheIndex > -1) { for (let i = cacheIndex; i < context.cached.length; i++) { const c = context.cached[i] if (c) c.index -= deleteCount } context.cached.splice(cacheIndex - deleteCount + 1, deleteCount) } } } return deleteCount } return 0 } let i = 0 for (; i < children.length; i++) { const child = children[i] const isCached = isParentCached || getCachedNode(child) if (isCached) { // presence of cached means child must be a stringifiable node const result = analyzeNode(child as StringifiableNode) if (result) { // node is stringifiable, record state nc += result[0] ec += result[1] currentChunk.push(child as StringifiableNode) continue } } // we only reach here if we ran into a node that is not stringifiable // check if currently analyzed nodes meet criteria for stringification. // adjust iteration index i -= stringifyCurrentChunk(i) // reset state nc = 0 ec = 0 currentChunk.length = 0 } // in case the last node was also stringifiable stringifyCurrentChunk(i) } const getCachedNode = ( node: TemplateChildNode, ): CacheExpression | undefined => { if ( ((node.type === NodeTypes.ELEMENT && node.tagType === ElementTypes.ELEMENT) || node.type === NodeTypes.TEXT_CALL) && node.codegenNode && node.codegenNode.type === NodeTypes.JS_CACHE_EXPRESSION ) { return node.codegenNode } } const dataAriaRE = /^(data|aria)-/ const isStringifiableAttr = (name: string, ns: Namespaces) => { return ( (ns === Namespaces.HTML ? isKnownHtmlAttr(name) : ns === Namespaces.SVG ? isKnownSvgAttr(name) : ns === Namespaces.MATH_ML ? isKnownMathMLAttr(name) : false) || dataAriaRE.test(name) ) } const isNonStringifiable = /*@__PURE__*/ makeMap( `caption,thead,tr,th,tbody,td,tfoot,colgroup,col`, ) /** * for a cached node, analyze it and return: * - false: bailed (contains non-stringifiable props or runtime constant) * - [nc, ec] where * - nc is the number of nodes inside * - ec is the number of element with bindings inside */ function analyzeNode(node: StringifiableNode): [number, number] | false { if (node.type === NodeTypes.ELEMENT && isNonStringifiable(node.tag)) { return false } if (node.type === NodeTypes.TEXT_CALL) { return [1, 0] } let nc = 1 // node count let ec = node.props.length > 0 ? 1 : 0 // element w/ binding count let bailed = false const bail = (): false => { bailed = true return false } // TODO: check for cases where using innerHTML will result in different // output compared to imperative node insertions. // probably only need to check for most common case // i.e. non-phrasing-content tags inside `<p>` function walk(node: ElementNode): boolean { const isOptionTag = node.tag === 'option' && node.ns === Namespaces.HTML for (let i = 0; i < node.props.length; i++) { const p = node.props[i] // bail on non-attr bindings if ( p.type === NodeTypes.ATTRIBUTE && !isStringifiableAttr(p.name, node.ns) ) { return bail() } if (p.type === NodeTypes.DIRECTIVE && p.name === 'bind') { // bail on non-attr bindings if ( p.arg && (p.arg.type === NodeTypes.COMPOUND_EXPRESSION || (p.arg.isStatic && !isStringifiableAttr(p.arg.content, node.ns))) ) { return bail() } if ( p.exp && (p.exp.type === NodeTypes.COMPOUND_EXPRESSION || p.exp.constType < ConstantTypes.CAN_STRINGIFY) ) { return bail() } // <option :value="1"> cannot be safely stringified if ( isOptionTag && isStaticArgOf(p.arg, 'value') && p.exp && !p.exp.isStatic ) { return bail() } } } for (let i = 0; i < node.children.length; i++) { nc++ const child = node.children[i] if (child.type === NodeTypes.ELEMENT) { if (child.props.length > 0) { ec++ } walk(child) if (bailed) { return false } } } return true } return walk(node) ? [nc, ec] : false } function stringifyNode( node: string | TemplateChildNode, context: TransformContext, ): string { if (isString(node)) { return node } if (isSymbol(node)) { return `` } switch (node.type) { case NodeTypes.ELEMENT: return stringifyElement(node, context) case NodeTypes.TEXT: return escapeHtml(node.content) case NodeTypes.COMMENT: return `<!--${escapeHtml(node.content)}-->` case NodeTypes.INTERPOLATION: return escapeHtml(toDisplayString(evaluateConstant(node.content))) case NodeTypes.COMPOUND_EXPRESSION: return escapeHtml(evaluateConstant(node)) case NodeTypes.TEXT_CALL: return stringifyNode(node.content, context) default: // static trees will not contain if/for nodes return '' } } function stringifyElement( node: ElementNode, context: TransformContext, ): string { let res = `<${node.tag}` let innerHTML = '' for (let i = 0; i < node.props.length; i++) { const p = node.props[i] if (p.type === NodeTypes.ATTRIBUTE) { res += ` ${p.name}` if (p.value) { res += `="${escapeHtml(p.value.content)}"` } } else if (p.type === NodeTypes.DIRECTIVE) { if (p.name === 'bind') { const exp = p.exp as SimpleExpressionNode if (exp.content[0] === '_') { // internally generated string constant references // e.g. imported URL strings via compiler-sfc transformAssetUrl plugin res += ` ${ (p.arg as SimpleExpressionNode).content }="__VUE_EXP_START__${exp.content}__VUE_EXP_END__"` continue } // #6568 if ( isBooleanAttr((p.arg as SimpleExpressionNode).content) && exp.content === 'false' ) { continue } // constant v-bind, e.g. :foo="1" let evaluated = evaluateConstant(exp) if (evaluated != null) { const arg = p.arg && (p.arg as SimpleExpressionNode).content if (arg === 'class') { evaluated = normalizeClass(evaluated) } else if (arg === 'style') { evaluated = stringifyStyle(normalizeStyle(evaluated)) } res += ` ${(p.arg as SimpleExpressionNode).content}="${escapeHtml( evaluated, )}"` } } else if (p.name === 'html') { // #5439 v-html with constant value // not sure why would anyone do this but it can happen innerHTML = evaluateConstant(p.exp as SimpleExpressionNode) } else if (p.name === 'text') { innerHTML = escapeHtml( toDisplayString(evaluateConstant(p.exp as SimpleExpressionNode)), ) } } } if (context.scopeId) { res += ` ${context.scopeId}` } res += `>` if (innerHTML) { res += innerHTML } else { for (let i = 0; i < node.children.length; i++) { res += stringifyNode(node.children[i], context) } } if (!isVoidTag(node.tag)) { res += `</${node.tag}>` } return res } // __UNSAFE__ // Reason: eval. // It's technically safe to eval because only constant expressions are possible // here, e.g. `{{ 1 }}` or `{{ 'foo' }}` // in addition, constant exps bail on presence of parens so you can't even // run JSFuck in here. But we mark it unsafe for security review purposes. // (see compiler-core/src/transforms/transformExpression) function evaluateConstant(exp: ExpressionNode): string { if (exp.type === NodeTypes.SIMPLE_EXPRESSION) { return new Function(`return (${exp.content})`)() } else { // compound let res = `` exp.children.forEach(c => { if (isString(c) || isSymbol(c)) { return } if (c.type === NodeTypes.TEXT) { res += c.content } else if (c.type === NodeTypes.INTERPOLATION) { res += toDisplayString(evaluateConstant(c.content)) } else { res += evaluateConstant(c as ExpressionNode) } }) return res } } |