| /openbsd-src/gnu/usr.bin/texinfo/util/ |
| H A D | texinfo.dtd | 120 <!-- TOP Level Element -->
122 <!ELEMENT texinfo ((%metainformation; | titlepage | node | %block; | %toc;
127 <!ELEMENT setfilename (#PCDATA)>
128 <!ELEMENT settitle (#PCDATA | %Inline.phrase; | footnote)*>
129 <!ELEMENT dircategory (#PCDATA)>
131 <!ELEMENT setvalue (#PCDATA | %Inline.phrase;)*>
132 <!ELEMENT clearvalue EMPTY>
139 <!ELEMENT contents EMPTY>
140 <!ELEMENT shortcontents EMPTY>
143 <!ELEMENT documentlanguage EMPTY>
[all …]
|
| /openbsd-src/gnu/llvm/clang/bindings/xml/ |
| H A D | comment-xml-schema.rng | 21 <element name="Other">
48 </element>
52 <element name="Function">
111 </element>
115 <element name="Class">
156 </element>
160 <element name="Variable">
192 </element>
196 <element name="Namespace">
228 </element>
[all …]
|
| /openbsd-src/share/man/man9/ |
| H A D | RBT_INIT.9 | 185 that allows the element to be connected to a tree.
190 element.
253 inserts the element
262 If a matching element already exists in the tree, the insertion is
263 aborted and a pointer to the existing element is returned.
266 removes the element
301 returns the root element in the red-black tree
307 returns the lowest ordered element in the red-black tree
313 returns the highest ordered element in the red-black tree
317 .Ss Red-Black Tree Element Operations
[all …]
|
| H A D | SMR_LIST_INIT.9 | 172 When an element has been removed from the data structure, the element
179 to ensure that the element can no longer be accessed by readers.
193 return the first element on the list
200 return the successor of the element
220 It is permitted to remove the element referenced by variable
226 inserts the new element
231 inserts the new element
233 after the element
237 removes the first element of the list
241 removes the list element immediately following
[all …]
|
| /openbsd-src/sys/scsi/ |
| H A D | scsi_changer.h | 71 * Exchange the medium in the source element with the medium
72 * located at the destination element.
78 u_int8_t tea[2]; /* transport element address */
90 * other status relevant to the element.
101 * Request the changer to move a unit of media from the source element
102 * to the destination element.
108 u_int8_t tea[2]; /* transport element address */
109 u_int8_t src[2]; /* source element address */
110 u_int8_t dst[2]; /* destination element address */
118 * Position the specified transport element (picker) in front of
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | bitmap.c | 43 bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
72 /* Free a bitmap element. Since these are allocated off the
103 /* Allocate a bitmap element. The bits are cleared, but nothing else is. */
109 bitmap_element *element; local
115 element = bitmap_free;
116 bitmap_free = element->next;
149 element = (bitmap_element *) obstack_alloc (&bitmap_obstack,
157 element = bitmap_ggc_free;
158 bitmap_ggc_free = element->next;
161 element = ggc_alloc (sizeof (bitmap_element));
[all …]
|
| /openbsd-src/share/man/man3/ |
| H A D | queue.3 | 254 Insertion of a new entry after any element in the list.
303 Insertion of a new entry before any element in the list.
312 Each element requires two pointers rather than one.
382 This structure contains a single pointer to the first element on the list.
385 New elements can be added to the list after an existing element or
435 macro inserts the new element
441 macro inserts the new element
443 after the element
448 macro removes the first element of the list pointed by
453 macro removes the list element immediately following
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/lib/Class/ |
| H A D | Struct.pm | 68 # struct( class => [ element-list ])
69 # struct( class => { element-list })
70 # struct( element-list )
177 croak "'$type' is not a valid struct element type";
281 my $element_value = $obj->s; # element value
282 $obj->s('new value'); # assign to element
286 my $ary_element_value = $obj->a(2); # array element value
287 $obj->a(2, 'new value'); # assign to array element
291 my $hash_element_value = $obj->h('x'); # hash element value
292 $obj->h('x', 'new value'); # assign to hash element
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/cpan/CPAN-Meta/t/data-valid/ |
| H A D | 1206545041-META.yml | 66 PDF::Template::Element:
67 file: lib/PDF/Template/Element.pm
69 PDF::Template::Element::Bookmark:
70 file: lib/PDF/Template/Element/Bookmark.pm
72 PDF::Template::Element::Circle:
73 file: lib/PDF/Template/Element/Circle.pm
75 PDF::Template::Element::HorizontalRule:
76 file: lib/PDF/Template/Element/HorizontalRule.pm
78 PDF::Template::Element::Image:
79 file: lib/PDF/Template/Element/Image.pm
[all …]
|
| /openbsd-src/sys/sys/ |
| H A D | chio.h | 40 * Element types. Used as "to" and "from" type indicators in move
61 int cm_fromtype; /* element type to move from */
62 int cm_fromunit; /* logical unit of from element */
63 int cm_totype; /* element type to move to */
64 int cm_tounit; /* logical unit of to element */
85 int ce_srctype; /* element type of source */
87 int ce_fdsttype; /* element type of first destination */
89 int ce_sdsttype; /* element type of second destination */
99 * Structure used to execute a POSITION TO ELEMENT command. This
100 * moves the current picker in front of the specified element.
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/LogicalView/Core/ |
| H A D | LVCompare.cpp | 63 LVCompareInfo::iterator getResultsEntry(LVElement *Element) { in getResultsEntry() argument
65 if (Element->getIsLine()) in getResultsEntry()
67 else if (Element->getIsScope()) in getResultsEntry()
69 else if (Element->getIsSymbol()) in getResultsEntry()
80 void updateExpected(LVElement *Element) { in updateExpected() argument
81 LVCompareInfo::iterator Iter = getResultsEntry(Element); in updateExpected()
84 // Update total for specific element kind. in updateExpected()
88 void updateMissingOrAdded(LVElement *Element, LVComparePass Pass) { in updateMissingOrAdded() argument
89 LVCompareInfo::iterator Iter = getResultsEntry(Element); in updateMissingOrAdded()
190 // element. If a difference is found, the reference element is marked as in execute()
[all …]
|
| H A D | LVElement.cpp | 22 #define DEBUG_TYPE "Element"
41 // Set the element type.
42 void LVElement::setGenericType(LVElement *Element) { in setGenericType() argument
43 if (!Element->isTemplateParam()) { in setGenericType()
44 setType(Element); in setGenericType()
49 if (Element->getIsKindType()) in setGenericType()
50 setType(Element->getTypeAsType()); in setGenericType()
51 else if (Element->getIsKindScope()) in setGenericType()
52 setType(Element->getTypeAsScope()); in setGenericType()
54 setType(Element); in setGenericType()
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/cpan/CPAN-Meta/lib/CPAN/Meta/ |
| H A D | Converter.pm | 93 # called as $converter->($element, $field_name, $full_meta, $to_version)
139 my ($element, undef, undef, $version) = @_;
175 my ($element) = @_;
176 return 'unknown' unless defined $element;
177 if ( $license_map_1{lc $element} ) {
178 return $license_map_1{lc $element};
231 my ($element) = @_;
232 return [ 'unknown' ] unless defined $element;
233 $element = [ $element ] unless ref $element eq 'ARRAY';
235 for my $lic ( @$element ) {
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/DebugInfo/Symbolize/ |
| H A D | Markup.cpp | 63 "At most one multi-line element can be finished at a time."); in nextNode()
65 // Parse the multi-line element as if it were contiguous. in nextNode()
70 // The whole line is part of the multi-line element. in nextNode()
76 // Find the first valid markup element, if any. in nextNode()
77 if (std::optional<MarkupNode> Element = parseElement(Line)) { in nextNode() local
78 parseTextOutsideMarkup(takeTo(Line, Element->Text.begin())); in nextNode()
79 Buffer.push_back(std::move(*Element)); in nextNode()
80 advanceTo(Line, Element->Text.end()); in nextNode()
85 // multi-line element. in nextNode()
87 // Emit any text before the element. in nextNode()
[all …]
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | bitmap.c | 33 bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
67 /* Free a bitmap element. Since these are allocated off the
98 /* Allocate a bitmap element. The bits are cleared, but nothing else is. */
103 bitmap_element *element; in bitmap_element_allocate() local
108 element = bit_obstack->elements; in bitmap_element_allocate()
110 if (element) in bitmap_element_allocate()
112 element of the outer list. */ in bitmap_element_allocate()
113 if (element->next) in bitmap_element_allocate()
115 bit_obstack->elements = element->next; in bitmap_element_allocate()
116 bit_obstack->elements->prev = element->prev; in bitmap_element_allocate()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/LogicalView/Core/ |
| H A D | LVElement.h | 10 // information element.
102 // Typed bitvector with properties for this element.
118 // The given Specification points to an element that is connected via the
126 // Type of this element.
178 // The Element class type can point to a Type or Scope.
189 // Get pathname associated with the Element.
194 // Set filename associated with the Element.
197 // Set the Element qualified name.
208 // Element type name.
217 virtual void setReference(LVElement *Element) {} in setReference() argument
[all …]
|
| /openbsd-src/usr.bin/dig/lib/isc/include/isc/ |
| H A D | heap.h | 67 * argument. This function will be called whenever an element's
93 * \brief Inserts a new element into a heap.
102 * \brief Deletes an element from a heap, by element index.
106 *\li "index" is a valid element index, as provided by the "index" callback
113 * \brief Indicates to the heap that an element's priority has increased.
114 * This function MUST be called whenever an element has increased in priority.
118 *\li "index" is a valid element index, as provided by the "index" callback
125 * \brief Indicates to the heap that an element's priority has decreased.
126 * This function MUST be called whenever an element has decreased in priority.
130 *\li "index" is a valid element index, as provided by the "index" callback
[all …]
|
| /openbsd-src/usr.sbin/nsd/ |
| H A D | radtree.h | 38 /** data element associated with the binary string up to this node */
93 * Insert element into radix tree.
97 * @param elem: pointer to element data.
100 * On success the new radix node for this element.
106 * Delete element from radix tree.
108 * @param n: radix node for that element.
114 * Find radix element in tree.
124 * Find radix element in tree, and if not found, find the closest smaller or
125 * equal element in the tree.
137 * Return the first (smallest) element in the tree.
[all …]
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | stl_map.h | 156 * @param x A %map of identical element and allocator types.
206 * @param x A %map of identical element and allocator types.
297 // [23.3.1.2] element access
328 * @return A pair, of which the first element is an iterator that points
334 * first element (the key) is not already present in the %map.
348 * @return An iterator that points to the element with key of @a x (may
380 * @brief Erases an element from a %map.
381 * @param position An iterator pointing to the element to be erased.
383 * This function erases an element, pointed to by the given iterator, from
384 * a %map. Note that this function only erases the element, and that if
[all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_set.h | 188 * @param x A %set of identical element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
198 * @param x A %set of identical element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
226 * Returns a read/write iterator that points to the first element in the in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
234 * Returns a read/write iterator that points one past the last element in in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
242 * Returns a read/write reverse iterator that points to the last element in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
276 * @param x A %set of the same element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
291 * @brief Attempts to insert an element into the %set. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
292 * @param x Element to be inserted. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
293 * @return A pair, of which the first element is an iterator that points in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
294 * to the possibly inserted element, and the second is a bool in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
|
| H A D | stl_multiset.h | 178 * @param x A %multiset of identical element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
188 * @param x A %multiset of identical element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
216 * Returns a read/write iterator that points to the first element in the in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
225 * Returns a read/write iterator that points one past the last element in in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
234 * Returns a read/write reverse iterator that points to the last element in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
243 * Returns a read/write reverse iterator that points to the last element in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
268 * @param x A %multiset of the same element and allocator types. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
283 * @brief Inserts an element into the %multiset. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
284 * @param x Element to be inserted. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
285 * @return An iterator that points to the inserted element. in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
|
| /openbsd-src/gnu/llvm/clang/docs/ |
| H A D | MatrixTypes.rst | 23 A matrix type is a scalar type with an underlying *element type*, a constant
25 element type, rows, and columns are the same type. A value of a matrix type
26 includes storage for ``rows * columns`` values of the *element type*. The
33 Currently, the element type of a matrix is only permitted to be one of the
47 of the *typedef* must be a valid matrix element type. The
52 element type of the former underlying type.
56 same element type, number of rows, and number of columns.
68 element type of the result type. The result is a matrix where each element is
69 the converted corresponding element.
72 if it can be converted to the element type of the matrix. The result is a
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/dist/Dumpvalue/t/ |
| H A D | rt-134441-dumpvalue.t | 43 'dumpValue worked on array ref, first element undefined' );
47 'dumpValues worked on array, first element undefined' );
49 "dumpValues called on array returns same as dumpValue on array ref, first element undefined");
55 'dumpValue worked on array ref, last element undefined' );
59 'dumpValues worked on array, last element undefined' );
61 "dumpValues called on array returns same as dumpValue on array ref, last element undefined");
67 'dumpValue worked on array ref, first element empty string' );
71 'dumpValues worked on array, first element empty string' );
73 … "dumpValues called on array returns same as dumpValue on array ref, first element empty string");
79 'dumpValue worked on array ref, last element empty string' );
[all …]
|
| /openbsd-src/gnu/usr.bin/binutils/gdb/tui/ |
| H A D | tui-data.c | 481 init_content_element (struct tui_win_element * element, enum tui_win_type type) in init_content_element() argument
483 element->highlight = FALSE; in init_content_element()
488 element->which_element.source.line = (char *) NULL; in init_content_element()
489 element->which_element.source.line_or_addr.line_no = 0; in init_content_element()
490 element->which_element.source.is_exec_point = FALSE; in init_content_element()
491 element->which_element.source.has_break = FALSE; in init_content_element()
494 tui_init_generic_part (&element->which_element.data_window); in init_content_element()
495 element->which_element.data_window.type = DATA_ITEM_WIN; in init_content_element()
496 ((struct tui_gen_win_info *) & element->which_element.data_window)->content = in init_content_element()
499 & element->which_element.data_window)->content_size = 1; in init_content_element()
[all …]
|
| /openbsd-src/lib/libc/stdlib/ |
| H A D | lsearch.c | 45 void *element = lfind(key, base, nelp, width, compar); in lsearch() local
51 if (element == NULL) { in lsearch()
52 element = memmove((char *)base + *nelp * width, key, width); in lsearch()
55 return element; in lsearch()
62 const char *element, *end; in lfind() local
65 for (element = base; element < end; element += width) in lfind()
66 if (!compar(key, element)) /* key found */ in lfind()
67 return((void *)element); in lfind()
|