package diffast-langs-verilog

  1. Overview
  2. Docs
Verilog parser plugin for Diff/AST

Install 

dune-project
 Dependency

github.com Readme Edit opam file Versions (5)

Authors

  1. C
    Codinuum <codinuum@me.com>
  2. M
    Masatomo Hashimoto <m.hashimoto@stair.center>

Maintainers

  1. C
    Codinuum <codinuum@me.com>
  2. M
    Masatomo Hashimoto <m.hashimoto@stair.center>

Sources

v0.4.tar.gz
sha256=f58dc5326c1698e22b84e3b808e6008228071f5796cda65433106e0d42c0dad5
sha512=8e451ab99433ef479c7d3aa0396bab6650894a2c3282e72cc65014d61f59dde578020d4bc9d423045e66d1d4592b58e877d7bd830788aeb96e5fa4ba534b4b78

doc/src/diffast-langs-verilog.base/v_tree.ml.html

Source file v_tree.ml

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
(*
   Copyright 2012-2025 Codinuum Software Lab <https://codinuum.com>

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*)
(*
 * AST for Verilog HDL (for otreediff)
 *
 * verilog/tree.ml
 *
 *)

module Sourcecode = Diffast_core.Sourcecode
module Fname = Langs_common.Fname
module Astloc = Langs_common.Astloc
module Printer = Verilog_parsing.Printer

module P = Printer
module L = V_label

let sprintf = Printf.sprintf

let conv_loc = L.conv_loc

let set_loc nd loc = nd#data#set_loc (conv_loc loc)

module Tree = Sourcecode.Tree (L)
open Tree

let of_ast options ast =

  let rec convl astnd_list =

    let _, _children =
      List.fold_left
        (fun (is_included, l) an ->

          let children_are_included =
            List.for_all (fun c -> c#lloc#get_level > 0) an#children
          in
          if an#lloc#get_level > 0 && children_are_included then begin
            if is_included then begin
              (is_included, l)
            end
            else begin
              let f = Fname.strip (an#lloc#get_loc_of_level 1).Astloc.filename in
              let lab = L.CompilerDirective (L.CompilerDirective.Include ("\""^f^"\"")) in
              let nd = mkleaf options lab in
              set_loc nd (an#lloc#get_loc_of_level 0);
              (true, nd::l)
            end
          end
          else begin
            (false, (conv an)::l)
          end
        ) (false, []) astnd_list
    in
    List.rev _children

  and conv astnd =
    let lab = astnd#label in
    let children = convl astnd#children in
    let nd = mknode options lab children in
    set_loc nd astnd#loc;
    nd
  in
  let root_node =
    match convl [ast#root] with
    | [nd] -> nd
    | _ -> assert false
  in
  let tree = new c options root_node true in
  tree#collapse;
  tree#set_total_LOC ast#lines_read;
  tree#set_ignored_regions (ast#comment_regions @ ast#ignored_regions);
  tree#set_misparsed_regions ast#missed_regions;
  tree