亚洲国产小视频在线观看,性娇小13――14欧美,亚洲免费电影在线

Stone Jiang — Mon, 02 Jul 2012 09:03:00 GMT

�Ƣ迎讉K��我的新网�?br />TAO工作�?nbsp;http://www.tao-studio.net

Stone Jiang 2012-07-02 17:03 发表评论

Stone Jiang — Tue, 15 Sep 2009 09:15:00 GMT

Priority Inversion 优先�U�反转是嵌入式实时系�l�里面的一个经典的问题。简单描�q�C��下这个问题：有三个优先��不同的task,A,B,C; A的优先��最高，B�ơ之�Q�C最低。其中A和C有共享的临界区。如果C已进入��界区�Q�那么A在进入进入��界区之前�Q�就会被��d��。task B有可能打断C而进入运行状态，�q�样C什么时候从临界区退出，��是一个未知的旉��。A只有C从��界区退出后才能被调度，A被阻塞的旉��也是未知的。这��P��低优先��的B先于高优先��的A被调度，优先�U�发生了逆�{�?
�q�个问题在一般的操作�pȝ��里面不是一个严重的问题�Q�最多A被多��d��了一�D�|��间。但是，在实时系�l�里面，如果一个�Q务在规定的时间里面没有被调度�q�行�Q�系�l�就相当于失败了�Q�可能引发系�l�崩溃�?
解决�q�个问题有两�U�手�D�：
1�Q�Priority inheritance(优先�U��?�Q�如果一个高优先�U�的task被阻塞，与它�׃�n临界区的低优先��的task在进入��界区后，优先�U�就会��扉K��优先�U�task的优先��Q�保证它不会被其他优先��ơ高的�Q务打断。从临界区退出后�Q�C的优先��恢复正常�?
2�Q�A priority ceiling�Q�最高优先��Q�，�l��界区分配最高优先��Q�如果一个task�q�入临界区，��把临界区的优先�U�赋�l�它�Q�已保证它不会被打断。从临界区退出后�Q�task的优先��恢复正常�?/p>

实时操作�pȝ��的一个特点就是，一个实时�Q务，会在规定的时间内得到响应�Q��ƈ且在规定的时间内完成��d��。所以，一切不可预知的动作都是有害的�?/p>

有兴��可以看看下面两个链接：
http://en.wikipedia.org/wiki/Priority_inversion

Priority inversion

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In scheduling, priority inversion is the scenario where a low priority task holds a shared resource that is required by a high priority task. This causes the execution of the high priority task to be blocked until the low priority task has released the resource, effectively "inverting" the relative priorities of the two tasks. If some other medium priority task, one that does not depend on the shared resource, attempts to run in the interim, it will take precedence over both the low priority task and the high priority task.

In some cases, priority inversion can occur without causing immediate harm—the delayed execution of the high priority task goes unnoticed, and eventually the low priority task releases the shared resource. However, there are also many situations in which priority inversion can cause serious problems. If the high priority task is left starved of the resources, it might lead to a system malfunction or the triggering of pre-defined corrective measures, such as a watch dog timer resetting the entire system. The trouble experienced by the Mars lander "Mars Pathfinder"^[1]^[2] is a classic example of problems caused by priority inversion in realtime systems.

Priority inversion can also reduce the perceived performance of the system. Low priority tasks usually have a low priority because it is not important for them to finish promptly (for example, they might be a batch job or another non-interactive activity). Similarly, a high priority task has a high priority because it is more likely to be subject to strict time constraints—it may be providing data to an interactive user, or acting subject to realtime response guarantees. Because priority inversion results in the execution of the low priority task blocking the high priority task, it can lead to reduced system responsiveness, or even the violation of response time guarantees.

A similar problem called deadline interchange can occur within Earliest Deadline First Scheduling (EDF).

[hide]

1 Solutions
2 See also
3 Notes
4 References
5 External links

[edit] Solutions

The existence of this problem has been known since the 1970s, but there is no fool-proof method to predict the situation. There are however many existing solutions, of which the most common ones are:

Disabling all interrupts to protect critical sections: When disabled interrupts are used to prevent priority inversion, there are only two priorities: preemptible, and interrupts disabled. With no third priority, inversion is impossible. Since there's only one piece of lock data (the interrupt-enable bit), misordering locking is impossible, and so deadlocks cannot occur. Since the critical regions always run to completion, hangs do not occur. Note that this only works if all interrupts are disabled. If only a particular hardware device's interrupt is disabled, priority inversion is reintroduced by the hardware's prioritization of interrupts. A simple variation, "single shared-flag locking" is used on some systems with multiple CPUs. This scheme provides a single flag in shared memory that is used by all CPUs to lock all inter-processor critical sections with a busy-wait. Interprocessor communications are expensive and slow on most multiple CPU systems. Therefore, most such systems are designed to minimize shared resources. As a result, this scheme actually works well on many practical systems. These methods are widely used in simple embedded systems, where they are prized for their reliability, simplicity and low resource use. These schemes also require clever programming to keep the critical sections very brief, under 100 microseconds in practical systems. Many software engineers consider them impractical in general-purpose computers.; Arguably, these methods are similar to priority ceilings.

A priority ceiling: With priority ceilings, the shared mutex process (that runs the operating system code) has a characteristic (high) priority of its own, which is assigned to the task locking the mutex. This works well, provided the other high priority task(s) that try to access the mutex does not have a priority higher than the ceiling priority.

Priority inheritance: Under the policy of priority inheritance, whenever a high priority task has to wait for some resource shared with an executing low priority task, the low priority task is assigned the priority of the highest waiting priority task for the duration of its own use of the shared resource, thus keeping medium priority tasks from pre-empting the (originally) low priority task, and thereby effectively the waiting high priority task as well.

[edit] Notes

^ What Really Happened on Mars by Glenn Reeves of the JPL Pathfinder team
^ Explanation of priority inversion problem experienced by Mars Pathfinder

[edit] References

by Butler W. Lampson and David D. Redell, CACM 23(2):105-117 (Feb 1980) - One of the first (if not the) first papers to point out the priority inversion problem. Also suggested disabling interrupts and the priority ceiling protocol as solutions, noting that the former of these two cannot not tolerate page faults while in use.

[edit] External links

Description from FOLDOC
Citations from CiteSeer
IEEE Priority Inheritance Paper by Sha, Rajkumar, Lehoczky

Retrieved from "

Stone Jiang 2009-09-15 17:15 发表评论

如何在Windows,Visual C++下获取、配�|�和构徏ACE及TAO?

Stone Jiang — Mon, 21 Jul 2008 17:00:00 GMT

Q:如何在Windows,Visual C++下获取、配�|�和构徏ACE及TAO?
A:本FAQ提供在Windows下用VisualC++安装和构建ACE+TAO的基本说明�?br> ACE+TAO也适用于其它主要的操作�pȝ��Q�例如：Linux, Solaris,
HP-UX, AIX和Tru64,�q�适用于一些实�Ӟ��嵌入式操作系�l�，�?br> VxWorks,LynxOS, timeSys Linux和Windows CE。在Windows中，
ACE+TAO也可以用Borland C++�~�译器构建�?/p>

.��g要求�Q?br> - CPU�Q?Intel X86 P3 500 MHz或更�?br> - 内存�Q?12MB (更多内存可以提高�~�译速度)
- ��盘�I�间�Q?256MB交互�I�间+ 250MB��x��GB�I�闲�I�间�Q�取瘊于您要�?br> 多少需要构�?

.操作�pȝ��要求�Q?br> - Windows 2000, 2003,或XP (其实Vista下我试过也可�?

.C++�~�译器要求：
- Microsoft Visual C++ 6.0 SP5 (新版本的ACE+TAO已不支持VC6�?
- Microsoft Visual C++ 7.1 (VS2003)
- Microsoft Visual C++ 8.0 (VS2005)
- Microsoft Visaul C++ 9.0 (VS2008)

.其他软�g要求�Q?br> - WinZIP或类似的解压�~�工�?br> - ActiveState Perl v5.6.1或更新版本（推荐�Q�不是必需�Q?/p>

获取和安装ACE+TAO
1. 从下载OCI TAO 1.5a的最新补�?br>     http://download.ociweb.com/TAO-1.5a/ACE+TAO-1.5a_with_latest_patches.zip
    或从ACE+TAO的官方网站上下蝲最新Beta�?br>     http://download.dre.vanderbilt.edu/
2. 把上�q�压�~�文仉��入至没有�I�格的目录中�Q�例如：C:\ACE_wrappers)
3. 讄��环境变量 ACE_ROOT,TAO_ROOT和PATH.
     例如�Q�如果ACE+TAO安装至C:\ACE_wrappers,则上�q�环境变量如下：
     * ACE_ROOT=C:\ACE_wrappers
     * TAO_ROOT=%ACE_ROOT%\TAO
     * PATH路径需要包�? %ACE_ROOT%\bin;%ACE_ROOT%\lib
4. �?%ACE_ROOT%\ace 目录中config.h文�g�Q�文件内�Ҏ��Q?br>     #define ACE_DISABLE_WIN32_ERROR_WINDOWS
     #define ACE_HAS_STANDARD_CPP_LIBRARY 1
     #define ACE_DISABLE_WIN32_INCREASE_PRIORITY
     #include "ACE/config-win32.h"
5. %TAO_ROOT%\TAOACE.sln
      在ACETAO工作�?workspace)中的��目构徏ACE和TAO库，TAO_IDL�~�译器、gperf,
      ORB服务库和可执行文件以及一些公��q��实用工具(utilities)。他们不包含
      �C�Z��、测试和性能��试。库文�g��安装至%ACE_ROOT%\lib�Q�一些可执行文�g��安�?br>     �?ACE_ROOT%\bin中，其他�Q�ORB服务的可执行文�g�Q�将安装在他们自��q��源代码所�?br>     目录中�?br>
     如果您不惛_��部徏议TAOACE workspace的库和可执行文�g�Q�我们徏议构建Naming_Service
     ��目。在开发自��q��应用�E�序里常会用到它�?/p>

     如果上述的workspace文�g不存在，那么你需要用MakeProjectCreator (MPC)来生成它�?br>     命��o行如下（需要Perl�Q�上面已列出�Q�：
     cd %TAO_ROOT%
     %ACE_ROOT%\bin\mwc.pl -type vc71 TAOACE.mwc -- 成生visual stuido 2003 workspace文�g
     %ACE_ROOT%\bin\mwc.pl -type vc8 TAOACE.mwc -- 成生visual stuido 2005 workspace文�g
     %ACE_ROOT%\bin\mwc.pl -type vc9 TAOACE.mwc -- 成生visual stuido 2008 workspace文�g

Stone Jiang 2008-07-22 01:00 发表评论

�Ƣ迎讉K��www.ace-tao.org/bbs

Stone Jiang — Wed, 05 Dec 2007 04:59:00 GMT

�Ƣ迎讉K��http://www.ace-tao.org/bbs

Stone Jiang 2007-12-05 12:59 发表评论

使用vs2005(vc8)�~�译log4cpp-0.3.5rc3

Stone Jiang — Sat, 27 Jan 2007 08:38:00 GMT

使用vs2005(vc8)�~�译log4cpp-0.3.5rc3

问题�Q�由于log4cpp-0.3.5rc3仅提供了vc6的工�E�文�Ӟ��因此�Q��用vs2005打开后，需要进行�{换。但是�{换后�Q�不能正��编译，提示Custom Build Step时出��C��错误�?/p>

分析�Q�因为log4cpp在生成NTEventLogAppender.dll�Ӟ��需要连接NTEventLogCategories.mc文�g。所以，��目讄��了自定义的生成步骤去生成NTEventLogAppender.dll。但从vc6的工�E�文件�{换时�Q�这些步骤却没有正确的�{换过来。从而出��C��q�问题�?/p>

解决�Ҏ��Q�重新填写Custom Build Step��V�?/p>

其中�Q�CommandLine填写以下内容�Q?/p>

if not exist $(OutDir) md $(OutDir)
"mc.exe" -h $(OutDir) -r $(OutDir) $(SolutionDir)NTEventLogCategories.mc
"RC.exe" -r -fo $(OutDir)\$(InputName).res $(ProjectDir)\$(InputName).rc
"link.exe" /MACHINE:IX86 -dll -noentry -out:$(OutDir)\NTEventLogAppender.dll $(OutDir)\$(InputName).res

Outputs填写�Q?(OutDir)\NTEventLogAppender.dll

适用范围�Q�log4cpp��目、log4cppDLL��目的Debug和Release配置。同�Ӟ��该方法适用于vs2003(vc7.1)�?/p>

Stone Jiang 2007-01-27 16:38 发表评论

Stone Jiang — Mon, 04 Dec 2006 02:24:00 GMT

TAO(The ACE ORB)��?br />TAO是一�U�开源的CORBA的实现。它是基于对象管理组�l?OMG)标准CORBA参考模�?�q��过自适应通讯环境(ACE)提供的��Y件概念和框架构徏而成。这是一��中间�g技术，�q�种技术��通用�|�络�~�程��d��自动化，包括以下斚w��Q?br />1.注册�Q�定位和�Ȁ�z�；
2.对象��h��的多路分发；
3.分��及错误处理；
4.参数�~�码和解码；�?br />5.操作的多路分�?/p>

ACE/TAO的实现语�a�是C和C++。用ACE/TAO构徏服务器和客户端的�q�程��出了本指南的范��_��但有几个概念�q�是值得重提�Q?br />1. 接口(Interface)定义在OMG 标准�?idl文�g中。用TAO_IDL实用�E�序,TAO可以自动通过.idl文�g生成C++的静态存�?stubs)和框�?skeletions),二者分别用于服务器端和客户�?
2.�E�序员实现在生成的I.cpp静态存根中的接口，再��用惯用的CORBA技术来�~�写客户端和服务端的代码来进行实现�?br />3. ACE/TAO提供了一个make实用�E�序�Q�这个实用程序可以跨�q�_��的管理项目的创徏和编译。程序员�~�写�?mpc文�g�Q�定义了所创徏的项目所需的源代码�Q�Perl语言脚本创徏makefile文�g或Visual Sutdio的解��x��案。在Linux上，可以生成GC++��目�Q�命令是 mwc.pl -type gcace。在Windows上，产生Visual studio.net 2003解决�Ҏ��的命令是:mwc.pl -type VC71

Stone Jiang 2006-12-04 10:24 发表评论

Stone Jiang — Wed, 30 Aug 2006 06:11:00 GMT

ACE��技巧：在ACE_Acceptor框架中，自定义服务处理器的创�?/span>

Stone Jiang

ACE_Acceptor框架使对新连接的侦听变得�Ҏ��Q�也使创建和�Ȁ�z�L��q�接的ACE_Svc_Handler的派生类变得�Ҏ��。之前我们已�l�了解了ACE_Svc_Handle::open()挂勾函数和服务处理器

初始化时它所扮演的角艌Ӏ�本文我们回退几步�Q�来了解服务处理器是如何实例化的以及我们如何自定义它的行为�?/p>

再看看ACE_Acceptor�c�，它是一个模板类�Q�第一个模板参数ACE_Accetpor是代表与服务建立�q�接的处理器。当新的�q�接建立�Ӟ��ACE_Acceptor调用make_svc_handler()挂勾函数�?/p>

实际创徏的新建服务处理器对象。ACE_Acceptor::make_svc_handler()的实现如�?

template < class SVC_HANDLE,ACE_PEER_ACCEPTOR_1 >
int
ACE_Acceptor < SVC_HANDLE, ACE_PEER_ACCEPTOR_2 > ::make_svc_handler(SVC_HANDLE *& sh)
{
  ACE_TRACE ( " ACE_Acceptor::make_svc_handler " );   if (sh == 0 )
    ACE_NEW_RETURN (sh,
                    SVC_HANDLER,
                     - 1 );   // Set the reactor of the newly created  to the same
   // reactor that this  is using.
  sh -> reactor ( this -> reactor ());
   return 0 ;

}

默认的实现包括了两步基本操作�Q?br />1. 获得一个新的SVC_HANLDER对象�Q?�q�里是��用的new�q�算�W�分配的�?br />2. 讄��新的服务处理器的reactor指针为ACE_Accetpor使用的reactor的�?/p>

然而，如果应用�E�序需要通过其它方式获得SVC_HANDLER对象�Q�而不是通过默认的构造函数��U�动态分配，�q�又该怎么办呢�Q��D例来��_��我们可能需要：
. 从一个预分配的池中获得SVC_HANDLER对象�Q?br /> . 为新创徏的SVC_HANDLER传入一些额外的信息
. 使用单体的SVC_HANDLER

上面�q�些情�Ş�Q�我们都可以自定义make_svc_handler()挂勾函数来实现必要的行�ؓ。例�?假定我们新的处理器需要拥有一个处理所有对所有接收到的消息进行集中处理的中心处理

器。这个中心处理器我们用类Processor表示。我们需要每个服务处理器都拥有一个指向中心处理器的指针，而不是��Processor成�ؓ一个全局讉K��的指�?使用全局变量的种�U�弊�?/p>

本文不作详述)。我们的解决办法�? 从ACE_Accetor�z��一个新�c�，�q�个新类拥有Processor的指针作成员�Q��ƈ且，在创建新和服务处理器(Service)的时候，把这�?Processor�?/p>

指针作参��C��q�去�?/p>

新的acceptor�c�d��以这样定义：

class My_Acceptor : public ACE_Acceptor < Service, ACE_SOCK_ACCEPTOR >
{
public :
  My_Acceptor (Processor * processor) : processor_ (processor) { } ;

   int make_svc_handler (Service *& sh)
     {
       if (sh == 0 )
        ACE_NEW_RETURN (sh,
                        Service ( this -> processor_),
                         - 1 );       // Set the reactor of the newly created  to the same
       //   reactor that this  is using.
      sh -> reactor ( this -> reactor ());
       return 0 ;
    }

private :
  Processor * processor_;
}

��p��P��现在�Q�当My_Acceptor接受新连接的时候，make_svc_handler()挂勾函数分配一个新的处理器(Service)�Q��ƈ把Processor*作�ؓ参数传进厅R��需要注意的事，��管�q�里使用

的是�q�一个构造函数Service(Processor*)。我们仍需求�ؓService�c�d��义默认的构造函敎ͼ�以满��x��板类ACE_Acceptor的需要�?/p>

Stone Jiang 2006-08-30 14:11 发表评论

��技�? 当ACE_Svc_Handler关闭时��用的默认行�ؓ

Stone Jiang — Mon, 28 Aug 2006 01:36:00 GMT

��技�? 当ACE_Svc_Handler关闭时��用的默认行�ؓ

Stone Jiang

上一��我们看了ACE_Svc_Handler::open()挂勾函数提供默认行�ؓ的一些技巧。因为在大多数情况下�Q�它完成了服务创建时所需的所有事情：��入事件注册新处理器和�q�回�?/p>

在ACE_Svc_Handler中关闭操作的默认行�ؓ要比在open()中初始化的代码更为复杂。这是因为关闭时的挂勑և�数包含了反应�?reactive)关闭和主动式(active-object)关闭两种�?/p>

况，它们有相同的效果:删除所有在反应器注册的事�g和确保删除ACE_Svc_handler的派生类的对象�?/p>

反应式关�?handle_close()): 当以下�Ş况发生时被调用：
1) 事�g回调函数(译注�Q�handle_xxxx())�q�回-1�Ӟ��?br /> 2) 调用ACE_Reactor::remove_handler()�Q�传入的标记不含 DONT_CALL�?br /> 反应器框架将调用handle_close()挂勾函数�?ACE_Svc_handler::handle_close()的默认行为是调用ACE_Svc_Handler::destroy()销毁事件处理器�?/p>

