[Home] [Help]
95: begin
96: --
97: for objlook in c_plnelp_look loop
98: --
99: l_id := ben_hash_utility.get_hashed_index(p_id => objlook.pl_id);
100: --
101: -- Check if hashed value is already allocated
102: --
103: if g_cache_plnelp_lookup.exists(l_id) then
107: -- Loop until un-allocated has value is derived
108: --
109: while not l_not_hash_found loop
110: --
111: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
112: --
113: -- Check if the hash index exists, if not we can use it
114: --
115: if not g_cache_plnelp_lookup.exists(l_id) then
141: for objinst in c_plnelp_inst loop
142: --
143: -- Populate the cache lookup details
144: --
145: l_id := ben_hash_utility.get_hashed_index(p_id => objinst.pl_id);
146: --
147: -- Check if hashed value is already allocated
148: --
149: if g_cache_plnelp_inst.exists(l_id) then
153: -- Loop until un-allocated has value is derived
154: --
155: while not l_not_hash_found loop
156: --
157: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
158: --
159: -- Check if the hash index exists, if not we can use it
160: --
161: if not g_cache_plnelp_inst.exists(l_id) then
244: --
245: -- Get the instance details
246: --
247: l_torrwnum := 0;
248: l_index := ben_hash_utility.get_hashed_index(p_id => p_pl_id);
249: --
250: -- Check if hashed value is already allocated
251: --
252: if g_cache_plnelp_lookup.exists(l_index) then
260: -- Loop until un-allocated has value is derived
261: --
262: while not l_not_hash_found loop
263: --
264: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
265: --
266: -- Check if the hash index exists, if not we can use it
267: --
268: if not g_cache_plnelp_lookup.exists(l_index) then
366: begin
367: --
368: for objlook in c_pgmelp_look loop
369: --
370: l_id := ben_hash_utility.get_hashed_index(p_id => objlook.pgm_id);
371: --
372: -- Check if hashed value is already allocated
373: --
374: if g_cache_pgmelp_lookup.exists(l_id) then
378: -- Loop until un-allocated has value is derived
379: --
380: while not l_not_hash_found loop
381: --
382: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
383: --
384: -- Check if the hash index exists, if not we can use it
385: --
386: if not g_cache_pgmelp_lookup.exists(l_id) then
412: for objinst in c_pgmelp_inst loop
413: --
414: -- Populate the cache lookup details
415: --
416: l_id := ben_hash_utility.get_hashed_index(p_id => objinst.pgm_id);
417: --
418: -- Check if hashed value is already allocated
419: --
420: if g_cache_pgmelp_inst.exists(l_id) then
424: -- Loop until un-allocated has value is derived
425: --
426: while not l_not_hash_found loop
427: --
428: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
429: --
430: -- Check if the hash index exists, if not we can use it
431: --
432: if not g_cache_pgmelp_inst.exists(l_id) then
516: --
517: -- Get the instance details
518: --
519: l_torrwnum := 0;
520: l_index := ben_hash_utility.get_hashed_index(p_id => p_pgm_id);
521: --
522: -- Check if hashed value is already allocated
523: --
524: if g_cache_pgmelp_lookup.exists(l_index) then
532: -- Loop until un-allocated has value is derived
533: --
534: while not l_not_hash_found loop
535: --
536: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
537: --
538: -- Check if the hash index exists, if not we can use it
539: --
540: if not g_cache_pgmelp_lookup.exists(l_index) then
639: begin
640: --
641: for objlook in c_copelp_look loop
642: --
643: l_id := ben_hash_utility.get_hashed_index(p_id => objlook.oipl_id);
644: --
645: -- Check if hashed value is already allocated
646: --
647: if g_cache_copelp_lookup.exists(l_id) then
651: -- Loop until un-allocated has value is derived
652: --
653: while not l_not_hash_found loop
654: --
655: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
656: --
657: -- Check if the hash index exists, if not we can use it
658: --
659: if not g_cache_copelp_lookup.exists(l_id) then
685: for objinst in c_copelp_inst loop
686: --
687: -- Populate the cache lookup details
688: --
689: l_id := ben_hash_utility.get_hashed_index(p_id => objinst.oipl_id);
690: --
691: -- Check if hashed value is already allocated
692: --
693: if g_cache_copelp_inst.exists(l_id) then
697: -- Loop until un-allocated has value is derived
698: --
699: while not l_not_hash_found loop
700: --
701: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
702: --
703: -- Check if the hash index exists, if not we can use it
704: --
705: if not g_cache_copelp_inst.exists(l_id) then
788: --
789: -- Get the instance details
790: --
791: l_torrwnum := 0;
792: l_index := ben_hash_utility.get_hashed_index(p_id => p_oipl_id);
793: --
794: -- Check if hashed value is already allocated
795: --
796: if g_cache_copelp_lookup.exists(l_index) then
804: -- Loop until un-allocated has value is derived
805: --
806: while not l_not_hash_found loop
807: --
808: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
809: --
810: -- Check if the hash index exists, if not we can use it
811: --
812: if not g_cache_copelp_lookup.exists(l_index) then
911: begin
912: --
913: for objlook in c_cppelp_look loop
914: --
915: l_id := ben_hash_utility.get_hashed_index(p_id => objlook.plip_id);
916: --
917: -- Check if hashed value is already allocated
918: --
919: if g_cache_cppelp_lookup.exists(l_id) then
923: -- Loop until un-allocated has value is derived
924: --
925: while not l_not_hash_found loop
926: --
927: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
928: --
929: -- Check if the hash index exists, if not we can use it
930: --
931: if not g_cache_cppelp_lookup.exists(l_id) then
957: for objinst in c_cppelp_inst loop
958: --
959: -- Populate the cache lookup details
960: --
961: l_id := ben_hash_utility.get_hashed_index(p_id => objinst.plip_id);
962: --
963: -- Check if hashed value is already allocated
964: --
965: if g_cache_cppelp_inst.exists(l_id) then
969: -- Loop until un-allocated has value is derived
970: --
971: while not l_not_hash_found loop
972: --
973: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
974: --
975: -- Check if the hash index exists, if not we can use it
976: --
977: if not g_cache_cppelp_inst.exists(l_id) then
1060: --
1061: -- Get the instance details
1062: --
1063: l_torrwnum := 0;
1064: l_index := ben_hash_utility.get_hashed_index(p_id => p_plip_id);
1065: --
1066: -- Check if hashed value is already allocated
1067: --
1068: if g_cache_cppelp_lookup.exists(l_index) then
1076: -- Loop until un-allocated has value is derived
1077: --
1078: while not l_not_hash_found loop
1079: --
1080: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
1081: --
1082: -- Check if the hash index exists, if not we can use it
1083: --
1084: if not g_cache_cppelp_lookup.exists(l_index) then
1183: begin
1184: --
1185: for objlook in c_ctpelp_look loop
1186: --
1187: l_id := ben_hash_utility.get_hashed_index(p_id => objlook.ptip_id);
1188: --
1189: -- Check if hashed value is already allocated
1190: --
1191: if g_cache_ctpelp_lookup.exists(l_id) then
1195: -- Loop until un-allocated has value is derived
1196: --
1197: while not l_not_hash_found loop
1198: --
1199: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
1200: --
1201: -- Check if the hash index exists, if not we can use it
1202: --
1203: if not g_cache_ctpelp_lookup.exists(l_id) then
1229: for objinst in c_ctpelp_inst loop
1230: --
1231: -- Populate the cache lookup details
1232: --
1233: l_id := ben_hash_utility.get_hashed_index(p_id => objinst.ptip_id);
1234: --
1235: -- Check if hashed value is already allocated
1236: --
1237: if g_cache_ctpelp_inst.exists(l_id) then
1241: -- Loop until un-allocated has value is derived
1242: --
1243: while not l_not_hash_found loop
1244: --
1245: l_id := ben_hash_utility.get_next_hash_index(p_hash_index => l_id);
1246: --
1247: -- Check if the hash index exists, if not we can use it
1248: --
1249: if not g_cache_ctpelp_inst.exists(l_id) then
1332: --
1333: -- Get the instance details
1334: --
1335: l_torrwnum := 0;
1336: l_index := ben_hash_utility.get_hashed_index(p_id => p_ptip_id);
1337: --
1338: -- Check if hashed value is already allocated
1339: --
1340: if g_cache_ctpelp_lookup.exists(l_index) then
1348: -- Loop until un-allocated has value is derived
1349: --
1350: while not l_not_hash_found loop
1351: --
1352: l_index := ben_hash_utility.get_next_hash_index(p_hash_index => l_index);
1353: --
1354: -- Check if the hash index exists, if not we can use it
1355: --
1356: if not g_cache_ctpelp_lookup.exists(l_index) then