Pogolyn: pg_task.h Source File

00001 /*
00002     Copyright (c) 2007-2009 Takashi Kitao
00003     All rights reserved.
00004 
00005     Redistribution and use in source and binary forms, with or without
00006     modification, are permitted provided that the following conditions
00007     are met:
00008 
00009     1. Redistributions of source code must retain the above copyright
00010     `  notice, this list of conditions and the following disclaimer.
00011 
00012     2. Redistributions in binary form must reproduce the above copyright
00013     `  notice, this list of conditions and the following disclaimer in the
00014     `  documentation and/or other materials provided with the distribution.
00015 
00016     3. The name of the author may not be used to endorse or promote products
00017     `  derived from this software without specific prior written permission.
00018 
00019     THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
00020     IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
00021     OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
00022     IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
00023     INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
00024     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
00025     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
00026     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00027     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
00028     THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00029 */
00030 
00031 
00032 class pgTaskMgr;
00033 
00034 
00039 class PG_API pgTask
00040 {
00041     friend class pgTaskMgr;
00042 
00043 public:
00044     pgDefineException(ExceptionInvalidArgument);
00045     pgDefineException(ExceptionInvalidCall);
00046 
00050     enum TaskOrder
00051     {
00052         ORDER_MINUS_8_FOR_SYSTEM, ORDER_MINUS_7, ORDER_MINUS_6, ORDER_MINUS_5, //
00053         ORDER_MINUS_4, ORDER_MINUS_3, ORDER_MINUS_2, ORDER_MINUS_1, //
00054         ORDER_ZERO, //
00055         ORDER_PLUS_1, ORDER_PLUS_2, ORDER_PLUS_3, ORDER_PLUS_4, //
00056         ORDER_PLUS_5, ORDER_PLUS_6, ORDER_PLUS_7, ORDER_PLUS_8_FOR_SYSTEM
00057     };
00058 
00059     bool hasOrder() const;
00060     TaskOrder getOrder() const;
00061 
00062     bool hasParent() const;
00063     pgTask* getParentN() const;
00064 
00065     pgTask* getPrevAllN() const;
00066     pgTask* getNextAllN() const;
00067     pgTask* getPrevSiblingN() const;
00068     pgTask* getNextSiblingN() const;
00069     pgTask* getLastDesc() const;
00070 
00071     bool hasChild() const;
00072     pgTask* getFirstChildN() const;
00073     pgTask* getLastChildN() const;
00074 
00075     const char* getName() const;
00076     u64 getExecuteUsecTime() const;
00077 
00078     bool isActive() const;
00079     void setActive(bool is_active);
00080 
00081     virtual void onUpdate();
00082     virtual void onMessage(pgID msg_id, pgMsg<4>& msg);
00083 
00084 protected:
00085     pgTask(TaskOrder order);
00086     pgTask(pgTask* parent);
00087     virtual ~pgTask();
00088 
00089 private:
00090     enum TaskFlag
00091     {
00092         FLAG_ACTIVE
00093     };
00094 
00095     pgTask();
00096     pgTask(const pgTask&);
00097     void operator=(const pgTask&);
00098 
00099     pgTree<pgTask> m_tree;
00100     pgType<u8, TaskOrder> m_order;
00101     pgFlag<u8, TaskFlag> m_flag;
00102     const char* m_name;
00103     u64 m_execute_time;
00104 };