��d��对象式关�?close()): 当ACE_Svc_Handler �z��的对象通过activate()函数转变��Z��动对象，处理器的的svc()�Ҏ��在它产生的线�E�中�q�行后进行回调。当svc()�q�回�Ӟ��U�程

退出，但在它要退出时�Q�仍在将要退出线�E�的上下文中�Q�ACE_Task框架调用它的close()�Ҏ��。ACE_Svc_Handler::close()�Ҏ��调用handle_close()完成服务处理器的清理工作�?/p>

因此�Q�不��ACE_Svc_Handler对象是反应式�q�是��d��式，�l�束时的清理工作都在相同的地方：ACE_Svc_Handler::destroy()。如果对象是动态分配且不是ACE_Stream框架中的�l�成�?/p>

分，destroy()��删除此对象�Q�如果对象不是动态分配的�Q�析构它的责��L��创徏时对象所在的��闭范围。如果对象是ACE_Stream的模块的�l�成部分�Q�流�?或控制流的代码负责管�?/p>

对象的生命期。destroy()函数应遵守这��L��规则来避免出现资源泄漏�?/p>

无论ACE_Svc_Handler对象是反应式销毁还是主动式销毁，都会引�v相同的事情发生：~ACE_Svc_Handler() (处理器的析构函数)调用ACE_Svc_Handler::shutdown()函数完成服务�?/p>

