Shopping Cart | Contact us | Partners | Customers
HOME OVERVIEW PRODUCTS PRICE LIST DOWNLOADS SUPPORT COMPANY TIPS & FAQ TUTORIALS

Crystal FLOW
Why Crystal FLOW
Overview
Screen Shots
System Requirements
Interactive Flowchart
HTML Documentation
Code Navigation
Premium Browsing
Call/Caller/File Trees
Crystal REVS
What's New
Comparison

Understand code in less time with Crystal C/C++
View Demo
 
 
Crystal FLOW for C
Crystal FLOW for C++
Crystal REVS for C
Crystal REVS for C++
 

Call / Caller / File Trees

Home Products Crystal FLOW Call / Caller / File Trees Try Now
 

Feature: Call / Caller / File Trees - PDF


You can view the Call-tree or Caller-tree of a function. You can also view the File-tree. It shows what files are #included (directly or nested) in the current file.

  When you click on a node in a call-tree or a caller-tree, the corresponding function's code is displayed in the file-window

  By clicking on a node in the file-tree you can open the corresponding file

  The file-tree highlights any missing files, i.e. #included files that could not be found

  All occurrences of the current node are automatically highlighted. You can easily see all
  occurrences of the current node as you scan the tree

  Call-Path Extraction: Often a call-tree is very long and it is difficult to see the full call-sequence from the root to the current node.
  You can hide all nodes except the nodes that are in the call-path from the root to the current node - or from the root to all occurrences
  of the current node. You get a clear and compact view of the call-sequence

  You can perform a node-search to find a function in the tree. This is especially helpful in very large trees

  Function's Occurrences List is a filewise list of all the places in the project where the current function is called. By clicking on
  any entry in the list, you can display the corresponding code

  You can export a call-path, a tree or a selected part of a tree as a .bmp or .jpg file

   
  © Copyright 2017, SGV Sarc, All Rights Reserved. | Privacy Policy | Disclaimer | Sitemap