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
|
/*
* Copyright (C) 2003-2014 The Music Player Daemon Project
* http://www.musicpd.org
*
* 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.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include "InputStream.hxx"
#include "thread/Cond.hxx"
#include "util/UriUtil.hxx"
#include <assert.h>
InputStream::~InputStream()
{
}
bool
InputStream::Check(gcc_unused Error &error)
{
return true;
}
void
InputStream::Update()
{
}
void
InputStream::SetReady()
{
assert(!ready);
ready = true;
cond.broadcast();
}
void
InputStream::WaitReady()
{
while (true) {
Update();
if (ready)
break;
cond.wait(mutex);
}
}
void
InputStream::LockWaitReady()
{
const ScopeLock protect(mutex);
WaitReady();
}
/**
* Is seeking on resources behind this URI "expensive"? For example,
* seeking in a HTTP file requires opening a new connection with a new
* HTTP request.
*/
gcc_pure
static bool
ExpensiveSeeking(const char *uri)
{
return uri_has_scheme(uri);
}
bool
InputStream::CheapSeeking() const
{
return IsSeekable() && !ExpensiveSeeking(uri.c_str());
}
bool
InputStream::Seek(gcc_unused offset_type new_offset,
gcc_unused Error &error)
{
return false;
}
bool
InputStream::LockSeek(offset_type _offset, Error &error)
{
const ScopeLock protect(mutex);
return Seek(_offset, error);
}
Tag *
InputStream::ReadTag()
{
return nullptr;
}
Tag *
InputStream::LockReadTag()
{
const ScopeLock protect(mutex);
return ReadTag();
}
bool
InputStream::IsAvailable()
{
return true;
}
size_t
InputStream::LockRead(void *ptr, size_t _size, Error &error)
{
assert(ptr != nullptr);
assert(_size > 0);
const ScopeLock protect(mutex);
return Read(ptr, _size, error);
}
bool
InputStream::LockIsEOF()
{
const ScopeLock protect(mutex);
return IsEOF();
}
|
