/barrelfish-master/lib/msun/ld80/ |
H A D | k_sinl.c | 37 #define S1 ((long double)S1hi + S1lo) macro 40 S1 = -0.166666666666666666671L; /* -0xaaaaaaaaaaaaaaab.0p-66 */ variable 60 if(iy==0) return x+v*(S1+z*r); 61 else return x-((z*(half*y-v*r)-y)-v*S1);
|
/barrelfish-master/lib/msun/src/ |
H A D | k_sin.c | 31 * sin(x) ~ x + S1*x + ... + S6*x 35 * |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2 44 * sin(x) = x + (S1*x + (x *(r-y/2)+y)) 52 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */ variable 68 if(iy==0) return x+v*(S1+z*r); 69 else return x-((z*(half*y-v*r)-y)-v*S1);
|
H A D | k_sinf.c | 27 S1 = -0x15555554cbac77.0p-55, /* -0.166666666416265235595 */ variable 45 return (x + s*(S1+z*S2)) + s*w*r;
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | read.pl | 129 read(var(Variable,_), ['('|S1], Precedence, Answer, S) :- !, 130 read(S1, 999, Arg1, S2), 137 read(atom(-), [integer(Integer)|S1], Precedence, Answer, S) :- 139 exprtl0(S1, Negative, Precedence, Answer, S). 141 read(atom(Functor), ['('|S1], Precedence, Answer, S) :- !, 142 read(S1, 999, Arg1, S2), 157 read('[', [']'|S1], Precedence, Answer, S) :- !, 158 exprtl0(S1, [], Precedence, Answer, S). 160 read('[', S1, Precedence, Answer, S) :- !, 161 read(S1, 99 [all...] |
H A D | distfix.pl | 167 read(var(Variable,_), ['('|S1], Precedence, Answer, S) :- !, 168 read(S1, 999, Arg1, S2), 175 read(atom(-), [integer(Integer)|S1], Precedence, Answer, S) :- 177 exprtl0(S1, Negative, Precedence, Answer, S). 179 read(atom(Functor), ['('|S1], Precedence, Answer, S) :- !, 180 read(S1, 999, Arg1, S2), 188 distfix_pass(Keys, S0, S1), 189 distfix_read(Pattern, S1, S2), 203 read('[', [']'|S1], Precedence, Answer, S) :- !, 204 exprtl0(S1, [], Precedenc [all...] |
H A D | random.pl | 42 S1 is Seed mod 30307, 44 setval(seed, [S0,S1,S2]).
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_make_overlap_bivs.pl | 108 Task1 = task with start:S1, 110 no_possible_overlap(S1,S2,D2), !, 113 Task1 = task with start:S1, 115 must_overlap(S1,S2,D2), !, 120 Task1 = task with start:S1, 127 demon_suspend(set_biv(S1,S2,D2,R2,Biv,Susp1), 129 [[S1,S2,D2]->min,[S1,S2,D2]->max], 136 no_possible_overlap(S1,S2,D2) :- 137 (get_min(S1)> [all...] |
H A D | make_overlap_bivs.pl | 108 Task1 = task with start:S1, 110 no_possible_overlap(S1,S2,D2), !, 113 Task1 = task with start:S1, 115 must_overlap(S1,S2,D2), !, 120 Task1 = task with start:S1, 127 demon_suspend(set_biv(S1,S2,D2,R2,Biv,Susp1), 129 [[S1,S2,D2]->min,[S1,S2,D2]->max], 136 no_possible_overlap(S1,S2,D2) :- 137 (mindomain(S1)> [all...] |
/barrelfish-master/lib/msun/ld128/ |
H A D | k_sinl.c | 33 S1 = -0.16666666666666666666666666666666666606732416116558L, variable 57 if(iy==0) return x+v*(S1+z*r); 58 else return x-((z*(half*y-v*r)-y)-v*S1);
|
/barrelfish-master/usr/eclipseclp/ecrc_solvers/ |
H A D | s_lists.pl | 90 s_insertion(Element, S1, S2) :- 91 slist_set(L1, S1), 130 s_intersection(S1, S2, S) :- 131 slist_set(L1, S1), 137 s_delta(S1, S2, S) :- 138 slist_set(L1, S1), 145 s_remove(Element, S1, S2) :- 146 slist_set(L1, S1), 152 s_union(S1, S2, S) :- 153 slist_set(L1, S1), [all...] |
H A D | conjunto.pl | 53 S `:: {}.. {1,3,5}, S1 `:: {1} .. {1,3,4}, S2 `::{3,4}..{3,4,5}, 54 all_disjoint([S,S1,S2]). 57 S1 = {1} 81 [eclipse 13]: S `:: {}.. {1,2,3,5}, S1 `:: {1} .. {1,2,3,4}, 82 all_union([S, S1],{1,2,3,4,5}). 85 S1 = S1{{1, 4} .. {1, 2, 3, 4}} 89 S1{{1, 4} .. {1, 2, 3, 4}}, {1, 2, 3, 4, 5}) 118 eclipse 3]: S `:: {}..{c,d}, S1= {1,2,3}, #(S \\/ S1, [all...] |
H A D | set.pl | 129 seteval(S, S1) :- 131 S = S1. 132 seteval(S \/ S1, Re) :- !, 134 seteval(S1, R1), 136 seteval(S /\ S1, Re) :- !, 138 seteval(S1, R1), 140 seteval(S \ S1, Re) :- !, 142 seteval(S1, R1), 148 S `<> S1 :- 150 seteval(S1, R [all...] |
/barrelfish-master/usr/eclipseclp/ecrc_solvers/chr/ |
H A D | s_lists.pl | 61 s_insertion(Element, S1, S2) :- 62 slist_set(L1, S1), 68 s_remove(Element, S1, S2) :- 69 slist_set(L1, S1), 128 s_intersection(S1, S2, S) :- 129 slist_set(L1, S1), 136 s_delta(S1, S2, S) :- 137 slist_set(L1, S1), 144 s_union(S1, S2, S) :- 145 slist_set(L1, S1), [all...] |
H A D | demo.pl | 20 point_intensity([S1 | ListSender], Point, Sender, Intensity) :- 21 point_intensity_from_one(S1, Point, I1), 27 Sender = S1, Intensity = I1
|
/barrelfish-master/usr/skb/programs/ |
H A D | decoding_net4_tests.pl | 115 state_add_free(S0, ["DRAM"], [block(0,Size)], S1), 118 alloc(S1, Size2M, Reg1, S2), 137 state_add_free(S0, ["DRAM"], [block(0,Size)], S1), 138 state_add_free(S1, ["GDDR"], [block(0,Size)], S2), 159 state_add_free(S0, ["SOCKET"], [block(Offset,OffsetLimit)], S1), 166 assert_conf_node(S1, ["SMPT_IN"],["SMPT_OUT"], 34, 32, S2), 173 printf("Src=%p --> Dst=%p with S1=%p\n", [SrcRegion, DstRegion, S5]). 191 state_add_free(S0, ["SOCKET"], [block(Offset,OffsetLimit)], S1), 197 assert_conf_node(S1, ["SMPT_IN"],["SMPT_OUT"], 34, 32, S2), 216 assert_accept_node(S0, region(["DRAM"], block(0, Size)), S1), [all...] |
H A D | decoding_net4.pl | 86 state_remove_avail(S, NodeId, C, S1), 90 state_add_avail(S1, NodeId, CNew, NewS). 94 state_remove_avail(S, NodeId, C, S1), 97 state_add_avail(S1, NodeId, CNew, NewS). 382 state_remove_free(S, DstId, FreeBlks, S1), 386 state_add_free(S1, DstId, FreeBlks3, SNew). 402 state_remove_free(S, DstId, FreeBlks, S1), 404 state_add_free(S1, DstId, FreeBlks2, SNew). 408 free_multi(S, Regs, S1), 409 free(S1, [all...] |
H A D | decoding_net4_support.pl | 214 state_add_avail(S, InNodeId, Slots, S1), 216 state_add_free(S1, InNodeId, [block(0, Limit)], NewS). 265 state_empty(S1), 266 add_SYSTEM(S1, [], S2), 288 add_PROC_MMU(S, Id, S1), 295 assert_conf_node(S1, MMU_IN_ID, MMU_OUT_ID, 21, NumSlots, S2), 329 % state_add(S, blu(3,2), S1), 330 % add_pci(S1, addr(0,0,0), _, S2), 336 add_pci_internal(S, Addr, Enum, add_XEONPHI, add_XEONPHI_IOMMU, S1), 348 assert_vspace_node(S1, regio [all...] |
H A D | bridge_linux.pl | 50 S1 is H1 - B1, 51 Bridge1 = [buselement(bridge, Addr, S, B1, H1, S1, mem, nonprefetchable, pcie, 0)];
|
/barrelfish-master/usr/eclipseclp/Opium/demo/ |
H A D | yoyo1.pl | 24 S1 is unified with a list containing X --> del/3 can never succeed, \n\ 65 subset(L,S1), 66 member(X,S1), 67 del(X,S,S1).
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | kb.pl | 316 concat_strings("cat ", File,S1), 317 concat_strings(S1," >> ",S2), 1598 domains(R1, S1), 1602 'KB_link_join_atts'( Cond, [R1| S1], [R2| S2], Args1, Args2), 1603 'KB_flatten'(Cond, [R1|S1], [R2|S2], Args1, Args2, Xtrs), 1610 domains(R1, S1), 1614 'KB_link_join_atts'( Cond, [R1| S1], [R2| S2], Args1, Args2), 1615 'KB_flatten'(Cond, [R1|S1], [R2|S2], Args1, Args2, Xtrs), 1617 RS1 =.. [R1|S1], 1621 'KB_projectj'( Proj, [R1|S1], RS [all...] |
H A D | t_all.pl | 318 open(F1,read,S1), open(F2,read,S2), 319 ( similar_streams(S1, S2) -> 320 close(S1), close(S2) 322 close(S1), close(S2), 326 similar_streams(S1, S2) :- 327 at_eof(S1), at_eof(S2), !. 328 similar_streams(S1, S2) :- 329 get_stream_info(S1, line, LineNr), 330 ( read_string(S1, end_of_line, _, Line1) -> true ; Line1 = "" ), 335 similar_streams(S1, S [all...] |
H A D | ordset.pl | 282 ord_disjoint(S1, S2) :- 283 S1=[_|_], 284 ord_disjoint1(S1, S2). 321 ord_add_element(S1, E, S2) :- 322 ord_insert(S1, E, S2). 389 ord_intersect(S1, S2, S) :- 390 ord_intersection(S1, S2, S). 394 ord_intersection(S1, S2, L) :- 395 S1=[_|_], 396 ord_intersection1(S1, S [all...] |
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | propiachr.tex | 38 the start times $S1$ and $S2$ 41 {\em noclash} $ \Leftrightarrow (S1 >= S2 + 5 \vee S2 >= S1 + 5)$. 44 noclash(S1,S2) :- 45 ic:(S1 \$>= S2+5). 46 noclash(S1,S2) :- 47 ic:(S2 \$>= S1+5). 63 noclash(S1,S2) <=> ic:(S2 #< S1+5) | ic:(S1 #> [all...] |
H A D | modelling.tex | 300 no_overlap(S1,D1,S2,D2) :- S1 #>= S2 + D2. 301 no_overlap(S1,D1,S2,D2) :- S2 #>= S1 + D1. 316 delay no_overlap(S1,D1,S2,D2,B) if var(B). 317 no_overlap(S1,D1,S2,D2,0) :- S1 #>= S2 + D2. 318 no_overlap(S1,D1,S2,D2,1) :- S2 #>= S1 + D1. 322 no_overlap(S1,D [all...] |
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | extconjunto.tex | 167 {\bf ?S \verb/`=/ ?S1} 170 the value of the set term {\em S1}. 191 {\bf ?S \verb/`</ ?S1} 195 term {\bf S1}. If the two terms are ground sets it just checks the 197 S} is not included in the upper bound of {\em S1} domain, it fails. 201 {\bf ?S \verb/`<>/ ?S1} 204 The domains of S and S1 are disjoint (intersection empty). 324 solve(S1, Sum) :- 326 S1 `:: {}.. S, 327 trim(S, S1), [all...] |