Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
V
vlc-2-2
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Redmine
Redmine
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Metrics
Environments
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
videolan
vlc-2-2
Commits
64632922
Commit
64632922
authored
Oct 10, 2008
by
Rémi Duraffort
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Playlist: Simplification and fix CID 151
parent
ca4fadaa
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
19 additions
and
20 deletions
+19
-20
src/playlist/tree.c
src/playlist/tree.c
+19
-20
No files found.
src/playlist/tree.c
View file @
64632922
...
...
@@ -481,41 +481,40 @@ playlist_item_t *GetNextItem( playlist_t *p_playlist,
playlist_item_t
*
p_root
,
playlist_item_t
*
p_item
)
{
playlist_item_t
*
p_parent
;
int
i
;
/* If the item is NULL, return the firt child of root */
if
(
p_item
==
NULL
)
{
if
(
p_root
->
i_children
>
0
)
return
p_root
->
pp_children
[
0
];
else
return
NULL
;
}
/* Node with children, get the first one */
if
(
p_item
&&
p_item
->
i_children
>
0
)
if
(
p_item
->
i_children
>
0
)
return
p_item
->
pp_children
[
0
];
if
(
p_item
!=
NULL
)
p_parent
=
p_item
->
p_parent
;
else
p_parent
=
p_root
;
for
(
i
=
0
;
i
<
p_parent
->
i_children
;
i
++
)
playlist_item_t
*
p_parent
=
p_item
->
p_parent
;
for
(
int
i
=
0
;
i
<
p_parent
->
i_children
;
i
++
)
{
if
(
p_
item
==
NULL
||
p_
parent
->
pp_children
[
i
]
==
p_item
)
if
(
p_parent
->
pp_children
[
i
]
==
p_item
)
{
if
(
p_item
==
NULL
)
i
=
-
1
;
if
(
i
+
1
>=
p_parent
->
i_children
)
// Return the next children
if
(
i
+
1
<
p_parent
->
i_children
)
return
p_parent
->
pp_children
[
i
+
1
];
// We are the least one, so try to have uncles
else
{
/* Was already the last sibling. Look for uncles */
PL_DEBUG2
(
"Current item is the last of the node,"
"looking for uncle from %s"
,
p_parent
->
p_input
->
psz_name
);
if
(
p_parent
==
p_root
)
{
PL_DEBUG2
(
"already at root"
);
return
NULL
;
}
return
GetNextUncle
(
p_playlist
,
p_item
,
p_root
);
}
else
{
return
p_parent
->
pp_children
[
i
+
1
];
else
return
GetNextUncle
(
p_playlist
,
p_item
,
p_root
);
}
}
}
...
...
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