Home
last modified time | relevance | path

Searched refs:which_half (Results 1 – 9 of 9) sorted by relevance

/dports/net-p2p/c-lightning/lightning-0.10.2/common/
H A Ddijkstra.c221 int which_half; in dijkstra_() local
227 c = gossmap_nth_chan(map, cur, i, &which_half); in dijkstra_()
228 neighbor = gossmap_nth_node(map, c, !which_half); in dijkstra_()
236 if (!channel_ok(map, c, !which_half, cur_d->cost, arg)) in dijkstra_()
241 c->half[!which_half].base_fee, in dijkstra_()
242 c->half[!which_half].proportional_fee)) in dijkstra_()
249 + c->half[!which_half].delay); in dijkstra_()
250 score = path_score(cur_d->distance + 1, cost, risk, !which_half, c); in dijkstra_()
256 + c->half[!which_half].delay; in dijkstra_()
H A Dgossmap.h169 int *which_half);
H A Dgossmap.c990 int *which_half) in gossmap_nth_chan() argument
998 if (which_half) { in gossmap_nth_chan()
1000 *which_half = 0; in gossmap_nth_chan()
1003 *which_half = 1; in gossmap_nth_chan()
/dports/biology/ncbi-toolkit/ncbi/algo/blast/core/
H A Dblast_itree.c527 enum EIntervalDirection which_half; in BlastIntervalTreeAddHSP() local
632 which_half = eIntervalTreeLeft; in BlastIntervalTreeAddHSP()
656 which_half = eIntervalTreeRight; in BlastIntervalTreeAddHSP()
709 mid_index = s_IntervalNodeInit(tree, root_index, which_half, &retval); in BlastIntervalTreeAddHSP()
717 if (which_half == eIntervalTreeLeft) in BlastIntervalTreeAddHSP()
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/src/algo/blast/core/
H A Dblast_itree.c527 enum EIntervalDirection which_half; in BlastIntervalTreeAddHSP() local
632 which_half = eIntervalTreeLeft; in BlastIntervalTreeAddHSP()
656 which_half = eIntervalTreeRight; in BlastIntervalTreeAddHSP()
709 mid_index = s_IntervalNodeInit(tree, root_index, which_half, &retval); in BlastIntervalTreeAddHSP()
717 if (which_half == eIntervalTreeLeft) in BlastIntervalTreeAddHSP()
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/blast/core/
H A Dblast_itree.c527 enum EIntervalDirection which_half; in BlastIntervalTreeAddHSP() local
632 which_half = eIntervalTreeLeft; in BlastIntervalTreeAddHSP()
656 which_half = eIntervalTreeRight; in BlastIntervalTreeAddHSP()
709 mid_index = s_IntervalNodeInit(tree, root_index, which_half, &retval); in BlastIntervalTreeAddHSP()
717 if (which_half == eIntervalTreeLeft) in BlastIntervalTreeAddHSP()
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/ia64/kernel/
H A Dptrace.c1813 int which_half = (pos / sizeof(unsigned long)) & 1; in access_uarea() local
1827 fpreg.u.bits[which_half] = *data; in access_uarea()
1831 *data = fpreg.u.bits[which_half]; in access_uarea()
1835 unsigned long *bits = &p->u.bits[which_half]; in access_uarea()
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/ia64/kernel/
H A Dptrace.c1813 int which_half = (pos / sizeof(unsigned long)) & 1; in access_uarea() local
1827 fpreg.u.bits[which_half] = *data; in access_uarea()
1831 *data = fpreg.u.bits[which_half]; in access_uarea()
1835 unsigned long *bits = &p->u.bits[which_half]; in access_uarea()
/dports/multimedia/libv4l/linux-5.13-rc2/arch/ia64/kernel/
H A Dptrace.c1813 int which_half = (pos / sizeof(unsigned long)) & 1; in access_uarea() local
1827 fpreg.u.bits[which_half] = *data; in access_uarea()
1831 *data = fpreg.u.bits[which_half]; in access_uarea()
1835 unsigned long *bits = &p->u.bits[which_half]; in access_uarea()