From b96eea4e5d314a767a5bb5f06f3d852c66a863fb Mon Sep 17 00:00:00 2001 From: Ben Vanik Date: Sat, 2 May 2015 23:05:37 -0700 Subject: [PATCH] Removing unneeded files. --- TODO.md | 182 --------------------------------------------- private/runtest.sh | 20 ----- 2 files changed, 202 deletions(-) delete mode 100644 TODO.md delete mode 100644 private/runtest.sh diff --git a/TODO.md b/TODO.md deleted file mode 100644 index 00ba5c1f0..000000000 --- a/TODO.md +++ /dev/null @@ -1,182 +0,0 @@ -refactor: - module gen - recompiler (move to cpu) -implement: - function table - exec_module FindFunctionSymbol - -jit: -- add imports/exports/etc to module -- function generator (thread safe) - - - -## Loader - -Set all function variable addresses to the thunks. Since we handle the thunks -specially the variables are just used as function pointer storage. - -## Kernel - -Ordered: -``` -RtlInitializeCriticalSection/RtlInitializeCriticalSectionAndSpinCount -RtlEnterCriticalSection/RtlLeaveCriticalSection -NtCreateEvent -NtClose -NtWaitForSingleObjectEx -RtlFreeAnsiString/RtlFreeUnicodeString -RtlUnicodeStringToAnsiString -``` - -Others: -``` -NtCreateEvent -NtWaitForSingleObjectEx - -RtlCompareMemoryUlong -RtlNtStatusToDosError -RtlRaiseException - -NtCreateFile/NtOpenFile -NtClose -NtReadFile/NtReadFileScatter -NtQueryFullAttributesFile -NtQueryInformationFile/NtSetInformationFile -NtQueryDirectoryFile/NtQueryVolumeInformationFile - -NtDuplicateObject - -KeBugCheck: -// VOID -// _In_ ULONG BugCheckCode -``` - -## Instructions - -``` -lwarx -stwcx - -addcx -addicx -divwx -extswx -faddx -fcfidx -fcmpu -fctiwzx -fdivx -fmaddsx -fmrx -fmulsx -fmulx -fnegx -frspx -mulldx -negx -rlwimix -rldiclx -rldicrx -sradx -srdx -srwx -subfcx -subfzex - -new: -extldi -mfmsr -mtmsrd -srdi -``` - -### XER CA bit (carry) - -Not sure the way I'm doing this is right. addic/subficx/etc set it to the value -of the overflow bit from the LLVM *_with_overflow intrinsic. - -### Overflow - -Overflow bits can be set via the intrinsics: -`llvm.sadd.with.overflow`/etc -It'd be nice to avoid doing this unless absolutely required. The SDB could -walk functions to see if they ever read or branch on the SO bit of things. - -### Conditions - -Condition bits are, after each function: -``` -if (target_reg < 0) { CR0 = b100 | XER[SO] } -if (target_reg > 0) { CR0 = b010 | XER[SO] } -else { CR0 = b001 | XER[SO] } -``` -Most PPC instructions are optimized by the compiler to have Rc=0 and not set the -bits if possible. There are some instructions, though, that always set them. -For those, it would be nice to remove redundant sets. Maybe LLVM will do it -automatically due to the local cr? May need to split that up into a few locals -(one for each bit?) to ensure deduping. - -### Branch Hinting - -`@llvm.expect.i32`/`.i64` could be used with the BH bits in branches to -indicate expected values. - -### Data Caching - -dcbt and dcbtst could use LLVM intrinsic @llvm.prefetch. - -## Codegen - -### Calling convention - -Experiment with fastcc? May need typedef fn ptrs to call into the JITted code. - -### Function calling convention analysis - -Track functions to see if they follow the standard calling convention. -This could use the hints from the EH data in the XEX. Looking specifically for -stack prolog/epilog and branches to LR. - -Benefits: -- Optimized prolog/epilog generation. -- Local variables for stack storage (alloca/etc) instead of user memory. -- Better return detection and fast returns. - -### Indirect branches (ctr/lr) - -Return path: -- In SDB see if the function follows the 'return' semantic: - - mfspr LR / mtspr LR/CTR / bcctr -- at end? -- In codegen add a BB that is just return. -- If a block 'returns', branch to the return BB. - -Tail calls: -- If in a call BB check next BB. -- If next is a return, optimize to a tail call. - -Fast path: -- Every time LR would be stashed, add the value of LR (some NIA) to a lookup - table. -- When doing an indirect branch first lookup the address in the table. -- If not found, slow path, else jump. - -Slow path: -- Call out and do an SDB lookup. -- If found, return, add to lookup table, and jump. -- If not found, need new function codegen! -``` - -## Linking/multicore processing - -Need to split up processing of functions. -ModuleGenerator::Generate's BuildFunction loop is the real time hog here. -Spin up N threads. Each as a module and steals functions from the queue to -generate. After the module hits a certain size it's dumped to disk and another -is created. -Afterwards, all modules are loaded lazily and linked together. The final one -is writen out and loaded again lazily. -JIT works on that. - -## Debugging - diff --git a/private/runtest.sh b/private/runtest.sh deleted file mode 100644 index 134361d0c..000000000 --- a/private/runtest.sh +++ /dev/null @@ -1,20 +0,0 @@ -python xenia-build.py build - -if [ "$?" -ne 0 ]; then - echo "Build failed!" - exit $? -fi - -./build/xenia/release/xenia-run \ - private/$1 \ - --dump_path=build/ \ - --dump_module_map=true \ - --dump_module_bitcode=true \ - --optimize_ir_modules=true \ - --optimize_ir_functions=true \ - --memory_address_verification=true \ - --trace_kernel_calls=true \ - --trace_user_calls=true \ - --trace_instructions=false \ - --abort_before_entry=true \ - 1>build/run.txt