Searched refs:BFS (Results 1 – 4 of 4) sorted by relevance
52 For Up/Down routing, a BFS from every target is used. The BFS tracks link145 a rank of 0. Using the BFS algorithm, the rest of the switch nodes in the149 3. Min Hop Table setting - after ranking is done, a BFS algorithm is run from150 each (CA or switch) node in the subnet. During the BFS process, the FDB table151 of each switch node traversed by BFS is updated, in reference to the starting
71 class BFS : public WorkList { class105 WorkList *WorkList::makeBFS() { return new BFS(); } in makeBFS()
6355 int BFS = MFI->getObjectSize(BFI); in isConsecutiveLoad() local6356 if (FS != BFS || FS != (int)Bytes) return false; in isConsecutiveLoad()
6891 int BFS = MFI->getObjectSize(BFI); in isConsecutiveLS() local6892 if (FS != BFS || FS != (int)Bytes) return false; in isConsecutiveLS()