Home
last modified time | relevance | path

Searched refs:jpm_Pop0 (Results 1 – 25 of 30) sorted by relevance

12

/dports/devel/judy/judy-1.0.5/src/JudyCommon/
H A DJudyMallocIF.c220 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBL()
243 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBB()
286 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBU()
556 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBL()
572 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBB()
604 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBU()
622 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL1()
640 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL2()
656 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL3()
674 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL4()
[all …]
H A DJudyCount.c202 Pjpm->jpm_Pop0 = Pjlw[0]; // from first word of leaf. in Judy1Count()
203 pop1 = Pjpm->jpm_Pop0 + 1; in Judy1Count()
209 pop1 = (Pjpm->jpm_Pop0) + 1; // note: can roll over to 0. in Judy1Count()
395 pop1 = (Pjpm->jpm_Pop0) + 1; \ in j__udy1LCountSM()
420 assert((Pjpm->jpm_Pop0) + 1 == Pjlw[0] + 1); // sent correctly. in j__udy1LCountSM()
421 offset = j__udySearchLeafW(Pjlw + 1, Pjpm->jpm_Pop0 + 1, Index); in j__udy1LCountSM()
423 assert(offset < (Pjpm->jpm_Pop0) + 1); // Index be in range. in j__udy1LCountSM()
424 return((Pjpm->jpm_Pop0) + 1 - offset); // INCLUSIVE of Index. in j__udy1LCountSM()
H A DJudyIns.c260 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
402 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
459 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
472 if ((Pjpm->jpm_Pop0 - Pjpm->jpm_LastUPop0) > JU_BTOU_POP_INCREMENT) in j__udyInsWalk()
477 if (Pjpm->jpm_Pop0 > JU_BRANCHB_MAX_POP) in j__udyInsWalk()
488 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
1822 (Pjpm->jpm_Pop0) = cJU_LEAFW_MAXPOP1 - 1; in Judy1Set()
1856 if (retcode == 1) ++(Pjpm->jpm_Pop0); // incr total array popu. in Judy1Set()
H A DJudyFreeArray.c73 jpm.jpm_Pop0 = 0; // see above.
H A DJudyInsArray.c234 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
253 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
H A DJudyByCount.c158 if (Count0 > (Pjpm->jpm_Pop0)) JU_RET_NOTFOUND; // too high. in Judy1ByCount()
161 pop1 = (Pjpm->jpm_Pop0) + 1; in Judy1ByCount()
H A DJudyDel.c1979 --(Pjpm->jpm_Pop0); // success; decrement total population. in Judy1Unset()
1981 if ((Pjpm->jpm_Pop0 + 1) != cJU_LEAFW_MAXPOP1) in Judy1Unset()
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/klib/judy/
H A DJudyMallocIF.c218 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBL()
241 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBB()
284 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBU()
554 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBL()
570 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBB()
602 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBU()
620 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL1()
638 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL2()
654 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL3()
672 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL4()
[all …]
H A DJudyCount.c200 Pjpm->jpm_Pop0 = Pjlw[0]; // from first word of leaf. in Judy1Count()
201 pop1 = Pjpm->jpm_Pop0 + 1; in Judy1Count()
207 pop1 = (Pjpm->jpm_Pop0) + 1; // note: can roll over to 0. in Judy1Count()
393 pop1 = (Pjpm->jpm_Pop0) + 1; \ in j__udy1LCountSM()
418 assert((Pjpm->jpm_Pop0) + 1 == Pjlw[0] + 1); // sent correctly. in j__udy1LCountSM()
419 offset = j__udySearchLeafW(Pjlw + 1, Pjpm->jpm_Pop0 + 1, Index); in j__udy1LCountSM()
421 assert(offset < (Pjpm->jpm_Pop0) + 1); // Index be in range. in j__udy1LCountSM()
422 return((Pjpm->jpm_Pop0) + 1 - offset); // INCLUSIVE of Index. in j__udy1LCountSM()
H A DJudyIns.c258 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
400 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
457 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
470 if ((Pjpm->jpm_Pop0 - Pjpm->jpm_LastUPop0) > JU_BTOU_POP_INCREMENT) in j__udyInsWalk()
475 if (Pjpm->jpm_Pop0 > JU_BRANCHB_MAX_POP) in j__udyInsWalk()
486 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
1820 (Pjpm->jpm_Pop0) = cJU_LEAFW_MAXPOP1 - 1; in Judy1Set()
1854 if (retcode == 1) ++(Pjpm->jpm_Pop0); // incr total array popu. in Judy1Set()
H A DJudyFreeArray.c71 jpm.jpm_Pop0 = 0; // see above.
H A DJudyByCount.c156 if (Count0 > (Pjpm->jpm_Pop0)) JU_RET_NOTFOUND; // too high. in Judy1ByCount()
159 pop1 = (Pjpm->jpm_Pop0) + 1; in Judy1ByCount()
H A DJudyInsArray.c232 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
251 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
H A DJudy1.h429 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member
H A DJudyL.h364 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/klib/judy/
H A DJudyMallocIF.c218 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBL()
241 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBB()
284 j__udyMemSequence++, Words, (Pjpm->jpm_Pop0) + 2); in j__udyAllocJBU()
554 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBL()
570 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBB()
602 j__udyMemSequence++, Words, Pjpm->jpm_Pop0); in j__udyFreeJBU()
620 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL1()
638 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL2()
654 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL3()
672 j__udyMemSequence++, Pop1, Words, Pjpm->jpm_Pop0); in j__udyFreeJLL4()
[all …]
H A DJudyCount.c200 Pjpm->jpm_Pop0 = Pjlw[0]; // from first word of leaf. in Judy1Count()
201 pop1 = Pjpm->jpm_Pop0 + 1; in Judy1Count()
207 pop1 = (Pjpm->jpm_Pop0) + 1; // note: can roll over to 0. in Judy1Count()
393 pop1 = (Pjpm->jpm_Pop0) + 1; \ in j__udy1LCountSM()
418 assert((Pjpm->jpm_Pop0) + 1 == Pjlw[0] + 1); // sent correctly. in j__udy1LCountSM()
419 offset = j__udySearchLeafW(Pjlw + 1, Pjpm->jpm_Pop0 + 1, Index); in j__udy1LCountSM()
421 assert(offset < (Pjpm->jpm_Pop0) + 1); // Index be in range. in j__udy1LCountSM()
422 return((Pjpm->jpm_Pop0) + 1 - offset); // INCLUSIVE of Index. in j__udy1LCountSM()
H A DJudyIns.c258 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
400 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
457 exppop1 = Pjpm->jpm_Pop0; in j__udyInsWalk()
470 if ((Pjpm->jpm_Pop0 - Pjpm->jpm_LastUPop0) > JU_BTOU_POP_INCREMENT) in j__udyInsWalk()
475 if (Pjpm->jpm_Pop0 > JU_BRANCHB_MAX_POP) in j__udyInsWalk()
486 Pjpm->jpm_LastUPop0 = Pjpm->jpm_Pop0; in j__udyInsWalk()
1820 (Pjpm->jpm_Pop0) = cJU_LEAFW_MAXPOP1 - 1; in Judy1Set()
1854 if (retcode == 1) ++(Pjpm->jpm_Pop0); // incr total array popu. in Judy1Set()
H A DJudyFreeArray.c71 jpm.jpm_Pop0 = 0; // see above.
H A DJudyByCount.c156 if (Count0 > (Pjpm->jpm_Pop0)) JU_RET_NOTFOUND; // too high. in Judy1ByCount()
159 pop1 = (Pjpm->jpm_Pop0) + 1; in Judy1ByCount()
H A DJudyInsArray.c232 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
251 (Pjpm->jpm_Pop0) = Count - 1; in Judy1SetArray()
H A DJudy1.h429 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member
H A DJudyL.h364 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member
/dports/devel/judy/judy-1.0.5/src/Judy1/
H A DJudy1.h431 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member
/dports/devel/judy/judy-1.0.5/src/JudyL/
H A DJudyL.h366 /* 1 */ Word_t jpm_Pop0; // total population-1 in array. member

12