void RSSEditor::DoDeleteSite(bool remove)
{
QMutexLocker locker(&m_lock);
if (!remove)
return;
RSSSite *site = m_sites->GetItemCurrent()->GetData().value<RSSSite*>();
if (removeFromDB(site))
ListChanged();
}
void RSSEditor::SlotNewSite()
{
QMutexLocker locker(&m_lock);
MythScreenStack *mainStack = GetMythMainWindow()->GetMainStack();
RSSEditPopup *rsseditpopup =
new RSSEditPopup("", false, mainStack, "rsseditpopup");
if (rsseditpopup->Create())
{
connect(rsseditpopup, SIGNAL(Saving()), this, SLOT(ListChanged()));
mainStack->AddScreen(rsseditpopup);
}
else
delete rsseditpopup;
}
void SetList(List* plist)
{
if (plist != m_plist) {
if (m_plist != NULL) {
m_plist->GetChangedEvent()->RemoveSink(m_peventSink);
}
if (plist == NULL) {
m_plist = new EmptyList();
} else {
m_plist = plist;
}
m_plist->GetChangedEvent()->AddSink(
m_peventSink = IEventSink::CreateDelegate(this)
);
ListChanged();
}
}
void RSSEditor::SlotEditSite()
{
QMutexLocker locker(&m_lock);
MythScreenStack *mainStack = GetMythMainWindow()->GetMainStack();
RSSSite *site = m_sites->GetItemCurrent()->GetData().value<RSSSite*>();
if (site)
{
RSSEditPopup *rsseditpopup =
new RSSEditPopup(site->GetURL(), true, mainStack, "rsseditpopup");
if (rsseditpopup->Create())
{
connect(rsseditpopup, SIGNAL(Saving()), this, SLOT(ListChanged()));
mainStack->AddScreen(rsseditpopup);
}
else
delete rsseditpopup;
}
}
bool OnEvent(IEventSource* pevent)
{
ListChanged();
return true;
}
void
GPMProcessList::TreeColSelected
(
const JIndex index
)
{
if (index == kTreePID)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreePID,
JOrderedSetT::kSortAscending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeUser)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreeUser,
JOrderedSetT::kSortAscending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeNice)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreeNice,
JOrderedSetT::kSortAscending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeSize)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreeSize,
JOrderedSetT::kSortDescending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeCPU)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreePercentCPU,
JOrderedSetT::kSortDescending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeMemory)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreePercentMemory,
JOrderedSetT::kSortDescending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeTime)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreeTime,
JOrderedSetT::kSortDescending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
else if (index == kTreeCommand)
{
Broadcast(PrepareForUpdate());
itsRootNode->SetChildCompareFunction(GPMProcessEntry::CompareTreeCommand,
JOrderedSetT::kSortAscending, kJTrue);
itsTreeColType = (TreeColType) index;
Broadcast(ListChanged());
}
}
void
GPMProcessList::ListColSelected
(
const JIndex index
)
{
JBoolean changed = kJFalse;
if (index == kListPID)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListPID);
itsEntries->SetSortOrder(JOrderedSetT::kSortAscending);
changed = kJTrue;
}
else if (index == kListUser)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListUser);
itsEntries->SetSortOrder(JOrderedSetT::kSortAscending);
changed = kJTrue;
}
else if (index == kListNice)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListNice);
itsEntries->SetSortOrder(JOrderedSetT::kSortAscending);
changed = kJTrue;
}
else if (index == kListSize)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListSize);
itsEntries->SetSortOrder(JOrderedSetT::kSortDescending);
changed = kJTrue;
}
else if (index == kListCPU)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListPercentCPU);
itsEntries->SetSortOrder(JOrderedSetT::kSortDescending);
changed = kJTrue;
}
else if (index == kListMemory)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListPercentMemory);
itsEntries->SetSortOrder(JOrderedSetT::kSortDescending);
changed = kJTrue;
}
else if (index == kListTime)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListTime);
itsEntries->SetSortOrder(JOrderedSetT::kSortDescending);
changed = kJTrue;
}
else if (index == kListCommand)
{
itsEntries->SetCompareFunction(GPMProcessEntry::CompareListCommand);
itsEntries->SetSortOrder(JOrderedSetT::kSortAscending);
changed = kJTrue;
}
if (changed)
{
Broadcast(PrepareForUpdate());
itsEntries->Sort();
itsListColType = (ListColType) index;
Broadcast(ListChanged());
}
}
void
GPMProcessList::Update()
{
Broadcast(PrepareForUpdate());
struct timeval currentTime;
struct timezone tZone;
gettimeofday(¤tTime, &tZone);
const JFloat newTime = currentTime.tv_sec + (JFloat)(currentTime.tv_usec / 1000000.0);
itsElapsedTime = newTime - itsLastTime;
itsLastTime = newTime;
JPtrArray<GPMProcessEntry> newEntries(JPtrArrayT::kForgetAll);
newEntries.SetCompareFunction(GPMProcessEntry::CompareListPID);
#ifdef _J_HAS_PROC
{
if (itsDirInfo == NULL)
{
JBoolean ok = JDirInfo::Create("/proc", &itsDirInfo);
assert(ok);
}
else
{
itsDirInfo->ForceUpdate();
}
const JSize count = itsDirInfo->GetEntryCount();
for (JIndex i=1; i<=count; i++)
{
const JDirEntry& entry = itsDirInfo->GetEntry(i);
if (entry.GetName().IsInteger() &&
(!itsIsShowingUserOnly || itsUID == entry.GetUserID()))
{
GPMProcessEntry* pentry = new GPMProcessEntry(itsTree, entry);
assert(pentry != NULL);
newEntries.InsertSorted(pentry);
}
}
}
#elif defined _J_HAS_SYSCTL
{
int mib[4] = { CTL_KERN, KERN_PROC, KERN_PROC_ALL, 0 };
if (itsIsShowingUserOnly)
{
mib[2] = KERN_PROC_UID;
mib[3] = itsUID;
}
size_t len;
int result = sysctl(mib, 4, NULL, &len, NULL, 0);
if (result != 0)
{
itsRootNode->DeleteAllChildren();
itsEntries->RemoveAll();
itsAlphaEntries->RemoveAll();
}
else
{
void* buf = malloc(len);
assert( buf != NULL );
result = sysctl(mib, 4, buf, &len, NULL, 0);
if (result != 0)
{
itsRootNode->DeleteAllChildren();
itsEntries->RemoveAll();
itsAlphaEntries->RemoveAll();
}
else
{
kinfo_proc* list = (kinfo_proc*) buf;
const JSize count = len / sizeof(kinfo_proc);
for (JIndex i=0; i<count; i++)
{
GPMProcessEntry* pentry = new GPMProcessEntry(itsTree, list[i]);
assert( pentry != NULL );
newEntries.InsertSorted(pentry);
}
}
free(buf);
}
}
#endif
// remove dead processes from the list
JSize count = itsEntries->GetElementCount();
for (JIndex i=count; i>=1; i--)
{
GPMProcessEntry* pentry = itsEntries->NthElement(i);
JIndex findex;
if (newEntries.SearchSorted(pentry, JOrderedSetT::kAnyMatch, &findex))
{
newEntries.DeleteElement(findex);
}
else
{
while (pentry->HasChildren())
{
itsRootNode->InsertSorted(pentry->GetChild(1));
}
itsAlphaEntries->Remove(pentry);
itsEntries->DeleteElement(i);
}
}
// update information on all pre-existing processes
count = itsEntries->GetElementCount();
for (JIndex i=1; i<=count; i++)
{
(itsEntries->NthElement(i))->Update(itsElapsedTime);
}
itsEntries->Sort();
itsAlphaEntries->Sort();
itsRootNode->SortChildren(kJTrue);
// add new processes to the list
JOrderedSetT::CompareResult (*treeCompareFn)(JTreeNode * const &,
JTreeNode * const &);
JOrderedSetT::SortOrder treeSortOrder;
itsRootNode->GetChildCompareFunction(&treeCompareFn, &treeSortOrder);
count = newEntries.GetElementCount();
for (JIndex i=1; i<=count; i++)
{
GPMProcessEntry* pentry = newEntries.NthElement(i);
pentry->Update(itsElapsedTime);
itsEntries->InsertSorted(pentry);
itsAlphaEntries->InsertSorted(pentry);
pentry->SetChildCompareFunction(treeCompareFn, treeSortOrder, kJTrue);
}
// reparent all nodes
count = itsEntries->GetElementCount();
for (JIndex i=1; i<=count; i++)
{
GPMProcessEntry* pentry = itsEntries->NthElement(i);
GPMProcessEntry* parent;
if (FindProcessEntry(pentry->GetPPID(), &parent) &&
parent != pentry)
{
parent->InsertSorted(pentry);
}
else
{
itsRootNode->InsertSorted(pentry);
}
}
Broadcast(ListChanged());
}
