Searched refs:data (Results 1 - 25 of 2243) sorted by path

1234567891011>>

/haiku/3rdparty/mmu_man/scripts/
H A Dgenerate_icon_table.sh7 for f in data/artwork/icons/*; do
14 done | xargs -d '\n' sh -c 'montage -frame 5 -background "#336699" -geometry +4+4 -font /system/data/fonts/ttfonts/NotoSans-Regular.ttf -pointsize 9 "$@" haiku_icons.png' --
/haiku/3rdparty/proj2make/
H A Dproj2make.cpp133 ParseGenB(hdr* data) argument
135 hdr* child = (hdr*)data->Data();
/haiku/build/scripts/
H A Dbootstrap_client.py54 data = sys.stdin.readline(bufferSize) variable
55 if data:
56 stdioConnection.send(data)
62 data = stdioConnection.recv(bufferSize) variable
63 if data:
64 sys.stdout.write(data)
69 data = stderrConnection.recv(bufferSize) variable
70 if data:
71 sys.stderr.write(data)
76 data variable
[all...]
H A Dbootstrap_daemon.py13 data = '';
18 data += dataReceived
20 return data
/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex40 Resources provide a means to store structured but flat data in files. Unlike
46 In either case the format of the chunk of data that frames the resources
128 regular data of the file. That is adding resources to an existing ELF file
129 will not cause any modification to its data (i.e. ELF header, program header
146 The data used for the padding between the end of the actual ELF data and the
152 Similar to ELF files the resources are simply appended to the regular data of
156 regular data), it has to be deduced by iterating through the PEF section
171 resource files big endian data. The endianess of an ELF file is encoded in
201 \multicolumn{3}{|c|}{data sectio
[all...]
/haiku/docs/develop/media/
H A DMediaExtractorAddOn.h149 const void * data,
397 // or even illegal. Attempting to decode data from the track in
H A DMediaFileProducer.h56 const void * data,
89 // const void * data,
150 /* If <npairs> is negative, use the data from line -<npairs> (there are 0 pairs after */
194 const void * data,
/haiku/headers/build/os/app/
H A DMessage.h83 // Flattening data
104 // Adding data
128 const void *data, ssize_t numBytes,
131 // Removing data
136 // Finding data
179 const void **data, ssize_t *numBytes) const;
181 const void **data, ssize_t *numBytes) const;
183 // Replacing data
225 const void *data, ssize_t numBytes);
227 const void *data, ssize_
[all...]
/haiku/headers/build/os/interface/
H A DBitmap.h9 // contain bitmap data.
48 BBitmap(BMessage *data);
49 static BArchivable *Instantiate(BMessage *data);
50 virtual status_t Archive(BMessage *data, bool deep = true) const;
65 void SetBits(const void *data, int32 length, int32 offset,
69 status_t ImportBits(const void *data, int32 length, int32 bpr,
/haiku/headers/cpp/
H A Deditbuf.h70 /* Make a fresh, contiguous copy of the data in STR.
123 // A 'edit_buffer' consists of a sequence of buf_chars (the data),
124 // a list of edit_marks pointing into the data, and a list of FILEs
125 // also pointing into the data.
137 buf_char *data; /* == emacs buffer_text.p1+1 */ member in struct:edit_buffer
155 inline buf_char *gap_end() { return data + gap_end_pos(); }
157 inline int size1() { return gap_start() - data; }
162 void move_gap (buf_char *pos) { move_gap(pos - data); }
176 { return buf->data + index_in_buffer(buf); }
/haiku/headers/cpp/std/
H A Dbastring.cc72 p->copy (0, data (), len);
74 return p->data ();
106 p->copy (0, data (), length ());
131 return replace (pos1, n1, _str.data () + pos2, n2);
139 traits::copy (data () + pos, s, n);
147 traits::move (data () + pos, s, n);
165 p->copy (0, data (), pos);
166 p->copy (pos + n2, data () + pos + n1, len - (pos + n1));
172 rep ()->move (pos + n2, data () + pos + n1, len - (pos + n1));
184 traits::set (data ()
[all...]
/haiku/headers/libs/agg/
H A Dagg_array.h149 const T* data() const { return m_array; } function in class:agg::pod_array
150 T* data() { return m_array; } function in class:agg::pod_array
160 // of a fixed size. The data is continous in memory
175 // Set new capacity. All data is lost, size is set to zero.
179 // Allocate n elements. All data is lost,
198 void deserialize(const int8u* data, unsigned byte_size);
205 const T* data() const { return m_array; } function in class:agg::pod_vector
206 T* data() { return m_array; } function in class:agg::pod_vector
248 T* data = pod_allocator<T>::allocate(new_size); local
249 memcpy(data, m_arra
292 deserialize(const int8u* data, unsigned byte_size) argument
365 add_data(DataAccessor& data) argument
453 deserialize(ByteAccessor data) argument
471 deserialize(unsigned start, const T& empty_val, ByteAccessor data) argument
730 deserialize(const int8u* data, unsigned byte_size) argument
747 deserialize(unsigned start, const T& empty_val, const int8u* data, unsigned byte_size) argument
785 int8u* data; member in struct:agg::block_allocator::block_type
[all...]
H A Dagg_dda_line.h145 void save(save_data_type* data) const
147 data[0] = m_mod;
148 data[1] = m_y;
152 void load(const save_data_type* data) argument
154 m_mod = data[0];
155 m_y = data[1];
H A Dagg_font_cache_manager.h39 int8u* data; member in struct:agg::glyph_cache
111 glyph->data = m_allocator.allocate(data_size);
300 m_engine.write_glyph_to(m_last_glyph->data);
318 m_mono_adaptor.init(gl->data, gl->data_size, x, y);
322 m_gray8_adaptor.init(gl->data, gl->data_size, x, y);
326 m_path_adaptor.init(gl->data, gl->data_size, x, y, scale);
H A Dagg_path_storage.h365 poly_plain_adaptor(const T* data, unsigned num_points, bool closed) : argument
366 m_data(data),
367 m_ptr(data),
368 m_end(data + num_points * 2),
373 void init(const T* data, unsigned num_points, bool closed) argument
375 m_data = data;
376 m_ptr = data;
377 m_end = data + num_points * 2;
431 poly_container_adaptor(const Container& data, bool closed) : argument
432 m_container(&data),
438 init(const Container& data, bool closed) argument
493 poly_container_reverse_adaptor(const Container& data, bool closed) argument
500 init(const Container& data, bool closed) argument
780 concat_poly(const T* data, unsigned num_points, bool closed) argument
790 join_poly(const T* data, unsigned num_points, bool closed) argument
[all...]
H A Dagg_path_storage_integer.h217 serialized_integer_path_adaptor(const int8u* data, unsigned size, argument
219 m_data(data),
220 m_end(data + size),
221 m_ptr(data),
228 void init(const int8u* data, unsigned size, argument
231 m_data = data;
232 m_end = data + size;
233 m_ptr = data;
H A Dagg_rasterizer_cells_aa.h91 return m_sorted_cells.data() + m_sorted_y[y - m_min_y].start;
720 qsort_cells(m_sorted_cells.data() + curr_y.start, curr_y.num);
H A Dagg_scanline_storage_aa.h441 void serialize(int8u* data) const
445 write_int32(data, min_x()); // min_x
446 data += sizeof(int32);
447 write_int32(data, min_y()); // min_y
448 data += sizeof(int32);
449 write_int32(data, max_x()); // max_x
450 data += sizeof(int32);
451 write_int32(data, max_y()); // max_y
452 data += sizeof(int32);
458 int8u* size_ptr = data;
665 serialized_scanlines_adaptor_aa(const int8u* data, unsigned size, double dx, double dy) argument
679 init(const int8u* data, unsigned size, double dx, double dy) argument
[all...]
H A Dagg_scanline_storage_bin.h266 void serialize(int8u* data) const
270 write_int32(data, min_x()); // min_x
271 data += sizeof(int32);
272 write_int32(data, min_y()); // min_y
273 data += sizeof(int32);
274 write_int32(data, max_x()); // max_x
275 data += sizeof(int32);
276 write_int32(data, max_y()); // max_y
277 data += sizeof(int32);
283 write_int32(data, sl_thi
457 serialized_scanlines_adaptor_bin(const int8u* data, unsigned size, double dx, double dy) argument
471 init(const int8u* data, unsigned size, double dx, double dy) argument
[all...]
/haiku/headers/libs/iconv/
H A Diconv.h85 typedef void (*iconv_unicode_char_hook) (unsigned int uc, void* data);
87 typedef void (*iconv_wide_char_hook) (wchar_t wc, void* data);
92 void* data; member in struct:iconv_hooks
104 void* data);
114 void* data);
125 void* data);
135 void* data);
148 void* data; member in struct:iconv_fallbacks
164 void* data),
165 void* data);
[all...]
/haiku/headers/os/add-ons/graphics/
H A DAccelerant.h24 void* get_accelerant_hook(uint32 feature, void* data);
285 typedef void (*get_accelerant_clone_info)(void* data);
286 typedef status_t (*clone_accelerant)(void* data);
/haiku/headers/os/add-ons/network_settings/
H A DNetworkSettings.h113 const BMessage& data);
140 status_t GetMessage(BMessage& data) const;
187 status_t GetMessage(BMessage& data) const;
203 const BMessage& data, int family = -1,
219 status_t GetMessage(BMessage& data) const;
272 status_t GetMessage(BMessage& data) const;
/haiku/headers/os/app/
H A DApplication.h42 BApplication(BMessage* data);
43 static BArchivable* Instantiate(BMessage* data);
44 virtual status_t Archive(BMessage* data, bool deep = true) const;
94 virtual status_t GetSupportedSuites(BMessage* data);
H A DHandler.h35 BHandler(BMessage* data);
36 static BArchivable* Instantiate(BMessage* data);
37 virtual status_t Archive(BMessage* data, bool deep = true) const;
61 virtual status_t GetSupportedSuites(BMessage* data);
H A DKey.h39 const uint8* data = NULL,
51 const uint8* data = NULL,
63 status_t SetData(const uint8* data, size_t length);

Completed in 175 milliseconds

1234567891011>>