理器的清理工作。shutdown()执行的这些清理操作是�Q?/p>

如果处理器与反应器是兌��的：
取消处理器关联的所有定时器�?br /> 为处理器的流对象�Q�如socket)删除所有已注册的事件�?br />如果处理器与再生�?recycler)是关�pȝ��Q�从再生器中清除处理器�?br />关闭��对象�?br />因此�Q�我们看到的�l�大多数情况服务处理器通过shutdown需要通过框架来清理工作，都是��单的允许�~�省的挂勑և�数得以被调用。如果你的应用程序需求更多的关闭/清理规则�Q�推

荐的地方是你的处理器的handle_close()挂勾�Ҏ��。仅仅是��保把ACE_Svc_Handler::destroy()函数��Z��Z��的handle_close()的最后一个动作，与框架清理行为的余下的行为合

�q��?/p>

Stone Jiang 2006-08-28 09:36 发表评论

��技�? ACE_Svc_Handler的初始化

Stone Jiang — Sun, 27 Aug 2006 15:48:00 GMT

��技�? ACE_Svc_Handler的初始化

										

						
Stone Jiang
ACE_Svc_Handler�l�常用于�|�络服务�cȝ��基类�Q�这是因为它很容易在��d��对象(Active Ojbect)
模式和反应器(Reactor)框架中��用。APG�W?.6节中讨论了怎么在接受器-�q�接�?Acceptor-conector)
框架中如何把ACE_Svc_Handler作�ؓ目标来��用，�q�且�Q�在C++NPv2�W?章中�Q�深度探讨了
Acceotor-Connector的相兌���计�?/pre>挂勾函数(Hook method)ACE_Svc_Handler::open()常是服务中新�����接时执行的初始化讄���的地斏V�?br />举例来说�Q�如果服务要在日志中记录新连接徏立的相关信息�Q�open()函数是则是记录这个信息的地方�?br />对于使用Reacotor 框架的服务检查网�l�数据到达，open()是执行reactor注册的地斏V�?br />事实上，�q�正是reactor注册的地方，�q�种动作在服务徏立新�q�接旉���常常见的�Q�ACE_Svc_Handler::
open()的缺省操作也正是
if (this->reactor () && this->reactor ()->register_handler
          (this,
           ACE_Event_Handler::READ_MASK) == -1)
  ACE_ERROR_RETURN ((LM_ERROR,
                     ACE_LIB_TEXT ("%p\n"),
                     ACE_LIB_TEXT ("unable to register client handler")),
                    -1);
