summaryrefslogtreecommitdiffstats
path: root/modules/pl_dir.module/module.cpp
blob: 3c96eb2ea79f0a6fc554e172701c71d026d89d15 (plain)
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
/*  Copyright 2008,2009,2010 Edwin Eefting (edwin@datux.nl)

    This file is part of Synapse.

    Synapse 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 3 of the License, or
    (at your option) any later version.

    Synapse 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 Synapse.  If not, see <http://www.gnu.org/licenses/>. */


/** \file
The play list module.

This module can dynamicly generate playlists from directory's. It also can cache per path metadata.



*/


#include "synapse.h"
#include "cconfig.h"
#include <string.h>
#include <errno.h>
#include <map>
#include <boost/shared_ptr.hpp>

#include "exception/cexception.h"

#define BOOST_FILESYSTEM_VERSION 3

#include "boost/filesystem.hpp"

#include <boost/random/mersenne_twister.hpp>
#include <boost/random/uniform_int_distribution.hpp>

/** Playlist namespace
 *
 */
namespace pl
{
	using namespace std;
	using namespace boost::filesystem;
	using namespace boost;



	class Cpath : public path
	{
		private:
		time_t mWriteDate;

		public:

		Cpath(const path & p)
		:path(p)
		{
			mWriteDate=0;
		}


		//get/cache modification date
		int getDate()
		{
			if (!mWriteDate)
				mWriteDate=last_write_time(*this);

			return (mWriteDate);
		}

		//get sort filename string
		std::string getSortName()
		{
			return(filename().string());
		}



		//get/cache metadata field (from the path database)
		std::string getMeta(std::string key)
		{
			throw(synapse::runtime_error("not implemented yet!"));
			return("error");
		}

		void setMeta(std::string key, std::string value)
		{
			throw(synapse::runtime_error("not implemented yet!"));

		}
	};

	class CsortedDir: public list<Cpath>
	{
		private:
		string mSortField;

		public:
        path mBasePath;
		enum Efiletype  { FILE, DIR, ALL };
        Efiletype mFiletype;
//		list<Cpath> mPaths;
//		list<Cpath>::iterator iterator;

		static bool compareFilename (Cpath first, Cpath second)
		{
			return (first.getSortName() < second.getSortName());
		}

		static bool compareDate (Cpath first, Cpath second)
		{
			return (first.getDate() < second.getDate());
		}


		void read(path basePath, string sortField, Efiletype filetype)
		{
            //if nothing has changed, dont reread if its same dir
            if (mBasePath==basePath && sortField==mSortField && filetype==mFiletype)
                return;

			mBasePath=basePath;
			mSortField=sortField;
            mFiletype=filetype;
            clear();

			//DEB("Reading directory " << basePath.string());
			directory_iterator end_itr;
			for ( directory_iterator itr( basePath );
				itr != end_itr;
				++itr )
			{
				path p;
				p=itr->path().filename();
				if (
						(filetype==ALL) ||
						(filetype==DIR && is_directory(*itr)) ||
						(filetype==FILE && is_regular(*itr))
				)
				{
					push_back(p);
				}
			}

			if (sortField=="filename")
				sort(compareFilename);
			else if (sortField=="date")
				sort(compareDate);
		}

	};


    //compares two absolute paths, to see if subdir is really a subdir of dir. (or the same dir)
    bool isSubdir(path dir, path subdir)
    {
        if (dir==subdir)
        {
            return(true);
        }

        while (!subdir.empty())
        {
            subdir=subdir.parent_path();
            if (dir==subdir)
                return(true);
        }
        return(false);
    }


    /*
    /a/b
    /a/b/c/d
    */

    /*** traverses directories/files

    -currentPath contains the currently 'selected' path.
    -rootPath is the 'highest' path we can ever reach.
    -filetype determines if we're looking for a file or directory or both.
    -direction tells if you want the next or previous file or directory.
    -RECURSE: its allow to enter or exit directories to find the next of previous file.

    returns resulting path after this movement.
    when first or last path is reached it loops.

    */


    enum Edirection { NEXT, PREVIOUS };
    enum Erecursion { RECURSE, DONT_RECURSE };

