Name Description Size
AsmJS.cpp / // The asm.js valid heap lengths are precisely the WASM valid heap lengths for // ARM greater or equal to MinHeapLength static const size_t MinHeapLength = PageSize; static uint64_t RoundUpToNextValidAsmJSHeapLength(uint64_t length) { if (length <= MinHeapLength) { return MinHeapLength; } return wasm::RoundUpToNextValidARMImmediate(length); } /**************************************************************************** 208059
AsmJS.h 3509
TypedObject-inl.h static 732
TypedObject.cpp Typed Prototypes Every type descriptor has an associated prototype. Instances of that type descriptor use this as their prototype. Per the spec, typed object prototypes cannot be mutated. 24725
TypedObject.h The prototype for typed objects. 10228
WasmBaselineCompile.cpp [SMDOC] WebAssembly baseline compiler (RabaldrMonkey) General assumptions for 32-bit vs 64-bit code: - A 32-bit register can be extended in-place to a 64-bit register on 64-bit systems. - Code that knows that Register64 has a '.reg' member on 64-bit systems and '.high' and '.low' members on 32-bit systems, or knows the implications thereof, is #ifdef JS_PUNBOX64. All other code is #if(n)?def JS_64BIT. Coding standards: - In "small" code generating functions (eg emitMultiplyF64, emitQuotientI32, and surrounding functions; most functions fall into this class) where the meaning is obvious: - if there is a single source + destination register, it is called 'r' - if there is one source and a different destination, they are called 'rs' and 'rd' - if there is one source + destination register and another source register they are called 'r' and 'rs' - if there are two source registers and a destination register they are called 'rs0', 'rs1', and 'rd'. - Generic temp registers are named /temp[0-9]?/ not /tmp[0-9]?/. - Registers can be named non-generically for their function ('rp' for the 'pointer' register and 'rv' for the 'value' register are typical) and those names may or may not have an 'r' prefix. - "Larger" code generating functions make their own rules. General status notes: "FIXME" indicates a known or suspected bug. Always has a bug#. "TODO" indicates an opportunity for a general improvement, with an additional tag to indicate the area of improvement. Usually has a bug#. There are lots of machine dependencies here but they are pretty well isolated to a segment of the compiler. Many dependencies will eventually be factored into the MacroAssembler layer and shared with other code generators. High-value compiler performance improvements: - (Bug 1316802) The specific-register allocator (the needI32(r), needI64(r) etc methods) can avoid syncing the value stack if the specific register is in use but there is a free register to shuffle the specific register into. (This will also improve the generated code.) The sync happens often enough here to show up in profiles, because it is triggered by integer multiply and divide. High-value code generation improvements: - (Bug 1316804) brTable pessimizes by always dispatching to code that pops the stack and then jumps to the code for the target case. If no cleanup is needed we could just branch conditionally to the target; if the same amount of cleanup is needed for all cases then the cleanup can be done before the dispatch. Both are highly likely. - (Bug 1316806) Register management around calls: At the moment we sync the value stack unconditionally (this is simple) but there are probably many common cases where we could instead save/restore live caller-saves registers and perform parallel assignment into argument registers. This may be important if we keep some locals in registers. - (Bug 1316808) Allocate some locals to registers on machines where there are enough registers. This is probably hard to do well in a one-pass compiler but it might be that just keeping register arguments and the first few locals in registers is a viable strategy; another (more general) strategy is caching locals in registers in straight-line code. Such caching could also track constant values in registers, if that is deemed valuable. A combination of techniques may be desirable: parameters and the first few locals could be cached on entry to the function but not statically assigned to registers throughout. (On a large corpus of code it should be possible to compute, for every signature comprising the types of parameters and locals, and using a static weight for loops, a list in priority order of which parameters and locals that should be assigned to registers. Or something like that. Wasm makes this simple. Static assignments are desirable because they are not flushed to memory by the pre-block sync() call.) 488166
WasmBaselineCompile.h 3027
WasmBuiltins.cpp 55382
WasmBuiltins.h 4761
WasmCode.cpp static 46782
WasmCode.h 25921
WasmCompile.cpp 25122
WasmCompile.h 5318
WasmConstants.h 24359
WasmContext.cpp 1205
WasmContext.h 1685
WasmCraneliftCompile.cpp 25809
WasmCraneliftCompile.h 1914
WasmDebug.cpp 15891
WasmDebug.h 5685
WasmFrameIter.cpp 56014
WasmFrameIter.h 8923
WasmGC.cpp 9168
WasmGC.h 14688
WasmGenerator.cpp limitedSize= 42419
WasmGenerator.h 9216
WasmInstance.cpp 72433
WasmInstance.h 10503
WasmIonCompile.cpp prev 173602
WasmIonCompile.h 1557
WasmJS.cpp 138692
WasmJS.h 20705
WasmModule.cpp 43406
WasmModule.h 10472
WasmOpIter.cpp 21032
WasmOpIter.h 81373
WasmProcess.cpp 12610
WasmProcess.h 2137
WasmRealm.cpp 4584
WasmRealm.h 2709
WasmSerialize.h 5780
WasmSignalHandlers.cpp 40802
WasmSignalHandlers.h 2877
WasmStubs.cpp 110758
WasmStubs.h 11010
WasmTable.cpp static 11714
WasmTable.h 4472
WasmTypes.cpp 44758
WasmTypes.h 126428
WasmUtility.h 725
WasmValidate.cpp 104245
WasmValidate.h 31787
cranelift 6 1323