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
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
|
open Types
open Common
open Printf
let bpos = -1, -1
let raw_pos2pos(a, b) = !Info.current_file, a, b
let pos_range (_, (_, (a1, b1))) (_, (_, (a2, b2))) = raw_pos2pos((if a1 = -1 then a2 else a1), (if b2 = -1 then b1 else b2))
let sp_pos_range (_, (space, (a1, b1))) (_, (_, (a2, b2))) = space, ((if a1 = -1 then a2 else a1), (if b2 = -1 then b1 else b2))
let get_pos (_, (_, pos)) = raw_pos2pos pos
let var_dollar_ = Deref(I_scalar, Ident(None, "_", raw_pos2pos bpos))
let var_STDOUT = Deref(I_star, Ident(None, "STDOUT", raw_pos2pos bpos))
let is_var_dollar_ = function
| Deref(I_scalar, Ident(None, "_", _)) -> true
| _ -> false
let is_var_number_match = function
| Deref(I_scalar, Ident(None, s, _)) -> String.length s = 1 && s.[0] <> '0' && char_is_number s.[0]
| _ -> false
let is_parenthesized = function
| List[]
| List[List _] -> true
| _ -> false
let un_parenthesize = function
| List[List[e]] -> e
| _ -> internal_error "un_parenthesize"
let rec un_parenthesize_full = function
| List[e] -> un_parenthesize_full e
| e -> e
let not_complex e =
if is_parenthesized e then true else
let rec not_complex_ op = function
| Call_op("?:", _, _) -> false
| Call_op(op', l, _) -> op <> op' && List.for_all (not_complex_ op') l
| e -> not (is_parenthesized e)
in not_complex_ "" (un_parenthesize_full e)
let not_simple = function
| Num _ | Ident _ | Deref(_, Ident _) -> false
| _ -> true
let string_of_Ident = function
| Ident(None, s, _) -> s
| Ident(Some fq, s, _) -> fq ^ "::" ^ s
| _ -> internal_error "string_of_Ident"
let context2s = function
| I_scalar -> "$"
| I_hash -> "%"
| I_array -> "@"
| I_func -> "&"
| I_raw -> ""
| I_star -> "*"
let variable2s(context, ident) = context2s context ^ ident
let non_scalar_context context = context = I_hash || context = I_array
let rec is_same_fromparser a b =
match a, b with
| Undef, Undef -> true
| Ident(fq1, s1, _), Ident(fq2, s2, _) -> fq1 = fq2 && s1 = s2
| Num(s1, _), Num(s2, _)
| Raw_string(s1, _), Raw_string(s2, _) -> s1 = s2
| String(l1, _), String(l2, _) ->
List.for_all2 (fun (s1, e1) (s2, e2) -> s1 = s2 && is_same_fromparser e1 e2) l1 l2
| Ref(c1, e1), Ref(c2, e2)
| Deref(c1, e1), Deref(c2, e2) -> c1 = c2 && is_same_fromparser e1 e2
| Deref_with(c1, c_1, e1, e_1), Deref_with(c2, c_2, e2, e_2) -> c1 = c2 && c_1 = c_2 && is_same_fromparser e1 e2 && is_same_fromparser e_1 e_2
| Diamond(None), Diamond(None) -> true
| Diamond(Some e1), Diamond(Some e2) -> is_same_fromparser e1 e2
| List(l1), List(l2) -> List.for_all2 is_same_fromparser l1 l2
| Call_op(op1, l1, _), Call_op(op2, l2, _) -> op1 = op2 && List.for_all2 is_same_fromparser l1 l2
| Call(e1, l1), Call(e2, l2) -> is_same_fromparser e1 e2 && List.for_all2 is_same_fromparser l1 l2
| Method_call(e1, m1, l1), Method_call(e2, m2, l2) ->
is_same_fromparser e1 e2 && is_same_fromparser m1 m2 && List.for_all2 is_same_fromparser l1 l2
| _ -> false
let from_scalar (e, _) =
match e with
| Deref(I_scalar, ident) -> ident
| _ -> internal_error "from_scalar"
let from_array (e, _) =
match e with
| Deref(I_array, ident) -> ident
| _ -> internal_error "from_array"
let msg_with_rawpos (start, end_) msg = Info.pos2sfull_current start end_ ^ msg
let die_with_rawpos raw_pos msg = failwith (msg_with_rawpos raw_pos msg)
let warn raw_pos msg = prerr_endline (msg_with_rawpos raw_pos msg)
let die_rule msg = die_with_rawpos (Parsing.symbol_start(), Parsing.symbol_end()) msg
let warn_rule msg = warn (Parsing.symbol_start(), Parsing.symbol_end()) msg
let debug msg = if true then prerr_endline msg
let warn_verb pos msg = if not !Flags.quiet then warn (pos, pos) msg
let warn_too_many_space start = warn_verb start "you should have only one space here"
let warn_no_space start = warn_verb start "you should have a space here"
let warn_cr start = warn_verb start "you should not have a carriage-return (\\n) here"
let warn_space start = warn_verb start "you should not have a space here"
let rec prio_less = function
| P_paren_wanted prio1, prio2
| prio1, P_paren_wanted prio2 -> prio_less(prio1, prio2)
| P_ternary, P_or -> false
| P_ternary, P_and -> false
| _, P_loose -> true
| P_loose, _ -> false
| _, P_or -> true
| P_or, _ -> false
| _, P_and -> true
| P_and, _ -> false
| _, P_comma -> true
| P_comma, _ -> false
| _, P_call_no_paren -> true
| P_call_no_paren, _ -> false
| _, P_assign -> true
| P_assign, _ -> false
| _, P_ternary -> true
| P_ternary, _ -> false
| _, P_tight_or -> true
| P_tight_or, _ -> false
| _, P_tight_and -> true
| P_tight_and, _ -> false
| _, P_expr -> true
| P_expr, _ -> false
| _, P_eq -> true
| P_eq, _ -> false
| _, P_cmp -> true
| P_cmp, _ -> false
| _, P_add -> true
| P_add, _ -> false
| _, P_mul -> true
| P_mul, _ -> false
| _, P_tight -> true
| P_tight, _ -> false
| _, P_paren _ -> true
| P_paren _, _ -> true
| P_tok, _ -> true
let prio_lo pri_out ((pri_in, e), (_, pos)) =
if prio_less(pri_in, pri_out) then
(match pri_in with
| P_paren (P_paren_wanted _) -> ()
| P_paren pri_in' ->
if pri_in' <> pri_out &&
prio_less(pri_in', pri_out) && not_complex (un_parenthesize e) then
warn pos "unneeded parentheses"
| _ -> ())
else warn pos "missing parentheses (needed for clarity)" ;
e
let prio_lo_after pri_out ((pri_in, e), _ as para) =
if pri_in = P_call_no_paren then e else prio_lo pri_out para
let prio_lo_concat ((pri_in, e), both) = prio_lo P_mul ((P_paren_wanted pri_in, e), both)
let sp_0(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0 -> ()
| Space_1
| Space_n -> warn_space start
| Space_cr -> warn_cr start
let sp_0_or_cr(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0 -> ()
| Space_1
| Space_n -> warn_space start
| Space_cr -> ()
let sp_1(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0 -> warn_no_space start
| Space_1 -> ()
| Space_n -> warn_too_many_space start
| Space_cr -> warn_cr start
let sp_n(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0 -> warn_no_space start
| Space_1 -> ()
| Space_n -> ()
| Space_cr -> warn_cr start
let sp_p(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0 -> warn_no_space start
| Space_1 -> ()
| Space_n -> ()
| Space_cr -> ()
let sp_cr(_, (spaces, (start, _))) =
match spaces with
| Space_none -> ()
| Space_0
| Space_1
| Space_n -> warn_verb start "you should have a carriage-return (\\n) here"
| Space_cr -> ()
let sp_same (_, (spaces1, _) as ter1) (_, (spaces2, _) as ter2) =
if spaces1 <> Space_0 then sp_p ter2
else if spaces2 <> Space_0 then sp_p ter1
let check_word_alone (word, _) =
match word with
| Ident(None, f, _) ->
(match f with
| "length" | "stat" | "lstat" | "chop" | "chomp" | "quotemeta" | "lc" | "lcfirst" | "uc" | "ucfirst" ->
Deref(I_func, word)
| "split" | "shift"
| "return" | "eof" | "die" | "caller"
| "redo" | "next" | "last" ->
Deref(I_func, word)
| "hex" | "ref" ->
warn_rule (sprintf "please use \"%s $_\" instead of \"%s\"" f f) ;
Deref(I_func, word)
| "time" | "wantarray" | "fork" | "getppid" | "arch" ->
warn_rule (sprintf "please use %s() instead of %s" f f) ;
Deref(I_func, word)
| _ -> word)
| _ -> word
let check_parenthesized_first_argexpr word ((_, e), (_, (start, _)) as ex) =
let want_space = word.[0] = '-' in
if word = "return" then () else
match e with
| [ Call_op(_, (e' :: l), _) ]
| e' :: l ->
if is_parenthesized e' then
if l = [] then
(if want_space then sp_n else sp_0) ex
else die_with_rawpos (start, start) "can't handle this nicely"
else
sp_p(ex)
| _ ->
if word = "time" then die_rule "please use time() instead of time";
sp_p(ex)
let check_hash_subscript ((_, e), (_, pos)) =
let can_be_raw_string = function
| "" | "x" | "y" -> false (* special case for {'y'} otherwise the emacs mode goes wild, special case for {'x'} to have the same as {'y'} (since they usually go together) *)
| s ->
char_is_alpha s.[0] && (String.length s = 1 || string_forall_with char_is_alphanumerical_ 1 s)
in
match e with
| List [String ([(s, List [])], _)] when can_be_raw_string s -> warn pos (sprintf "{\"%s\"} can be written {%s}" s s)
| List [Raw_string(s, _)] when can_be_raw_string s -> warn pos (sprintf "{'%s'} can be written {%s}" s s)
| _ -> ()
let check_arrow_needed ((_, e), _) ter =
match e with
| Deref_with(I_array, I_scalar, List [List [Call _]], _) -> () (* "->" needed for (f())[0]->{XX} *)
| Deref_with _ -> warn (sndsnd ter) "the arrow \"->\" is unneeded"
| _ -> ()
let check_ternary_paras(cond, a, b) =
let rec dont_need_short_circuit_rec = function
| Num _
| Raw_string _
| String ([(_, List [])], _)
| Call_op("qw", _, _)
-> true
| Call(Deref(I_func, Ident(None, "N", _)), [ List(String _ :: l) ])
| Call_op(".", l, _)
| Ref(I_hash, List l)
| List l -> List.for_all dont_need_short_circuit_rec l
| _ -> false
in
let rec dont_need_short_circuit = function
| Ref(_, Deref(_, Ident _))
| Deref(_, Ident _) -> true
| Ref(I_hash, List l)
| List l -> List.for_all dont_need_short_circuit l
| e -> dont_need_short_circuit_rec e
in
let check_ternary_para = function
| List [] -> warn_rule "you may use if_() here\n beware that the short-circuit semantic of ?: is not kept\n if you want to keep the short-circuit behaviour, replace () with @{[]} and there will be no warning anymore"
| _ -> ()
in
if dont_need_short_circuit a || is_same_fromparser cond a then check_ternary_para b;
if dont_need_short_circuit b || is_same_fromparser cond b then check_ternary_para a;
[ cond; a; b ]
let check_unneeded_var_dollar_ ((_, e), (_, pos)) =
if is_var_dollar_ e then warn pos "\"$_ =~ /regexp/\" can be written \"/regexp/\"" else
if is_var_number_match e then warn pos "do not use the result of a match (eg: $1) to match another pattern"
let check_unneeded_var_dollar_not ((_, e), (_, pos)) =
if is_var_dollar_ e then warn pos "\"$_ !~ /regexp/\" can be written \"!/regexp/\"" else
if is_var_number_match e then warn pos "do not use the result of a match (eg: $1) to match another pattern"
let check_unneeded_var_dollar_s ((_, e), (_, pos)) =
if is_var_dollar_ e then warn pos "\"$_ =~ s/regexp/.../\" can be written \"s/regexp/.../\"" else
if is_var_number_match e then die_with_rawpos pos "do not modify the result of a match (eg: $1)"
let check_MULT_is_x (s, _) = if s <> "x" then die_rule "syntax error"
let check_my (s, _) = if s <> "my" then die_rule "syntax error"
let check_foreach (s, (_, pos)) = if s = "for" then warn pos "write \"foreach\" instead of \"for\""
let check_for (s, (_, pos)) = if s = "foreach" then warn pos "write \"for\" instead of \"foreach\""
let check_for_foreach (s, (_, pos)) ((_, expr), _) =
match expr with
| List [ Deref(I_scalar, _) ] ->
if s = "foreach" then warn pos "you are using the special fpons trick to locally set $_ with a value, for this please use \"for\" instead of \"foreach\""
| List [ Deref_with(context, I_scalar, _, _) ] when context <> I_func ->
if s = "foreach" then warn pos "you are using the special fpons trick to locally set $_ with a value, for this please use \"for\" instead of \"foreach\""
| _ ->
if s = "for" then warn pos "write \"foreach\" instead of \"for\""
let check_block_sub (l, (_, (_, end_)) as ter_lines) (_, (space, _) as ter_BRACKET_END) =
if l = [] then
sp_0_or_cr ter_BRACKET_END
else (
(if l <> [] && List.hd l = Semi_colon then sp_0 else sp_p) ter_lines ;
sp_p ter_BRACKET_END ;
if space <> Space_cr then
(if l <> [] && last l = Semi_colon then warn_verb end_ "spurious \";\" before closing block")
)
let check_block_ref (l, (_, (_, end_)) as ter_lines) (_, (space, _) as ter_BRACKET_END) =
if l <> [] && List.hd l = Semi_colon
then (sp_0 ter_lines ; sp_p ter_BRACKET_END)
else sp_same ter_lines ter_BRACKET_END ;
if space <> Space_cr then
(if l <> [] && last l = Semi_colon then warn_verb end_ "spurious \";\" before closing block")
let check_my_our_paren (((comma_closed, _), _), _) =
if not comma_closed then die_rule "syntax error"
let rec only_one (l, (spaces, pos)) =
match l with
| [List l'] -> only_one (l', (spaces, pos))
| [e] -> e
| [] -> die_with_rawpos pos "you must give one argument"
| _ -> die_with_rawpos pos "you must give only one argument"
let only_one_in_List ((_, e), both) =
match e with
| List l -> only_one(l, both)
| _ -> e
let rec is_only_one_in_List = function
| [List l] -> is_only_one_in_List l
| [_] -> true
| _ -> false
let is_not_a_scalar = function
| Deref_with(_, context, _, _)
| Deref(context, _) -> non_scalar_context context
| _ -> false
let maybe_to_Raw_string = function
| Ident(None, s, pos) -> Raw_string(s, pos)
| Ident(Some fq, s, pos) -> Raw_string(fq ^ "::" ^ s, pos)
| e -> e
let to_List = function
| [e] -> e
| l -> List l
let deref_arraylen e = Call(Deref(I_func, Ident(None, "int", raw_pos2pos bpos)), [Deref(I_array, e)])
let to_Ident ((fq, name), (_, pos)) = Ident(fq, name, raw_pos2pos pos)
let to_Raw_string (s, (_, pos)) = Raw_string(s, raw_pos2pos pos)
let to_Method_call (object_, method_, para) = Method_call(maybe_to_Raw_string object_, maybe_to_Raw_string method_, para)
let to_Deref_with(from_context, to_context, ref_, para) =
if is_not_a_scalar ref_ then warn_rule "bad deref";
Deref_with(from_context, to_context, ref_, para)
let to_Local ((_, e), (_, pos)) =
let l =
match e with
| List[List l] -> l
| _ -> [e]
in
let local_vars, local_exprs = fpartition (function
| Deref(I_star, Ident(None, ident, _)) ->
Some(I_star, ident)
| Deref(I_scalar, Ident _)
| Deref(I_array, Ident _)
| Deref(I_star, Ident _)
| Deref_with(I_hash, I_scalar, Ident _, _)
| Deref_with(I_hash, I_scalar, Deref(I_scalar, _), _)
| Deref_with(I_hash, I_scalar, Deref_with(I_hash, I_scalar, Ident _, _), _)
| Deref_with(I_hash, I_scalar, Deref_with(I_hash, I_scalar, Deref(I_scalar, Ident _), _), _) ->
None
| _ -> die_with_rawpos pos "bad argument to \"local\""
) l in
if local_vars = [] then Call_op("local", local_exprs, raw_pos2pos pos)
else if local_exprs = [] then My_our("local", local_vars, raw_pos2pos pos)
else die_with_rawpos pos "bad argument to \"local\""
let op prio s (_, both) = prio, (((), both), s)
let op_p prio s e = sp_p e ; op prio s e
let sub_declaration (name, proto) body = Sub_declaration(name, proto, Block body)
let anonymous_sub body = Anonymous_sub (Block body)
let cook_call_op(op, para, pos) =
let call = Call_op(op, para, raw_pos2pos pos) in
match op, para with
| "=", [My_our _; Ident(None, "undef", _)] ->
warn pos "no need to initialize variable, it's done by default" ;
call
| "=", [My_our _; List[]] ->
if Info.is_on_same_line_current pos then warn pos "no need to initialize variables, it's done by default" ;
call
| "=", [ Deref(I_star, String ([(sf1, List [])], _)); _ ] ->
warn_rule (sprintf "write *{'%s'} instead of *{\"%s\"}" sf1 sf1) ;
call
| "=", [ Deref(I_star, (Ident _ as f1)); Deref(I_star, (Ident _ as f2)) ] ->
let s1, s2 = string_of_Ident f1, string_of_Ident f2 in
warn pos (sprintf "\"*%s = *%s\" is better written \"*%s = \\&%s\"" s1 s2 s1 s2) ;
sub_declaration (f1, "") [ Deref(I_func, f2) ]
| "=", [ Deref(I_star, Raw_string(sf1, pos_f1)); Deref(I_star, (Ident _ as f2)) ] ->
let s2 = string_of_Ident f2 in
warn pos (sprintf "\"*{'%s'} = *%s\" is better written \"*{'%s'} = \\&%s\"" sf1 s2 sf1 s2) ;
sub_declaration (Ident(None, sf1, pos_f1), "") [ Deref(I_func, f2) ]
| "=", [ Deref(I_star, (Ident _ as f1)); Ref(I_scalar, Deref(I_func, (Ident _ as f2))) ] ->
sub_declaration (f1, "") [ Deref(I_func, f2) ]
| "=", [ Deref(I_star, Raw_string(sf1, pos_f1)); Ref(I_scalar, Deref(I_func, (Ident _ as f2))) ] ->
sub_declaration (Ident(None, sf1, pos_f1), "") [ Deref(I_func, f2) ]
| _ ->
call
let call_op_((prio, (prev_ter, op)), ter, para) (sp, pos) =
sp_same prev_ter ter ;
(prio, cook_call_op(op, para, pos)), (sp, pos)
let to_Call_op(op, para) (sp, pos) = Call_op(op, para, raw_pos2pos pos), (sp, pos)
let to_Call_op_(prio, op, para) (sp, pos) = (prio, Call_op(op, para, raw_pos2pos pos)), (sp, pos)
let followed_by_comma ((_,e), _) (true_comma, _) =
if true_comma then e else
match split_last e with
| l, Ident(None, s, pos) -> l @ [Raw_string(s, pos)]
| _ -> e
let call_func is_a_func (e, para) =
match e with
| Deref(I_func, Ident(None, f, _)) ->
let para' = match f with
| "no" ->
(match para with
| [ Ident(_, _, pos) as s ] -> Some [ Raw_string(string_of_Ident s, pos) ]
| [ Call(Deref(I_func, (Ident(_, _, pos) as s)), l) ] -> Some(Raw_string(string_of_Ident s, pos) :: l)
| _ -> die_rule "use \"no PACKAGE <para>\"")
| "undef" ->
(match para with
| [ Deref(I_star, ident) ] -> Some [ Deref(I_func, ident) ]
| _ -> None)
| "N" | "N_" ->
(match para with
| [ List(String([ _s, List [] ], _) :: _) ] -> None
| [ List(String _ :: _) ] -> die_rule "don't use interpolated translated string, use %s or %d instead"
| _ -> die_rule (sprintf "%s() must be used with a string" f))
| "goto" ->
(match para with
| [ Ident(None, s, pos) ] -> Some [ Raw_string(s, pos) ]
| _ -> None)
| "last" | "next" | "redo" when not is_a_func ->
(match para with
| [ Ident(None, s, pos) ] -> Some [ Raw_string(s, pos) ]
| _ -> die_rule (sprintf "%s must be used with a raw string" f))
| "length" ->
if para = [] then warn_rule "length() with no parameter !?" else
if is_not_a_scalar (List.hd para) then warn_rule "never use \"length @l\", it returns the length of the string int(@l)" ;
None
| _ -> None
in Call(e, some_or para' para)
| _ -> Call(e, para)
let call(e, para) = call_func false (e, para)
let call_one_scalar_para (e, (_, pos)) para =
let pri =
match e with
| "defined" -> P_expr
| _ -> P_add
in
pri, call(Deref(I_func, Ident(None, e, raw_pos2pos pos)), para)
let call_op_if_infix left right (sp, pos) =
(match left, right with
| List [Call_op("=", [Deref(context, _); _], _)], _ when non_scalar_context context -> ()
| List [Call_op("=", [v; _], _)],
List [Call_op("not", [v'], _)] when is_same_fromparser v v' ->
warn_rule "\"$foo = ... if !$foo\" can be written \"$foo ||= ...\""
| _ -> ());
Call_op("if infix", [ left ; right], raw_pos2pos pos), (sp, pos)
let call_op_unless_infix left right (sp, pos) =
(match left, right with
| List [Call_op("=", [Deref(context, _); _], _)], _ when non_scalar_context context -> ()
| List [Call_op("=", [v; _], _)], List [v'] when is_same_fromparser v v' ->
warn_rule "\"$foo = ... unless $foo\" can be written \"$foo ||= ...\""
| _ -> ());
(match right with
| List [Call_op(op, _, _)] ->
(match op with
| "&&" | "||" | "not" | "ne" | "?:" -> warn_rule "don't use \"unless\" when the condition is complex, use \"if\" instead"
| _ -> ());
| _ -> ());
Call_op("unless infix", [ left ; right], raw_pos2pos pos), (sp, pos)
let (current_lexbuf : Lexing.lexbuf option ref) = ref None
let rec list2tokens l =
let rl = ref l in
fun lexbuf ->
match !rl with
| [] -> internal_error "list2tokens"
| ((start, end_), e) :: l ->
lexbuf.Lexing.lex_abs_pos <- 0 ;
lexbuf.Lexing.lex_start_pos <- start ;
lexbuf.Lexing.lex_curr_pos <- end_ ;
rl := l ; e
let parse_tokens parse tokens lexbuf_opt =
if lexbuf_opt <> None then current_lexbuf := lexbuf_opt ;
if tokens = [] then [] else
parse (list2tokens tokens) (some !current_lexbuf)
let parse_interpolated parse l =
let l' = List.map (fun (s, tokens) -> s, to_List(parse_tokens parse tokens None)) l in
match split_last l' with
| pl, ("", List []) -> pl
| _ -> l'
let to_String parse strict (l, (_, pos)) =
let l' = parse_interpolated parse l in
(match l' with
| [ "", List [Deref(I_scalar, Ident(None, ident, _))]] ->
if strict then warn pos (sprintf "%s is better written without the double quotes" (variable2s(I_scalar, ident)))
| [ "", List [Deref(I_hash, _)]] ->
warn pos "don't use a hash in string context"
| [ "", List [Deref(I_array, _)]] ->
()
| [("", _)] ->
if strict then warn pos "double quotes are unneeded"
| _ -> ());
String(l', raw_pos2pos pos)
let from_PATTERN parse ((s, opts), (_, pos)) =
[ String(parse_interpolated parse s, raw_pos2pos pos) ;
Raw_string(opts, raw_pos2pos pos) ]
let from_PATTERN_SUBST parse ((s1, s2, opts), (_, pos)) =
[ String(parse_interpolated parse s1, raw_pos2pos pos) ;
String(parse_interpolated parse s2, raw_pos2pos pos) ;
Raw_string(opts, raw_pos2pos pos) ]
|