The Windows Access Control Model: Part 2

oshah

Rate me:

4.80/5 (28 votes)

27 Jun 2005CPOL43 min read

244.5K

7.2K

113

This second part of the Access Control series will program with the basic Access Control structures.

userfun.zip
- 2000
  - 2000.vcproj
  - boosthelper.h
  - Privateobject.h
  - release
    - 2000.exe
  - Safer.h
  - sized_array.h
  - UserFun2000.cpp
  - UserFun2000.h
- ATL
  - PrivateObject.cpp
  - PrivateObject.h
  - release
    - UserFun.exe
  - stdafx.cpp
  - stdafx.h
  - UserFun.vcproj
  - UserFunATL.cpp
- Boostlib.txt
- LowLevel
  - LowLevel.vcproj
  - release
    - LowLevel.exe
  - UserFunLowLevel.c
- ReadMe.txt
whoami.zip
- Whoami
  - release
    - Whoami.exe
  - sized_array.h
  - Whoami.cpp
  - Whoami.vcproj
boost.zip
- boost
  - assert.hpp
  - checked_delete.hpp
  - config.hpp
  - config
    - compiler
    - platform
      - aix.hpp
      - amigaos.hpp
      - beos.hpp
      - bsd.hpp
      - cygwin.hpp
      - hpux.hpp
      - irix.hpp
      - linux.hpp
      - macos.hpp
      - solaris.hpp
      - win32.hpp
    - posix_features.hpp
    - select_compiler_config.hpp
    - select_platform_config.hpp
    - select_stdlib_config.hpp
    - stdlib
    - suffix.hpp
    - user.hpp
  - cregex.hpp
  - cstdint.hpp
  - cstdlib.hpp
  - current_function.hpp
  - detail
    - allocator.hpp
    - catch_exceptions.hpp
    - limits.hpp
    - workaround.hpp
  - limits.hpp
  - mpl
    - aux_
  - preprocessor
    - arithmetic.hpp
    - arithmetic
      - add.hpp
      - dec.hpp
      - detail
        
        div_base.hpp
      - div.hpp
      - inc.hpp
      - mod.hpp
      - mul.hpp
      - sub.hpp
    - array.hpp
    - array
      - data.hpp
      - elem.hpp
      - insert.hpp
      - pop_back.hpp
      - pop_front.hpp
      - push_back.hpp
      - push_front.hpp
      - remove.hpp
      - replace.hpp
      - reverse.hpp
      - size.hpp
    - assert_msg.hpp
    - cat.hpp
    - comma.hpp
    - comma_if.hpp
    - comparison.hpp
    - comparison
      - equal.hpp
      - greater.hpp
      - greater_equal.hpp
      - less.hpp
      - less_equal.hpp
      - not_equal.hpp
    - config
      - config.hpp
      - limits.hpp
    - control.hpp
    - control
      - deduce_d.hpp
      - detail
        
        edg
        
        while.hpp
        
        msvc
        
        while.hpp
        
        while.hpp
      - expr_if.hpp
      - expr_iif.hpp
      - if.hpp
      - iif.hpp
      - while.hpp
    - debug.hpp
    - dec.hpp
    - detail
      - auto_rec.hpp
      - check.hpp
      - is_binary.hpp
      - is_nullary.hpp
      - is_unary.hpp
      - null.hpp
      - split.hpp
    - empty.hpp
    - enum.hpp
    - enum_params.hpp
    - enum_params_with_a_default.hpp
    - enum_params_with_defaults.hpp
    - enum_shifted.hpp
    - enum_shifted_params.hpp
    - expand.hpp
    - expr_if.hpp
    - facilities.hpp
    - facilities
      - apply.hpp
      - empty.hpp
      - expand.hpp
      - identity.hpp
      - intercept.hpp
      - is_1.hpp
      - is_empty.hpp
      - is_empty_or_1.hpp
    - for.hpp
    - identity.hpp
    - if.hpp
    - inc.hpp
    - iterate.hpp
    - iteration.hpp
    - iteration
      - detail
        
        bounds
        
        lower1.hpp
        
        lower2.hpp
        
        lower3.hpp
        
        lower4.hpp
        
        lower5.hpp
        
        upper1.hpp
        
        upper2.hpp
        
        upper3.hpp
        
        upper4.hpp
        
        upper5.hpp
        
        finish.hpp
        
        iter
        
        forward1.hpp
        
        forward2.hpp
        
        forward3.hpp
        
        forward4.hpp
        
        forward5.hpp
        
        reverse1.hpp
        
        reverse2.hpp
        
        reverse3.hpp
        
        reverse4.hpp
        
        reverse5.hpp
        
        local.hpp
        
        rlocal.hpp
        
        self.hpp
        
        start.hpp
      - iterate.hpp
      - local.hpp
      - self.hpp
    - library.hpp
    - limits.hpp
    - list.hpp
    - list
      - adt.hpp
      - append.hpp
      - at.hpp
      - cat.hpp
      - detail
        
        edg
        
        fold_left.hpp
        
        fold_right.hpp
        
        fold_left.hpp
        
        fold_right.hpp
      - enum.hpp
      - filter.hpp
      - first_n.hpp
      - fold_left.hpp
      - fold_right.hpp
      - for_each.hpp
      - for_each_i.hpp
      - for_each_product.hpp
      - rest_n.hpp
      - reverse.hpp
      - size.hpp
      - to_tuple.hpp
      - transform.hpp
    - logical.hpp
    - logical
      - and.hpp
      - bitand.hpp
      - bitnor.hpp
      - bitor.hpp
      - bitxor.hpp
      - bool.hpp
      - compl.hpp
      - nor.hpp
      - not.hpp
      - or.hpp
      - xor.hpp
    - max.hpp
    - min.hpp
    - punctuation.hpp
    - punctuation
      - comma.hpp
      - comma_if.hpp
      - paren.hpp
      - paren_if.hpp
    - repeat.hpp
    - repeat_2nd.hpp
    - repeat_3rd.hpp
    - repeat_from_to.hpp
    - repeat_from_to_2nd.hpp
    - repeat_from_to_3rd.hpp
    - repetition.hpp
    - repetition
      - deduce_r.hpp
      - deduce_z.hpp
      - detail
        
        edg
        
        for.hpp
        
        for.hpp
        
        msvc
        
        for.hpp
      - enum.hpp
      - enum_binary_params.hpp
      - enum_params.hpp
      - enum_params_with_a_default.hpp
      - enum_params_with_defaults.hpp
      - enum_shifted.hpp
      - enum_shifted_params.hpp
      - enum_trailing.hpp
      - enum_trailing_binary_params.hpp
      - enum_trailing_params.hpp
      - for.hpp
      - repeat.hpp
      - repeat_from_to.hpp
    - selection.hpp
    - selection
      - max.hpp
      - min.hpp
    - seq.hpp
    - seq
      - cat.hpp
      - detail
        
        split.hpp
      - elem.hpp
      - enum.hpp
      - filter.hpp
      - first_n.hpp
      - fold_left.hpp
      - fold_right.hpp
      - for_each.hpp
      - for_each_i.hpp
      - for_each_product.hpp
      - insert.hpp
      - pop_back.hpp
      - pop_front.hpp
      - push_back.hpp
      - push_front.hpp
      - remove.hpp
      - replace.hpp
      - rest_n.hpp
      - reverse.hpp
      - seq.hpp
      - size.hpp
      - subseq.hpp
      - to_array.hpp
      - to_tuple.hpp
      - transform.hpp
    - slot.hpp
    - slot
      - detail
        
        def.hpp
        
        shared.hpp
        
        slot1.hpp
        
        slot2.hpp
        
        slot3.hpp
        
        slot4.hpp
        
        slot5.hpp
      - slot.hpp
    - stringize.hpp
    - tuple.hpp
    - tuple
      - eat.hpp
      - elem.hpp
      - rem.hpp
      - reverse.hpp
      - to_list.hpp
      - to_seq.hpp
    - while.hpp
    - wstringize.hpp
  - regex.h
  - regex.hpp
  - regex
    - config.hpp
    - pattern_except.hpp
    - regex_traits.hpp
    - src.cpp
    - user.hpp
    - v3
  - regex_fwd.hpp
  - scoped_array.hpp
  - scoped_ptr.hpp
  - static_assert.hpp
  - test
    - auto_unit_test.hpp
    - detail
    - execution_monitor.hpp
    - floating_point_comparison.hpp
    - included
    - minimal.hpp
    - test_tools.hpp
    - unit_test.hpp
    - unit_test_log.hpp
    - unit_test_result.hpp
    - unit_test_suite.hpp
    - unit_test_suite_ex.hpp
  - timer.hpp
  - type_traits.hpp
  - type_traits
    - add_const.hpp
    - add_cv.hpp
    - add_pointer.hpp
    - add_reference.hpp
    - add_volatile.hpp
    - alignment_of.hpp
    - alignment_traits.hpp
    - arithmetic_traits.hpp
    - array_traits.hpp
    - broken_compiler_spec.hpp
    - composite_traits.hpp
    - config.hpp
    - conversion_traits.hpp
    - cv_traits.hpp
    - detail
      - bool_trait_def.hpp
      - bool_trait_undef.hpp
      - cv_traits_impl.hpp
      - false_result.hpp
      - ice_and.hpp
      - ice_eq.hpp
      - ice_not.hpp
      - ice_or.hpp
      - is_function_ptr_helper.hpp
      - is_function_ptr_tester.hpp
      - is_function_type_tester.hpp
      - is_mem_fun_pointer_impl.hpp
      - is_mem_fun_pointer_tester.hpp
      - size_t_trait_def.hpp
      - size_t_trait_undef.hpp
      - template_arity_spec.hpp
      - type_trait_def.hpp
      - type_trait_undef.hpp
      - wrap.hpp
      - yes_no_type.hpp
    - function_traits.hpp
    - has_nothrow_assign.hpp
    - has_nothrow_constructor.hpp
    - has_nothrow_copy.hpp
    - has_nothrow_destructor.hpp
    - has_trivial_assign.hpp
    - has_trivial_constructor.hpp
    - has_trivial_copy.hpp
    - has_trivial_destructor.hpp
    - ice.hpp
    - intrinsics.hpp
    - is_arithmetic.hpp
    - is_array.hpp
    - is_base_and_derived.hpp
    - is_class.hpp
    - is_compound.hpp
    - is_const.hpp
    - is_convertible.hpp
    - is_empty.hpp
    - is_enum.hpp
    - is_float.hpp
    - is_function.hpp
    - is_fundamental.hpp
    - is_integral.hpp
    - is_member_function_pointer.hpp
    - is_member_pointer.hpp
    - is_object.hpp
    - is_pod.hpp
    - is_pointer.hpp
    - is_polymorphic.hpp
    - is_reference.hpp
    - is_same.hpp
    - is_scalar.hpp
    - is_stateless.hpp
    - is_union.hpp
    - is_void.hpp
    - is_volatile.hpp
    - object_traits.hpp
    - reference_traits.hpp
    - remove_bounds.hpp
    - remove_const.hpp
    - remove_cv.hpp
    - remove_pointer.hpp
    - remove_reference.hpp
    - remove_volatile.hpp
    - same_traits.hpp
    - transform_traits.hpp
    - transform_traits_spec.hpp
    - type_traits_test.hpp
    - type_with_alignment.hpp
  - utility.hpp
  - utility
    - addressof.hpp
    - base_from_member.hpp
    - value_init.hpp
  - utility_fwd.hpp

