1 /* 2 Open Tracker License 3 4 Terms and Conditions 5 6 Copyright (c) 1991-2000, Be Incorporated. All rights reserved. 7 8 Permission is hereby granted, free of charge, to any person obtaining a copy of 9 this software and associated documentation files (the "Software"), to deal in 10 the Software without restriction, including without limitation the rights to 11 use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 12 of the Software, and to permit persons to whom the Software is furnished to do 13 so, subject to the following conditions: 14 15 The above copyright notice and this permission notice applies to all licensees 16 and shall be included in all copies or substantial portions of the Software. 17 18 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 19 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF TITLE, MERCHANTABILITY, 20 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 21 BE INCORPORATED BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN 22 AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF, OR IN CONNECTION 23 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 24 25 Except as contained in this notice, the name of Be Incorporated shall not be 26 used in advertising or otherwise to promote the sale, use or other dealings in 27 this Software without prior written authorization from Be Incorporated. 28 29 Tracker(TM), Be(R), BeOS(R), and BeIA(TM) are trademarks or registered trademarks 30 of Be Incorporated in the United States and other countries. Other brand product 31 names are registered trademarks or trademarks of their respective holders. 32 All rights reserved. 33 */ 34 35 36 #include "PendingNodeMonitorCache.h" 37 #include "PoseView.h" 38 39 40 const bigtime_t kDelayedNodeMonitorLifetime = 10000000; 41 // after this much the pending node monitor gets discarded as 42 // too old 43 44 45 PendingNodeMonitorEntry::PendingNodeMonitorEntry(const node_ref* node, 46 const BMessage* nodeMonitor) 47 : fExpiresAfter(system_time() + kDelayedNodeMonitorLifetime), 48 fNodeMonitor(*nodeMonitor), 49 fNode(*node) 50 { 51 } 52 53 54 const BMessage* 55 PendingNodeMonitorEntry::NodeMonitor() const 56 { 57 return &fNodeMonitor; 58 } 59 60 61 bool 62 PendingNodeMonitorEntry::Match(const node_ref* node) const 63 { 64 return fNode == *node; 65 } 66 67 68 bool 69 PendingNodeMonitorEntry::TooOld(bigtime_t now) const 70 { 71 return now > fExpiresAfter; 72 } 73 74 75 PendingNodeMonitorCache::PendingNodeMonitorCache() 76 : fList(10, true) 77 { 78 } 79 80 81 PendingNodeMonitorCache::~PendingNodeMonitorCache() 82 { 83 } 84 85 86 void 87 PendingNodeMonitorCache::Add(const BMessage* message) 88 { 89 #if xDEBUG 90 PRINT(("adding pending node monitor\n")); 91 message->PrintToStream(); 92 #endif 93 node_ref node; 94 if (message->FindInt32("device", &node.device) != B_OK 95 || message->FindInt64("node", (int64*)&node.node) != B_OK) 96 return; 97 98 fList.AddItem(new PendingNodeMonitorEntry(&node, message)); 99 } 100 101 102 void 103 PendingNodeMonitorCache::RemoveEntries(const node_ref* nodeRef) 104 { 105 int32 count = fList.CountItems(); 106 for (int32 index = count - 1; index >= 0; index--) 107 if (fList.ItemAt(index)->Match(nodeRef)) 108 delete fList.RemoveItemAt(index); 109 } 110 111 112 void 113 PendingNodeMonitorCache::RemoveOldEntries() 114 { 115 bigtime_t now = system_time(); 116 int32 count = fList.CountItems(); 117 for (int32 index = count - 1; index >= 0; index--) 118 if (fList.ItemAt(index)->TooOld(now)) { 119 PRINT(("removing old entry from pending node monitor cache\n")); 120 delete fList.RemoveItemAt(index); 121 } 122 } 123 124 125 void 126 PendingNodeMonitorCache::PoseCreatedOrMoved(BPoseView* poseView, 127 const BPose* pose) 128 { 129 bigtime_t now = system_time(); 130 for (int32 index = 0; index < fList.CountItems();) { 131 PendingNodeMonitorEntry* item = fList.ItemAt(index); 132 if (item->TooOld(now)) { 133 PRINT(("removing old entry from pending node monitor cache\n")); 134 delete fList.RemoveItemAt(index); 135 } else if (item->Match(pose->TargetModel()->NodeRef())) { 136 fList.RemoveItemAt(index); 137 #if DEBUG 138 PRINT(("reapplying node monitor for model:\n")); 139 pose->TargetModel()->PrintToStream(); 140 item->NodeMonitor()->PrintToStream(); 141 bool result = 142 #endif 143 poseView->FSNotification(item->NodeMonitor()); 144 ASSERT(result); 145 delete item; 146 } else 147 index++; 148 } 149 } 150