/usr/include/OpenSP/OpenElement.h is in libosp-dev 1.5.2-13ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // Copyright (c) 1994 James Clark
// See the file COPYING for copying permission.
#ifndef OpenElement_INCLUDED
#define OpenElement_INCLUDED 1
#ifdef __GNUG__
#pragma interface
#endif
#include "Boolean.h"
#include "ContentToken.h"
#include "ElementType.h"
#include "Link.h"
#include "Mode.h"
#include "Allocator.h"
#include "Location.h"
#ifdef SP_NAMESPACE
namespace SP_NAMESPACE {
#endif
class SP_API OpenElement : public Link {
public:
inline ~OpenElement() {}
void *operator new(size_t sz, Allocator &alloc) { return alloc.alloc(sz); }
void *operator new(size_t sz) { return Allocator::allocSimple(sz); }
void operator delete(void *p) { Allocator::free(p); }
#ifdef SP_HAVE_PLACEMENT_OPERATOR_DELETE
void operator delete(void *p, Allocator &) { Allocator::free(p); }
#endif
OpenElement(const ElementType *, Boolean net, Boolean included,
const ShortReferenceMap *currentMap,
const Location &startLocation);
Boolean isFinished() const;
Boolean tryTransition(const ElementType *);
const LeafContentToken *invalidExclusion(const ElementType *) const;
// This doesn't handle declared content of EMPTY.
// If this situation can arise must use declaredEmpty().
Boolean tryTransitionPcdata();
const LeafContentToken *impliedStartTag() const;
void doRequiredTransition();
const ElementType *type() const;
Boolean netEnabling() const;
Boolean included() const;
const MatchState &matchState() const;
void setMatchState(const MatchState &);
Mode mode(Boolean netEnabled) const;
const ShortReferenceMap *map() const;
void setMap(const ShortReferenceMap *);
Boolean requiresSpecialParse() const;
const Location &startLocation() const;
const LeafContentToken *currentPosition() const;
Boolean declaredEmpty() const;
void setConref();
unsigned long index() const;
void setIndex(unsigned long);
private:
OpenElement(const OpenElement &); // undefined
void operator=(const OpenElement &); // undefined
const ElementType *elementType_;
PackedBoolean netEnabling_; // start-tag was net-enabling
PackedBoolean included_;
MatchState matchState_;
ElementDefinition::DeclaredContent declaredContent_;
const ShortReferenceMap *map_;
Location startLocation_;
unsigned long index_;
};
inline
const ElementType *OpenElement::type() const
{
return elementType_;
}
inline
Boolean OpenElement::netEnabling() const
{
return netEnabling_;
}
inline
Boolean OpenElement::included() const
{
return included_;
}
inline
const MatchState &OpenElement::matchState() const
{
return matchState_;
}
inline
void OpenElement::setMatchState(const MatchState &state)
{
matchState_ = state;
}
inline
Boolean OpenElement::isFinished() const
{
return (declaredContent_ != ElementDefinition::modelGroup
|| matchState_.isFinished());
}
inline
Boolean OpenElement::tryTransition(const ElementType *e)
{
switch (declaredContent_) {
case ElementDefinition::modelGroup:
return matchState_.tryTransition(e);
case ElementDefinition::any:
return (e != elementType_) || e->definition()->allowImmediateRecursion();
default:
return 0;
}
}
inline
Boolean OpenElement::tryTransitionPcdata()
{
return (declaredContent_ == ElementDefinition::modelGroup
? matchState_.tryTransitionPcdata()
: 1); // CDATA, RCDATA, ANY all ok
}
inline
const LeafContentToken *OpenElement::invalidExclusion(const ElementType *e)
const
{
return (declaredContent_ == ElementDefinition::modelGroup
? matchState_.invalidExclusion(e)
: 0);
}
inline
void OpenElement::doRequiredTransition()
{
matchState_.doRequiredTransition();
}
inline
const LeafContentToken *OpenElement::impliedStartTag() const
{
return (declaredContent_ == ElementDefinition::modelGroup
? matchState_.impliedStartTag()
: 0);
}
inline
const ShortReferenceMap *OpenElement::map() const
{
return map_;
}
inline
void OpenElement::setMap(const ShortReferenceMap *map)
{
map_ = map;
}
inline
Boolean OpenElement::requiresSpecialParse() const
{
return (declaredContent_ == ElementDefinition::cdata
|| declaredContent_ == ElementDefinition::rcdata);
}
inline
Mode OpenElement::mode(Boolean netEnabled) const
{
return elementType_->definition()->mode(netEnabled);
}
inline
const Location &OpenElement::startLocation() const
{
return startLocation_;
}
inline
const LeafContentToken *OpenElement::currentPosition() const
{
return (declaredContent_ == ElementDefinition::modelGroup
? matchState_.currentPosition()
: 0);
}
inline
Boolean OpenElement::declaredEmpty() const
{
return declaredContent_ == ElementDefinition::empty;
}
inline
void OpenElement::setConref()
{
declaredContent_ = ElementDefinition::empty;
}
inline
unsigned long OpenElement::index() const
{
return index_;
}
inline
void OpenElement::setIndex(unsigned long index)
{
index_ = index;
}
#ifdef SP_NAMESPACE
}
#endif
#endif /* not OpenElement_INCLUDED */
|