//-----------------------------------------------------------------------------
// boost mpl/aux_/full_lambda.hpp header file
// See http://www.boost.org for updates, documentation, and revision history.
//-----------------------------------------------------------------------------
//
// Copyright (c) 2001-02
// Aleksey Gurtovoy
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee, 
// provided that the above copyright notice appears in all copies and 
// that both the copyright notice and this permission notice appear in 
// supporting documentation. No representations are made about the 
// suitability of this software for any purpose. It is provided "as is" 
// without express or implied warranty.

#if !defined(BOOST_PP_IS_ITERATING)

///// header body

#ifndef BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED
#define BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED

#if !defined(BOOST_MPL_PREPROCESSING_MODE)
#   include "boost/mpl/lambda_fwd.hpp"
#   include "boost/mpl/bind.hpp"
#   include "boost/mpl/protect.hpp"
#   include "boost/mpl/quote.hpp"
#   include "boost/mpl/bool.hpp"
#   include "boost/mpl/int_fwd.hpp"
#   include "boost/mpl/aux_/template_arity.hpp"
#   include "boost/mpl/aux_/config/ttp.hpp"
#endif

#include "boost/mpl/aux_/lambda_expr.hpp"
#include "boost/mpl/aux_/lambda_arity_param.hpp"
#include "boost/mpl/aux_/config/use_preprocessed.hpp"

