seams-core v2.14.0
libyodaLib, the C++ engine of d-SEAMS
Loading...
Searching...
No Matches
tum_device.hpp File Reference

Device-safe TUM ice-score pieces: hop-bound primitive six-rings and claim-free HC/DDC affiliation. More...

Go to the source code of this file.

Namespaces

namespace  tum
namespace  tum::device

Functions

bool tum::device::bonded (const int *deg, const int *cols, int nAtoms, int kMax, int a, int b)
bool tum::device::inSix (const int *r, int atom)
bool tum::device::shareAtoms (const int *a, const int *b)
int tum::device::commonCount (const int *a, const int *b)
bool tum::device::commonInThree (const int *a, const int *b, const int *c)
bool tum::device::shareNeigh (const int *deg, const int *cols, int nAtoms, int kMax, int a, int b)
int tum::device::hopsAtMost (const int *deg, const int *cols, int nAtoms, int kMax, int a, int b, int cap)
 Graph distance from a to b when it is at most cap, else -1.
bool tum::device::hopBoundPrimitiveSix (const int *r, const int *deg, const int *cols, int nAtoms, int kMax)
 Hop-bounded Franzblau SP test on a six-cycle of the bond graph.
bool tum::device::notNeighboursOfRing (const int *deg, const int *cols, int nAtoms, int kMax, const int *trip, const int *ring)
bool tum::device::basalConditions (const int *deg, const int *cols, int nAtoms, int kMax, const int *b1, const int *b2)
 beta(b1, b2) for rings sharing no atom: some alternating triplet {l_p, l_p+2, l_p+4} of b1 bonds one-to-one onto an alternating triplet {m_q, m_q+2, m_q+4} of b2, and no other atom of b2 is bonded to b1.
int tum::device::ringsThrough (const int *A, int nA, const int *B, int nB, const int *C, int nC, int skipA, int skipB, int *out, int cap)
int tum::device::fetchAdd (int *p)
void tum::device::enumSixFrom (int i, const int *deg, const int *cols, int nAtoms, int kMax, int maxRings, int *nRings, int *ringAtoms)
 Enumerate hop-bound primitive six-rings whose lowest vertex is i.
void tum::device::invertOneRing (int r, const int *nRings, const int *ringAtoms, int nAtoms, int maxPer, int *throughCount, int *through)
 throughCount counts every stored ring through the atom; only the first maxPer ids are kept.
void tum::device::sortThroughRow (int *row, int n)
bool tum::device::seenEarlier (const int *bi, const int *deg, const int *cols, const int *throughCount, const int *through, int nAtoms, int kMax, int maxPer, int slot, int n, int j)
 True when ring j is in the through row of a bond neighbour of bi[0] or bi[1] visited before (slot, n), so each candidate is tested once.
void tum::device::emitBasalFrom (int i, const int *nRings, const int *ringAtoms, const int *deg, const int *cols, const int *throughCount, const int *through, int nAtoms, int kMax, int maxPer, int maxPairs, int *nPairs, int *pairs)
 Ordered basal pairs (i, j).
void tum::device::applyHcPair (int p, const int *nPairs, const int *pairs, const int *ringAtoms, const int *throughCount, const int *through, int nAtoms, int maxPer, int *hc)
void tum::device::ddcFrom (int i, const int *nRings, const int *ringAtoms, const int *throughCount, const int *through, const int *hc, int nAtoms, int maxPer, int *ddc)
 epsilon(i) for a ring that is not HC, as ring::equatorialConditions: every atom in 3 other rings, and pairwise distinct P_k in T_k with P_0, P_2, P_4 sharing an atom, P_1, P_3, P_5 sharing an atom and, for some starting atom and direction of i, the alternate pairs sharing 3 atoms.
void tum::device::atomIceFrom (int r, const int *nRings, const int *ringAtoms, const int *hc, const int *ddc, int nAtoms, int *atomHc, int *atomDdc)

Variables

constexpr int tum::device::kRowCap = 32
 Longest atom row the kernels accept.

Detailed Description

Device-safe TUM ice-score pieces: hop-bound primitive six-rings and claim-free HC/DDC affiliation.

No STL containers, no function-local statics. Host OpenMP and OpenMP target regions call the same functions. CHILL and q_lm are not here.

A six-cycle is primitive when the hop-bounded Franzblau test holds: every pair of non-adjacent members is at least as far through the graph as around the ring. On a 4-regular bond graph that is no chords (ring hops 2) and no common neighbour of opposite vertices (ring hops 3).

Definition in file tum_device.hpp.