diff --git a/sv-parser-pp/Cargo.toml b/sv-parser-pp/Cargo.toml
index cdd7883..2639574 100644
--- a/sv-parser-pp/Cargo.toml
+++ b/sv-parser-pp/Cargo.toml
@@ -9,6 +9,8 @@ default = []
 trace   = ["sv-parser-parser/trace"]
 
 [dependencies]
+failure              = "0.1.5"
 nom                  = "5.0.0"
+sv-parser-error      = { path = "../sv-parser-error" }
 sv-parser-parser     = { path = "../sv-parser-parser" }
 sv-parser-syntaxtree = { path = "../sv-parser-syntaxtree" }
diff --git a/sv-parser-pp/src/lib.rs b/sv-parser-pp/src/lib.rs
index b914e8f..9610f16 100644
--- a/sv-parser-pp/src/lib.rs
+++ b/sv-parser-pp/src/lib.rs
@@ -1,154 +1,2 @@
-use std::collections::HashMap;
-use std::convert::TryInto;
-use sv_parser_parser::{pp_parser, Span, SpanInfo};
-use sv_parser_syntaxtree::{Locate, NodeEvent, RefNode};
-
-pub fn preprocessor(s: &str) -> String {
-    let mut ret = String::new();
-    let pp_text = pp_parser(Span::new_extra(s, SpanInfo::default()));
-
-    let mut skip = false;
-    let mut skip_nodes = vec![];
-    let mut defines = HashMap::new();
-
-    if let Ok((_, pp_text)) = pp_text {
-        for n in pp_text.into_iter().event() {
-            match n {
-                NodeEvent::Enter(RefNode::ResetallCompilerDirective(_)) if !skip => {
-                    defines.clear();
-                }
-                NodeEvent::Enter(RefNode::UndefineCompilerDirective(x)) if !skip => {
-                    let (_, _, ref name) = x.nodes;
-                    let id = identifier((&name.nodes.0).into());
-                    let id = String::from(id.unwrap().str(s));
-                    defines.remove(&id);
-                }
-                NodeEvent::Enter(RefNode::UndefineallCompilerDirective(_)) if !skip => {
-                    defines.clear();
-                }
-                NodeEvent::Enter(RefNode::SourceDescriptionNotDirective(x)) if !skip => {
-                    let locate: Locate = x.try_into().unwrap();
-                    ret.push_str(locate.str(s));
-                }
-                NodeEvent::Enter(RefNode::IfdefDirective(x)) if !skip => {
-                    let (_, _, ref ifid, ref ifbody, ref elsif, ref elsebody, _, _) = x.nodes;
-                    let ifid = identifier(ifid.into());
-                    let ifid = String::from(ifid.unwrap().str(s));
-                    let mut hit = false;
-                    if defines.contains_key(&ifid) {
-                        hit = true;
-                    } else {
-                        skip_nodes.push(ifbody.into());
-                    }
-
-                    for x in elsif {
-                        let (_, _, ref elsifid, ref elsifbody) = x;
-                        let elsifid = identifier(elsifid.into());
-                        let elsifid = String::from(elsifid.unwrap().str(s));
-                        if hit {
-                            skip_nodes.push(elsifbody.into());
-                        } else if defines.contains_key(&elsifid) {
-                            hit = true;
-                        } else {
-                            skip_nodes.push(elsifbody.into());
-                        }
-                    }
-
-                    if let Some(elsebody) = elsebody {
-                        let (_, _, ref elsebody) = elsebody;
-                        if hit {
-                            skip_nodes.push(elsebody.into());
-                        }
-                    }
-                }
-                NodeEvent::Enter(RefNode::IfndefDirective(x)) if !skip => {
-                    let (_, _, ref ifid, ref ifbody, ref elsif, ref elsebody, _, _) = x.nodes;
-                    let ifid = identifier(ifid.into());
-                    let mut hit = false;
-                    if !defines.contains_key(&String::from(ifid.unwrap().str(s))) {
-                        hit = true;
-                    } else {
-                        skip_nodes.push(ifbody.into());
-                    }
-
-                    for x in elsif {
-                        let (_, _, ref elsifid, ref elsifbody) = x;
-                        let elsifid = identifier(elsifid.into());
-                        if hit {
-                            skip_nodes.push(elsifbody.into());
-                        } else if defines.contains_key(&String::from(elsifid.unwrap().str(s))) {
-                            hit = true;
-                        } else {
-                            skip_nodes.push(elsifbody.into());
-                        }
-                    }
-
-                    if let Some(elsebody) = elsebody {
-                        let (_, _, ref elsebody) = elsebody;
-                        if hit {
-                            skip_nodes.push(elsebody.into());
-                        }
-                    }
-                }
-                NodeEvent::Enter(RefNode::TextMacroDefinition(x)) if !skip => {
-                    let (_, _, ref name, _) = x.nodes;
-                    let id = identifier((&name.nodes.0).into());
-                    let id = String::from(id.unwrap().str(s));
-                    defines.insert(id, x.clone());
-                }
-                NodeEvent::Enter(x) => {
-                    if skip_nodes.contains(&x) {
-                        skip = true;
-                    }
-                }
-                NodeEvent::Leave(x) => {
-                    if skip_nodes.contains(&x) {
-                        skip = false;
-                    }
-                }
-            }
-        }
-    }
-    //let ret = dbg!(ret);
-    println!("{}", ret);
-
-    ret
-}
-
-fn identifier(node: RefNode) -> Option<Locate> {
-    for x in node {
-        match x {
-            RefNode::SimpleIdentifier(x) => {
-                let x: Locate = x.nodes.0.try_into().unwrap();
-                return Some(x);
-            }
-            RefNode::EscapedIdentifier(x) => {
-                let x: Locate = x.nodes.0.try_into().unwrap();
-                return Some(x);
-            }
-            _ => (),
-        }
-    }
-    None
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-
-    #[test]
-    fn it_works() {
-        let s = r##"module and_op (a, b, c);
-                  output a;
-                  input b, c;
-
-                  `define behavioral
-                  `ifdef behavioral
-                    wire a = b & c;
-                  `else
-                    and a1 (a,b,c);
-                  `endif
-                endmodule"##;
-        preprocessor(s);
-    }
-}
+pub mod preprocess;
+pub mod range;
diff --git a/sv-parser-pp/src/preprocess.rs b/sv-parser-pp/src/preprocess.rs
new file mode 100644
index 0000000..065b252
--- /dev/null
+++ b/sv-parser-pp/src/preprocess.rs
@@ -0,0 +1,320 @@
+use crate::range::Range;
+use std::collections::{BTreeMap, HashMap};
+use std::convert::TryInto;
+use std::fs::File;
+use std::io::{BufReader, Read};
+use std::path::{Path, PathBuf};
+use sv_parser_error::{Error, ErrorKind};
+use sv_parser_parser::{pp_parser, Span, SpanInfo};
+use sv_parser_syntaxtree::{
+    IncludeCompilerDirective, Locate, NodeEvent, RefNode, TextMacroDefinition,
+};
+
+#[derive(Debug)]
+pub struct PreprocessedText {
+    text: String,
+    origins: BTreeMap<Range, Origin>,
+}
+
+#[derive(Debug)]
+pub struct Origin {
+    range: Range,
+    origin_path: PathBuf,
+    origin_range: Range,
+}
+
+impl PreprocessedText {
+    fn new() -> Self {
+        PreprocessedText {
+            text: String::new(),
+            origins: BTreeMap::new(),
+        }
+    }
+
+    fn push<T: AsRef<Path>>(&mut self, s: &str, origin_path: T, origin_range: Range) {
+        let base = self.text.len();
+        self.text.push_str(s);
+
+        let range = Range::new(base, base + s.len());
+        let origin = Origin {
+            range,
+            origin_path: PathBuf::from(origin_path.as_ref()),
+            origin_range,
+        };
+        self.origins.insert(range, origin);
+    }
+
+    fn merge(&mut self, other: PreprocessedText) {
+        let base = self.text.len();
+        self.text.push_str(&other.text);
+        for (mut range, mut origin) in other.origins {
+            range.offset(base);
+            origin.range.offset(base);
+            self.origins.insert(range, origin);
+        }
+    }
+
+    pub fn text(&self) -> &str {
+        &self.text
+    }
+
+    pub fn origin(&self, pos: usize) -> Option<(&PathBuf, usize)> {
+        let origin = self.origins.get(&Range::new(pos, pos + 1));
+        if let Some(origin) = origin {
+            let ret_pos = pos - origin.range.begin + origin.origin_range.begin;
+            Some((&origin.origin_path, ret_pos))
+        } else {
+            None
+        }
+    }
+}
+
+pub fn preprocess<T: AsRef<Path>, U: AsRef<Path>>(
+    path: T,
+    pre_defines: &HashMap<String, Option<TextMacroDefinition>>,
+    include_paths: &[U],
+) -> Result<PreprocessedText, Error> {
+    let f = File::open(path.as_ref())?;
+    let mut reader = BufReader::new(f);
+    let mut s = String::new();
+    reader.read_to_string(&mut s)?;
+
+    let mut skip = false;
+    let mut skip_nodes = vec![];
+    let mut defines = HashMap::new();
+
+    for (k, v) in pre_defines {
+        defines.insert(k.clone(), v.clone());
+    }
+
+    let span = Span::new_extra(&s, SpanInfo::default());
+    let (_, pp_text) = pp_parser(span).map_err(|_| ErrorKind::Parse)?;
+
+    let mut ret = PreprocessedText::new();
+
+    for n in pp_text.into_iter().event() {
+        match n {
+            NodeEvent::Enter(RefNode::ResetallCompilerDirective(_)) if !skip => {
+                defines.clear();
+            }
+            NodeEvent::Enter(RefNode::UndefineCompilerDirective(x)) if !skip => {
+                let (_, _, ref name) = x.nodes;
+                let id = identifier((&name.nodes.0).into(), &s).unwrap();
+                defines.remove(&id);
+            }
+            NodeEvent::Enter(RefNode::UndefineallCompilerDirective(_)) if !skip => {
+                defines.clear();
+            }
+            NodeEvent::Enter(RefNode::SourceDescriptionNotDirective(x)) if !skip => {
+                let locate: Locate = x.try_into().unwrap();
+                let range = Range::new(locate.offset, locate.offset + locate.len);
+                ret.push(locate.str(&s), path.as_ref(), range);
+            }
+            NodeEvent::Enter(RefNode::IfdefDirective(x)) if !skip => {
+                let (_, _, ref ifid, ref ifbody, ref elsif, ref elsebody, _, _) = x.nodes;
+                let ifid = identifier(ifid.into(), &s).unwrap();
+                let mut hit = false;
+                if defines.contains_key(&ifid) {
+                    hit = true;
+                } else {
+                    skip_nodes.push(ifbody.into());
+                }
+
+                for x in elsif {
+                    let (_, _, ref elsifid, ref elsifbody) = x;
+                    let elsifid = identifier(elsifid.into(), &s).unwrap();
+                    if hit {
+                        skip_nodes.push(elsifbody.into());
+                    } else if defines.contains_key(&elsifid) {
+                        hit = true;
+                    } else {
+                        skip_nodes.push(elsifbody.into());
+                    }
+                }
+
+                if let Some(elsebody) = elsebody {
+                    let (_, _, ref elsebody) = elsebody;
+                    if hit {
+                        skip_nodes.push(elsebody.into());
+                    }
+                }
+            }
+            NodeEvent::Enter(RefNode::IfndefDirective(x)) if !skip => {
+                let (_, _, ref ifid, ref ifbody, ref elsif, ref elsebody, _, _) = x.nodes;
+                let ifid = identifier(ifid.into(), &s).unwrap();
+                let mut hit = false;
+                if !defines.contains_key(&ifid) {
+                    hit = true;
+                } else {
+                    skip_nodes.push(ifbody.into());
+                }
+
+                for x in elsif {
+                    let (_, _, ref elsifid, ref elsifbody) = x;
+                    let elsifid = identifier(elsifid.into(), &s).unwrap();
+                    if hit {
+                        skip_nodes.push(elsifbody.into());
+                    } else if defines.contains_key(&elsifid) {
+                        hit = true;
+                    } else {
+                        skip_nodes.push(elsifbody.into());
+                    }
+                }
+
+                if let Some(elsebody) = elsebody {
+                    let (_, _, ref elsebody) = elsebody;
+                    if hit {
+                        skip_nodes.push(elsebody.into());
+                    }
+                }
+            }
+            NodeEvent::Enter(RefNode::TextMacroDefinition(x)) if !skip => {
+                let (_, _, ref name, _) = x.nodes;
+                let id = identifier((&name.nodes.0).into(), &s).unwrap();
+                defines.insert(id, Some(x.clone()));
+            }
+            NodeEvent::Enter(RefNode::IncludeCompilerDirective(x)) if !skip => {
+                let path = match x {
+                    IncludeCompilerDirective::DoubleQuote(x) => {
+                        let (_, _, ref literal) = x.nodes;
+                        let (locate, _) = literal.nodes;
+                        locate.str(&s).trim_matches('"')
+                    }
+                    IncludeCompilerDirective::AngleBracket(x) => {
+                        let (_, _, ref literal) = x.nodes;
+                        let (locate, _) = literal.nodes;
+                        locate.str(&s).trim_start_matches('<').trim_end_matches('>')
+                    }
+                };
+                let mut path = PathBuf::from(path);
+                if path.is_relative() {
+                    if !path.exists() {
+                        for include_path in include_paths {
+                            let new_path = include_path.as_ref().join(&path);
+                            if new_path.exists() {
+                                path = new_path;
+                                break;
+                            }
+                        }
+                    }
+                }
+                let include = preprocess(path, &defines, include_paths)?;
+                ret.merge(include);
+            }
+            NodeEvent::Enter(x) => {
+                if skip_nodes.contains(&x) {
+                    skip = true;
+                }
+            }
+            NodeEvent::Leave(x) => {
+                if skip_nodes.contains(&x) {
+                    skip = false;
+                }
+            }
+        }
+    }
+
+    Ok(ret)
+}
+
+fn identifier(node: RefNode, s: &str) -> Option<String> {
+    for x in node {
+        match x {
+            RefNode::SimpleIdentifier(x) => {
+                let x: Locate = x.nodes.0.try_into().unwrap();
+                return Some(String::from(x.str(s)));
+            }
+            RefNode::EscapedIdentifier(x) => {
+                let x: Locate = x.nodes.0.try_into().unwrap();
+                return Some(String::from(x.str(s)));
+            }
+            _ => (),
+        }
+    }
+    None
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use std::env;
+
+    fn get_testcase(s: &str) -> String {
+        format!(
+            "{}/testcases/{}",
+            env::var("CARGO_MANIFEST_DIR").unwrap(),
+            s
+        )
+    }
+
+    #[test]
+    fn test1() {
+        let ret = preprocess(get_testcase("test1.sv"), &HashMap::new(), &[] as &[String]).unwrap();
+        assert_eq!(
+            ret.text(),
+            r##"module and_op (a, b, c);
+output a;
+input b, c;
+
+and a1 (a,b,c);
+endmodule
+"##
+        );
+        assert_eq!(
+            ret.origin(10).unwrap().0,
+            &PathBuf::from(get_testcase("test1.sv"))
+        );
+        assert_eq!(ret.origin(10).unwrap().1, 10);
+        assert_eq!(ret.origin(50).unwrap().1, 98);
+        assert_eq!(ret.origin(70).unwrap().1, 125);
+    }
+
+    #[test]
+    fn test1_predefine() {
+        let mut defines = HashMap::new();
+        defines.insert(String::from("behavioral"), None);
+        let ret = preprocess(get_testcase("test1.sv"), &defines, &[] as &[String]).unwrap();
+        assert_eq!(
+            ret.text(),
+            r##"module and_op (a, b, c);
+output a;
+input b, c;
+
+wire a = b & c;
+endmodule
+"##
+        )
+    }
+
+    #[test]
+    fn test2() {
+        let include_paths = [get_testcase("")];
+        let ret = preprocess(get_testcase("test2.sv"), &HashMap::new(), &include_paths).unwrap();
+        let ret = dbg!(ret);
+        assert_eq!(
+            ret.text(),
+            r##"module and_op (a, b, c);
+output a;
+input b, c;
+
+and a1 (a,b,c);
+endmodule
+"##
+        );
+        assert_eq!(
+            ret.origin(10).unwrap().0,
+            &PathBuf::from(get_testcase("test2.sv"))
+        );
+        assert_eq!(ret.origin(10).unwrap().1, 10);
+        assert_eq!(
+            ret.origin(50).unwrap().0,
+            &PathBuf::from(get_testcase("test3.sv"))
+        );
+        assert_eq!(ret.origin(50).unwrap().1, 73);
+        assert_eq!(
+            ret.origin(70).unwrap().0,
+            &PathBuf::from(get_testcase("test2.sv"))
+        );
+        assert_eq!(ret.origin(70).unwrap().1, 51);
+    }
+}
diff --git a/sv-parser-pp/src/range.rs b/sv-parser-pp/src/range.rs
new file mode 100644
index 0000000..74bd0f7
--- /dev/null
+++ b/sv-parser-pp/src/range.rs
@@ -0,0 +1,62 @@
+use std::cmp::Ordering;
+
+#[derive(Copy, Clone, Debug, Eq)]
+pub struct Range {
+    pub begin: usize,
+    pub end: usize,
+}
+
+impl Range {
+    pub fn new(begin: usize, end: usize) -> Self {
+        assert!(begin < end);
+        Range { begin, end }
+    }
+
+    pub fn offset(&mut self, offset: usize) {
+        self.begin += offset;
+        self.end += offset;
+    }
+}
+
+impl PartialEq for Range {
+    fn eq(&self, other: &Self) -> bool {
+        if self.begin <= other.begin {
+            other.begin < self.end
+        } else {
+            self.begin < other.end
+        }
+    }
+}
+
+impl Ord for Range {
+    fn cmp(&self, other: &Self) -> Ordering {
+        if self.eq(other) {
+            Ordering::Equal
+        } else {
+            self.begin.cmp(&other.begin)
+        }
+    }
+}
+
+impl PartialOrd for Range {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use std::collections::BTreeMap;
+
+    #[test]
+    fn test_btreemap() {
+        let mut map = BTreeMap::new();
+        map.insert(Range::new(0, 10), String::from("0-10"));
+        map.insert(Range::new(10, 15), String::from("10-15"));
+        assert_eq!(map.get(&Range::new(0, 1)), Some(&String::from("0-10")));
+        assert_eq!(map.get(&Range::new(3, 4)), Some(&String::from("0-10")));
+        assert_eq!(map.get(&Range::new(10, 11)), Some(&String::from("10-15")));
+        assert_eq!(map.get(&Range::new(15, 16)), None);
+    }
+}
diff --git a/sv-parser-pp/testcases/test1.sv b/sv-parser-pp/testcases/test1.sv
new file mode 100644
index 0000000..51567d5
--- /dev/null
+++ b/sv-parser-pp/testcases/test1.sv
@@ -0,0 +1,10 @@
+module and_op (a, b, c);
+output a;
+input b, c;
+
+`ifdef behavioral
+    wire a = b & c;
+`else
+    and a1 (a,b,c);
+`endif
+endmodule
diff --git a/sv-parser-pp/testcases/test2.sv b/sv-parser-pp/testcases/test2.sv
new file mode 100644
index 0000000..a943179
--- /dev/null
+++ b/sv-parser-pp/testcases/test2.sv
@@ -0,0 +1,3 @@
+module and_op (a, b, c);
+`include "test3.sv"
+endmodule
diff --git a/sv-parser-pp/testcases/test3.sv b/sv-parser-pp/testcases/test3.sv
new file mode 100644
index 0000000..258b7d6
--- /dev/null
+++ b/sv-parser-pp/testcases/test3.sv
@@ -0,0 +1,8 @@
+output a;
+input b, c;
+
+`ifdef behavioral
+    wire a = b & c;
+`else
+    and a1 (a,b,c);
+`endif