#if !defined(BOOST_MPL_NO_PREPROCESSED_HEADERS) \
 && !defined(BOOST_MPL_PREPROCESSING_MODE)

#   define BOOST_MPL_PREPROCESSED_HEADER full_lambda.hpp
#   include "boost/mpl/aux_/include_preprocessed.hpp"

#else

#   include "boost/mpl/limits/arity.hpp"
#   include "boost/mpl/aux_/preprocessor/default_params.hpp"
#   include "boost/mpl/aux_/preprocessor/params.hpp"
#   include "boost/mpl/aux_/preprocessor/enum.hpp"
#   include "boost/mpl/aux_/preprocessor/repeat.hpp"

#   include "boost/preprocessor/iterate.hpp"
#   include "boost/preprocessor/comma_if.hpp"
#   include "boost/preprocessor/inc.hpp"
#   include "boost/preprocessor/cat.hpp"

namespace boost {
namespace mpl {

// local macros, #undef-ined at the end of the header
#   define AUX_LAMBDA_PARAMS(i, param) \
    BOOST_MPL_PP_PARAMS(i, param) \
    /**/

#   define AUX_LAMBDA_BIND_PARAMS(param) \
    BOOST_MPL_PP_PARAMS( \
          BOOST_MPL_METAFUNCTION_MAX_ARITY \
        , param \
        ) \
    /**/

#   define AUX_LAMBDA_BIND_N_PARAMS(i, param) \
    BOOST_PP_COMMA_IF(i) \
    BOOST_MPL_PP_PARAMS(i, param) \
    /**/

#   define AUX_ARITY_PARAM(param) \
    BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(param) \
    /**/

template<
      typename T
    , typename Protect = false_
    AUX_ARITY_PARAM(typename Arity = int_< aux::template_arity<T>::value >)
    >
struct lambda_impl
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef T type;
};

template<
      typename T
    AUX_ARITY_PARAM(typename Arity = int_< aux::template_arity<T>::value >)
    >
struct lambda
    : lambda_impl<T,false_ AUX_ARITY_PARAM(Arity)>
{
};

#if !defined(BOOST_MPL_NO_LAMBDA_HEURISTIC)

#define n BOOST_MPL_METAFUNCTION_MAX_ARITY
namespace aux {

template<
      BOOST_MPL_PP_DEFAULT_PARAMS(n,bool C,false)
    >
struct lambda_or
    : true_
{
};

template<>
struct lambda_or< BOOST_MPL_PP_ENUM(n,false) >
    : false_
{
};

} // namespace aux
#undef n

template< int N, typename Protect >
struct lambda_impl< arg<N>, Protect AUX_ARITY_PARAM(int_<-1>) >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(true_)
    typedef arg<N> type;
};

