Searched refs:field (Results 1 - 25 of 99) sorted by path

1234

/haiku/docs/develop/kits/storage/resources/
H A DResourcesFormat.tex135 a size field, it has to be deduced, where the file ends. This end offset is
155 As no field exists, that tells about the size of the PEF container (the
178 first field of the resources header (\code{rh\_resources\_magic}, see
402 certain field of this type is, it may help to imagine, that before the
409 \code{index} the index of an unused field in \code{resources}, then it holds:
423 a block that starts with a type field.
496 \code{ri\_name\_size} specifies the size of this field (including the
/haiku/headers/build/os/app/
H A DMessage.h291 status_t _RemoveField(field_header* field);
/haiku/headers/compatibility/bsd/sys/
H A Dqueue.h164 #define SLIST_FOREACH(var, head, field) \
167 (var) = SLIST_NEXT((var), field))
169 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
171 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
174 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
177 (varp) = &SLIST_NEXT((var), field))
183 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
184 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
185 SLIST_NEXT((slistelm), field)
[all...]
/haiku/headers/libs/libfdt/
H A Dlibfdt.h143 #define fdt_get_header(fdt, field) \
144 (fdt32_to_cpu(((const struct fdt_header *)(fdt))->field))
/haiku/headers/os/app/
H A DMessage.h542 status_t _RemoveField(field_header* field);
/haiku/headers/os/package/
H A DPackageInfo.h234 const char* field,
237 const char* field,
240 const char* field,
244 const char* field,
248 const char* field,
251 static status_t _AddUsers(BMessage* archive, const char* field,
255 const char* field, int32 index,
258 const char* field, BStringList& _list);
260 const char* field,
263 const char* field,
[all...]
/haiku/headers/private/firewire/
H A Dfwglue.h58 #define __offsetof(type, field) ((size_t)(&((type *)0)->field))
H A Dqueue.h159 #define SLIST_FOREACH(var, head, field) \
162 (var) = SLIST_NEXT((var), field))
164 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
166 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
169 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
172 (varp) = &SLIST_NEXT((var), field))
178 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
179 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
180 SLIST_NEXT((slistelm), field)
[all...]
/haiku/headers/private/interface/
H A DColumnListView.h119 // for each column in the list, associated by their "logical field"
132 void SetField(BField* field,
144 void ValidateField(const BField* field,
180 virtual void DrawField(BField* field, BRect rect,
185 BField* field, BRect fieldRect,
188 BField* field, BRect fieldRect,
191 BField* field);
194 virtual float GetPreferredWidth(BField* field,
212 \param field The BField derivative to validate.
223 logical field inde
[all...]
H A DColumnTypes.h5 / Description: Experimental classes that implement particular column/field
41 virtual float GetPreferredWidth(BField* field, BView* parent) const;
80 virtual void DrawField(BField* field, BRect rect, BView* parent);
82 virtual float GetPreferredWidth(BField* field, BView* parent) const;
83 virtual bool AcceptsField(const BField* field) const;
121 virtual void DrawField(BField* field, BRect rect, BView* parent);
152 virtual void DrawField(BField* field, BRect rect, BView* parent);
180 virtual void DrawField(BField* field, BRect rect, BView* parent);
208 virtual void DrawField(BField* field, BRect rect, BView* parent);
210 virtual bool AcceptsField(const BField* field) cons
[all...]
/haiku/headers/private/kernel/util/
H A DKMessage.h61 KMessageField* field = NULL);
63 KMessageField* field) const;
65 KMessageField* field) const;
66 status_t GetNextField(KMessageField* field) const;
212 int32 elementSize, KMessageField* field);
213 status_t _AddFieldData(KMessageField* field,
567 // don't use _GetType() here, since it checks field size == sizeof(T)
/haiku/headers/private/mail/
H A DProtocolConfigView.h85 const char* name, BMenuField* field) const;
H A Dmail_util.h92 status_t extract_from_header(const BString& header, const BString& field,
96 // retrieves the mail address only from an address header formatted field
99 // Given a header field (usually the From: e-mail address) with gobbledygook in
/haiku/headers/private/package/
H A DActivationTransaction.h61 const char* field, BStringList& _list);
H A DDaemonClient.h59 const char* field, BPackageInfoSet& _infos);
/haiku/src/add-ons/input_server/filters/shortcut_catcher/
H A DBitFieldTesters.cpp77 ConstantFieldTester::IsMatching(uint32 field) argument
129 HasBitsFieldTester::IsMatching(uint32 field) argument
131 return ((((fRequiredBits & (~field)) == 0))
132 && ((fForbiddenBits & (~field)) == fForbiddenBits));
201 NotFieldTester::IsMatching(uint32 field) argument
203 return fSlave ? (!fSlave->IsMatching(field)) : false;
295 MinMatchFieldTester::IsMatching(uint32 field) argument
306 if ((((BitFieldTester*)fSlaves.ItemAt(i))->IsMatching(field))
H A DBitFieldTesters.h27 virtual bool IsMatching(uint32 field) = 0;
43 virtual bool IsMatching(uint32 field);
50 // This version matches if all requiredBits are found in the field,
62 virtual bool IsMatching(uint32 field);
82 virtual bool IsMatching(uint32 field);
105 virtual bool IsMatching(uint32 field);
/haiku/src/add-ons/kernel/bus_managers/acpi/acpica/include/platform/
H A Dacenv.h403 #define ACPI_STRUCT_INIT(field, value) value
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Ddevices.cpp260 #define SET_BIT(field, bit) field[(bit) >> 3] |= 1 << ((bit) & 7)
/haiku/src/add-ons/kernel/drivers/audio/ac97/auich/
H A Dqueue.h108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 (head)->lh_first->field.le_prev != &(head)->lh_first) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
117 if (*(elm)->field.le_prev != (elm)) \
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
120 (elm)->field
[all...]
/haiku/src/add-ons/kernel/drivers/audio/ac97/auvia/
H A Dqueue.h108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 (head)->lh_first->field.le_prev != &(head)->lh_first) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
117 if (*(elm)->field.le_prev != (elm)) \
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
120 (elm)->field
[all...]
/haiku/src/add-ons/kernel/drivers/audio/ac97/es1370/
H A Dqueue.h108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 (head)->lh_first->field.le_prev != &(head)->lh_first) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
117 if (*(elm)->field.le_prev != (elm)) \
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
120 (elm)->field
[all...]
/haiku/src/add-ons/kernel/drivers/audio/echo/
H A Dqueue.h108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 (head)->lh_first->field.le_prev != &(head)->lh_first) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
117 if (*(elm)->field.le_prev != (elm)) \
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
120 (elm)->field
[all...]
/haiku/src/add-ons/kernel/drivers/audio/emuxki/
H A Dqueue.h108 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 (head)->lh_first->field.le_prev != &(head)->lh_first) \
112 #define QUEUEDEBUG_LIST_OP(elm, field) \
113 if ((elm)->field.le_next && \
114 (elm)->field.le_next->field.le_prev != \
115 &(elm)->field.le_next) \
117 if (*(elm)->field.le_prev != (elm)) \
119 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \
120 (elm)->field
[all...]
/haiku/src/add-ons/kernel/drivers/disk/nvme/libnvme/
H A Dnvme_internal.h52 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
54 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
60 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
62 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \

Completed in 255 milliseconds

1234