convcmd.py
580 lines
| 20.6 KiB
| text/x-python
|
PythonLexer
|
r5621 | # convcmd - convert extension commands definition | ||
# | ||||
# Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | ||||
# | ||||
|
r8225 | # This software may be used and distributed according to the terms of the | ||
|
r10263 | # GNU General Public License version 2 or any later version. | ||
|
r5621 | |||
|
r6332 | from common import NoRepo, MissingTool, SKIPREV, mapfile | ||
|
r5621 | from cvs import convert_cvs | ||
from darcs import darcs_source | ||||
from git import convert_git | ||||
from hg import mercurial_source, mercurial_sink | ||||
|
r7873 | from subversion import svn_source, svn_sink | ||
|
r6306 | from monotone import monotone_source | ||
|
r6035 | from gnuarch import gnuarch_source | ||
|
r7053 | from bzr import bzr_source | ||
|
r7823 | from p4 import p4_source | ||
|
r19119 | import filemap | ||
|
r5621 | |||
|
r19181 | import os, shutil, shlex | ||
|
r26587 | from mercurial import hg, util, encoding, error | ||
|
r5621 | from mercurial.i18n import _ | ||
|
r6131 | orig_encoding = 'ascii' | ||
def recode(s): | ||||
if isinstance(s, unicode): | ||||
return s.encode(orig_encoding, 'replace') | ||||
else: | ||||
return s.decode('utf-8').encode(orig_encoding, 'replace') | ||||
|
r25805 | def mapbranch(branch, branchmap): | ||
''' | ||||
>>> bmap = {'default': 'branch1'} | ||||
>>> for i in ['', None]: | ||||
... mapbranch(i, bmap) | ||||
'branch1' | ||||
'branch1' | ||||
>>> bmap = {'None': 'branch2'} | ||||
>>> for i in ['', None]: | ||||
... mapbranch(i, bmap) | ||||
'branch2' | ||||
'branch2' | ||||
>>> bmap = {'None': 'branch3', 'default': 'branch4'} | ||||
>>> for i in ['None', '', None, 'default', 'branch5']: | ||||
... mapbranch(i, bmap) | ||||
'branch3' | ||||
'branch4' | ||||
'branch4' | ||||
'branch4' | ||||
'branch5' | ||||
''' | ||||
# If branch is None or empty, this commit is coming from the source | ||||
# repository's default branch and destined for the default branch in the | ||||
# destination repository. For such commits, using a literal "default" | ||||
# in branchmap below allows the user to map "default" to an alternate | ||||
# default branch in the destination repository. | ||||
branch = branchmap.get(branch or 'default', branch) | ||||
# At some point we used "None" literal to denote the default branch, | ||||
# attempt to use that for backward compatibility. | ||||
if (not branch): | ||||
branch = branchmap.get(str(None), branch) | ||||
return branch | ||||
|
r5621 | source_converters = [ | ||
|
r8692 | ('cvs', convert_cvs, 'branchsort'), | ||
('git', convert_git, 'branchsort'), | ||||
('svn', svn_source, 'branchsort'), | ||||
('hg', mercurial_source, 'sourcesort'), | ||||
('darcs', darcs_source, 'branchsort'), | ||||
('mtn', monotone_source, 'branchsort'), | ||||
('gnuarch', gnuarch_source, 'branchsort'), | ||||
('bzr', bzr_source, 'branchsort'), | ||||
('p4', p4_source, 'branchsort'), | ||||
|
r5621 | ] | ||
sink_converters = [ | ||||
('hg', mercurial_sink), | ||||
|
r5631 | ('svn', svn_sink), | ||
|
r5621 | ] | ||
|
r25748 | def convertsource(ui, path, type, revs): | ||
|
r5621 | exceptions = [] | ||
|
r9962 | if type and type not in [s[0] for s in source_converters]: | ||
|
r26587 | raise error.Abort(_('%s: invalid source repository type') % type) | ||
|
r8692 | for name, source, sortmode in source_converters: | ||
|
r5621 | try: | ||
if not type or name == type: | ||||
|
r25748 | return source(ui, path, revs), sortmode | ||
|
r25660 | except (NoRepo, MissingTool) as inst: | ||
|
r5621 | exceptions.append(inst) | ||
if not ui.quiet: | ||||
for inst in exceptions: | ||||
|
r6913 | ui.write("%s\n" % inst) | ||
|
r26587 | raise error.Abort(_('%s: missing or unsupported repository') % path) | ||
|
r5621 | |||
def convertsink(ui, path, type): | ||||
|
r9962 | if type and type not in [s[0] for s in sink_converters]: | ||
|
r26587 | raise error.Abort(_('%s: invalid destination repository type') % type) | ||
|
r5621 | for name, sink in sink_converters: | ||
try: | ||||
if not type or name == type: | ||||
return sink(ui, path) | ||||
|
r25660 | except NoRepo as inst: | ||
|
r5621 | ui.note(_("convert: %s\n") % inst) | ||
|
r25660 | except MissingTool as inst: | ||
|
r26587 | raise error.Abort('%s\n' % inst) | ||
raise error.Abort(_('%s: unknown repository type') % path) | ||||
|
r5621 | |||
|
r11136 | class progresssource(object): | ||
def __init__(self, ui, source, filecount): | ||||
self.ui = ui | ||||
self.source = source | ||||
self.filecount = filecount | ||||
self.retrieved = 0 | ||||
def getfile(self, file, rev): | ||||
self.retrieved += 1 | ||||
|
r11731 | self.ui.progress(_('getting files'), self.retrieved, | ||
|
r11136 | item=file, total=self.filecount) | ||
return self.source.getfile(file, rev) | ||||
|
r26035 | def targetfilebelongstosource(self, targetfilename): | ||
return self.source.targetfilebelongstosource(targetfilename) | ||||
|
r11136 | def lookuprev(self, rev): | ||
return self.source.lookuprev(rev) | ||||
def close(self): | ||||
|
r11731 | self.ui.progress(_('getting files'), None) | ||
|
r11136 | |||
|
r5621 | class converter(object): | ||
def __init__(self, ui, source, dest, revmapfile, opts): | ||||
self.source = source | ||||
self.dest = dest | ||||
self.ui = ui | ||||
self.opts = opts | ||||
self.commitcache = {} | ||||
self.authors = {} | ||||
self.authorfile = None | ||||
|
r8444 | # Record converted revisions persistently: maps source revision | ||
|
r8843 | # ID to target revision ID (both strings). (This is how | ||
|
r8444 | # incremental conversions work.) | ||
|
r5631 | self.map = mapfile(ui, revmapfile) | ||
|
r5621 | |||
# Read first the dst author map if any | ||||
authorfile = self.dest.authorfile() | ||||
if authorfile and os.path.exists(authorfile): | ||||
self.readauthormap(authorfile) | ||||
# Extend/Override with new author map if necessary | ||||
|
r12198 | if opts.get('authormap'): | ||
self.readauthormap(opts.get('authormap')) | ||||
|
r5621 | self.authorfile = self.dest.authorfile() | ||
|
r19119 | self.splicemap = self.parsesplicemap(opts.get('splicemap')) | ||
|
r8377 | self.branchmap = mapfile(ui, opts.get('branchmap')) | ||
|
r5996 | |||
|
r19120 | def parsesplicemap(self, path): | ||
""" check and validate the splicemap format and | ||||
return a child/parents dictionary. | ||||
Format checking has two parts. | ||||
1. generic format which is same across all source types | ||||
2. specific format checking which may be different for | ||||
different source type. This logic is implemented in | ||||
checkrevformat function in source files like | ||||
hg.py, subversion.py etc. | ||||
""" | ||||
|
r19119 | |||
if not path: | ||||
return {} | ||||
m = {} | ||||
try: | ||||
fp = open(path, 'r') | ||||
for i, line in enumerate(fp): | ||||
line = line.splitlines()[0].rstrip() | ||||
if not line: | ||||
# Ignore blank lines | ||||
continue | ||||
|
r19181 | # split line | ||
lex = shlex.shlex(line, posix=True) | ||||
lex.whitespace_split = True | ||||
lex.whitespace += ',' | ||||
line = list(lex) | ||||
# check number of parents | ||||
if not (2 <= len(line) <= 3): | ||||
|
r26587 | raise error.Abort(_('syntax error in %s(%d): child parent1' | ||
|
r19181 | '[,parent2] expected') % (path, i + 1)) | ||
for part in line: | ||||
self.source.checkrevformat(part) | ||||
child, p1, p2 = line[0], line[1:2], line[2:] | ||||
if p1 == p2: | ||||
m[child] = p1 | ||||
else: | ||||
m[child] = p1 + p2 | ||||
|
r19120 | # if file does not exist or error reading, exit | ||
except IOError: | ||||
|
r26587 | raise error.Abort(_('splicemap file not found or error reading %s:') | ||
|
r19120 | % path) | ||
|
r19119 | return m | ||
|
r5621 | def walktree(self, heads): | ||
'''Return a mapping that identifies the uncommitted parents of every | ||||
uncommitted changeset.''' | ||||
visit = heads | ||||
|
r8456 | known = set() | ||
|
r5621 | parents = {} | ||
|
r22411 | numcommits = self.source.numcommits() | ||
|
r5621 | while visit: | ||
n = visit.pop(0) | ||||
|
r21636 | if n in known: | ||
|
r10282 | continue | ||
|
r21636 | if n in self.map: | ||
m = self.map[n] | ||||
if m == SKIPREV or self.dest.hascommitfrommap(m): | ||||
continue | ||||
|
r8456 | known.add(n) | ||
|
r22411 | self.ui.progress(_('scanning'), len(known), unit=_('revisions'), | ||
total=numcommits) | ||||
|
r5621 | commit = self.cachecommit(n) | ||
parents[n] = [] | ||||
for p in commit.parents: | ||||
parents[n].append(p) | ||||
visit.append(p) | ||||
|
r11135 | self.ui.progress(_('scanning'), None) | ||
|
r5621 | |||
return parents | ||||
|
r16106 | def mergesplicemap(self, parents, splicemap): | ||
"""A splicemap redefines child/parent relationships. Check the | ||||
map contains valid revision identifiers and merge the new | ||||
links in the source graph. | ||||
""" | ||||
|
r18372 | for c in sorted(splicemap): | ||
|
r16106 | if c not in parents: | ||
|
r21634 | if not self.dest.hascommitforsplicemap(self.map.get(c, c)): | ||
|
r16106 | # Could be in source but not converted during this run | ||
self.ui.warn(_('splice map revision %s is not being ' | ||||
'converted, ignoring\n') % c) | ||||
continue | ||||
pc = [] | ||||
for p in splicemap[c]: | ||||
# We do not have to wait for nodes already in dest. | ||||
|
r21634 | if self.dest.hascommitforsplicemap(self.map.get(p, p)): | ||
|
r16106 | continue | ||
# Parent is not in dest and not being converted, not good | ||||
if p not in parents: | ||||
|
r26587 | raise error.Abort(_('unknown splice map parent: %s') % p) | ||
|
r16106 | pc.append(p) | ||
parents[c] = pc | ||||
|
r8689 | def toposort(self, parents, sortmode): | ||
|
r5621 | '''Return an ordering such that every uncommitted changeset is | ||
|
r17424 | preceded by all its uncommitted ancestors.''' | ||
|
r8688 | |||
def mapchildren(parents): | ||||
"""Return a (children, roots) tuple where 'children' maps parent | ||||
revision identifiers to children ones, and 'roots' is the list of | ||||
revisions without parents. 'parents' must be a mapping of revision | ||||
identifier to its parents ones. | ||||
""" | ||||
|
r18376 | visit = sorted(parents) | ||
|
r8688 | seen = set() | ||
children = {} | ||||
roots = [] | ||||
|
r5621 | |||
|
r8688 | while visit: | ||
n = visit.pop(0) | ||||
if n in seen: | ||||
continue | ||||
seen.add(n) | ||||
# Ensure that nodes without parents are present in the | ||||
# 'children' mapping. | ||||
children.setdefault(n, []) | ||||
hasparent = False | ||||
for p in parents[n]: | ||||
|
r16686 | if p not in self.map: | ||
|
r8688 | visit.append(p) | ||
hasparent = True | ||||
children.setdefault(p, []).append(n) | ||||
if not hasparent: | ||||
roots.append(n) | ||||
return children, roots | ||||
|
r6100 | |||
|
r8688 | # Sort functions are supposed to take a list of revisions which | ||
# can be converted immediately and pick one | ||||
|
r6100 | |||
|
r8688 | def makebranchsorter(): | ||
"""If the previously converted revision has a child in the | ||||
eligible revisions list, pick it. Return the list head | ||||
otherwise. Branch sort attempts to minimize branch | ||||
switching, which is harmful for Mercurial backend | ||||
compression. | ||||
""" | ||||
prev = [None] | ||||
def picknext(nodes): | ||||
next = nodes[0] | ||||
for n in nodes: | ||||
if prev[0] in parents[n]: | ||||
next = n | ||||
break | ||||
prev[0] = next | ||||
return next | ||||
return picknext | ||||
|
r8690 | def makesourcesorter(): | ||
"""Source specific sort.""" | ||||
keyfn = lambda n: self.commitcache[n].sortkey | ||||
def picknext(nodes): | ||||
return sorted(nodes, key=keyfn)[0] | ||||
return picknext | ||||
|
r18819 | def makeclosesorter(): | ||
"""Close order sort.""" | ||||
keyfn = lambda n: ('close' not in self.commitcache[n].extra, | ||||
self.commitcache[n].sortkey) | ||||
def picknext(nodes): | ||||
return sorted(nodes, key=keyfn)[0] | ||||
return picknext | ||||
|
r8688 | def makedatesorter(): | ||
"""Sort revisions by date.""" | ||||
|
r6100 | dates = {} | ||
def getdate(n): | ||||
if n not in dates: | ||||
dates[n] = util.parsedate(self.commitcache[n].date) | ||||
return dates[n] | ||||
def picknext(nodes): | ||||
return min([(getdate(n), n) for n in nodes])[1] | ||||
|
r8688 | |||
return picknext | ||||
|
r8689 | if sortmode == 'branchsort': | ||
picknext = makebranchsorter() | ||||
elif sortmode == 'datesort': | ||||
|
r8688 | picknext = makedatesorter() | ||
|
r8690 | elif sortmode == 'sourcesort': | ||
picknext = makesourcesorter() | ||||
|
r18819 | elif sortmode == 'closesort': | ||
picknext = makeclosesorter() | ||||
|
r6100 | else: | ||
|
r26587 | raise error.Abort(_('unknown sort mode: %s') % sortmode) | ||
|
r8688 | |||
children, actives = mapchildren(parents) | ||||
|
r5621 | |||
s = [] | ||||
|
r6100 | pendings = {} | ||
while actives: | ||||
n = picknext(actives) | ||||
actives.remove(n) | ||||
s.append(n) | ||||
|
r5621 | |||
|
r6100 | # Update dependents list | ||
for c in children.get(n, []): | ||||
if c not in pendings: | ||||
pendings[c] = [p for p in parents[c] if p not in self.map] | ||||
|
r6131 | try: | ||
pendings[c].remove(n) | ||||
except ValueError: | ||||
|
r26587 | raise error.Abort(_('cycle detected between %s and %s') | ||
|
r6131 | % (recode(c), recode(n))) | ||
|
r6100 | if not pendings[c]: | ||
# Parents are converted, node is eligible | ||||
actives.insert(0, c) | ||||
pendings[c] = None | ||||
|
r5621 | |||
|
r6100 | if len(s) != len(parents): | ||
|
r26587 | raise error.Abort(_("not all revisions were sorted")) | ||
|
r5621 | |||
return s | ||||
def writeauthormap(self): | ||||
authorfile = self.authorfile | ||||
if authorfile: | ||||
|
r16925 | self.ui.status(_('writing author map file %s\n') % authorfile) | ||
|
r7877 | ofile = open(authorfile, 'w+') | ||
for author in self.authors: | ||||
ofile.write("%s=%s\n" % (author, self.authors[author])) | ||||
ofile.close() | ||||
|
r5621 | |||
def readauthormap(self, authorfile): | ||||
afile = open(authorfile, 'r') | ||||
for line in afile: | ||||
|
r7962 | |||
|
r7968 | line = line.strip() | ||
if not line or line.startswith('#'): | ||||
|
r6184 | continue | ||
|
r7962 | |||
|
r5621 | try: | ||
|
r6186 | srcauthor, dstauthor = line.split('=', 1) | ||
|
r7962 | except ValueError: | ||
|
r16925 | msg = _('ignoring bad line in author map file %s: %s\n') | ||
|
r7962 | self.ui.warn(msg % (authorfile, line.rstrip())) | ||
continue | ||||
srcauthor = srcauthor.strip() | ||||
dstauthor = dstauthor.strip() | ||||
if self.authors.get(srcauthor) in (None, dstauthor): | ||||
msg = _('mapping author %s to %s\n') | ||||
self.ui.debug(msg % (srcauthor, dstauthor)) | ||||
self.authors[srcauthor] = dstauthor | ||||
continue | ||||
m = _('overriding mapping for author %s, was %s, will be %s\n') | ||||
self.ui.status(m % (srcauthor, self.authors[srcauthor], dstauthor)) | ||||
|
r5621 | afile.close() | ||
def cachecommit(self, rev): | ||||
commit = self.source.getcommit(rev) | ||||
commit.author = self.authors.get(commit.author, commit.author) | ||||
|
r25805 | commit.branch = mapbranch(commit.branch, self.branchmap) | ||
|
r5621 | self.commitcache[rev] = commit | ||
return commit | ||||
def copy(self, rev): | ||||
commit = self.commitcache[rev] | ||||
|
r22300 | full = self.opts.get('full') | ||
changes = self.source.getchanges(rev, full) | ||||
|
r5621 | if isinstance(changes, basestring): | ||
if changes == SKIPREV: | ||||
dest = SKIPREV | ||||
else: | ||||
dest = self.map[changes] | ||||
|
r5631 | self.map[rev] = dest | ||
|
r5621 | return | ||
|
r24395 | files, copies, cleanp2 = changes | ||
|
r5934 | pbranches = [] | ||
|
r5621 | if commit.parents: | ||
|
r5934 | for prev in commit.parents: | ||
if prev not in self.commitcache: | ||||
self.cachecommit(prev) | ||||
|
r6210 | pbranches.append((self.map[prev], | ||
|
r5934 | self.commitcache[prev].branch)) | ||
self.dest.setbranch(commit.branch, pbranches) | ||||
|
r5996 | try: | ||
|
r16105 | parents = self.splicemap[rev] | ||
|
r6956 | self.ui.status(_('spliced in %s as parents of %s\n') % | ||
|
r26812 | (_(' and ').join(parents), rev)) | ||
|
r6143 | parents = [self.map.get(p, p) for p in parents] | ||
|
r5996 | except KeyError: | ||
parents = [b[0] for b in pbranches] | ||||
|
r24395 | if len(pbranches) != 2: | ||
cleanp2 = set() | ||||
|
r24328 | if len(parents) < 3: | ||
source = progresssource(self.ui, self.source, len(files)) | ||||
else: | ||||
# For an octopus merge, we end up traversing the list of | ||||
# changed files N-1 times. This tweak to the number of | ||||
# files makes it so the progress bar doesn't overflow | ||||
# itself. | ||||
source = progresssource(self.ui, self.source, | ||||
len(files) * (len(parents) - 1)) | ||||
|
r8843 | newnode = self.dest.putcommit(files, copies, parents, commit, | ||
|
r24395 | source, self.map, full, cleanp2) | ||
|
r11136 | source.close() | ||
|
r5631 | self.source.converted(rev, newnode) | ||
self.map[rev] = newnode | ||||
|
r5621 | |||
|
r8689 | def convert(self, sortmode): | ||
|
r5621 | try: | ||
self.source.before() | ||||
self.dest.before() | ||||
|
r5631 | self.source.setrevmap(self.map) | ||
|
r6956 | self.ui.status(_("scanning source...\n")) | ||
|
r5621 | heads = self.source.getheads() | ||
parents = self.walktree(heads) | ||||
|
r16106 | self.mergesplicemap(parents, self.splicemap) | ||
|
r6956 | self.ui.status(_("sorting...\n")) | ||
|
r8689 | t = self.toposort(parents, sortmode) | ||
|
r5621 | num = len(t) | ||
c = None | ||||
|
r6956 | self.ui.status(_("converting...\n")) | ||
|
r12769 | for i, c in enumerate(t): | ||
|
r5621 | num -= 1 | ||
desc = self.commitcache[c].desc | ||||
if "\n" in desc: | ||||
desc = desc.splitlines()[0] | ||||
|
r5794 | # convert log message to local encoding without using | ||
|
r12768 | # tolocal() because the encoding.encoding convert() | ||
# uses is 'utf-8' | ||||
|
r5954 | self.ui.status("%d %s\n" % (num, recode(desc))) | ||
|
r6913 | self.ui.note(_("source: %s\n") % recode(c)) | ||
|
r11135 | self.ui.progress(_('converting'), i, unit=_('revisions'), | ||
total=len(t)) | ||||
|
r5621 | self.copy(c) | ||
|
r11135 | self.ui.progress(_('converting'), None) | ||
|
r5621 | |||
|
r25741 | if not self.ui.configbool('convert', 'skiptags'): | ||
tags = self.source.gettags() | ||||
ctags = {} | ||||
for k in tags: | ||||
v = tags[k] | ||||
if self.map.get(v, SKIPREV) != SKIPREV: | ||||
ctags[k] = self.map[v] | ||||
|
r5621 | |||
|
r25741 | if c and ctags: | ||
nrev, tagsparent = self.dest.puttags(ctags) | ||||
if nrev and tagsparent: | ||||
# write another hash correspondence to override the | ||||
# previous one so we don't end up with extra tag heads | ||||
tagsparents = [e for e in self.map.iteritems() | ||||
if e[1] == tagsparent] | ||||
if tagsparents: | ||||
self.map[tagsparents[0][0]] = nrev | ||||
|
r5621 | |||
|
r13745 | bookmarks = self.source.getbookmarks() | ||
cbookmarks = {} | ||||
for k in bookmarks: | ||||
v = bookmarks[k] | ||||
if self.map.get(v, SKIPREV) != SKIPREV: | ||||
cbookmarks[k] = self.map[v] | ||||
if c and cbookmarks: | ||||
self.dest.putbookmarks(cbookmarks) | ||||
|
r5621 | self.writeauthormap() | ||
finally: | ||||
self.cleanup() | ||||
def cleanup(self): | ||||
try: | ||||
self.dest.after() | ||||
finally: | ||||
self.source.after() | ||||
|
r5631 | self.map.close() | ||
|
r5621 | |||
def convert(ui, src, dest=None, revmapfile=None, **opts): | ||||
|
r5794 | global orig_encoding | ||
|
r7948 | orig_encoding = encoding.encoding | ||
encoding.encoding = 'UTF-8' | ||||
|
r5621 | |||
|
r12198 | # support --authors as an alias for --authormap | ||
if not opts.get('authormap'): | ||||
opts['authormap'] = opts.get('authors') | ||||
|
r5621 | if not dest: | ||
dest = hg.defaultdest(src) + "-hg" | ||||
|
r6956 | ui.status(_("assuming destination %s\n") % dest) | ||
|
r5621 | |||
destc = convertsink(ui, dest, opts.get('dest_type')) | ||||
try: | ||||
|
r8692 | srcc, defaultsort = convertsource(ui, src, opts.get('source_type'), | ||
opts.get('rev')) | ||||
|
r5621 | except Exception: | ||
for path in destc.created: | ||||
shutil.rmtree(path, True) | ||||
raise | ||||
|
r18819 | sortmodes = ('branchsort', 'datesort', 'sourcesort', 'closesort') | ||
|
r8690 | sortmode = [m for m in sortmodes if opts.get(m)] | ||
if len(sortmode) > 1: | ||||
|
r26587 | raise error.Abort(_('more than one sort mode specified')) | ||
|
r24306 | if sortmode: | ||
sortmode = sortmode[0] | ||||
else: | ||||
sortmode = defaultsort | ||||
|
r8691 | if sortmode == 'sourcesort' and not srcc.hasnativeorder(): | ||
|
r26587 | raise error.Abort(_('--sourcesort is not supported by this data source') | ||
) | ||||
|
r18819 | if sortmode == 'closesort' and not srcc.hasnativeclose(): | ||
|
r26587 | raise error.Abort(_('--closesort is not supported by this data source')) | ||
|
r8689 | |||
|
r5621 | fmap = opts.get('filemap') | ||
if fmap: | ||||
srcc = filemap.filemap_source(ui, srcc, fmap) | ||||
destc.setfilemapmode(True) | ||||
if not revmapfile: | ||||
|
r19889 | revmapfile = destc.revmapfile() | ||
|
r5621 | |||
c = converter(ui, srcc, destc, revmapfile, opts) | ||||
|
r8689 | c.convert(sortmode) | ||