return 0;
所以，如果在与服务建立新连接�ƈ为“读事�g”注册时�Q�你甚至不需要在你的�c�M��
实现open(void*)函数�Q�ACE已经��Z��做了�q�一�?另外�Q�请��C���Q�如果reactor注册��p�|�Q?br />默认的open()函数会返�?1�Q�它会引起Acceptor-Connector框架关闭新徏的连接和删除�q�个
事�g处理�?handler)�?br />Stone Jiang
http://www.shnenglu.com/ace/


		


Stone Jiang 2006-08-27 23:48 发表评论

有�h知道CSDN邮�g列表的退订方式吗?

Stone Jiang — Tue, 08 Aug 2006 04:27:00 GMT

几乎每天收到一��到几封不想看的垃圾邮�g,邮�g中却没有退订功�?
�q�且,�Ҏ��没有订�q�这�c�邮�?
不知道有没有��Z��有同��L��烦恼?

Stone Jiang 2006-08-08 12:27 发表评论

亚洲国产小视频在线观看,性娇小13――14欧美,亚洲免费电影在线

Priority inversion

From Wikipedia, the free encyclopedia

Contents

[edit] Solutions

[edit] See also

[edit] Notes

[edit] References

[edit] External links

如何在Windows,Visual C++下获取、配�|�和构徏ACE及TAO?

�Ƣ迎讉K��www.ace-tao.org/bbs

使用vs2005(vc8)�~�译log4cpp-0.3.5rc3

使用vs2005(vc8)�~�译log4cpp-0.3.5rc3

���技�? 当ACE_Svc_Handler关闭时��用的默认行�ؓ

���技�? ACE_Svc_Handler的初始化

���技�? ACE_Svc_Handler的初始化

有�h知道CSDN邮�g列表的退订方式吗?

��技�? 当ACE_Svc_Handler关闭时��用的默认行�ؓ

��技�? ACE_Svc_Handler的初始化

��技�? ACE_Svc_Handler的初始化