summaryrefslogtreecommitdiff
path: root/lace.rb
blob: f6f871dd6b6d99b4a59a249c9e0f7689d33adc05 (plain) (blame)
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
require "bigdecimal"
require "set"

module Lace

  extend self

  def en(series, sigfigs, n)
    return BigDecimal((10.0**Math.log10(n.to_f**series.to_f).round.to_f)**(1.0/series.to_f), sigfigs).round
  end

  HISTORIC_E24_FIX_TABLE = {
    Math.log10(2.6)  => Math.log10(2.7),
    Math.log10(2.9)  => Math.log10(3.0),
    Math.log10(3.2)  => Math.log10(3.3),
    Math.log10(3.5)  => Math.log10(3.6),
    Math.log10(3.8)  => Math.log10(3.9),
    Math.log10(4.2)  => Math.log10(4.3),
    Math.log10(4.6)  => Math.log10(4.7),
    }
  def historic_e24_fix(n)
    exp, rem = Math.log10(n).divmod(1)
    HISTORIC_E24_FIX_TABLE.each do | accurate, historic |
      rem = historic if (rem - accurate).abs <= 0.0001
    end
    return (10 ** (exp + rem)).round
  end

  def e3(n)
    return historic_e24_fix(en(3, 2, n))
  end

  def e6(n)
    return historic_e24_fix(en(6, 2, n))
  end

  def e12(n)
    return historic_e24_fix(en(12, 2, n))
  end

  def e24(n)
    return historic_e24_fix(en(24, 2, n))
  end

  def e48(n)
    return en(48, 3, n)
  end

  def e96(n)
    return en(96, 3, n)
  end

  def e192(n)
    return en(192, 3, n)
  end

  class Netlist

    attr_reader :components
    attr_reader :nets

    def initialize(&p)
      @components = {}
      @nets = {}

      edit(&p) if p
    end

    def merge_nets(a, b)
      into = @nets[[a.object_id, b.object_id].min]
      if a.name
        raise "Nets #{into.name} and #{a.name} merged!" if into.name and into.name != a.name
        into.name = a.name
      end
      if b.name
        raise "Nets #{into.name} and #{b.name} merged!" if into.name and into.name != b.name
        into.name = b.name
      end
      @nets[a.object_id] = into
      @nets[b.object_id] = into
      return into
    end

    def edit(&p)
      instance_eval &p
    end

    def comp(*args)
      c = Component.new(self, *args)
      @components[c.object_id] = c
    end

    def net(*args)
      n = Net.new(self, *args)
      @nets[n.object_id] = n
    end

    def real_refs
      refs = {}
      counters = {}
      seen = Set.new
      @components.each do | id, comp |
        next if seen.member?(comp.object_id)
        seen.add(comp.object_id)
        counter = counters[comp.refbase] || 1
        counters[comp.refbase] = counter + 1
        ref = "#{comp.refbase}#{counter}"
        refs[ref] = comp
      end
      return refs
    end

    def real_nets(refs)
      n = 1
      nets = {}
      seen = Set.new
      @nets.each do | id, net |
        next if seen.member?(net.object_id)
        seen.add(net.object_id)
        name = net.name
        unless name
          name = "$unnamed#{n}"
          n += 1
        end
        raise "Multiple disconnected nets named #{name}" if nets.member?(name)
        nodes = []
        refs.each do | ref, comp |
          comp.pins.each do | pin, pinnet |
            nodes << {:ref => ref, :pin => pin} if @nets[pinnet].object_id == net.object_id
          end
        end
        nets[name] = nodes if nodes.size > 1
      end
      return nets
    end

    def real
      refs = real_refs
      nets = real_nets(refs)
      return [refs, nets]
    end

    def kicad(stream=$stdout)
      refs, nets = real
      stream.write(<<END)
(export
  (version D)
  (components
END
      refs.each do | ref, comp |
        stream.write(<<END)
    (comp
      (ref #{ref.inspect})
      (footprint #{comp.footprint.inspect})
      (value #{comp.value.inspect})
      (libsource (lib NO_LIB) (part #{comp.name.inspect}))
    )
END
      end
      stream.write(<<END)
  )
  (nets
END
      n = 1
      nets.each do | name, nodes |
        stream.write(<<END)
    (net
      (code #{n})
      (name #{name.inspect})
END
        nodes.each do | node |
          stream.write(<<END)
      (node
        (ref #{node[:ref].inspect})
        (pin #{node[:pin]})
      )
END
        end
        stream.write(<<END)
    )
END
        n += 1
      end
      stream.write(<<END)
  )
)
END
    end

    def summary(stream=$stdout)
      refs, nets = real
      refs.each do | ref, comp |
        stream.write("#{ref} is a #{comp.footprint} #{comp.desc}\n")
      end
      nets.each do | name, nodes |
        stream.write("Net #{name}:\n")
        nodes.each do | node |
          stream.write("  #{node[:ref]}[#{node[:pin]}]\n")
        end
      end
    end

    def bom
      bom = {}
      real_refs.each do | ref, comp |
        desc = "#{comp.footprint} #{comp.desc}"
        bom[desc] = 0 unless bom.member?(desc)
        bom[desc] += 1
      end
      return bom
    end
  end

  class Wireable

    attr_reader :netlist

    attr_reader :left
    attr_reader :right

    def initialize(netlist, left=nil, right=nil)
      @netlist = netlist

      @left = left
      @right = right || left
    end

    def -(that)
      @netlist.merge_nets(@right, that.left)
      return Wireable.new(@netlist, @left, that.right)
    end

  end

  class Component < Wireable

    attr_reader :refbase
    attr_reader :footprint
    attr_reader :name
    attr_reader :value

    attr_reader :pins

    def initialize(netlist, refbase, footprint, name, value=nil)
      super(netlist)

      @refbase = refbase
      @footprint = footprint
      @name = name
      @value = value || name

      @pins = {}
    end

    def left
      return self[1]
    end

    def right
      return self[2]
    end

    def [](pin)
      unless pins.member?(pin)
        n = @netlist.net
        pins[pin] = n.object_id
      end
      return @netlist.nets[pins[pin]]
    end

    def desc
      return "#{@value} #{@name}" if @name != @value
      return @name
    end

  end

  class Net < Wireable

    attr_accessor :name

    def initialize(netlist, name=nil)
      super(netlist, self)

      @name = name
    end

  end

end