    path movePath(path rootPath, path currentPath, string sortField, Edirection direction, Erecursion recursion, CsortedDir::Efiletype filetype)
    {
        // DEB(
        //     "currentPath=" << currentPath.string() <<
        //     " sortField=" << sortField <<
        //     " direction=" << direction <<
        //     " recursion=" << recursion << 
        //     " filetype=" << filetype);

        //determine the path we should get the initial listing of:
        path listPath;
        if (currentPath==rootPath)
            listPath=currentPath;
        else
            listPath=currentPath.parent_path();

        path startPath=currentPath;
        
        CsortedDir::iterator dirI;

        do
        {
            //get sorted directory listing
            static CsortedDir sortedDir;
            sortedDir.read(listPath, sortField, filetype);

            if (!sortedDir.empty())
            {
                
                //try to find the current path:
                if (!currentPath.empty())
                    dirI=find(sortedDir.begin(), sortedDir.end(), currentPath.filename());
                else
                    dirI=sortedDir.end();

                //currentPath not found?
                if (dirI==sortedDir.end())
                {
                    //start at the first or last entry depending on direction
                    if (direction==NEXT)
                        dirI=sortedDir.begin();
                    else
                    {
                        dirI=sortedDir.end();
                        dirI--;
                    }
                }
                else
                {
                    //make a step in the right direction
                    if (direction==NEXT)
                    {
                        dirI++;
                    }
                    //PREVIOUS:
                    else
                    {
                        if (dirI==sortedDir.begin())
                            dirI=sortedDir.end();
                        else
                            dirI--;
                    }
                }

                //top or bottom was reached
                if (dirI==sortedDir.end())
                {
                    //can we one dir higher?
                    if (recursion==RECURSE && listPath!=rootPath)
                    {
                        //yes, so go one dir higher and continue the loop
                        currentPath=listPath;
                        listPath=listPath.parent_path();
                    }
                    else
                    {
                        //no, cant go higher.
                        //clear the current path, so it just gets the first or last entry
                        currentPath.clear();
                    }
                }
                //we found something
                else
                {
                    //should we recurse?
                    if (recursion==RECURSE && is_directory(listPath/(*dirI)))
                    {
                        //enter it
                        listPath=listPath/(*dirI);
                        currentPath.clear();
                    }
                    else
                    {
                        //we found it
                        //DEB("found, returning " << listPath/(*dirI));
                        return (listPath/(*dirI));
                    }
                }
            }
            else
            {
                //list is empty, our last chance is to go one dir higher, otherwise we will exit the loop:
                if (recursion==RECURSE && listPath!=rootPath)
                {
                    //go one dir higher and continue the loop
                    currentPath=listPath;
                    listPath=listPath.parent_path();
                }
            }

        }
        while(listPath!=startPath); //prevent inifinte loops if we dont find anything

        DEB("nothing found, returning " << startPath)
        return(startPath);
    }

	class Citer
	{
		private:
		path mRootPath;
		path mCurrentPath;
		path mCurrentFile;

        list<path> mPrevFiles;
        list<path> mNextFiles;
        list<path> mPrevPaths;
        list<path> mNextPaths;

		int mId;

        unsigned int mNextLen;
        unsigned int mPrevLen;