#endif // BOOST_MPL_NO_LAMBDA_HEURISTIC

#define BOOST_PP_ITERATION_LIMITS (0, BOOST_MPL_METAFUNCTION_MAX_ARITY)
#define BOOST_PP_FILENAME_1 "boost/mpl/aux_/full_lambda.hpp"
#include BOOST_PP_ITERATE()

//: special case for 'protect'
template< typename T, typename Protect >
struct lambda_impl< protect<T>, Protect AUX_ARITY_PARAM(int_<1>) >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef protect<T> type;
};

//: specializations for main 'bind', 'bind1st' and 'bind2nd' forms
template<
      typename F, AUX_LAMBDA_BIND_PARAMS(typename T)
    , typename Protect
    >
struct lambda_impl<
      bind<F,AUX_LAMBDA_BIND_PARAMS(T)>
    , Protect 
    AUX_ARITY_PARAM(int_<BOOST_PP_INC(BOOST_MPL_METAFUNCTION_MAX_ARITY)>)
    >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef bind<F, AUX_LAMBDA_BIND_PARAMS(T)> type;
};

template<
      typename F, typename T
    , typename Protect
    >
struct lambda_impl< bind1st<F,T>, Protect AUX_ARITY_PARAM(int_<2>) >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef bind1st<F,T> type;
};

