Searched refs:start (Results 1 - 25 of 624) sorted by path

1234567891011>>

/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex67 x86 resource files introduce the least overhead. The resources start directly
77 The resources start at \code{kX86ResourcesOffset}.
83 resources start.
122 The resources start at \code{kPPCResourcesOffset}.
154 start directly after the last PEF section without any padding.
426 Nonterminals start with an upper case, terminals with a lower case letter.
/haiku/headers/cpp/
H A Deditbuf.h41 // Logical pos from start of buffer (does not count gap).
44 // Pos from start of buffer, possibly including gap_size.
59 // A edit_string is defined as the region between the 'start' and 'end' marks.
60 // Normally (always?) 'start->insert_before()' should be false,
64 struct edit_buffer *buffer; // buffer that 'start' and 'end' belong to
65 struct edit_mark *start, *end; member in struct:edit_string
69 { buffer = b; start = ms; end = me; }
130 // The gap start is defined by de-referencing a (buf_char**).
168 void delete_range(struct edit_mark *start, struct edit_mark *end);
/haiku/headers/cpp/std/
H A Dgslice.h58 size_t start () const;
69 gslice::start () const function in class:gslice
H A Dslice.h43 size_t start () const;
59 slice::start () const function in class:slice
H A Dslice_array.h98 _M_array (__a.begin () + __s.start ()) {}
H A Dvalarray_meta.h507 { return _M_expr[_M_slice.start () + __i * _M_slice.stride ()]; }
520 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
/haiku/headers/libs/agg/
H A Dagg_array.h449 void deserialize(unsigned start, const T& empty_val,
471 void deserialize(unsigned start, const T& empty_val, ByteAccessor data) argument
473 while(m_size < start)
482 if(start + i < m_size)
484 ptr = (int8u*)(&((*this)[start + i]));
744 // Replace or add a number of elements starting from "start" position
747 void pod_bvector<T, S>::deserialize(unsigned start, const T& empty_val, argument
750 while(m_size < start)
758 if(start + i < m_size)
760 memcpy(&((*this)[start
1089 range_adaptor(Array& array, unsigned start, unsigned size) argument
[all...]
H A Dagg_bounding_rect.h30 unsigned start, unsigned num,
45 vs.rewind(gi[start + i]);
29 bounding_rect(VertexSource& vs, GetId& gi, unsigned start, unsigned num, CoordT* x1, CoordT* y1, CoordT* x2, CoordT* y2) argument
H A Dagg_gamma_functions.h79 void start(double s) { m_start = s; } function in class:agg::gamma_linear
81 double start() const { return m_start; } function in class:agg::gamma_linear
H A Dagg_image_filters.h82 int start() const { return m_start; } function in class:agg::image_filter_lut
H A Dagg_path_storage.h707 unsigned arrange_polygon_orientation(unsigned start, path_flags_e orientation);
710 void invert_polygon(unsigned start);
800 unsigned perceive_polygon_orientation(unsigned start, unsigned end);
801 void invert_polygon(unsigned start, unsigned end);
1176 unsigned path_base<VC>::perceive_polygon_orientation(unsigned start, argument
1181 unsigned np = end - start;
1187 m_vertices.vertex(start + i, &x1, &y1);
1188 m_vertices.vertex(start + (i + 1) % np, &x2, &y2);
1197 void path_base<VC>::invert_polygon(unsigned start, unsigned end) argument
1200 unsigned tmp_cmd = m_vertices.command(start);
1222 invert_polygon(unsigned start) argument
1243 arrange_polygon_orientation(unsigned start, path_flags_e orientation) argument
1282 arrange_orientations(unsigned start, path_flags_e orientation) argument
1307 unsigned start = 0; local
[all...]
H A Dagg_rasterizer_cells_aa.h57 unsigned start; member in struct:agg::rasterizer_cells_aa::sorted_y
91 return m_sorted_cells.data() + m_sorted_y[y - m_min_y].start;
359 //Vertical line - we have to calculate start and end cells,
513 void qsort_cells(Cell** start, unsigned num) argument
520 limit = start + num;
521 base = start;
666 m_sorted_y[cell_ptr->y - m_min_y].start++;
675 m_sorted_y[cell_ptr->y - m_min_y].start++;
680 unsigned start = 0; local
683 unsigned v = m_sorted_y[i].start;
[all...]
H A Dagg_rasterizer_outline_aa.h82 void draw(draw_vars& dv, unsigned start, unsigned end);
230 unsigned start,
236 for(i = start; i < end; i++)
229 draw(draw_vars& dv, unsigned start, unsigned end) argument
H A Dagg_renderer_outline_image.h947 int start = m_start; local
988 m_start = start + uround(lp.len / m_scale_x);
H A Dagg_span_gouraud_gray.h165 int start = pc1->m_x - (x << subpixel_shift); local
166 v -= start;
167 a -= start;
168 nlen += start;
176 // for overflow. It lasts until "start" is positive;
179 while(len && start > 0)
190 start -= subpixel_scale;
H A Dagg_span_gouraud_rgba.h179 int start = pc1->m_x - (x << subpixel_shift); local
180 r -= start;
181 g -= start;
182 b -= start;
183 a -= start;
184 nlen += start;
192 // for overflow. It lasts until "start" is positive;
195 while(len && start > 0)
214 start -= subpixel_scale;
H A Dagg_span_image_filter_gray.h465 int start = base_type::filter().start(); local
490 fg_ptr = (const value_type*)base_type::source().span(x_lr + start,
491 y_lr + start,
H A Dagg_span_image_filter_rgb.h568 int start = base_type::filter().start(); local
593 fg_ptr = (const value_type*)base_type::source().span(x_lr + start,
594 y_lr + start,
H A Dagg_span_image_filter_rgba.h585 int start = base_type::filter().start(); local
610 fg_ptr = (const value_type*)base_type::source().span(x_lr + start,
611 y_lr + start,
/haiku/headers/os/drivers/pcmcia/
H A Dss.h109 u_short start, stop; member in struct:pccard_io_map
123 u_int start, stop; member in struct:cb_bridge_map
/haiku/headers/os/interface/
H A DColorControl.h27 BColorControl(BPoint start,
H A DGradientLinear.h22 BGradientLinear(const BPoint& start,
28 void SetStart(const BPoint& start);
H A DInput.h41 status_t watch_input_devices(BMessenger target, bool start);
/haiku/headers/os/locale/
H A DFormat.h36 int32 start; member in struct:format_field_position
/haiku/headers/os/midi/
H A DMidiText.h45 void ResetTimer(bool start = false);

Completed in 123 milliseconds

1234567891011>>