SVF::SlicedICFGEdgeIterImpl< Forward > Class Template Reference

#include <SlicedGraphs.h>

Public Types
using	iterator_category = std::forward_iterator_tag
using	value_type = SlicedICFGEdgeRef
using	difference_type = std::ptrdiff_t
using	pointer = const SlicedICFGEdgeRef*
using	reference = const SlicedICFGEdgeRef&

Public Member Functions
	SlicedICFGEdgeIterImpl ()=default
reference	operator* () const
pointer	operator-> () const
SlicedICFGNodeRef	target () const
SlicedICFGEdgeIterImpl &	operator++ ()
SlicedICFGEdgeIterImpl	operator++ (int)

Static Public Member Functions
static SlicedICFGEdgeIterImpl	begin (const SlicedICFGView *v, const ICFGNode *n)
static SlicedICFGEdgeIterImpl	end (const SlicedICFGView *v, const ICFGNode *n)

Private Types
using	EdgeIt = ICFGNode::const_iterator
using	BrIt = OrderedSet<const ICFGNode*>::const_iterator

Private Member Functions
	SlicedICFGEdgeIterImpl (const SlicedICFGView *v, const ICFGNode *n)
void	skipNonKeptReal ()
void	refresh ()

Static Private Member Functions
static const OrderedSet< const ICFGNode * > &	emptySet ()
static const ICFGNode *	other (const ICFGEdge *e)

Private Attributes
const SlicedICFGView *	view = nullptr
const ICFGNode *	src = nullptr
EdgeIt	realIt {}
EdgeIt	realEnd {}
const OrderedSet< const ICFGNode * > *	bridged = nullptr
BrIt	brIt {}
BrIt	brEnd {}
SlicedICFGEdgeRef	cur {}

Friends
bool	operator== (const SlicedICFGEdgeIterImpl &a, const SlicedICFGEdgeIterImpl &b)
bool	operator!= (const SlicedICFGEdgeIterImpl &a, const SlicedICFGEdgeIterImpl &b)

Detailed Description

template<bool Forward>
class SVF::SlicedICFGEdgeIterImpl< Forward >

Definition at line 428 of file SlicedGraphs.h.

Member Typedef Documentation

BrIt

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::BrIt = OrderedSet<const ICFGNode*>::const_iterator

private

Definition at line 511 of file SlicedGraphs.h.

difference_type

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::difference_type = std::ptrdiff_t

Definition at line 433 of file SlicedGraphs.h.

EdgeIt

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::EdgeIt = ICFGNode::const_iterator

private

Definition at line 510 of file SlicedGraphs.h.

iterator_category

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::iterator_category = std::forward_iterator_tag

Definition at line 431 of file SlicedGraphs.h.

pointer

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::pointer = const SlicedICFGEdgeRef*

Definition at line 434 of file SlicedGraphs.h.

reference

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::reference = const SlicedICFGEdgeRef&

Definition at line 435 of file SlicedGraphs.h.

value_type

template<bool Forward>

using SVF::SlicedICFGEdgeIterImpl< Forward >::value_type = SlicedICFGEdgeRef

Definition at line 432 of file SlicedGraphs.h.

Constructor & Destructor Documentation

SlicedICFGEdgeIterImpl() [1/2]

template<bool Forward>

SVF::SlicedICFGEdgeIterImpl< Forward >::SlicedICFGEdgeIterImpl ( )

default

SlicedICFGEdgeIterImpl() [2/2]

template<bool Forward>

SVF::SlicedICFGEdgeIterImpl< Forward >::SlicedICFGEdgeIterImpl ( const SlicedICFGView * v, const ICFGNode * n )

inlineprivate

Definition at line 520 of file SlicedGraphs.h.

: view(v), src(n) {}

Member Function Documentation

begin()

template<bool Forward>

SlicedICFGEdgeIterImpl SVF::SlicedICFGEdgeIterImpl< Forward >::begin ( const SlicedICFGView * v, const ICFGNode * n )

inlinestatic

Definition at line 439 of file SlicedGraphs.h.

    {
        SlicedICFGEdgeIterImpl it(v, n);
        const auto& edges = Forward ? n->getOutEdges() : n->getInEdges();
        it.realIt = edges.begin();
        it.realEnd = edges.end();
        it.bridged = Forward ? v->bridgedSuccsOf(n) : v->bridgedPredsOf(n);
        it.brIt = it.bridged ? it.bridged->begin() : emptySet().begin();
        it.brEnd = it.bridged ? it.bridged->end() : emptySet().end();
        it.skipNonKeptReal();
        it.refresh();
        return it;
    }

emptySet()

template<bool Forward>

const OrderedSet< const ICFGNode * > & SVF::SlicedICFGEdgeIterImpl< Forward >::emptySet ( )

inlinestaticprivate

Definition at line 522 of file SlicedGraphs.h.

    {
        static const OrderedSet<const ICFGNode*> e;
        return e;
    }

end()

template<bool Forward>

SlicedICFGEdgeIterImpl SVF::SlicedICFGEdgeIterImpl< Forward >::end ( const SlicedICFGView * v, const ICFGNode * n )

inlinestatic

Definition at line 452 of file SlicedGraphs.h.

    {
        SlicedICFGEdgeIterImpl it(v, n);
        const auto& edges = Forward ? n->getOutEdges() : n->getInEdges();
        it.realIt = edges.end();
        it.realEnd = edges.end();
        it.bridged = Forward ? v->bridgedSuccsOf(n) : v->bridgedPredsOf(n);
        it.brIt = it.bridged ? it.bridged->end() : emptySet().end();
        it.brEnd = it.bridged ? it.bridged->end() : emptySet().end();
        return it;
    }

