/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/testsuite/libffi.call/ |
H A D | many.c | 14 static float ABI_ATTR many(float f1, float f2, float f3, float f4, float f5, float f6, float f7, float f8, float f9, float f10, float f11, float f12, float f13) argument 18 (double) f1, (double) f2, (double) f3, (double) f4, (double) f5, 23 return f1+f2+f3+f4+f5+f6+f7+f8+f9+f10+f11+f12+f13;
|
H A D | many2_win32.c | 16 float f5, 26 return ((f1/f2+f3/f4+f5/f6+f7/f8+f9/f10+f11/f12) * f13); 12 fastcall_many(float f1, float f2, float f3, float f4, float f5, float f6, float f7, float f8, float f9, float f10, float f11, float f12, float f13) argument
|
H A D | many_win32.c | 16 float f5, 26 return ((f1/f2+f3/f4+f5/f6+f7/f8+f9/f10+f11/f12) * f13); 12 stdcall_many(float f1, float f2, float f3, float f4, float f5, float f6, float f7, float f8, float f9, float f10, float f11, float f12, float f13) argument
|
/seL4-l4v-10.1.1/l4v/tools/autocorres/tests/examples/ |
H A D | heap_wrap.c | 44 void f5(struct thing *p, struct thing t) { function
|
/seL4-l4v-10.1.1/HOL4/src/tfl/src/test/ |
H A D | pattern_matchingScript.sml | 32 val _ = def "f5" `(f5 (0,0) = 0)`;
|
/seL4-l4v-10.1.1/HOL4/tools/Holmake/ |
H A D | FunctionalRecordUpdate.sml | 10 fun f5 z = next f4 z function 11 fun f6 z = next f5 z 36 fun c5 from = c4 (from f5)
|
/seL4-l4v-10.1.1/HOL4/examples/machine-code/lisp/ |
H A D | lisp_equalScript.sml | 608 ``(!x. x IN bb \/ x - 4w IN bb ==> (f5 x = ft x)) ==> 609 !t a s. (lisp_x t (a,bb,ft) s = lisp_x t (a,bb,f5) s)``, 616 \\ Cases_on `f5 (a + 0xFFFFFFE4w) = 0w` 654 \\ Q.ABBREV_TAC `f5 = (a - 4w =+ r8) f4` 655 \\ Q.ABBREV_TAC `wl = (f5 (a - 32w))` 656 \\ Q.ABBREV_TAC `wi = (f5 (a - 28w))` 660 \\ `?r3t r4t r5t r6t r7t r8t dft ft. arm_eq_loop (r3,r4,wi,wl,ww,0w ,df,f5) = 670 \\ `lisp_inv (x1,x2,x3,x4,x5,x6,limit) (r3,r4,r5,r6,r7,r8,a,df,f5,s,rest)` by 673 \\ `f5 (a - 32w) = n2w (8 * limit)` by 694 \\ `lisp_inv (LISP_EQUAL x1 x2,x2,x3,x4,x5,x6,limit) (r3u,r4,r5,r6,r7,r8,a,df,f5, [all...] |
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/examples/ |
H A D | fc_examples.sml | 24 val def5 = Define `f5(x:word32,y) = y + (f4 (x, f2 y, y)) + x`;
|
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/libffi/src/powerpc/ |
H A D | linux64.S | 121 lfd %f5, -32-(17*8)(%r28) 180 stfd %f5, 32(%r30) 191 stfs %f5, 16(%r30)
|
H A D | aix.S | 64 .set f5,5 159 lfd f5,-32-(9*8)(r28) 261 lfd f5,-16-(9*8)(r28)
|
H A D | aix_closure.S | 64 .set f5,5 137 stfd f5, 128+(4*8)(r1) 310 stfd f5, 72+(4*8)(r1)
|
H A D | linux64_closure.S | 130 stfd %f5, -104+(4*8)(%r1) 297 lfd %f5, RETVAL+32(%r1) 306 lfs %f5, RETVAL+16(%r1)
|
H A D | darwin.S | 157 lfd f5, -SAVE_REGS_SIZE-( 9*FPR_SIZE)(r28) 232 stfd f5, -SAVE_REGS_SIZE-( 9*FPR_SIZE)(r28)
|
H A D | sysv.S | 94 lfd %f5,-16-(8*4)-(4*8)(%r28)
|
H A D | darwin_closure.S | 163 stfd f5, (FP_SAVE_BASE + FPR_SIZE * 4 )(r1) 430 lfd f5, (FP_SAVE_BASE + FPR_SIZE * 4 )(r1)
|
H A D | ppc_closure.S | 63 stfd %f5, 80(%r1)
|
/seL4-l4v-10.1.1/HOL4/examples/l3-machine-code/mips/decompiler/ |
H A D | mips_decomp_demoScript.sml | 31 trunc.l.d $f5, $f2
|
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/ |
H A D | ILTheory.sig | 430 |- (!f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 a0 a1. 431 DOPER_case f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 434 (!f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 a0 a1. 435 DOPER_case f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 438 (!f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 a0 a1. 439 DOPER_case f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 442 (!f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 a0 a1 a2. 443 DOPER_case f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 446 (!f f1 f2 f3 f4 f5 f6 f7 f8 f9 f10 f11 f12 f13 f14 f15 a0 a1 a2. 447 DOPER_case f f1 f2 f3 f4 f5 f [all...] |
/seL4-l4v-10.1.1/HOL4/examples/dev/sw2/test/ |
H A D | regAllocTest.sml | 73 f5 = \(v1:word32,v2:word32).
|
H A D | test.sml | 209 `f5 (k0,k1,k2,k3) = 219 f5 = 236 |- f5 =
|
/seL4-l4v-10.1.1/HOL4/examples/elliptic/swsep/ |
H A D | examples.sml | 104 val def5 = Define `f5 (x:word32) = if (x = 0w) then (f1 x + 1w) else x`;
|
/seL4-l4v-10.1.1/HOL4/examples/formal-languages/context-free/ |
H A D | pegScript.sml | 229 (subexprs (rpt e f5) = rpt e f5 INSERT subexprs e)
|
/seL4-l4v-10.1.1/seL4/src/arch/x86/64/ |
H A D | traps.S | 440 INT_HANDLER_WITHOUT_ERR_CODE(f5,0)
|
/seL4-l4v-10.1.1/HOL4/examples/machine-code/garbage-collectors/ |
H A D | arm_improved_gcScript.sml | 839 \\ Q.PAT_ABBREV_TAC `f5 = (r6 + 0x34w =+ f (r6 + 0x2Cw)) xxx` 841 (one_scratch r6 (b2,e2,b,e) * p)) (fun2set (f5,df)) /\ 844 (Q.UNABBREV_TAC `f5` \\ FULL_SIMP_TAC std_ss [one_scratch_def] 846 \\ Q.PAT_X_ASSUM `Abbrev (f5 = fghfgh)` (K ALL_TAC)
|
/seL4-l4v-10.1.1/HOL4/examples/theorem-prover/lisp-runtime/implementation/ |
H A D | lisp_invScript.sml | 1886 \\ Q.ABBREV_TAC `f5 = (0x4w * wsp + sp - 0x4w =+ w5) 1897 (sl1 - LENGTH ss1) * ^STATIC) (fun2set (f5,df)) /\ 1907 \\ Q.UNABBREV_TAC `f5` 1941 (Q.PAT_X_ASSUM `xxx (fun2set (f5,df))` (K ALL_TAC) 1950 (Q.PAT_X_ASSUM `xxx (fun2set (f5,df))` (K ALL_TAC) 1970 \\ Q.PAT_X_ASSUM `xxx (fun2set (f5,df))` (K ALL_TAC) 2048 \\ Q.ABBREV_TAC `f5 = (0x4w * wsp + sp - 0x4w =+ w5) 2059 (sl1 - LENGTH ss1) * ^STATIC) (fun2set (f5,df)) /\ 2069 \\ Q.UNABBREV_TAC `f5` 2099 (Q.PAT_X_ASSUM `xxx (fun2set (f5,d [all...] |