/**CFile**************************************************************** FileName [mfsWin.c] SystemName [ABC: Logic synthesis and verification system.] PackageName [The good old minimization with complete don't-cares.] Synopsis [Procedures to compute windows stretching to the PIs.] Author [Alan Mishchenko] Affiliation [UC Berkeley] Date [Ver. 1.0. Started - June 20, 2005.] Revision [$Id: mfsWin.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $] ***********************************************************************/ #include "mfsInt.h" ABC_NAMESPACE_IMPL_START //////////////////////////////////////////////////////////////////////// /// DECLARATIONS /// //////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// //////////////////////////////////////////////////////////////////////// /**Function************************************************************* Synopsis [Returns 1 if the node should be a root.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ static inline int Abc_MfsComputeRootsCheck( Abc_Obj_t * pNode, int nLevelMax, int nFanoutLimit ) { Abc_Obj_t * pFanout; int i; // the node is the root if one of the following is true: // (1) the node has more than fanouts than the limit if ( Abc_ObjFanoutNum(pNode) > nFanoutLimit ) return 1; // (2) the node has CO fanouts // (3) the node has fanouts above the cutoff level Abc_ObjForEachFanout( pNode, pFanout, i ) if ( Abc_ObjIsCo(pFanout) || (int)pFanout->Level > nLevelMax ) return 1; return 0; } /**Function************************************************************* Synopsis [Recursively collects the root candidates.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ void Abc_MfsComputeRoots_rec( Abc_Obj_t * pNode, int nLevelMax, int nFanoutLimit, Vec_Ptr_t * vRoots ) { Abc_Obj_t * pFanout; int i; assert( Abc_ObjIsNode(pNode) ); if ( Abc_NodeIsTravIdCurrent(pNode) ) return; Abc_NodeSetTravIdCurrent( pNode ); // check if the node should be the root if ( Abc_MfsComputeRootsCheck( pNode, nLevelMax, nFanoutLimit ) ) Vec_PtrPush( vRoots, pNode ); else // if not, explore its fanouts Abc_ObjForEachFanout( pNode, pFanout, i ) Abc_MfsComputeRoots_rec( pFanout, nLevelMax, nFanoutLimit, vRoots ); } /**Function************************************************************* Synopsis [Recursively collects the root candidates.] Description [Returns 1 if the only root is this node.] SideEffects [] SeeAlso [] ***********************************************************************/ Vec_Ptr_t * Abc_MfsComputeRoots( Abc_Obj_t * pNode, int nWinTfoMax, int nFanoutLimit ) { Vec_Ptr_t * vRoots; vRoots = Vec_PtrAlloc( 10 ); Abc_NtkIncrementTravId( pNode->pNtk ); Abc_MfsComputeRoots_rec( pNode, pNode->Level + nWinTfoMax, nFanoutLimit, vRoots ); assert( Vec_PtrSize(vRoots) > 0 ); // if ( Vec_PtrSize(vRoots) == 1 && Vec_PtrEntry(vRoots, 0) == pNode ) // return 0; return vRoots; } //////////////////////////////////////////////////////////////////////// /// END OF FILE /// //////////////////////////////////////////////////////////////////////// ABC_NAMESPACE_IMPL_END d9be521d5db43ff94dd024883fab86ec30'>tinyusb/docs/contributing/structure.rst
blob: e8c658850d0d0dd6a7002575bf7221e12601416d (plain) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

*********
Structure
*********

Tree
====

::

  .
  ├── docs
  ├── examples
  ├── hw
  │   ├── bsp
  │   └── mcu
  ├── lib
  ├── src
  ├── test
  └── tools

docs
----

Documentation

examples
--------

Sample with Makefile build support

hw/bsp
------

Supported boards source files

hw/mcu
------

Low level mcu core & peripheral drivers

lib
---

Sources from 3rd party such as freeRTOS, fatfs ...

src
---

All sources files for TinyUSB stack itself.

test
----

Unit tests for the stack

tools
-----

Files used internally
generated by cgit v1.2.3 (git 2.25.1) at 2025-08-06 01:02:51 +0000