Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
M
mpd
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Иван Мажукин
mpd
Commits
557bee61
Commit
557bee61
authored
Jan 29, 2015
by
Max Kellermann
Browse files
Options
Browse Files
Download
Plain Diff
Merge branch 'v0.19.x'
parents
8bfb8884
3adca3c2
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
17 additions
and
15 deletions
+17
-15
NEWS
NEWS
+3
-0
Walk.cxx
src/db/update/Walk.cxx
+1
-1
DsdLib.cxx
src/decoder/plugins/DsdLib.cxx
+7
-8
Clock.cxx
src/system/Clock.cxx
+6
-6
No files found.
NEWS
View file @
557bee61
...
...
@@ -29,6 +29,9 @@ ver 0.20 (not yet released)
- proxy: add TCP keepalive option
ver 0.19.9 (not yet released)
* decoder
- dsdiff, dsf: raise ID3 tag limit to 1 MB
* fix clock integer overflow on OS X
* fix build failure with uClibc
* fix build failure on non-POSIX operating systems
...
...
src/db/update/Walk.cxx
View file @
557bee61
...
...
@@ -334,7 +334,7 @@ UpdateWalk::UpdateDirectory(Directory &directory, const FileInfo &info)
directory_set_stat
(
directory
,
info
);
Error
error
;
const
std
::
auto
_ptr
<
StorageDirectoryReader
>
reader
(
storage
.
OpenDirectory
(
directory
.
GetPath
(),
error
));
const
std
::
unique
_ptr
<
StorageDirectoryReader
>
reader
(
storage
.
OpenDirectory
(
directory
.
GetPath
(),
error
));
if
(
reader
.
get
()
==
nullptr
)
{
LogError
(
error
);
return
false
;
...
...
src/decoder/plugins/DsdLib.cxx
View file @
557bee61
...
...
@@ -125,27 +125,26 @@ dsdlib_tag_id3(InputStream &is,
const
id3_length_t
count
=
size
-
offset
;
if
(
count
<
10
||
count
>
256
*
1024
)
if
(
count
<
10
||
count
>
1024
*
1024
)
return
;
id3_byte_t
*
const
id3_buf
=
static_cast
<
id3_byte_t
*>
(
xalloc
(
count
));
id3_byte_t
*
const
id3_buf
=
new
id3_byte_t
[
count
];
if
(
id3_buf
==
nullptr
)
return
;
if
(
!
decoder_read_full
(
nullptr
,
is
,
id3_buf
,
count
))
{
free
(
id3_buf
)
;
delete
[]
id3_buf
;
return
;
}
struct
id3_tag
*
id3_tag
=
id3_tag_parse
(
id3_buf
,
count
);
if
(
id3_tag
==
nullptr
)
{
free
(
id3_buf
);
delete
[]
id3_buf
;
if
(
id3_tag
==
nullptr
)
return
;
}
scan_id3_tag
(
id3_tag
,
handler
,
handler_ctx
);
id3_tag_delete
(
id3_tag
);
free
(
id3_buf
);
return
;
}
#endif
src/system/Clock.cxx
View file @
557bee61
...
...
@@ -40,8 +40,8 @@ MonotonicClockS(void)
if
(
base
.
denom
==
0
)
(
void
)
mach_timebase_info
(
&
base
);
return
(
unsigned
)((
mach_absolute_time
()
*
base
.
numer
/
1000
)
/
(
1000000
*
base
.
denom
)
);
return
(
unsigned
)((
(
double
)
mach_absolute_time
()
*
base
.
numer
/
1000
)
/
base
.
denom
/
1000000
);
#elif defined(CLOCK_MONOTONIC)
struct
timespec
ts
;
clock_gettime
(
CLOCK_MONOTONIC
,
&
ts
);
...
...
@@ -62,8 +62,8 @@ MonotonicClockMS(void)
if
(
base
.
denom
==
0
)
(
void
)
mach_timebase_info
(
&
base
);
return
(
unsigned
)((
mach_absolute_time
()
*
base
.
numer
)
/
(
1000000
*
base
.
denom
)
);
return
(
unsigned
)((
(
double
)
mach_absolute_time
()
*
base
.
numer
)
/
base
.
denom
/
1000000
);
#elif defined(CLOCK_MONOTONIC)
struct
timespec
ts
;
clock_gettime
(
CLOCK_MONOTONIC
,
&
ts
);
...
...
@@ -104,8 +104,8 @@ MonotonicClockUS(void)
if
(
base
.
denom
==
0
)
(
void
)
mach_timebase_info
(
&
base
);
return
(
(
uint64_t
)
mach_absolute_time
()
*
(
uint64_t
)
base
.
numer
)
/
(
1000
*
(
uint64_t
)
base
.
denom
);
return
(
uint64_t
)(((
double
)
mach_absolute_time
()
*
base
.
numer
)
/
base
.
denom
/
1000
);
#elif defined(CLOCK_MONOTONIC)
struct
timespec
ts
;
clock_gettime
(
CLOCK_MONOTONIC
,
&
ts
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment