HomeSort by: relevance | last modified time | path
    Searched refs:n_elements (Results 1 - 7 of 7) sorted by relevancy

  /xsrc/external/mit/xf86-video-qxl/dist/src/
qxl_ring.c 46 int n_elements; member in struct:qxl_ring
54 int n_elements,
66 ring->n_elements = n_elements;
91 idx = header->prod & (ring->n_elements - 1);
118 idx = header->cons & (ring->n_elements - 1);
mspace.h 89 void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size);
101 //void** mspace_independent_calloc(mspace msp, size_t n_elements,
108 //void** mspace_independent_comalloc(mspace msp, size_t n_elements,
qxl.h 430 int n_elements,
mspace.c 2352 void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size) {
2360 if (n_elements != 0) {
2361 req = n_elements * elem_size;
2362 if (((n_elements | elem_size) & ~(size_t)0xffff) &&
2363 (req / n_elements != elem_size))
  /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
rectBlock.h 63 Int n_elements; member in class:rectBlockArray
69 Int get_n_elements() {return n_elements;}
rectBlock.cc 123 for(Int i=0; i<n_elements; i++)
131 n_elements = 0;
155 if(n_elements == size) //full
163 for(i=0; i<n_elements; i++)
171 array[n_elements++] = newBlock;
177 for(i=0; i<n_elements; i++)
184 for(i=0; i<n_elements; i++)
  /xsrc/external/mit/viewres/dist/
viewres.c 83 int n_elements;
366 for (cur = start; start < selected_list.n_elements; start++, src++) {
383 if (selected_list.n_elements >= selected_list.max_elements) {
388 INSERT_NODE(node, selected_list.n_elements);
389 selected_list.n_elements++;
407 if (selected_list.n_elements > 1) {
413 selected_list.n_elements -= skips;
431 selected_list.n_elements -= copydown(start);
499 for (int i = 0; i < selected_list.n_elements; i++) {
526 args[0].value = (XtArgVal) (selected_list.n_elements > 0 ? TRUE : FALSE)
77 int n_elements; member in struct:WidgetList
    [all...]

Completed in 23 milliseconds