operator*()

template<bool Forward>

reference SVF::SlicedICFGEdgeIterImpl< Forward >::operator* ( ) const

inline

Definition at line 464 of file SlicedGraphs.h.

    {
        return cur;
    }

operator++() [1/2]

template<bool Forward>

SlicedICFGEdgeIterImpl & SVF::SlicedICFGEdgeIterImpl< Forward >::operator++ ( )

inline

Definition at line 479 of file SlicedGraphs.h.

    {
        if (realIt != realEnd)
        {
            ++realIt;
            skipNonKeptReal();
        }
        else if (brIt != brEnd)
        {
            ++brIt;
        }
        refresh();
        return *this;
    }

operator++() [2/2]

template<bool Forward>

SlicedICFGEdgeIterImpl SVF::SlicedICFGEdgeIterImpl< Forward >::operator++ ( int )

inline

Definition at line 493 of file SlicedGraphs.h.

    {
        SlicedICFGEdgeIterImpl t = *this;
        ++*this;
        return t;
    }

operator->()

template<bool Forward>

pointer SVF::SlicedICFGEdgeIterImpl< Forward >::operator-> ( ) const

inline

Definition at line 468 of file SlicedGraphs.h.

    {
        return &cur;
    }

other()

template<bool Forward>

const ICFGNode * SVF::SlicedICFGEdgeIterImpl< Forward >::other ( const ICFGEdge * e )

inlinestaticprivate

Definition at line 527 of file SlicedGraphs.h.

    {
        return Forward ? e->getDstNode() : e->getSrcNode();
    }

refresh()

template<bool Forward>

void SVF::SlicedICFGEdgeIterImpl< Forward >::refresh ( )

inlineprivate

Definition at line 535 of file SlicedGraphs.h.

    {
        if (realIt != realEnd)
        {
            const ICFGEdge* e = *realIt;
            SlicedICFGNodeRef a{view, e->getSrcNode()}, b{view, e->getDstNode()};
            cur = SlicedICFGEdgeRef{a, b, e, false};
        }
        else if (brIt != brEnd)
        {
            SlicedICFGNodeRef self{view, src}, adj{view, *brIt};
            cur = Forward ? SlicedICFGEdgeRef{self, adj, nullptr, true}
                  :
                  SlicedICFGEdgeRef{adj, self, nullptr, true};
        }
        else
        {
            cur = SlicedICFGEdgeRef{};
        }
    }

skipNonKeptReal()

template<bool Forward>

void SVF::SlicedICFGEdgeIterImpl< Forward >::skipNonKeptReal ( )

inlineprivate

Definition at line 531 of file SlicedGraphs.h.

    {
        while (realIt != realEnd && !view->isKeptNode(other(*realIt))) ++realIt;
    }

target()

template<bool Forward>

SlicedICFGNodeRef SVF::SlicedICFGEdgeIterImpl< Forward >::target ( ) const

inline

Definition at line 474 of file SlicedGraphs.h.

    {
        return Forward ? cur.dst : cur.src;
    }

Friends And Related Symbol Documentation

operator!=

template<bool Forward>

bool operator!= ( const SlicedICFGEdgeIterImpl< Forward > & a, const SlicedICFGEdgeIterImpl< Forward > & b )

friend

Definition at line 504 of file SlicedGraphs.h.

    {
        return !(a == b);
    }

operator==

template<bool Forward>

bool operator== ( const SlicedICFGEdgeIterImpl< Forward > & a, const SlicedICFGEdgeIterImpl< Forward > & b )

friend

Definition at line 500 of file SlicedGraphs.h.

    {
        return a.view == b.view && a.src == b.src && a.realIt == b.realIt && a.brIt == b.brIt;
    }

Member Data Documentation

brEnd

template<bool Forward>

BrIt SVF::SlicedICFGEdgeIterImpl< Forward >::brEnd {}

private

Definition at line 517 of file SlicedGraphs.h.

{}, brEnd{};

bridged

template<bool Forward>

const OrderedSet<const ICFGNode*>* SVF::SlicedICFGEdgeIterImpl< Forward >::bridged = nullptr

private

Definition at line 516 of file SlicedGraphs.h.

brIt

template<bool Forward>

BrIt SVF::SlicedICFGEdgeIterImpl< Forward >::brIt {}

private

Definition at line 517 of file SlicedGraphs.h.

{}, brEnd{};

cur

template<bool Forward>

SlicedICFGEdgeRef SVF::SlicedICFGEdgeIterImpl< Forward >::cur {}

private

Definition at line 518 of file SlicedGraphs.h.

{};

realEnd

template<bool Forward>

EdgeIt SVF::SlicedICFGEdgeIterImpl< Forward >::realEnd {}

private

Definition at line 515 of file SlicedGraphs.h.

{}, realEnd{};

realIt

template<bool Forward>

EdgeIt SVF::SlicedICFGEdgeIterImpl< Forward >::realIt {}

private

Definition at line 515 of file SlicedGraphs.h.

{}, realEnd{};

src

template<bool Forward>

const ICFGNode* SVF::SlicedICFGEdgeIterImpl< Forward >::src = nullptr

private

Definition at line 514 of file SlicedGraphs.h.

view

template<bool Forward>

const SlicedICFGView* SVF::SlicedICFGEdgeIterImpl< Forward >::view = nullptr

private

Definition at line 513 of file SlicedGraphs.h.

---

The documentation for this class was generated from the following file:

• /home/runner/work/SVF/SVF/svf/include/Graphs/SlicedGraphs.h