/* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ use msg::constellation_msg::{FrameId, PipelineId}; use pipeline::Pipeline; use servo_url::ServoUrl; use std::collections::HashMap; use std::iter::once; use std::mem::replace; use std::time::Instant; /// A frame in the frame tree. /// Each frame is the constellation's view of a browsing context. /// Each browsing context has a session history, caused by /// navigation and traversing the history. Each frame has its /// current entry, plus past and future entries. The past is sorted /// chronologically, the future is sorted reverse chronologically: /// in particular prev.pop() is the latest past entry, and /// next.pop() is the earliest future entry. #[derive(Debug, Clone)] pub struct Frame { /// The frame id. pub id: FrameId, /// The timestamp for the current session history entry pub instant: Instant, /// The pipeline for the current session history entry pub pipeline_id: PipelineId, /// The URL for the current session history entry pub url: ServoUrl, /// The past session history, ordered chronologically. pub prev: Vec, /// The future session history, ordered reverse chronologically. pub next: Vec, } impl Frame { /// Create a new frame. /// Note this just creates the frame, it doesn't add it to the frame tree. pub fn new(id: FrameId, pipeline_id: PipelineId, url: ServoUrl) -> Frame { Frame { id: id, pipeline_id: pipeline_id, instant: Instant::now(), url: url, prev: vec!(), next: vec!(), } } /// Get the current frame state. pub fn current(&self) -> FrameState { FrameState { instant: self.instant, frame_id: self.id, pipeline_id: Some(self.pipeline_id), url: self.url.clone(), } } /// Set the current frame entry, and push the current frame entry into the past. pub fn load(&mut self, pipeline_id: PipelineId, url: ServoUrl) { let current = self.current(); self.prev.push(current); self.instant = Instant::now(); self.pipeline_id = pipeline_id; self.url = url; } /// Set the future to be empty. pub fn remove_forward_entries(&mut self) -> Vec { replace(&mut self.next, vec!()) } /// Update the current entry of the Frame from an entry that has been traversed to. pub fn update_current(&mut self, pipeline_id: PipelineId, entry: &FrameState) { self.pipeline_id = pipeline_id; self.instant = entry.instant; self.url = entry.url.clone(); } } /// An entry in a frame's session history. /// Each entry stores the pipeline id for a document in the session history. /// /// When we operate on the joint session history, entries are sorted chronologically, /// so we timestamp the entries by when the entry was added to the session history. #[derive(Debug, Clone)] pub struct FrameState { /// The timestamp for when the session history entry was created pub instant: Instant, /// The pipeline for the document in the session history, /// None if the entry has been discarded pub pipeline_id: Option, /// The URL for this entry, used to reload the pipeline if it has been discarded pub url: ServoUrl, /// The frame that this session history entry is part of pub frame_id: FrameId, } impl FrameState { /// Updates the entry's pipeline and url. This is used when navigating with replacement /// enabled. pub fn replace_pipeline(&mut self, pipeline_id: PipelineId, url: ServoUrl) { self.pipeline_id = Some(pipeline_id); self.url = url; } } /// Represents a pending change in the frame tree, that will be applied /// once the new pipeline has loaded and completed initial layout / paint. pub struct FrameChange { /// The frame to change. pub frame_id: FrameId, /// The pipeline that was currently active at the time the change started. /// TODO: can this field be removed? pub old_pipeline_id: Option, /// The pipeline for the document being loaded. pub new_pipeline_id: PipelineId, /// The URL for the document being loaded. pub url: ServoUrl, /// Is the new document replacing the current document (e.g. a reload) /// or pushing it into the session history (e.g. a navigation)? pub replace: Option, } /// An iterator over a frame tree, returning the fully active frames in /// depth-first order. Note that this iterator only returns the fully /// active frames, that is ones where every ancestor frame is /// in the currently active pipeline of its parent frame. pub struct FrameTreeIterator<'a> { /// The frames still to iterate over. pub stack: Vec, /// The set of all frames. pub frames: &'a HashMap, /// The set of all pipelines. We use this to find the active /// children of a frame, which are the iframes in the currently /// active document. pub pipelines: &'a HashMap, } impl<'a> Iterator for FrameTreeIterator<'a> { type Item = &'a Frame; fn next(&mut self) -> Option<&'a Frame> { loop { let frame_id = match self.stack.pop() { Some(frame_id) => frame_id, None => return None, }; let frame = match self.frames.get(&frame_id) { Some(frame) => frame, None => { warn!("Frame {:?} iterated after closure.", frame_id); continue; }, }; let pipeline = match self.pipelines.get(&frame.pipeline_id) { Some(pipeline) => pipeline, None => { warn!("Pipeline {:?} iterated after closure.", frame.pipeline_id); continue; }, }; self.stack.extend(pipeline.children.iter()); return Some(frame) } } } /// An iterator over a frame tree, returning all frames in depth-first /// order. Note that this iterator returns all frames, not just the /// fully active ones. pub struct FullFrameTreeIterator<'a> { /// The frames still to iterate over. pub stack: Vec, /// The set of all frames. pub frames: &'a HashMap, /// The set of all pipelines. We use this to find the /// children of a frame, which are the iframes in all documents /// in the session history. pub pipelines: &'a HashMap, } impl<'a> Iterator for FullFrameTreeIterator<'a> { type Item = &'a Frame; fn next(&mut self) -> Option<&'a Frame> { let pipelines = self.pipelines; loop { let frame_id = match self.stack.pop() { Some(frame_id) => frame_id, None => return None, }; let frame = match self.frames.get(&frame_id) { Some(frame) => frame, None => { warn!("Frame {:?} iterated after closure.", frame_id); continue; }, }; let child_frame_ids = frame.prev.iter().chain(frame.next.iter()) .filter_map(|entry| entry.pipeline_id) .chain(once(frame.pipeline_id)) .filter_map(|pipeline_id| pipelines.get(&pipeline_id)) .flat_map(|pipeline| pipeline.children.iter()); self.stack.extend(child_frame_ids); return Some(frame) } } }