* Copyright 2000, Georges-Edouard Berenger. All rights reserved.
* Distributed under the terms of the MIT License.
*/
#include "PriorityMenu.h"
#include "ProcessController.h"
#include <Catalog.h>
#include <MenuItem.h>
#include <Window.h>
#include <stdio.h>
#undef B_TRANSLATION_CONTEXT
#define B_TRANSLATION_CONTEXT "ProcessController"
PriorityMenu::PriorityMenu(thread_id thread, int32 priority)
: BMenu(B_EMPTY_STRING),
fThreadID(thread),
fPriority(priority)
{
}
void
PriorityMenu::Update(int32 priority)
{
if (priority != fPriority && CountItems() > 0)
RemoveItems(0, CountItems(), true);
if (CountItems() < 1)
BuildMenu();
fPriority = priority;
}
typedef struct {
const char* name;
long priority;
} PriorityRec;
static PriorityRec priorities[] = {
{ B_TRANSLATE("Idle priority"), 0 },
{ B_TRANSLATE("Lowest active priority"), 1 },
{ B_TRANSLATE("Low priority"), 5 },
{ B_TRANSLATE("Normal priority"), 10 },
{ B_TRANSLATE("Display priority"), 15 },
{ B_TRANSLATE("Urgent display priority"), 20 },
{ B_TRANSLATE("Real-time display priority"), 100 },
{ B_TRANSLATE("Urgent priority"), 110 },
{ B_TRANSLATE("Real-time priority"), 120 },
{ "", -1 }
};
PriorityRec customPriority = { B_TRANSLATE("Custom priority"), 0 };
void
PriorityMenu::BuildMenu()
{
BMenuItem* item;
BMessage* message;
long found = false;
for (long index = 0; ; index++) {
PriorityRec *priority = &priorities[index];
if (priority->priority < 0)
break;
if (!found && fPriority < priority->priority) {
priority = &customPriority;
priority->priority = fPriority;
index--;
}
message = new BMessage('PrTh');
message->AddInt32("thread", fThreadID);
message->AddInt32("priority", priority->priority);
BString name;
const size_t size = B_OS_NAME_LENGTH * 4;
snprintf(name.LockBuffer(size), size,
"%s [%d]", priority->name, (int)priority->priority);
name.UnlockBuffer();
item = new BMenuItem(name.String(), message);
item->SetTarget(gPCView);
if (fPriority == priority->priority)
found = true, item->SetMarked(true);
AddItem(item);
}
}