template<
      typename F, typename T
    , typename Protect
    >
struct lambda_impl< bind2nd<F,T>, Protect AUX_ARITY_PARAM(int_<2>) >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef bind2nd<F,T> type;
};

#   undef AUX_ARITY_PARAM
#   undef AUX_LAMBDA_BIND_N_PARAMS
#   undef AUX_LAMBDA_BIND_PARAMS
#   undef AUX_LAMBDA_PARAMS

} // namespace mpl
} // namespace boost

#endif // BOOST_MPL_USE_PREPROCESSED_HEADERS
#endif // BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED

///// iteration, depth == 1

#elif BOOST_PP_ITERATION_DEPTH() == 1
#define i BOOST_PP_FRAME_ITERATION(1)

#if i > 0

template<
      template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename T)
    >
struct lambda< F<AUX_LAMBDA_PARAMS(i, T)> AUX_ARITY_PARAM(int_<i>) >
    : lambda_impl< F<AUX_LAMBDA_PARAMS(i, T)>, true_ AUX_ARITY_PARAM(int_<i>) >
{
};

#if defined(BOOST_MPL_NO_LAMBDA_HEURISTIC)

template<
      template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename T)
    , typename Protect
    >
struct lambda_impl< 
      F<AUX_LAMBDA_PARAMS(i, T)>, Protect AUX_ARITY_PARAM(int_<i>)
    >
{
#   define AUX_LAMBDA_INVOCATION(unused, i, T) \
    BOOST_PP_COMMA_IF(i) \
    typename lambda_impl< BOOST_PP_CAT(T, BOOST_PP_INC(i)) >::type \
    /**/

    typedef BOOST_PP_CAT(bind,i)<
          BOOST_PP_CAT(quote,i)<F>
        , BOOST_MPL_PP_REPEAT(i, AUX_LAMBDA_INVOCATION, T)
        > type;

#   undef AUX_LAMBDA_INVOCATION
};

#else // BOOST_MPL_NO_LAMBDA_HEURISTIC

#   define AUX_LAMBDA_RESULT(unused, i, T) \
    BOOST_PP_COMMA_IF(i) \
    typename BOOST_PP_CAT(T, BOOST_PP_INC(i))::type \
    /**/

namespace aux {

template<
      typename IsLE, typename Protect
    , template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename L)
    >
struct BOOST_PP_CAT(le_result,i)
{
    typedef F<
          BOOST_MPL_PP_REPEAT(i, AUX_LAMBDA_RESULT, L)
        > type;
};

template<
      template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename L)
    >