        boost::random::mt19937 mRandomGenerator;
        string mSortField;
        unsigned int mRandomLength; //max length of random queue, the more, the better it is, but takes more time scanning 
        path mLastRandomFile; //last queued random path

	
        //make sure there are enough entries in the file and path lists
        void updateLists()
        {

            //normal mode:
            if (mRandomLength==0)
            {
                //next file list:
                //make sure its not too long
                while (mNextFiles.size()>mNextLen)
                    mNextFiles.pop_back();

                //fill the back with newer entries until its long enough
                {
                    path p=mCurrentFile;
                    if (!mNextFiles.empty())
                        p=mNextFiles.back();
                    while(mNextFiles.size()<mNextLen)
                    {
                        p=movePath(mCurrentPath, p, mSortField, NEXT, RECURSE, CsortedDir::ALL);
                        mNextFiles.push_back(p.string());
                    }
                }

                //prev file list:
                //make sure its not too long
                while (mPrevFiles.size()>mPrevLen)
                    mPrevFiles.pop_back();

                //fill the back older entries until its long enough
                {
                    path p=mCurrentFile;
                    if (!mPrevFiles.empty())
                        p=mPrevFiles.back();
                    while(mPrevFiles.size()<mPrevLen)
                    {
                        p=movePath(mCurrentPath, p, mSortField, PREVIOUS, RECURSE, CsortedDir::ALL);
                        mPrevFiles.push_back(p.string());
                    }
                }

            }
            //random mode
            else
            {
                //make sure prevlist is not too long
                while (mPrevFiles.size()>mRandomLength)
                    mPrevFiles.pop_back();

                //insert new entryes randomly in the nextlist until its long enough
                {
                    if (!isSubdir(mCurrentPath, mLastRandomFile))
                        mLastRandomFile=mCurrentFile;

                    while(mNextFiles.size()<mRandomLength)
//                    for (unsigned int i=0; i<mRandomLength; i++)
                    {
                        mLastRandomFile=movePath(mCurrentPath, mLastRandomFile, mSortField, NEXT, RECURSE, CsortedDir::ALL);

                        //insert at random position:                        
                        list<path>::iterator nextFileI;
                        nextFileI=mNextFiles.begin();
                        boost::random::uniform_int_distribution<> dist(0, mNextFiles.size());
                        int rndCount=dist(mRandomGenerator);
                        while(rndCount)
                        {
                            rndCount--;
                            nextFileI++;
                        }
                        mNextFiles.insert(nextFileI, mLastRandomFile);

                    }

                }
            }

            //next path list:
            //make sure its not too long
            while (mNextPaths.size()>mNextLen)
                mNextPaths.pop_back();

            //fill the back with newer entries until its long enough
            {
                path p=mCurrentPath;
                if (!mNextPaths.empty())
                    p=mNextPaths.back();
                while(mNextPaths.size()<mNextLen)
                {
                    p=movePath(mRootPath, p, mSortField, NEXT, DONT_RECURSE, CsortedDir::DIR);
                    mNextPaths.push_back(p.string());
                }
            }

            //prev path list:
            //make sure its not too long
            while (mPrevPaths.size()>mPrevLen)
                mPrevPaths.pop_back();

            //fill the back with newer entries until its long enough
            {
                path p=mCurrentPath;
                if (!mPrevPaths.empty())
                    p=mPrevPaths.back();
                while(mPrevPaths.size()<mPrevLen)
                {
					p=movePath(mRootPath, p, mSortField, PREVIOUS, DONT_RECURSE, CsortedDir::DIR);
                    mPrevPaths.push_back(p.string());
                }
            }
        }

		public:

        Citer()
        {
            mNextLen=5;
            mPrevLen=5;

            mRandomLength=0;
            mSortField="filename";
        }

		//reload all file data. call this after you've changed currentPath or other settings
		void reloadFiles()
		{
			//clear lists
			mNextFiles.clear();
			mPrevFiles.clear();

			//current file doesnt belong to current path?
            if (!isSubdir(mCurrentPath, mCurrentFile))
            {
                //find the first valid file
                mCurrentFile=movePath(mCurrentPath, mCurrentPath, mSortField, NEXT, RECURSE, CsortedDir::ALL);
            } 

            //fill the lists
            updateLists();

		}

		//reload path and file data, call this after you exited or entered a path so that the previous/next paths need to be reloaded 
		void reloadPaths()
		{
			mNextPaths.clear();
			mPrevPaths.clear();
			reloadFiles();
		}

        void setMode(Cvar params)
        {
            if (params.isSet("randomLength") && params["randomLength"]>=0 && params["randomLength"]<10000)
            {
                mRandomLength=params["randomLength"];
            }

            if (params.isSet("sortField"))
                mSortField=params["sortField"].str();

            reloadPaths();
        }

		//next file
		void next()
		{
            if (mNextFiles.empty())
                return;

            mPrevFiles.push_front(mCurrentFile);
            mCurrentFile=mNextFiles.front();
            mNextFiles.pop_front();
            updateLists();
		}

