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
|
// traverse the node_modules/package.json tree
// looking for duplicates. If any duplicates are found,
// then move them up to the highest level necessary
// in order to make them no longer duplicated.
//
// This is kind of ugly, and really highlights the need for
// much better "put pkg X at folder Y" abstraction. Oh well,
// whatever. Perfect enemy of the good, and all that.
var fs = require("fs")
var asyncMap = require("slide").asyncMap
var path = require("path")
var readJson = require("read-package-json")
var semver = require("semver")
var rm = require("./utils/gently-rm.js")
var log = require("npmlog")
var npm = require("./npm.js")
var mapToRegistry = require("./utils/map-to-registry.js")
module.exports = dedupe
dedupe.usage = "npm dedupe [pkg pkg...]"
function dedupe (args, silent, cb) {
if (typeof silent === "function") cb = silent, silent = false
var dryrun = false
if (npm.command.match(/^find/)) dryrun = true
return dedupe_(npm.prefix, args, {}, dryrun, silent, cb)
}
function dedupe_ (dir, filter, unavoidable, dryrun, silent, cb) {
readInstalled(path.resolve(dir), {}, null, function (er, data, counter) {
if (er) {
return cb(er)
}
if (!data) {
return cb()
}
// find out which things are dupes
var dupes = Object.keys(counter || {}).filter(function (k) {
if (filter.length && -1 === filter.indexOf(k)) return false
return counter[k] > 1 && !unavoidable[k]
}).reduce(function (s, k) {
s[k] = []
return s
}, {})
// any that are unavoidable need to remain as they are. don't even
// try to touch them or figure it out. Maybe some day, we can do
// something a bit more clever here, but for now, just skip over it,
// and all its children.
;(function U (obj) {
if (unavoidable[obj.name]) {
obj.unavoidable = true
}
if (obj.parent && obj.parent.unavoidable) {
obj.unavoidable = true
}
Object.keys(obj.children).forEach(function (k) {
U(obj.children[k])
})
})(data)
// then collect them up and figure out who needs them
;(function C (obj) {
if (dupes[obj.name] && !obj.unavoidable) {
dupes[obj.name].push(obj)
obj.duplicate = true
}
obj.dependents = whoDepends(obj)
Object.keys(obj.children).forEach(function (k) {
C(obj.children[k])
})
})(data)
if (dryrun) {
var k = Object.keys(dupes)
if (!k.length) return cb()
return npm.commands.ls(k, silent, cb)
}
var summary = Object.keys(dupes).map(function (n) {
return [n, dupes[n].filter(function (d) {
return d && d.parent && !d.parent.duplicate && !d.unavoidable
}).map(function M (d) {
return [d.path, d.version, d.dependents.map(function (k) {
return [k.path, k.version, k.dependencies[d.name] || ""]
})]
})]
}).map(function (item) {
var set = item[1]
var ranges = set.map(function (i) {
return i[2].map(function (d) {
return d[2]
})
}).reduce(function (l, r) {
return l.concat(r)
}, []).map(function (v, i, set) {
if (set.indexOf(v) !== i) return false
return v
}).filter(function (v) {
return v !== false
})
var locs = set.map(function (i) {
return i[0]
})
var versions = set.map(function (i) {
return i[1]
}).filter(function (v, i, set) {
return set.indexOf(v) === i
})
var has = set.map(function (i) {
return [i[0], i[1]]
}).reduce(function (set, kv) {
set[kv[0]] = kv[1]
return set
}, {})
var loc = locs.length ? locs.reduce(function (a, b) {
// a=/path/to/node_modules/foo/node_modules/bar
// b=/path/to/node_modules/elk/node_modules/bar
// ==/path/to/node_modules/bar
var nmReg = new RegExp("\\" + path.sep + "node_modules\\" + path.sep)
a = a.split(nmReg)
b = b.split(nmReg)
var name = a.pop()
b.pop()
// find the longest chain that both A and B share.
// then push the name back on it, and join by /node_modules/
for (var i = 0, al = a.length, bl = b.length; i < al && i < bl && a[i] === b[i]; i++);
return a.slice(0, i).concat(name).join(path.sep + "node_modules" + path.sep)
}) : undefined
return [item[0], { item: item
, ranges: ranges
, locs: locs
, loc: loc
, has: has
, versions: versions
}]
}).filter(function (i) {
return i[1].loc
})
findVersions(npm, summary, function (er, set) {
if (er) return cb(er)
if (!set.length) return cb()
installAndRetest(set, filter, dir, unavoidable, silent, cb)
})
})
}
function installAndRetest (set, filter, dir, unavoidable, silent, cb) {
//return cb(null, set)
var remove = []
asyncMap(set, function (item, cb) {
// [name, has, loc, locMatch, regMatch, others]
var name = item[0]
var has = item[1]
var where = item[2]
var locMatch = item[3]
var regMatch = item[4]
var others = item[5]
// nothing to be done here. oh well. just a conflict.
if (!locMatch && !regMatch) {
log.warn("unavoidable conflict", item[0], item[1])
log.warn("unavoidable conflict", "Not de-duplicating")
unavoidable[item[0]] = true
return cb()
}
// nothing to do except to clean up the extraneous deps
if (locMatch && has[where] === locMatch) {
remove.push.apply(remove, others)
return cb()
}
if (regMatch) {
var what = name + "@" + regMatch
// where is /path/to/node_modules/foo/node_modules/bar
// for package "bar", but we need it to be just
// /path/to/node_modules/foo
var nmReg = new RegExp("\\" + path.sep + "node_modules\\" + path.sep)
where = where.split(nmReg)
where.pop()
where = where.join(path.sep + "node_modules" + path.sep)
remove.push.apply(remove, others)
return npm.commands.install(where, what, cb)
}
// hrm?
return cb(new Error("danger zone\n" + name + " " +
regMatch + " " + locMatch))
}, function (er) {
if (er) return cb(er)
asyncMap(remove, rm, function (er) {
if (er) return cb(er)
remove.forEach(function (r) {
log.info("rm", r)
})
dedupe_(dir, filter, unavoidable, false, silent, cb)
})
})
}
function findVersions (npm, summary, cb) {
// now, for each item in the summary, try to find the maximum version
// that will satisfy all the ranges. next step is to install it at
// the specified location.
asyncMap(summary, function (item, cb) {
var name = item[0]
var data = item[1]
var loc = data.loc
var locs = data.locs.filter(function (l) {
return l !== loc
})
// not actually a dupe, or perhaps all the other copies were
// children of a dupe, so this'll maybe be picked up later.
if (locs.length === 0) {
return cb(null, [])
}
// { <folder>: <version> }
var has = data.has
// the versions that we already have.
// if one of these is ok, then prefer to use that.
// otherwise, try fetching from the registry.
var versions = data.versions
var ranges = data.ranges
mapToRegistry(name, npm.config, function (er, uri, auth) {
if (er) return cb(er)
npm.registry.get(uri, { auth : auth }, next)
})
function next (er, data) {
var regVersions = er ? [] : Object.keys(data.versions)
var locMatch = bestMatch(versions, ranges)
var tag = npm.config.get("tag")
var distTag = data["dist-tags"] && data["dist-tags"][tag]
var regMatch
if (distTag && data.versions[distTag] && matches(distTag, ranges)) {
regMatch = distTag
} else {
regMatch = bestMatch(regVersions, ranges)
}
cb(null, [[name, has, loc, locMatch, regMatch, locs]])
}
}, cb)
}
function matches (version, ranges) {
return !ranges.some(function (r) {
return !semver.satisfies(version, r, true)
})
}
function bestMatch (versions, ranges) {
return versions.filter(function (v) {
return matches(v, ranges)
}).sort(semver.compareLoose).pop()
}
function readInstalled (dir, counter, parent, cb) {
var pkg, children, realpath
fs.realpath(dir, function (er, rp) {
realpath = rp
next()
})
readJson(path.resolve(dir, "package.json"), function (er, data) {
if (er && er.code !== "ENOENT" && er.code !== "ENOTDIR") return cb(er)
if (er) return cb() // not a package, probably.
counter[data.name] = counter[data.name] || 0
counter[data.name]++
pkg =
{ _id: data._id
, name: data.name
, version: data.version
, dependencies: data.dependencies || {}
, optionalDependencies: data.optionalDependencies || {}
, devDependencies: data.devDependencies || {}
, bundledDependencies: data.bundledDependencies || []
, path: dir
, realPath: dir
, children: {}
, parent: parent
, family: Object.create(parent ? parent.family : null)
, unavoidable: false
, duplicate: false
}
if (parent) {
parent.children[data.name] = pkg
parent.family[data.name] = pkg
}
next()
})
fs.readdir(path.resolve(dir, "node_modules"), function (er, c) {
children = c || [] // error is ok, just means no children.
children = children.filter(function (p) {
return !p.match(/^[\._-]/)
})
next()
})
function next () {
if (!children || !pkg || !realpath) return
// ignore devDependencies. Just leave them where they are.
children = children.filter(function (c) {
return !pkg.devDependencies.hasOwnProperty(c)
})
pkg.realPath = realpath
if (pkg.realPath !== pkg.path) children = []
var d = path.resolve(dir, "node_modules")
asyncMap(children, function (child, cb) {
readInstalled(path.resolve(d, child), counter, pkg, cb)
}, function (er) {
cb(er, pkg, counter)
})
}
}
function whoDepends (pkg) {
var start = pkg.parent || pkg
return whoDepends_(pkg, [], start)
}
function whoDepends_ (pkg, who, test) {
if (test !== pkg &&
test.dependencies[pkg.name] &&
test.family[pkg.name] === pkg) {
who.push(test)
}
Object.keys(test.children).forEach(function (n) {
whoDepends_(pkg, who, test.children[n])
})
return who
}
|