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
|
/*
Copyright (C) 2004 Paul Davis
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <cerrno>
#include <unistd.h>
#include <fstream>
#include <algorithm>
#include <pbd/error.h>
#include <ardour/configuration.h>
#include <ardour/recent_sessions.h>
#include <ardour/utils.h>
#include "i18n.h"
using namespace std;
using namespace ARDOUR;
int
ARDOUR::read_recent_sessions (RecentSessions& rs)
{
string path = Config->get_user_ardour_path();
path += "/recent";
ifstream recent (path.c_str());
if (!recent) {
if (errno != ENOENT) {
error << compose (_("cannot open recent session file %1 (%2)"), path, strerror (errno)) << endmsg;
return -1;
} else {
return 1;
}
}
while (true) {
pair<string,string> newpair;
getline(recent, newpair.first);
if (!recent.good()) {
break;
}
getline(recent, newpair.second);
if (!recent.good()) {
break;
}
if (!access(newpair.second.c_str(), R_OK)) {
rs.push_back (newpair);
}
}
// This deletes any missing sessions
ARDOUR::write_recent_sessions (rs);
/* display sorting should be done in the GUI, otherwise the
* natural order will be broken
*/
sort(rs.begin(), rs.end(), cmp);
return 0;
}
int
ARDOUR::write_recent_sessions (RecentSessions& rs)
{
string path = Config->get_user_ardour_path();
path += "/recent";
ofstream recent (path.c_str());
if (!recent) {
return -1;
}
for (RecentSessions::iterator i = rs.begin(); i != rs.end(); ++i) {
recent << (*i).first << '\n' << (*i).second << endl;
}
return 0;
}
int
ARDOUR::store_recent_sessions (string name, string path)
{
RecentSessions rs;
if (ARDOUR::read_recent_sessions (rs) < 0) {
return -1;
}
pair<string,string> newpair;
newpair.first = name;
newpair.second = path;
rs.erase(remove(rs.begin(), rs.end(), newpair), rs.end());
rs.push_front (newpair);
if (rs.size() > 10) {
rs.erase(rs.begin()+10, rs.end());
}
return ARDOUR::write_recent_sessions (rs);
}
|