		//prev file
		void previous()
		{
            if (mPrevFiles.empty())
                return;

            mNextFiles.push_front(mCurrentFile);
            mCurrentFile=mPrevFiles.front();
            mPrevFiles.pop_front();
            updateLists();
		}

		void nextPath()
		{
            if (mNextPaths.empty())
                return;
            mPrevPaths.push_front(mCurrentPath);
            mCurrentPath=mNextPaths.front();
                mNextPaths.pop_front();
			reloadFiles();

            //in random mode we want the first file to be random as well:
            if (mRandomLength)
                next();

		}

		void previousPath()
		{
            if (mPrevPaths.empty())
                return;
            mNextPaths.push_front(mCurrentPath);
            mCurrentPath=mPrevPaths.front();
            mPrevPaths.pop_front();
            reloadFiles();

            //in random mode we want the first file to be random as well:
            if (mRandomLength)
                next();
		}

		void exitPath()
		{
			if (mCurrentPath!=mRootPath)
			{
				mCurrentPath=mCurrentPath.parent_path();
				reloadPaths();
			}
		}


        //go one directory deeper, using the currentFile as reference
		void enterPath()
		{
            path p;
            p=mCurrentFile;
            while (!p.empty())
            {
                if (p.parent_path()==mCurrentPath)
                {
                    if (is_directory(p))
                    {
                        mCurrentPath=p;
                        reloadPaths();
                        return;
                    }
                    //the currentfile doesnt have a directory, so just use the first subdir we can find
                    else
                    {
                        mCurrentPath=movePath(mCurrentPath, mCurrentPath, mSortField, NEXT, DONT_RECURSE, CsortedDir::DIR);
                        reloadPaths();
                        return;
                    }
                }
                p=p.parent_path();
            }
		}


		void create(int id, string rootPath)
		{
			mId=id;
			mRootPath=rootPath;

			//find first path
			mCurrentPath=movePath(mRootPath, mRootPath, mSortField, NEXT, DONT_RECURSE, CsortedDir::DIR);
			reloadPaths();


			DEB("Created iterator " << id << " for path " << rootPath);
			
		}


		void send(int dst)
		{
            //there are lots of places/situations where things can go wrong, so do this extra check:
            if (!isSubdir(mRootPath, mCurrentPath) || !isSubdir(mRootPath, mCurrentFile))
            {
                ERROR("escaped rootpath: " << mRootPath << " " << mCurrentPath << " " << mCurrentFile);
                throw(synapse::runtime_error("Program error: ended up outside rootpath. (dont use trailing slashes for rootpath)"));
            }

			Cmsg out;
			out.event="pl_Entry";
			out.dst=dst;
			out["rootPath"]=mRootPath.string();
			out["currentPath"]=mCurrentPath.string();
			out["currentFile"]=mCurrentFile.string();

            //to make life easier for user interfaces in a crossplatform way:
            out["parentPath"]=mCurrentPath.parent_path().string();


            int maxItems;

            maxItems=5;
            out["prevFiles"].list();
            BOOST_FOREACH(path prevFile, mPrevFiles)
            {
                out["prevFiles"].list().push_back(prevFile.string());
                maxItems--;
                if (maxItems==0)
                    break;
            }
    
            maxItems=5;
            out["nextFiles"].list();
            BOOST_FOREACH(path nextFile, mNextFiles)
            {
                out["nextFiles"].list().push_back(nextFile.string());
                maxItems--;
                if (maxItems==0)
                    break;
            } 

            maxItems=5;
            out["prevPaths"].list();
            BOOST_FOREACH(path prevPath, mPrevPaths)
            {
                out["prevPaths"].list().push_back(prevPath.string());
                maxItems--;
                if (maxItems==0)
                    break;
            }
    
            maxItems=5;
            out["nextPaths"].list();
            BOOST_FOREACH(path nextPath, mNextPaths)
            {
                out["nextPaths"].list().push_back(nextPath.string());
                maxItems--;
                if (maxItems==0)
                    break;
            }

            out["randomLength"]=mRandomLength;
            out["sortField"]=mSortField;

			out.send();
		}

