diff options
author | iliyan <iliyan@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 2007-12-16 05:26:36 +0000 |
---|---|---|
committer | iliyan <iliyan@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 2007-12-16 05:26:36 +0000 |
commit | b04fd3b3a3e4195f6bc671d44b91962972642eec (patch) | |
tree | 1fce6c0c049bf05ea83beea347c553b377095bb3 /TAO/tao/Object_KeyC.cpp | |
parent | 1cf12da21f93cd359e7fccf25b80692614f14cd5 (diff) | |
download | ATCD-b04fd3b3a3e4195f6bc671d44b91962972642eec.tar.gz |
Branched out ACE
Diffstat (limited to 'TAO/tao/Object_KeyC.cpp')
-rw-r--r-- | TAO/tao/Object_KeyC.cpp | 277 |
1 files changed, 0 insertions, 277 deletions
diff --git a/TAO/tao/Object_KeyC.cpp b/TAO/tao/Object_KeyC.cpp deleted file mode 100644 index e09c9967a39..00000000000 --- a/TAO/tao/Object_KeyC.cpp +++ /dev/null @@ -1,277 +0,0 @@ -// -*- C++ -*- -// -// $Id$ - -// **** Code generated by the The ACE ORB (TAO) IDL Compiler **** -// TAO and the TAO IDL Compiler have been developed by: -// Center for Distributed Object Computing -// Washington University -// St. Louis, MO -// USA -// http://www.cs.wustl.edu/~schmidt/doc-center.html -// and -// Distributed Object Computing Laboratory -// University of California at Irvine -// Irvine, CA -// USA -// http://doc.ece.uci.edu/ -// and -// Institute for Software Integrated Systems -// Vanderbilt University -// Nashville, TN -// USA -// http://www.isis.vanderbilt.edu/ -// -// Information about TAO is available at: -// http://www.cs.wustl.edu/~schmidt/TAO.html - -// TAO_IDL - Generated from -// be\be_codegen.cpp:291 - - -#include "tao/Object_KeyC.h" -#include "tao/CDR.h" -#include "tao/ORB_Core.h" - -#if defined (__BORLANDC__) -#pragma option -w-rvl -w-rch -w-ccc -w-aus -w-sig -#endif /* __BORLANDC__ */ - -#include "ace/ACE.h" -#include "ace/Truncate.h" -#include "ace/OS_NS_string.h" -#include "ace/os_include/os_ctype.h" - -// TAO_IDL - Generated from -// be\be_visitor_arg_traits.cpp:70 - -TAO_BEGIN_VERSIONED_NAMESPACE_DECL - -// Arg traits specializations. -namespace TAO -{ -} - - -// TAO_IDL - Generated from -// be\be_visitor_sequence/sequence_cs.cpp:65 - -#if !defined (_TAO_OBJECTKEY_CS_) -#define _TAO_OBJECTKEY_CS_ - -TAO::ObjectKey::ObjectKey (void) -{} - -TAO::ObjectKey::ObjectKey ( - CORBA::ULong max - ) - : TAO::unbounded_value_sequence< - CORBA::Octet - > - (max) -{} - -TAO::ObjectKey::ObjectKey ( - CORBA::ULong max, - CORBA::ULong length, - CORBA::Octet * buffer, - CORBA::Boolean release - ) - : TAO::unbounded_value_sequence< - CORBA::Octet - > - (max, length, buffer, release) -{} - -TAO::ObjectKey::ObjectKey ( - const ObjectKey &seq - ) - : TAO::unbounded_value_sequence< - CORBA::Octet - > - (seq) -{} - -TAO::ObjectKey::~ObjectKey (void) -{} - -// Hand crafted. - -void -TAO::ObjectKey::encode_sequence_to_string (char* & str, - TAO::unbounded_value_sequence<CORBA::Octet> const & seq) -{ - // We must allocate a buffer which is (gag) 3 times the length - // of the sequence, which is the length required in the worst-case - // scenario of all non-printable characters. - // - // There are two strategies here...we could allocate all that space here, - // fill it up, then copy-allocate new space of just the right length. - // OR, we could just return this space. The classic time-space tradeoff, - // and for now we'll let time win out, which means that we only do the - // allocation once. - CORBA::ULong const seq_len = seq.length (); - CORBA::ULong const len = 3 * seq_len; /* space for zero termination - not needed */ - str = CORBA::string_alloc (len); - - char * const eos = str + len; - char * cp = str; - - for (CORBA::ULong i = 0; - cp < eos && i < seq_len; - ++i) - { - unsigned char bt = seq[i]; - if (is_legal (bt)) - { - *cp++ = static_cast<char> (bt); - continue; - } - - *cp++ = '%'; - *cp++ = static_cast<char> (ACE::nibble2hex ((bt >> 4) & 0x0f)); - *cp++ = static_cast<char> (ACE::nibble2hex (bt & 0x0f)); - } - // Zero terminate - *cp = '\0'; -} - -CORBA::Boolean -TAO::ObjectKey::is_legal (unsigned char c) -{ - if (isalnum (c)) - { - return true; - } - else - { - return ( c == ';' || c == '/' ||c == ':' || c == '?' || - c == '@' || c == '&' ||c == '=' || c == '+' || - c == '$' || c == ',' ||c == '_' || c == '.' || - c == '!' || c == '~' ||c == '*' || c == '\'' || - c == '-' || c == '(' || c == ')' ); - } -} - -void -TAO::ObjectKey::decode_string_to_sequence ( - TAO::unbounded_value_sequence<CORBA::Octet> & seq, - char const * str) -{ - if (str == 0) - { - seq.length (0); - return; - } - - size_t const str_len = ACE_OS::strlen (str); - - // Ensure sequence length value does not exceed maximum value for - // sequence index type (CORBA::ULong). This is mostly an issue for - // 64-bit MS Windows builds. - CORBA::ULong const len = - ACE_Utils::truncate_cast<CORBA::ULong> (str_len); - - char const * const eos = str + str_len; - char const * cp = str; - - // Set the length of the sequence to be as long as we'll possibly - // need...we'll reset it to the actual length later. - seq.length (len); - - CORBA::ULong i = 0; - for (; - cp < eos && i < len; - ++i) - { - if (*cp == '%' || *cp == '\\') - { - // This is an escaped non-printable, - // so we decode the hex values into - // the sequence's octet - seq[i] = static_cast<CORBA::Octet> (ACE::hex2byte (cp[1]) << 4); - seq[i] |= static_cast<CORBA::Octet> (ACE::hex2byte (cp[2])); - cp += 3; - } - else - // Copy it in - seq[i] = *cp++; - } - - // Set the length appropriately - seq.length (i); -} - -/*static*/ CORBA::Boolean -TAO::ObjectKey::demarshal_key (TAO::ObjectKey &key, - TAO_InputCDR &strm) -{ - CORBA::ULong _tao_seq_len; - - if (strm >> _tao_seq_len) - { - // Add a check to the length of the sequence - // to make sure it does not exceed the length - // of the stream. (See bug 58.) - if (_tao_seq_len > strm.length ()) - { - return 0; - } - - // Set the length of the sequence. - key.length (_tao_seq_len); - - // If length is 0 we return true. - if (0 >= _tao_seq_len) - { - return 1; - } - - // Retrieve all the elements. -#if (TAO_NO_COPY_OCTET_SEQUENCES == 1) - if (ACE_BIT_DISABLED (strm.start ()->flags (), - ACE_Message_Block::DONT_DELETE)) - { - key.replace (_tao_seq_len, strm.start ()); - key.mb ()->wr_ptr (key.mb()->rd_ptr () + _tao_seq_len); - strm.skip_bytes (_tao_seq_len); - return 1; - } - return strm.read_octet_array (key.get_buffer (), - _tao_seq_len); -#else /* TAO_NO_COPY_OCTET_SEQUENCES == 0 */ - return strm.read_octet_array (key.get_buffer (), key.length ()); -#endif /* TAO_NO_COPY_OCTET_SEQUENCES == 0 */ - - } - return 0; -} - -#endif /* end #if !defined */ - -// TAO_IDL - Generated from -// be\be_visitor_sequence/cdr_op_cs.cpp:96 - -#if !defined _TAO_CDR_OP_TAO_ObjectKey_CPP_ -#define _TAO_CDR_OP_TAO_ObjectKey_CPP_ - -CORBA::Boolean operator<< ( - TAO_OutputCDR &strm, - const TAO::ObjectKey &_tao_sequence - ) -{ - return TAO::marshal_sequence(strm, _tao_sequence); -} - -CORBA::Boolean operator>> ( - TAO_InputCDR &strm, - TAO::ObjectKey &_tao_sequence - ) -{ - return TAO::demarshal_sequence(strm, _tao_sequence); -} - -#endif /* _TAO_CDR_OP_TAO_ObjectKey_CPP_ */ - -TAO_END_VERSIONED_NAMESPACE_DECL |