struct BOOST_PP_CAT(le_result,i)< true_,false_,F,AUX_LAMBDA_PARAMS(i, L) >
{
    typedef BOOST_PP_CAT(bind,i)<
          BOOST_PP_CAT(quote,i)<F>
        , BOOST_MPL_PP_REPEAT(i, AUX_LAMBDA_RESULT, L)
        > type;
};

template<
      template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename L)
    >
struct BOOST_PP_CAT(le_result,i)< true_,true_,F,AUX_LAMBDA_PARAMS(i, L) >
{
    typedef protect< BOOST_PP_CAT(bind,i)<
          BOOST_PP_CAT(quote,i)<F>
        , BOOST_MPL_PP_REPEAT(i, AUX_LAMBDA_RESULT, L)
        > > type;
};

} // namespace aux

#   define AUX_LAMBDA_INVOCATION(unused, i, T) \
    typedef lambda_impl< BOOST_PP_CAT(T, BOOST_PP_INC(i)) > \
        BOOST_PP_CAT(l,BOOST_PP_INC(i)); \
    /**/

#   define AUX_IS_LAMBDA_EXPR(unused, i, unused2) \
    BOOST_PP_COMMA_IF(i) \
    BOOST_PP_CAT(l,BOOST_PP_INC(i))::is_le::value \
    /**/

template<
      template< AUX_LAMBDA_PARAMS(i, typename P) > class F
    , AUX_LAMBDA_PARAMS(i, typename T)
    , typename Protect
    >
struct lambda_impl< 
      F<AUX_LAMBDA_PARAMS(i, T)>, Protect AUX_ARITY_PARAM(int_<i>)
    >
{
    BOOST_MPL_PP_REPEAT(i, AUX_LAMBDA_INVOCATION, T)
    typedef aux::lambda_or<
          BOOST_MPL_PP_REPEAT(i, AUX_IS_LAMBDA_EXPR, unused)
        > is_le;

    typedef typename aux::BOOST_PP_CAT(le_result,i)<
          typename is_le::type
        , Protect
        , F
        , AUX_LAMBDA_PARAMS(i, l)
        >::type type;
};

#   undef AUX_IS_LAMBDA_EXPR
#   undef AUX_LAMBDA_INVOCATION
#   undef AUX_LAMBDA_RESULT

#endif // BOOST_MPL_NO_LAMBDA_HEURISTIC
#endif // i > 0

template<
      typename F AUX_LAMBDA_BIND_N_PARAMS(i, typename T)
    , typename Protect
    >
struct lambda_impl<
      BOOST_PP_CAT(bind,i)<F AUX_LAMBDA_BIND_N_PARAMS(i, T)>
    , Protect AUX_ARITY_PARAM(int_<BOOST_PP_INC(i)>)
    >
{
    BOOST_MPL_AUX_IS_LAMBDA_EXPR(false_)
    typedef BOOST_PP_CAT(bind,i)<
          F
        AUX_LAMBDA_BIND_N_PARAMS(i, T)
        > type;
};

#undef i
#endif // BOOST_PP_IS_ITERATING

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

oshah

Web Developer

United States

Mr. Shah is a reclusive C++/C# developer lurking somewhere in the depths of the city of London. He learnt physics at Kings' College London and obtained a Master in Science there. Having earned an MCAD, he teeters on the brink of transitioning from C++ to C#, unsure of which language to jump to. Fortunately, he also knows how to use .NET interop to merge code between the two languages (which means he won't have to make the choice anytime soon).

His interests (apart from programming) are walking, football (the real one!), philosophy, history, retro-gaming, strategy gaming, and any good game in general.

He maintains a website / blog / FAQ / junk at shexec32.serveftp.net, where he places the best answers he's written to the questions you've asked. If you can find him, maybe you can hire Mr. Shah to help you with anything C++[/CLI]/C#/.NET related Smile | :)

The Windows Access Control Model: Part 2

License

Comments and Discussions