Searched defs:element (Results 1 - 25 of 44) sorted by relevance

12

/vbox/src/VBox/Additions/WINNT/Graphics/Wine/wined3d/
H A Dvertexdeclaration.c39 static void dump_wined3dvertexelement(const WINED3DVERTEXELEMENT *element) { argument
40 TRACE(" format: %s (%#x)\n", debug_d3dformat(element->format), element->format);
41 TRACE(" input_slot: %u\n", element->input_slot);
42 TRACE(" offset: %u\n", element->offset);
43 TRACE("output_slot: %u\n", element->output_slot);
44 TRACE(" method: %s (%#x)\n", debug_d3ddeclmethod(element->method), element->method);
45 TRACE(" usage: %s (%#x)\n", debug_d3ddeclusage(element->usage), element
100 declaration_element_valid_ffp(const WINED3DVERTEXELEMENT *element) argument
[all...]
/vbox/src/libs/xpcom18a4/xpcom/ds/
H A DnsCOMArray.cpp137 nsISupports* element = ObjectAt(aIndex); local
138 if (element) {
141 NS_IF_RELEASE(element);
151 nsISupports* element = NS_STATIC_CAST(nsISupports*, aElement); local
152 NS_IF_RELEASE(element);
H A DnsArray.cpp172 nsISupports* element = local
177 element == closure->targetElement) {
H A DnsSupportsArray.h70 nsISupports* element = mArray[aIndex]; local
71 if (nsnull != element)
72 return element->QueryInterface(aIID, aResult);
H A DnsPersistentProperties.cpp332 nsPropertyElement *element = local
335 if (!element)
338 NS_ADDREF(element);
339 propArray->InsertElementAt(element, i);
H A DnsHashtable.cpp285 // XXX This method was called _hashEnumerateCopy, but it didn't copy the element!
811 nsISupports* element = NS_STATIC_CAST(nsISupports*, aData); local
812 NS_IF_RELEASE(element);
842 nsISupports* element = NS_REINTERPRET_CAST(nsISupports*, data);
843 NS_IF_ADDREF(element);
844 return element;
853 nsISupports* element = NS_STATIC_CAST(nsISupports*, data); local
855 *value = element;
857 NS_IF_RELEASE(element);
869 nsISupports* element local
[all...]
H A DnsSupportsArray.cpp326 nsISupports* element = mArray[aIndex]; local
327 NS_IF_ADDREF(element);
328 return element;
512 // can't extend the array when moving an element. Also catches mImpl = null
519 // Moving one element closer to the head; the elements inbetween move down
526 // Moving one element closer to the tail; the elements inbetween move up
/vbox/src/libs/xpcom18a4/xpcom/tests/
H A DTestVoidBTree.cpp56 printf("element %d differs; ", i);
71 for (nsVoidBTree::ConstIterator element = aTest.First(); element != last; ++element, ++index) {
72 if (*element != aControl[index]) {
89 nsVoidBTree::ConstIterator element = aTest.Last(); local
91 if (first != element) {
93 if (*--element != aControl[--index]) {
97 } while (element != first);
272 void* element local
[all...]
/vbox/src/VBox/Devices/EFI/Firmware/VBoxPkg/VBoxFsDxe/
H A Dfsw_lib.c472 * element string descriptor is filled to point at the part of the buffer string
476 * If the separator is not found in the buffer string, then element is changed to
485 void fsw_strsplit(struct fsw_string *element, struct fsw_string *buffer, char separator) argument
490 element->type = FSW_STRING_TYPE_EMPTY;
495 *element = *buffer;
500 p = (fsw_u8 *)element->data;
508 element->len = i;
514 element->size = element->len;
520 p = (fsw_u16 *)element
[all...]
/vbox/src/libs/xpcom18a4/nsprpub/pr/src/misc/
H A Dpratom.c398 PRStackElem *element; local
401 element = stack->prstk_head.prstk_elem_next;
402 if (element != NULL) {
403 stack->prstk_head.prstk_elem_next = element->prstk_elem_next;
404 element->prstk_elem_next = NULL; /* debugging aid */
407 return element;
/vbox/src/VBox/Devices/Network/lwip-new/src/core/
H A Dmem.c73 * to contain an element of 'size' and get an element from that pool.
82 struct memp_malloc_helper *element; local
90 /* is this pool big enough to hold an element of the required size
91 plus a struct memp_malloc_helper that saves the pool this element came from? */
100 element = (struct memp_malloc_helper*)memp_malloc(poolnr);
101 if (element == NULL) {
114 /* save the pool number this element came from */
115 element->poolnr = poolnr;
117 ret = (u8_t*)element
[all...]
/vbox/src/VBox/GuestHost/OpenGL/util/
H A Dlist.c12 void *element; member in struct:CRListIterator
57 t2->element = NULL;
90 p->element = elem;
107 iter->element = NULL;
154 return l->head->next->element;
163 return l->tail->prev->element;
198 return iter->element;
201 CRListIterator *crListFind( CRList *l, void *element, CRListCompareFunc compare ) argument
210 if ( compare( element, iter->element )
[all...]
H A Dsortarray.cpp55 static int crSaSearch(const CR_SORTARRAY *pArray, uint64_t element) argument
66 if (el == element)
68 else if (el < element)
97 static int crSaInsAt(CR_SORTARRAY *pArray, uint32_t iPos, uint64_t element) argument
123 pArray->pElements[iPos] = element;
143 static int crSaAdd(CR_SORTARRAY *pArray, uint64_t element) argument
151 return crSaInsAt(pArray, 0, element);
158 if (el == element)
160 else if (el < element)
166 if (el < element)
171 crSaRemove(CR_SORTARRAY *pArray, uint64_t element) argument
184 CrSaContains(const CR_SORTARRAY *pArray, uint64_t element) argument
189 CrSaAdd(CR_SORTARRAY *pArray, uint64_t element) argument
194 CrSaRemove(CR_SORTARRAY *pArray, uint64_t element) argument
270 uint64_t element; local
[all...]
/vbox/src/VBox/Frontends/VirtualBox/src/selector/graphics/details/
H A DUIGDetailsSet.cpp127 /* Should the element be visible? */
129 /* Should the element be opened? */
132 /* Check if element is present already: */
133 UIGDetailsElement *pElement = element(elementType);
136 /* Create element if necessary: */
144 /* Show element if necessary: */
147 /* Show the element: */
154 /* Hide element if necessary: */
157 /* Hide the element: */
168 /* For visible element
323 UIGDetailsElement* UIGDetailsSet::element(DetailsElementType elementType) const function in class:UIGDetailsSet
[all...]
/vbox/src/VBox/Additions/haiku/SharedFolders/
H A DOpenHashTable.h275 ValueType* element = fTable[i]; local
276 if (element != NULL)
279 *nextPointer = element;
282 // element in the bucket
283 while (element != NULL)
285 nextPointer = &_Link(element);
286 element = *nextPointer;
/vbox/src/VBox/Additions/WINNT/Graphics/Wine_new/d3d8/
H A Dvertexdeclaration.c273 struct wined3d_vertex_element *element; local
296 TRACE("Adding element %d:\n", element_count);
298 element = *wined3d_elements + element_count++;
299 element->format = wined3d_format_lookup[type];
300 element->input_slot = stream;
301 element->offset = offset;
302 element->output_slot = reg;
303 element->method = WINED3D_DECL_METHOD_DEFAULT;
304 element->usage = wined3d_usage_lookup[reg].usage;
305 element
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine_new/d3d9/
H A Dvertexdeclaration.c334 const D3DVERTEXELEMENT9* element; local
340 element = d3d9_elements;
341 while (element++->Stream != 0xff && count++ < 128);
345 /* Skip the END element */
358 WARN("Invalid element type %#x.\n", d3d9_elements[i].Type);
/vbox/src/VBox/Additions/WINNT/Graphics/Wine_new/wined3d/
H A Dvertexdeclaration.c40 static void dump_wined3d_vertex_element(const struct wined3d_vertex_element *element) argument
42 TRACE(" format: %s (%#x)\n", debug_d3dformat(element->format), element->format);
43 TRACE(" input_slot: %u\n", element->input_slot);
44 TRACE(" offset: %u\n", element->offset);
45 TRACE("output_slot: %u\n", element->output_slot);
46 TRACE(" method: %s (%#x)\n", debug_d3ddeclmethod(element->method), element->method);
47 TRACE(" usage: %s (%#x)\n", debug_d3ddeclusage(element->usage), element
83 declaration_element_valid_ffp(const struct wined3d_vertex_element *element) argument
[all...]
H A Ddrawprim.c129 const struct wined3d_stream_info_element *element; local
157 element = &si->elements[WINED3D_FFP_POSITION];
158 position = element->data.addr;
163 element = &si->elements[WINED3D_FFP_NORMAL];
164 normal = element->data.addr;
174 element = &si->elements[WINED3D_FFP_DIFFUSE];
175 diffuse = element->data.addr;
177 if (num_untracked_materials && element->format->id != WINED3DFMT_B8G8R8A8_UNORM)
178 FIXME("Implement diffuse color tracking from %s\n", debug_d3dformat(element->format->id));
187 element
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine/d3d8/
H A Dvertexdeclaration.c330 WINED3DVERTEXELEMENT *element; local
352 TRACE("Adding element %d:\n", element_count);
354 element = *wined3d_elements + element_count++;
355 element->format = wined3d_format_lookup[type];
356 element->input_slot = stream;
357 element->offset = offset;
358 element->output_slot = reg;
359 element->method = WINED3DDECLMETHOD_DEFAULT;
360 element->usage = wined3d_usage_lookup[reg].usage;
361 element
[all...]
/vbox/src/VBox/Additions/WINNT/Graphics/Wine/d3d9/
H A Dvertexdeclaration.c335 const D3DVERTEXELEMENT9* element; local
341 element = d3d9_elements;
342 while (element++->Stream != 0xff && count++ < 128);
346 /* Skip the END element */
359 WARN("Invalid element type %#x.\n", d3d9_elements[i].Type);
/vbox/src/libs/xpcom18a4/nsprpub/pr/src/md/unix/
H A Daix.c311 PRStackElem *element; local
317 while ((element = stack->prstk_head.prstk_elem_next) ==
321 (int)element, _PR_AIX_ATOMIC_LOCK);
324 if (element == NULL) {
328 (int) element->prstk_elem_next);
330 return element;
H A Dopenvms.c139 PRStackElem *element; local
150 element = (PRStackElem *) locked;
152 if (element == NULL) {
156 element->prstk_elem_next;
162 return element;
/vbox/src/VBox/Devices/Network/slirp/
H A Dmisc.c65 register struct quehead *element = (struct quehead *) a; local
68 element->qh_link = head->qh_link;
69 head->qh_link = (struct quehead *)element;
70 element->qh_rlink = (struct quehead *)head;
71 ((struct quehead *)(element->qh_link))->qh_rlink = (struct quehead *)element;
77 register struct quehead *element = (struct quehead *) a; local
79 ((struct quehead *)(element->qh_link))->qh_rlink = element->qh_rlink;
80 ((struct quehead *)(element
[all...]
H A Dqueue.h70 * added to the list after an existing element or at the head of the list.
81 * to the list after an existing element, at the head of the list, or at the
90 * so that an arbitrary element can be removed without a need to
92 * or after an existing element or at the head of the list. A list
97 * linked so that an arbitrary element can be removed without a need to
99 * after an existing element, at the head of the list, or at the end of
129 /* Store the last 2 places the queue element or head was altered */
166 struct type *slh_first; /* first element */ \
174 struct type *sle_next; /* next element */ \
238 struct type *stqh_first;/* first element */ \
615 struct quehead *element = (struct quehead *)a, local
627 struct quehead *element = (struct quehead *)a; local
[all...]

Completed in 1899 milliseconds

12