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 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535
|
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2001-2013. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
-module(andor_SUITE).
-export([all/0, suite/0,groups/0,init_per_suite/1, end_per_suite/1,
init_per_group/2,end_per_group/2,
t_case/1,t_and_or/1,t_andalso/1,t_orelse/1,inside/1,overlap/1,
combined/1,in_case/1,before_and_inside_if/1,
slow_compilation/1]).
-include_lib("test_server/include/test_server.hrl").
suite() -> [{ct_hooks,[ts_install_cth]}].
all() ->
test_lib:recompile(?MODULE),
[{group,p}].
groups() ->
[{p,test_lib:parallel(),
[t_case,t_and_or,t_andalso,t_orelse,inside,overlap,
combined,in_case,before_and_inside_if]}].
init_per_suite(Config) ->
Config.
end_per_suite(_Config) ->
ok.
init_per_group(_GroupName, Config) ->
Config.
end_per_group(_GroupName, Config) ->
Config.
t_case(Config) when is_list(Config) ->
%% We test boolean cases almost but not quite like cases
%% generated by andalso/orelse.
?line less = t_case_a(1, 2),
?line not_less = t_case_a(2, 2),
?line {'EXIT',{{case_clause,false},_}} = (catch t_case_b({x,y,z}, 2)),
?line {'EXIT',{{case_clause,true},_}} = (catch t_case_b(a, a)),
?line eq = t_case_c(a, a),
?line ne = t_case_c(42, []),
?line t = t_case_d(x, x, true),
?line f = t_case_d(x, x, false),
?line f = t_case_d(x, y, true),
?line {'EXIT',{badarg,_}} = (catch t_case_d(x, y, blurf)),
?line true = (catch t_case_e({a,b}, {a,b})),
?line false = (catch t_case_e({a,b}, 42)),
?line true = t_case_xy(42, 100, 700),
?line true = t_case_xy(42, 100, whatever),
?line false = t_case_xy(42, wrong, 700),
?line false = t_case_xy(42, wrong, whatever),
?line true = t_case_xy(0, whatever, 700),
?line true = t_case_xy(0, 100, 700),
?line false = t_case_xy(0, whatever, wrong),
?line false = t_case_xy(0, 100, wrong),
ok.
t_case_a(A, B) ->
case A < B of
[_|_] -> ok;
true -> less;
false -> not_less;
{a,b,c} -> ok;
_Var -> ok
end.
t_case_b(A, B) ->
case A =:= B of
blurf -> ok
end.
t_case_c(A, B) ->
case not(A =:= B) of
true -> ne;
false -> eq
end.
t_case_d(A, B, X) ->
case (A =:= B) and X of
true -> t;
false -> f
end.
t_case_e(A, B) ->
case A =:= B of
Bool when is_tuple(A) -> id(Bool)
end.
t_case_xy(X, Y, Z) ->
Res = t_case_x(X, Y, Z),
Res = t_case_y(X, Y, Z).
t_case_x(X, Y, Z) ->
case abs(X) =:= 42 of
true ->
Y =:= 100;
false ->
Z =:= 700
end.
t_case_y(X, Y, Z) ->
case abs(X) =:= 42 of
false ->
Z =:= 700;
true ->
Y =:= 100
end.
-define(GUARD(E), if E -> true;
true -> false
end).
t_and_or(Config) when is_list(Config) ->
?line true = true and true,
?line false = true and false,
?line false = false and true,
?line false = false and false,
?line true = id(true) and true,
?line false = id(true) and false,
?line false = id(false) and true,
?line false = id(false) and false,
?line true = true and id(true),
?line false = true and id(false),
?line false = false and id(true),
?line false = false and id(false),
?line true = true or true,
?line true = true or false,
?line true = false or true,
?line false = false or false,
?line true = id(true) or true,
?line true = id(true) or false,
?line true = id(false) or true,
?line false = id(false) or false,
?line true = true or id(true),
?line true = true or id(false),
?line true = false or id(true),
?line false = false or id(false),
True = id(true),
false = ?GUARD(erlang:'and'(bar, True)),
false = ?GUARD(erlang:'or'(bar, True)),
false = ?GUARD(erlang:'not'(erlang:'and'(bar, True))),
false = ?GUARD(erlang:'not'(erlang:'not'(erlang:'and'(bar, True)))),
true = (fun (X = true) when X or true or X -> true end)(True),
ok.
t_andalso(Config) when is_list(Config) ->
Bs = [true,false],
Ps = [{X,Y} || X <- Bs, Y <- Bs],
lists:foreach(fun (P) -> t_andalso_1(P) end, Ps),
?line true = true andalso true,
?line false = true andalso false,
?line false = false andalso true,
?line false = false andalso false,
?line true = ?GUARD(true andalso true),
?line false = ?GUARD(true andalso false),
?line false = ?GUARD(false andalso true),
?line false = ?GUARD(false andalso false),
?line false = false andalso glurf,
?line false = false andalso exit(exit_now),
?line true = not id(false) andalso not id(false),
?line false = not id(false) andalso not id(true),
?line false = not id(true) andalso not id(false),
?line false = not id(true) andalso not id(true),
?line {'EXIT',{badarg,_}} = (catch not id(glurf) andalso id(true)),
?line {'EXIT',{badarg,_}} = (catch not id(false) andalso not id(glurf)),
?line false = id(false) andalso not id(glurf),
?line false = false andalso not id(glurf),
true = begin (X1 = true) andalso X1, X1 end,
false = false = begin (X2 = false) andalso X2, X2 end,
ok.
t_orelse(Config) when is_list(Config) ->
Bs = [true,false],
Ps = [{X,Y} || X <- Bs, Y <- Bs],
lists:foreach(fun (P) -> t_orelse_1(P) end, Ps),
?line true = true orelse true,
?line true = true orelse false,
?line true = false orelse true,
?line false = false orelse false,
?line true = ?GUARD(true orelse true),
?line true = ?GUARD(true orelse false),
?line true = ?GUARD(false orelse true),
?line false = ?GUARD(false orelse false),
?line true = true orelse glurf,
?line true = true orelse exit(exit_now),
?line true = not id(false) orelse not id(false),
?line true = not id(false) orelse not id(true),
?line true = not id(true) orelse not id(false),
?line false = not id(true) orelse not id(true),
?line {'EXIT',{badarg,_}} = (catch not id(glurf) orelse id(true)),
?line {'EXIT',{badarg,_}} = (catch not id(true) orelse not id(glurf)),
?line true = id(true) orelse not id(glurf),
?line true = true orelse not id(glurf),
true = begin (X1 = true) orelse X1, X1 end,
false = begin (X2 = false) orelse X2, X2 end,
ok.
t_andalso_1({X,Y}) ->
io:fwrite("~w andalso ~w: ",[X,Y]),
V1 = echo(X) andalso echo(Y),
V1 = if
X andalso Y -> true;
true -> false
end,
check(V1, X and Y).
t_orelse_1({X,Y}) ->
io:fwrite("~w orelse ~w: ",[X,Y]),
V1 = echo(X) orelse echo(Y),
V1 = if
X orelse Y -> true;
true -> false
end,
check(V1, X or Y).
inside(Config) when is_list(Config) ->
?line true = inside(-8, 1),
?line false = inside(-53.5, -879798),
?line false = inside(1.0, -879),
?line false = inside(59, -879),
?line false = inside(-11, 1.0),
?line false = inside(100, 0.2),
?line false = inside(100, 1.2),
?line false = inside(-53.5, 4),
?line false = inside(1.0, 5.3),
?line false = inside(59, 879),
ok.
inside(Xm, Ym) ->
X = -10.0,
Y = -2.0,
W = 20.0,
H = 4.0,
Res = inside(Xm, Ym, X, Y, W, H),
Res = if
X =< Xm andalso Xm < X+W andalso Y =< Ym andalso Ym < Y+H -> true;
true -> false
end,
case not id(Res) of
Outside ->
Outside = if
not(X =< Xm andalso Xm < X+W andalso Y =< Ym andalso Ym < Y+H) -> true;
true -> false
end
end,
{Res,Xm,Ym,X,Y,W,H} = inside_guard(Xm, Ym, X, Y, W, H),
io:format("~p =< ~p andalso ~p < ~p andalso ~p =< ~p andalso ~p < ~p ==> ~p",
[X,Xm,Xm,X+W,Y,Ym,Ym,Y+H,Res]),
Res.
inside(Xm, Ym, X, Y, W, H) ->
X =< Xm andalso Xm < X+W andalso Y =< Ym andalso Ym < Y+H.
inside_guard(Xm, Ym, X, Y, W, H) when X =< Xm andalso Xm < X+W
andalso Y =< Ym andalso Ym < Y+H ->
{true,Xm,Ym,X,Y,W,H};
inside_guard(Xm, Ym, X, Y, W, H) ->
{false,Xm,Ym,X,Y,W,H}.
overlap(Config) when is_list(Config) ->
?line true = overlap(7.0, 2.0, 8.0, 0.5),
?line true = overlap(7.0, 2.0, 8.0, 2.5),
?line true = overlap(7.0, 2.0, 5.3, 2),
?line true = overlap(7.0, 2.0, 0.0, 100.0),
?line false = overlap(-1, 2, -35, 0.5),
?line false = overlap(-1, 2, 777, 0.5),
?line false = overlap(-1, 2, 2, 10),
?line false = overlap(2, 10, 12, 55.3),
ok.
overlap(Pos1, Len1, Pos2, Len2) ->
Res = case Pos1 of
Pos1 when (Pos2 =< Pos1 andalso Pos1 < Pos2+Len2)
orelse (Pos1 =< Pos2 andalso Pos2 < Pos1+Len1) ->
true;
Pos1 -> false
end,
Res = (Pos2 =< Pos1 andalso Pos1 < Pos2+Len2)
orelse (Pos1 =< Pos2 andalso Pos2 < Pos1+Len1),
Res = case Pos1 of
Pos1 when (Pos2 =< Pos1 andalso Pos1 < Pos2+Len2)
orelse (Pos1 =< Pos2 andalso Pos2 < Pos1+Len1) ->
true;
Pos1 -> false
end,
id(Res).
-define(COMB(A,B,C), (A andalso B orelse C)).
combined(Config) when is_list(Config) ->
?line false = comb(false, false, false),
?line true = comb(false, false, true),
?line false = comb(false, true, false),
?line true = comb(false, true, true),
?line false = comb(true, false, false),
?line true = comb(true, true, false),
?line true = comb(true, false, true),
?line true = comb(true, true, true),
?line false = comb(false, blurf, false),
?line true = comb(false, blurf, true),
?line true = comb(true, true, blurf),
?line false = ?COMB(false, false, false),
?line true = ?COMB(false, false, true),
?line false = ?COMB(false, true, false),
?line true = ?COMB(false, true, true),
?line false = ?COMB(true, false, false),
?line true = ?COMB(true, true, false),
?line true = ?COMB(true, false, true),
?line true = ?COMB(true, true, true),
?line false = ?COMB(false, blurf, false),
?line true = ?COMB(false, blurf, true),
?line true = ?COMB(true, true, blurf),
ok.
-undef(COMB).
comb(A, B, C) ->
Res = A andalso B orelse C,
Res = if
A andalso B orelse C -> true;
true -> false
end,
NotRes = if
not(A andalso B orelse C) -> true;
true -> false
end,
NotRes = id(not Res),
Res = A andalso B orelse C,
Res = if
A andalso B orelse C -> true;
true -> false
end,
NotRes = id(not Res),
Res = if
A andalso B orelse C -> true;
true -> false
end,
id(Res).
%% Test that a boolean expression in a case expression is properly
%% optimized (in particular, that the error behaviour is correct).
in_case(Config) when is_list(Config) ->
?line edge_rings = in_case_1(1, 1, 1, 1, 1),
?line not_loop = in_case_1(0.5, 1, 1, 1, 1),
?line loop = in_case_1(0.5, 0.9, 1.1, 1, 4),
?line {'EXIT',{badarith,_}} = (catch in_case_1(1, 1, 1, 1, 0)),
?line {'EXIT',{badarith,_}} = (catch in_case_1(1, 1, 1, 1, nan)),
?line {'EXIT',{badarg,_}} = (catch in_case_1(1, 1, 1, blurf, 1)),
?line {'EXIT',{badarith,_}} = (catch in_case_1([nan], 1, 1, 1, 1)),
ok.
in_case_1(LenUp, LenDw, LenN, Rotation, Count) ->
Res = in_case_1_body(LenUp, LenDw, LenN, Rotation, Count),
Res = in_case_1_guard(LenUp, LenDw, LenN, Rotation, Count),
Res.
in_case_1_body(LenUp, LenDw, LenN, Rotation, Count) ->
case (LenUp/Count > 0.707) and (LenN/Count > 0.707) and
(abs(Rotation) > 0.707) of
true ->
edge_rings;
false ->
case (LenUp >= 1) or (LenDw >= 1) or
(LenN =< 1) or (Count < 4) of
true ->
not_loop;
false ->
loop
end
end.
in_case_1_guard(LenUp, LenDw, LenN, Rotation, Count) ->
case (LenUp/Count > 0.707) andalso (LenN/Count > 0.707) andalso
(abs(Rotation) > 0.707) of
true -> edge_rings;
false when LenUp >= 1 orelse LenDw >= 1 orelse
LenN =< 1 orelse Count < 4 -> not_loop;
false -> loop
end.
before_and_inside_if(Config) when is_list(Config) ->
?line no = before_and_inside_if([a], [b], delete),
?line no = before_and_inside_if([a], [b], x),
?line no = before_and_inside_if([a], [], delete),
?line no = before_and_inside_if([a], [], x),
?line no = before_and_inside_if([], [], delete),
?line yes = before_and_inside_if([], [], x),
?line yes = before_and_inside_if([], [b], delete),
?line yes = before_and_inside_if([], [b], x),
?line {ch1,ch2} = before_and_inside_if_2([a], [b], blah),
?line {ch1,ch2} = before_and_inside_if_2([a], [b], xx),
?line {ch1,ch2} = before_and_inside_if_2([a], [], blah),
?line {ch1,ch2} = before_and_inside_if_2([a], [], xx),
?line {no,no} = before_and_inside_if_2([], [b], blah),
?line {no,no} = before_and_inside_if_2([], [b], xx),
?line {ch1,no} = before_and_inside_if_2([], [], blah),
?line {no,ch2} = before_and_inside_if_2([], [], xx),
ok.
%% Thanks to Simon Cornish and Kostis Sagonas.
%% Used to crash beam_bool.
before_and_inside_if(XDo1, XDo2, Do3) ->
Do1 = (XDo1 =/= []),
Do2 = (XDo2 =/= []),
if
%% This expression occurs in a try/catch (protected)
%% block, which cannot refer to variables outside of
%% the block that are boolean expressions.
Do1 =:= true;
Do1 =:= false, Do2 =:= false, Do3 =:= delete ->
no;
true ->
yes
end.
%% Thanks to Simon Cornish.
%% Used to generate code that would not set {y,0} on
%% all paths before its use (and therefore fail
%% validation by the beam_validator).
before_and_inside_if_2(XDo1, XDo2, Do3) ->
Do1 = (XDo1 =/= []),
Do2 = (XDo2 =/= []),
CH1 = if Do1 == true;
Do1 == false,Do2==false,Do3 == blah ->
ch1;
true ->
no
end,
CH2 = if Do1 == true;
Do1 == false,Do2==false,Do3 == xx ->
ch2;
true ->
no
end,
{CH1,CH2}.
-record(state, {stack = []}).
slow_compilation(_) ->
%% The function slow_compilation_1 used to compile very slowly.
ok = slow_compilation_1({a}, #state{}).
slow_compilation_1(T1, #state{stack = [T2|_]})
when element(1, T2) == a, element(1, T1) == b, element(1, T1) == c ->
ok;
slow_compilation_1(T, _)
when element(1, T) == a1; element(1, T) == b1; element(1, T) == c1 ->
ok;
slow_compilation_1(T, _)
when element(1, T) == a2; element(1, T) == b2; element(1, T) == c2 ->
ok;
slow_compilation_1(T, _) when element(1, T) == a ->
ok;
slow_compilation_1(T, _)
when
element(1, T) == a,
(element(1, T) == b) and (element(1, T) == c) ->
ok;
slow_compilation_1(_, T) when element(1, T) == a ->
ok;
slow_compilation_1(_, T) when element(1, T) == b ->
ok;
slow_compilation_1(T, _) when element(1, T) == a ->
ok.
%% Utilities.
check(V1, V0) ->
if V1 /= V0 ->
io:fwrite("error: ~w.\n", [V1]),
?t:fail();
true ->
io:fwrite("ok: ~w.\n", [V1])
end.
echo(X) ->
io:fwrite("eval(~w); ",[X]),
X.
id(I) -> I.
|