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

1234

/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/headers/private/firewire/
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/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/src/libs/compat/freebsd_network/compat/sys/
H A Dqueue.h190 #define SLIST_CONCAT(head1, head2, type, field) do { \
196 while (SLIST_NEXT(curelm, field) != NULL) \
197 curelm = SLIST_NEXT(curelm, field); \
198 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
207 #define SLIST_FOREACH(var, head, field) \
210 (var) = SLIST_NEXT((var), field))
212 #define SLIST_FOREACH_FROM(var, head, field) \
215 (var) = SLIST_NEXT((var), field))
217 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
219 (var) && ((tvar) = SLIST_NEXT((var), field),
[all...]
/haiku/src/apps/sudoku/
H A DSudokuGenerator.cpp35 SudokuGenerator::_HasOnlyOneSolution(SudokuField& field) argument
37 SudokuSolver solver(&field);
60 // first step: generate a solved field - random brute force style
62 SudokuField field(target->BlockSize());
63 uint32 inputCount = field.Size() * field.Size() / 3;
64 _Progress(progress, B_TRANSLATE("Creating solvable field"), 5.f);
67 field.Reset();
69 // generate input field
77 x = rand() % field
[all...]
H A DSudokuGenerator.h22 void Generate(SudokuField* field, uint32 fieldsLeft,
27 bool _HasOnlyOneSolution(SudokuField& field);
H A DSudokuSolver.h17 SudokuSolver(SudokuField* field);
21 void SetTo(SudokuField* field);
H A DSudokuField.cpp34 SudokuField::field::field() function in class:SudokuField::field
52 fFields = new (std::nothrow) field[fSize * fSize];
66 fFields = new (std::nothrow) field[count];
71 struct field& field = fFields[i]; local
73 if (archive->FindInt32("value", i, (int32*)&field.value) != B_OK
75 (int32*)&field.valid_mask) != B_OK
77 (int32*)&field.hint_mask) != B_OK
78 || archive->FindInt32("flags", i, (int32*)&field
123 struct field& field = fFields[i]; local
152 struct field& field = _FieldAt(x, y); local
179 struct field& field = _FieldAt(x, y); local
197 SetTo(const SudokuField* field) argument
[all...]
/haiku/src/apps/resedit/
H A DPreviewColumn.cpp20 PreviewColumn::DrawField(BField* field, BRect rect, BView* parent) argument
22 PreviewField *pField = (PreviewField*)field;
27 PreviewColumn::AcceptsField(const BField* field) const
29 return dynamic_cast<const PreviewField*>(field);
H A DPreviewColumn.h18 void DrawField(BField* field, BRect rect, BView* parent);
19 bool AcceptsField(const BField* field) const;
/haiku/src/add-ons/mail_daemon/inbound_filters/notifier/
H A DNotifierConfigView.cpp64 BMenuField *field; local
65 if ((field = dynamic_cast<BMenuField *>(FindView("notify"))) == NULL)
68 for (int32 i = field->Menu()->CountItems(); i-- > 0;) {
69 BMenuItem *item = field->Menu()->ItemAt(i);
81 BMenuField *field; local
82 if ((field = dynamic_cast<BMenuField *>(FindView("notify"))) != NULL) {
83 for (int32 i = field->Menu()->CountItems(); i-- > 0;) {
84 BMenuItem *item = field->Menu()->ItemAt(i);
97 if (BMenuField *field = dynamic_cast<BMenuField *>(FindView("notify")))
98 field
105 BMenuField *field; local
[all...]
/haiku/src/build/libbe/app/
H A DMessage.cpp225 field_header *field = &fFields[i]; local
228 const char *name = (const char *)fData + field->offset;
234 if (otherField->name_length != field->name_length)
239 if (strncmp(name, otherName, field->name_length) != 0)
243 if (otherField->type != field->type || otherField->count != field->count)
246 uint8 *data = fData + field->offset + field->name_length;
251 if (deep && field->type == B_MESSAGE_TYPE) {
262 if (otherField->data_size != field
370 field_header *field = fFields; local
401 field_header *field = NULL; local
420 field_header *field = NULL; local
442 field_header *field = fFields; local
655 field_header *field = &fFields[*nextField]; local
845 field_header *field = &fFields[i]; local
1160 field_header *field = fFields; local
1251 field_header *field = &fFields[nextField]; local
1297 field_header *field = &fFields[fHeader->field_count]; local
1321 _RemoveField(field_header *field) argument
1484 field_header *field = NULL; local
1516 field_header *field = NULL; local
1603 field_header *field = NULL; local
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/realtekwifi/dev/rtwn/
H A Dif_rtwnreg.h107 #define MS(val, field) \
108 (((val) & field##_M) >> field##_S)
111 #define SM(field, val) \
112 (((val) << field##_S) & field##_M)
115 #define RW(var, field, val) \
116 (((var) & ~field##_M) | SM(field, val))
/haiku/src/preferences/repositories/
H A DRepoRow.cpp41 BStringField* field = (BStringField*)GetField(kNameColumn); local
42 field->SetString(name);
59 BStringField* field = (BStringField*)GetField(kEnabledColumn); local
61 field->SetString(fEnabled ? B_TRANSLATE_COMMENT("Enabled",
64 field->SetString(B_UTF8_ELLIPSIS);
/haiku/src/kits/app/
H A DMessageAdapter.cpp253 BMessage::field_header* field = fromPrivate.GetMessageFields(); local
254 for (uint32 i = 0; i < header->field_count; i++, field++) {
255 const char* name = (const char*)data + field->offset;
256 const uint8* fieldData = data + field->offset + field->name_length;
257 bool fixedSize = (field->flags & FIELD_FLAG_FIXED_SIZE) != 0;
260 status_t status = to.AddArray(name, field->type, fieldData,
261 field->data_size / field->count, field
301 KMessageField field; local
363 BMessage::field_header *field = messagePrivate.GetMessageFields(); local
461 BMessage::field_header *field = messagePrivate.GetMessageFields(); local
757 dano_single_item *field = (dano_single_item *)fieldBuffer; local
797 dano_fixed_size_array *field local
826 dano_variable_size_array *field local
[all...]
H A DMessage.cpp296 field_header* field = &fFields[i]; local
299 const char* name = (const char*)fData + field->offset;
305 if (otherField->name_length != field->name_length)
310 if (strncmp(name, otherName, field->name_length) != 0)
314 if (otherField->type != field->type
315 || otherField->count != field->count) {
319 uint8* data = fData + field->offset + field->name_length;
324 if (deep && field->type == B_MESSAGE_TYPE) {
335 if (otherField->data_size != field
458 field_header* field = fFields; local
489 field_header* field = NULL; local
508 field_header* field = NULL; local
527 field_header* field = NULL; local
554 field_header* field = fFields; local
783 field_header* field = &fFields[*nextField]; local
1266 field_header* field = &fFields[i]; local
1542 field_header* field = fFields; local
1657 field_header* field = &fFields[nextField]; local
1703 field_header* field = &fFields[fHeader->field_count]; local
1727 _RemoveField(field_header* field) argument
1798 field_header* field = NULL; local
1863 field_header* field = NULL; local
1916 field_header* field = NULL; local
1943 field_header* field = NULL; local
1985 field_header* field = NULL; local
2029 field_header* field = NULL; local
2785 field_header* field = other.fFields; local
[all...]
/haiku/headers/private/interface/
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/src/add-ons/input_server/filters/shortcut_catcher/
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/kits/interface/
H A DColumnTypes.cpp5 / Description: Experimental classes that implement particular column/field
210 BStringField* field = static_cast<BStringField*>(_field); local
211 float fieldWidth = field->Width();
215 BString out_string(field->String());
219 field->SetClippedString(out_string.String());
221 field->SetClippedString("");
222 field->SetWidth(width);
225 DrawString(field->HasClippedString()
226 ? field->ClippedString()
227 : field
234 BStringField* field = static_cast<BStringField*>(_field); local
338 BDateField* field = (BDateField*)_field; local
522 DrawField(BField *field, BRect rect, BView* parent) argument
555 DrawField(BField* field, BRect rect, BView* parent) argument
622 DrawField(BField* field, BRect rect, BView* parent) argument
[all...]
/haiku/src/system/kernel/messaging/
H A DKMessage.cpp25 // TODO: Add a field index using a hash map, so that lookup improves to O(1)
281 KMessageField* field)
288 return _AddField(name, type, elementSize, field);
293 KMessage::FindField(const char* name, KMessageField* field) const
295 return FindField(name, B_ANY_TYPE, field);
301 KMessageField* field) const
306 if (field)
307 field->Unset();
309 field = &stackField;
310 while (GetNextField(field)
280 AddField(const char* name, type_code type, int32 elementSize, KMessageField* field) argument
382 KMessageField field; local
658 KMessageField field; local
753 _AddField(const char* name, type_code type, int32 elementSize, KMessageField* field) argument
776 _AddFieldData(KMessageField* field, const void* data, int32 elementSize, int32 elementCount) argument
[all...]
/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...]

Completed in 254 milliseconds

1234