		void destroy()
		{

		}

	};

	class CiterMan
	{
		private:
		typedef map<int,Citer> CiterMap;
		CiterMap mIterMap;

		public:

		Citer & get(int id)
		{
			if (mIterMap.find(id)==mIterMap.end())
				throw(synapse::runtime_error("Playlist not found"));
			return(mIterMap[id]);
		}

		void create(int id, string basePath)
		{
			if (mIterMap.find(id)!=mIterMap.end())
				throw(synapse::runtime_error("Playlist already exists"));

			mIterMap[id].create(id, basePath);
		}

		void destroy(int id)
		{
			get(id).destroy();
			mIterMap.erase(id);
		}


	};

	CiterMan iterMan;
    synapse::Cconfig config;

    bool shutdown;
    int defaultId=-1;

    SYNAPSE_REGISTER(module_Init)
    {
        Cmsg out;
        shutdown=false;
        defaultId=msg.dst;

        //load config file
        config.load("etc/synapse/pl.conf");

        out.clear();
        out.event="core_ChangeModule";
        out["maxThreads"]=1;
        out.send();

        out.clear();
        out.event="core_ChangeSession";
        out["maxThreads"]=1;
        out.send();

        //tell the rest of the world we are ready for duty
        out.clear();
        out.event="core_Ready";
        out.send();

    }

    SYNAPSE_REGISTER(module_SessionStart)
    {
        if (msg.isSet("path"))
            iterMan.create(dst, msg["path"]);
        else
            iterMan.create(dst, config["path"]);

        iterMan.get(dst).send(0);
    }

    SYNAPSE_REGISTER(module_SessionEnd)
    {
        iterMan.destroy(dst);
    }

	/** Create a new iterator
		\param id Traverser id
		\path path Base path. Iterator can never 'escape' this directory.

		SECURITY WARNING: Its possible to traverse the whole filesystem for users that have permission to send pl_Create!

	\par Replies pl_Entry:
		\param path Current path
		\param file Current file, selected according to search criteria

	*/
	SYNAPSE_REGISTER(pl_New)
	{
        Cmsg out;
        out.event="core_NewSession";
        out["path"]=msg["path"];
        out.dst=1;
        out.send();
	}


	/** Delete specified iterator (actually ends session, so you cant destroy default iterator)
		\param id Traverser id
	*/
	SYNAPSE_REGISTER(pl_Del)
	{
        if (msg.dst!=defaultId)
		{
            Cmsg out;
            out.event="core_DelSession";
            out.dst=1;
            out.send();
        }
	}


	/** Change selection/search criteria for files. Initalise a new iterator
        \param s

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_SetMode)
	{
        iterMan.get(dst).setMode(msg);
        iterMan.get(dst).send(0);

	}

	/** Get current directory and file
		\param id Traverser id

	\par Replies pl_Entry.
	*/
	SYNAPSE_REGISTER(pl_GetStatus)
	{
		iterMan.get(dst).send(msg.src);
	}

	/** Select next directory entry in list
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_NextPath)
	{
		iterMan.get(dst).nextPath();
		iterMan.get(dst).send(0);

	}


	/** Select previous entry directory in list
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_PreviousPath)
	{
		iterMan.get(dst).previousPath();
		iterMan.get(dst).send(0);
	}

	/** Enters selected directory
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_EnterPath)
	{
		iterMan.get(dst).enterPath();
		iterMan.get(dst).send(0);
	}

	/** Exits directory, selecting directory on higher up the hierarchy
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_ExitPath)
	{
		iterMan.get(dst).exitPath();
		iterMan.get(dst).send(0);

	}

	/** Next song
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_Next)
	{
		iterMan.get(dst).next();
		iterMan.get(dst).send(0);

	}

	/** Previous song
		\param id Traverser id

	\par Replies pl_Entry:
	 */
	SYNAPSE_REGISTER(pl_Previous)
	{
		iterMan.get(dst).previous();
		iterMan.get(dst).send(0);
	}




	SYNAPSE_REGISTER(module_Shutdown)
	{
		shutdown=true;
	}

}