Cross Reference: /external/chromium_org/net/spdy/spdy_priority

Lines Matching defs:node_id
41   bool NodeExists(NodeId node_id) const;
44   // on success, or false if the node_id already exists within the forest.
45   bool AddRootNode(NodeId node_id, Priority priority);
50   bool AddNonRootNode(NodeId node_id, NodeId parent_id, bool unordered);
54   bool RemoveNode(NodeId node_id);
58   Priority GetPriority(NodeId node_id) const;
62   NodeId GetParent(NodeId node_id) const;
67   bool IsNodeUnordered(NodeId node_id) const;
71   NodeId GetChild(NodeId node_id) const;
76   bool SetPriority(NodeId node_id, Priority priority);
83   bool SetParent(NodeId node_id, NodeId parent_id, bool unordered);
87   bool IsMarkedReadyToRead(NodeId node_id) const;
90   bool MarkReadyToRead(NodeId node_id);
91   bool MarkNoLongerReadyToRead(NodeId node_id);
98   bool IsMarkedReadyToWrite(NodeId node_id) const;
101   bool MarkReadyToWrite(NodeId node_id);
102   bool MarkNoLongerReadyToWrite(NodeId node_id);
135   bool IsMarked(NodeId node_id, unsigned int flag) const;
137   bool Mark(NodeId node_id, unsigned int flag);
139   bool Unmark(NodeId node_id, unsigned int flag);
143   const Node* FindNode(NodeId node_id) const;
162 bool SpdyPriorityForest<NodeId, Priority>::NodeExists(NodeId node_id) const {
163   return all_nodes_.count(node_id) != 0;
168     NodeId node_id, Priority priority) {
169   if (NodeExists(node_id)) {
172   Node* new_node = &all_nodes_[node_id];
180     NodeId node_id, NodeId parent_id, bool unordered) {
181   if (NodeExists(node_id) || !NodeExists(parent_id)) {
190   Node* new_node = &all_nodes_[node_id];
193   parent->child = node_id;
198 bool SpdyPriorityForest<NodeId, Priority>::RemoveNode(NodeId node_id) {
199   if (!NodeExists(node_id)) {
202   const Node& node = all_nodes_[node_id];
209     DCHECK_EQ(node_id, parent->child);
218     DCHECK_EQ(node_id, child->depends_on.parent_id);
233   all_nodes_.erase(node_id);
239     NodeId node_id) const {
240   const Node* node = FindNode(node_id);
249 NodeId SpdyPriorityForest<NodeId, Priority>::GetParent(NodeId node_id) const {
250   const Node* node = FindNode(node_id);
260     NodeId node_id) const {
261   const Node* node = FindNode(node_id);
266 NodeId SpdyPriorityForest<NodeId, Priority>::GetChild(NodeId node_id) const {
267   const Node* node = FindNode(node_id);
277     NodeId node_id, Priority priority) {
278   if (!NodeExists(node_id)) {
282   Node* node = &all_nodes_[node_id];
297     NodeId node_id, NodeId parent_id, bool unordered) {
298   if (!NodeExists(node_id) || !NodeExists(parent_id)) {
302   Node* node = &all_nodes_[node_id];
306   if (new_parent->child == node_id) {
316   if (node_id == parent_id) return false;
318   NodeId last_id = node_id;
333     DCHECK_EQ(node_id, old_parent->child);
340   new_parent->child = node_id;
346     NodeId node_id) const {
347   return IsMarked(node_id, kReadyToRead);
351 bool SpdyPriorityForest<NodeId, Priority>::MarkReadyToRead(NodeId node_id) {
352   return Mark(node_id, kReadyToRead);
357     NodeId node_id) {
358   return Unmark(node_id, kReadyToRead);
368     NodeId node_id) const {
369   return IsMarked(node_id, kReadyToWrite);
373 bool SpdyPriorityForest<NodeId, Priority>::MarkReadyToWrite(NodeId node_id) {
374   return Mark(node_id, kReadyToWrite);
379     NodeId node_id) {
380   return Unmark(node_id, kReadyToWrite);
390     NodeId node_id, unsigned int flag) const {
391   const Node* node = FindNode(node_id);
397     NodeId node_id, unsigned int flag) {
398   if (!NodeExists(node_id)) {
401   all_nodes_[node_id].flags |= flag;
407     NodeId node_id, unsigned int flag) {
408   if (!NodeExists(node_id)) {
411   all_nodes_[node_id].flags &= ~flag;
458   NodeId node_id = root_id;
460     DCHECK(NodeExists(node_id));
461     Node* node = &all_nodes_[node_id];
466       group.push_back(node_id);
481     node_id = node->child;
487 SpdyPriorityForest<NodeId, Priority>::FindNode(NodeId node_id) const {
488   typename NodeMap::const_iterator iter = all_nodes_.find(node_id);
499     const NodeId node_id = iter->first;
503          GetChild(node.depends_on.parent_id) != node_id)) {
507       if (!NodeExists(node.child) || node_id != GetParent(node.child)) {
515       if (count > num_nodes() || node_id == child_id) {