/haiku/src/add-ons/kernel/drivers/audio/ac97/auich/ |
H A D | queue.h | 108 #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 D | queue.h | 108 #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 D | queue.h | 108 #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 D | queue.h | 108 #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 D | queue.h | 108 #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 D | queue.h | 159 #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 D | queue.h | 164 #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 D | queue.h | 190 #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 D | SudokuGenerator.cpp | 35 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 D | SudokuGenerator.h | 22 void Generate(SudokuField* field, uint32 fieldsLeft, 27 bool _HasOnlyOneSolution(SudokuField& field);
|
H A D | SudokuSolver.h | 17 SudokuSolver(SudokuField* field); 21 void SetTo(SudokuField* field);
|
H A D | SudokuField.cpp | 34 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/libs/compat/openbsd_wlan/sys/ |
H A D | tree.h | 77 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left 78 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right 83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 90 SPLAY_RIGHT((head)->sph_root, field) [all...] |
/haiku/src/apps/resedit/ |
H A D | PreviewColumn.cpp | 20 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 D | PreviewColumn.h | 18 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 D | NotifierConfigView.cpp | 64 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 D | Message.cpp | 225 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 D | if_rtwnreg.h | 106 #define MS(val, field) \ 107 (((val) & field##_M) >> field##_S) 110 #define SM(field, val) \ 111 (((val) << field##_S) & field##_M) 114 #define RW(var, field, val) \ 115 (((var) & ~field##_M) | SM(field, val))
|
/haiku/src/preferences/repositories/ |
H A D | RepoRow.cpp | 41 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 D | MessageAdapter.cpp | 253 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...] |
/haiku/headers/private/interface/ |
H A D | ColumnTypes.h | 5 / 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 D | BitFieldTesters.h | 27 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 D | ColumnTypes.cpp | 5 / 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 D | KMessage.cpp | 25 // 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 D | PackageInfo.h | 238 const char* field, 241 const char* field, 244 const char* field, 248 const char* field, 252 const char* field, 255 static status_t _AddUsers(BMessage* archive, const char* field, 259 const char* field, int32 index, 262 const char* field, BStringList& _list); 264 const char* field, 267 const char* field, [all...] |