Home
last modified time | relevance | path

Searched refs:PASS_LD (Results 1 – 25 of 70) sorted by relevance

123

/dports/lang/swi-pl/swipl-8.2.3/src/
H A Dpl-ldpass.h43 #define allocGlobal(n) allocGlobal__LD(n PASS_LD)
53 compileTermToHeap__LD(t, NULL, NULL, f PASS_LD)
54 #define linkVal(p) linkVal__LD(p PASS_LD)
56 #define bindConst(p, c) bindConst__LD(p, c PASS_LD)
57 #define consPtr(p, ts) consPtr__LD(p, ts PASS_LD)
84 #define PL_unify(t1, t2) PL_unify__LD(t1, t2 PASS_LD)
90 #define PL_get_atom(t, a) PL_get_atom__LD(t, a PASS_LD)
91 #define PL_put_atom(t, a) PL_put_atom__LD(t, a PASS_LD)
111 #define PL_is_atomic(t) PL_is_atomic__LD(t PASS_LD)
113 #define PL_is_atom(t) PL_is_atom__LD(t PASS_LD)
[all …]
H A Dpl-dict.c730 if ( dict_order(m, TRUE PASS_LD) ) in PL_get_dict_ex()
1068 resort_dicts_in_term(p PASS_LD); in resort_dicts_in_term()
1080 resort_dicts_in_term(p PASS_LD); in resortDictsInTerm()
1131 ALLOW_GC|ALLOW_SHIFT PASS_LD);
1199 ALLOW_GC|ALLOW_SHIFT PASS_LD) && in pl_get_dict()
1246 if ( !get_name_ex(A1, &key PASS_LD) ||
1381 &new PASS_LD)) == TRUE )
1483 get_name_ex(key, &k PASS_LD) ) in setdict()
1489 unify_vp(vp, val PASS_LD); in setdict()
1512 return setdict(A1, A2, A3, 0 PASS_LD);
[all …]
H A Dpl-attvar.c212 register_attvar(gp PASS_LD); in link_attvar()
284 trail_new_attvar(gp PASS_LD); in make_new_attvar()
311 trail_new_attvar(gp PASS_LD); in put_new_attvar()
585 { restore_exception(p PASS_LD); in restoreWakeup()
894 if ( is_or(c2 PASS_LD) ) in add_or()
917 if ( is_or(c1 PASS_LD) ) in make_disj_list()
1220 av = deRefM(av, &w PASS_LD); in has_attributes_after()
1225 { l = deRefM(l, &w PASS_LD); in has_attributes_after()
1251 (void)deRefM(pv, &w PASS_LD); in has_attributes_after()
1325 scan_trail(ch, TRUE PASS_LD);
[all …]
H A Dpl-copyterm.c195 { if ( !can_share(a PASS_LD) ) in update_ground()
296 unshare_attvar(ap PASS_LD); in mark_for_copy()
307 update_ground(p PASS_LD); in mark_for_copy()
424 TrailCyclic(from PASS_LD); in copy_term()
446 TrailCyclic(p PASS_LD); in copy_term()
447 TrailCyclic(from PASS_LD); in copy_term()
464 TrailCyclic(p PASS_LD); in copy_term()
465 TrailCyclic(from PASS_LD); in copy_term()
571 cp_unmark(from, flags PASS_LD); in do_copy_term()
580 exitCyclicCopy(flags PASS_LD); in do_copy_term()
[all …]
H A Dpl-comp.c548 getVarDef(n-1 PASS_LD); in resetVarDefs()
1272 setVars(t, vt PASS_LD); in setVars()
3269 skippedVar(a1, ci PASS_LD); in compileBodyEQ()
3270 skippedVar(a2, ci PASS_LD); in compileBodyEQ()
3532 ci PASS_LD); in compileBodyTypeTest()
4659 *PC++ PASS_LD) ); in decompile_head()
5030 index PASS_LD); in decompileBody()
5291 cm PASS_LD); in decompileBody()
6804 add_node(tail, 2 PASS_LD);
6960 add_node(tail, 2 PASS_LD);
[all …]
H A Dpl-gc.c1002 mark_variable(sp PASS_LD); in mark_term_refs()
1444 push_marked(p PASS_LD); in mergeTrailedAssignments()
1516 mark_variable(gp PASS_LD); in early_reset_vars()
1860 mark_argp(state PASS_LD); in walk_and_mark()
1976 mark_argp(state PASS_LD); in walk_and_mark()
2053 mark_argp(state PASS_LD); in walk_and_mark()
2064 mark_argp(state PASS_LD); in walk_and_mark()
2068 mark_argp(state PASS_LD); in walk_and_mark()
3817 set_start(gTop PASS_LD); in scan_global()
4344 unblockGC(0 PASS_LD); in garbageCollect()
[all …]
H A Dpl-wam.c662 return call1(mdef, goal PASS_LD); in call_term()
682 return call1(mdef, goal PASS_LD); in call_term()
740 restoreWakeup(&wstate PASS_LD); in callCleanupHandler()
836 protect_var(l PASS_LD); in unify_gl()
1259 restoreWakeup(&wstate PASS_LD); in callBreakHook()
1371 __do_undo(m PASS_LD); in do_undo()
1508 if ( !is_qualified(p PASS_LD) ) in m_qualify_argument()
2331 discardFrame(fr2 PASS_LD); in discardChoicesAfter()
2588 discardFrame(&qf->frame PASS_LD); in discard_query()
2643 discard_query(qid PASS_LD); in PL_cut_query()
[all …]
H A Dpl-prims.c139 return visitedWord(p PASS_LD); in visited()
513 foreignWakeup(ex PASS_LD) ) in can_unify()
627 blockGC(0 PASS_LD); in failed_unify_with_occurs_check()
629 unblockGC(0 PASS_LD); in failed_unify_with_occurs_check()
910 if ( visited(f PASS_LD) ) in term_size()
1402 unscan_shared(t PASS_LD); in PL_factorize_term()
1414 link_shared(t PASS_LD); in PL_factorize_term()
1517 if ( visited(t PASS_LD) ) in termHashValue()
2404 unify_vp(a, v PASS_LD); in setarg()
3513 PASS_LD); in unifiable_occurs_check()
[all …]
H A Dpl-vmi.c3433 popArgvArithStack(2 PASS_LD);
3435 { pushArithStack(&r PASS_LD);
3455 popArgvArithStack(2 PASS_LD);
3457 { pushArithStack(&r PASS_LD);
3598 popArgvArithStack(2 PASS_LD);
3754 popArgvArithStack(1 PASS_LD);
4577 discardFrame(FR PASS_LD);
4585 discardFrame(FR PASS_LD);
4604 trimStacks(FALSE PASS_LD);
4636 discardFrame(FR PASS_LD);
[all …]
H A Dpl-tabling.c1160 if ( ground__LD(p PASS_LD) != NULL ) in update_delay_list()
1372 push_delay_list(p PASS_LD); in tbl_push_delay()
2373 &sa, &vars PASS_LD); in get_answer_table()
3406 if ( get_worklist(A1, &wl PASS_LD) )
3423 TRUE, &sa, NULL PASS_LD);
3660 ctx->delays PASS_LD) ) in update_subsuming_answer()
3813 if ( get_worklist(A1, &wl PASS_LD) )
3900 if ( get_worklist(A1, &wl PASS_LD) )
3989 push_delay_list(p PASS_LD); in unify_dependency()
4001 push_delay_list(p PASS_LD); in unify_dependency()
[all …]
H A Dpl-read.c1466 rc = raw_read2(_PL_rd PASS_LD); in raw_read()
1469 { rc = raw_read2(_PL_rd PASS_LD); in raw_read()
3456 if ( (rc = build_term(op_name(op PASS_LD), arity+1, _PL_rd PASS_LD)) != TRUE ) in build_op_term()
3512 stringAtom(op_name(e PASS_LD))
4244 { alloc_term(_PL_rd PASS_LD); in read_dict()
4310 _PL_rd PASS_LD)) != TRUE ) in read_dict()
4349 alloc_term(_PL_rd PASS_LD); in simple_term()
4442 _PL_rd PASS_LD); in simple_term()
4700 init_read_data(&rd, s PASS_LD); in pl_read2()
4812 init_read_data(&rd, s PASS_LD); in read_clause()
[all …]
H A Dpl-fli.c355 PL_reset_term_refs__LD(r PASS_LD); in PL_reset_term_refs()
1151 bindConsVal(++a, ai++ PASS_LD); in PL_cons_functor_v()
2073 length = skip_list(l, &t PASS_LD); in PL_skip_list()
2080 unify_ptrs(t2, t, 0 PASS_LD); in PL_skip_list()
2177 return PL_is_atom__LD(t PASS_LD); in PL_is_atom()
2770 put_int64(&w, i, 0 PASS_LD); in _PL_put_xpce_reference_i()
2803 { return unifyAtomic(t, a PASS_LD); in PL_unify_atom__LD()
2810 return unifyAtomic(t, a PASS_LD); in PL_unify_atom()
3128 put_int64(&w, i, 0 PASS_LD); in unify_int64_ex__LD()
3169 return unifyAtomic(t, w PASS_LD); in PL_unify_uint64()
[all …]
H A Dpl-event.c118 if ( !get_callback(closure, &m, t PASS_LD) ) in add_event_hook()
223 return prolog_listen(A1, A2, 0 PASS_LD);
230 return prolog_listen(A1, A2, A3 PASS_LD);
240 if ( get_event_listp(A1, &listp, &argc PASS_LD) )
252 if ( !get_callback(A2, &m, t PASS_LD) )
548 if ( !saveWakeup(&wstate, TRUE PASS_LD) ) in PL_call_event_hook_va()
620 restoreWakeup(&wstate PASS_LD); in PL_call_event_hook_va()
632 if ( !saveWakeup(&wstate, TRUE PASS_LD) ) in predicate_update_event()
641 restoreWakeup(&wstate PASS_LD); in predicate_update_event()
652 if ( !saveWakeup(&wstate, TRUE PASS_LD) ) in retractall_event()
[all …]
H A Dpl-trie.c730 prune_error(trie, node PASS_LD); in trie_lookup_abstract()
745 prune_error(trie, node PASS_LD); in trie_lookup_abstract()
912 destroy_ukey_state(&ustate PASS_LD); in unify_trie_term()
1263 { word val = intern_value(value PASS_LD); in set_trie_value()
1539 unify_trie_term(ptr, NULL, A2 PASS_LD)
1652 assignAttVar(p, &w PASS_LD); in unify_key()
1996 if ( advance_node(ch PASS_LD) ) in add_choice()
2082 { if ( advance_node(ch PASS_LD) ) in next_choice0()
2136 { destroy_ukey_state(&ustate PASS_LD); in unify_trie_path()
2141 destroy_ukey_state(&ustate PASS_LD); in unify_trie_path()
[all …]
H A Dpl-codelist.h57 #define valHandle(r) valHandle__LD(r PASS_LD)
60 #define INIT_SEQ_STRING(n) INIT_SEQ_STRING__LD(n PASS_LD)
61 #define EXTEND_SEQ_CODES(p, c) EXTEND_SEQ_CODES__LD(p, c PASS_LD)
62 #define EXTEND_SEQ_CHARS(p, c) EXTEND_SEQ_CHARS__LD(p, c PASS_LD)
64 CLOSE_SEQ_STRING__LD(p, p0, tail, term, l PASS_LD)
H A Dpl-list.c134 { if ( foreignWakeup(ex PASS_LD) )
369 if ( (vp = dict_lookup_ptr(*p1, argv[0] PASS_LD)) ) in extract_key()
432 len = skip_list(l, &tail PASS_LD); in prolog_list_to_sort_list()
463 p->item.key = extract_key(p->item.term, argc, argv, pair PASS_LD); in prolog_list_to_sort_list()
523 &l, &top PASS_LD) ) in pl_nat_sort()
549 0, NULL, FALSE PASS_LD);
559 0, NULL, FALSE PASS_LD);
569 0, NULL, TRUE PASS_LD);
645 if ( (rc=get_key_arg_ex(A1, argv, TRUE PASS_LD)) == FALSE )
667 { if ( get_key_arg_ex(head, &argv[argc], FALSE PASS_LD) != TRUE )
[all …]
H A Dpl-variant.c223 univ(node_orig(Node(i, buf)), &dm, &lm PASS_LD); in isomorphic()
224 univ(node_orig(Node(j, buf)), &dn, &ln PASS_LD); in isomorphic()
291 univ(node_orig(m), &dm, &lm PASS_LD); in isomorphic()
292 univ(node_orig(n), &dn, &ln PASS_LD); in isomorphic()
397 { if ( ( h = isomorphic(agenda, k, j, buf PASS_LD) ) <= 0 ) in variant()
402 univ(node_orig(m), &dm, &lm PASS_LD); in variant()
403 univ(node_orig(Node(j,buf)), &dn, &ln PASS_LD); in variant()
474 rval = variant(&agenda, VARIANT_BUFFER PASS_LD); in is_variant_ptr()
500 return is_variant_ptr(valTermRef(A1), valTermRef(A2) PASS_LD);
507 return !is_variant_ptr(valTermRef(A1), valTermRef(A2) PASS_LD);
H A Dpl-wic.c707 xr = getBlob(state PASS_LD); in loadXRc()
2360 do_save_qlf_term(state, q PASS_LD); in do_save_qlf_term()
2554 PASS_LD); in saveWicClause()
2558 PASS_LD); in saveWicClause()
2641 saveXRProc(state, p PASS_LD); in saveWicClause()
2646 saveXRModule(state, m PASS_LD); in saveWicClause()
2651 saveXRFunctor(state, f PASS_LD); in saveWicClause()
2656 saveXRFunctor(state, f PASS_LD); in saveWicClause()
2910 saveXRProc(state, proc PASS_LD); in importWic()
3391 loadInclude(state PASS_LD); in qlfLoad()
[all …]
H A Dpl-gvar.c301 return setval(A1, A2, FALSE PASS_LD);
309 return getval(A1, A2, TRUE PASS_LD);
317 return setval(A1, A2, TRUE PASS_LD);
324 return getval(A1, A2, TRUE PASS_LD);
360 return getval(A1, A2, FALSE PASS_LD);
387 unify_ptrs(valTermRef(A2), &val, 0 PASS_LD) )
H A Dpl-prof.c191 return activateProfiler(PROF_CPU PASS_LD); in startProfiler()
271 return activateProfiler(how PASS_LD); in startProfiler()
422 { if ( get_node(A1, &sibling PASS_LD) )
430 else if ( get_node(A2, &parent PASS_LD) )
481 if ( !get_node(A1, &n PASS_LD) )
782 unify_relatives(A8, sum.callees PASS_LD)
1126 profResumeParent(node->parent PASS_LD); in profExit()
1193 return prof_call(handle, type PASS_LD); in PL_prof_call()
1201 profResumeParent(n->parent PASS_LD); in PL_prof_exit()
1246 freeProfileNode(n PASS_LD); in freeProfileNode()
[all …]
H A Dpl-btree.c86 int d = compareStandard(k, a, FALSE PASS_LD);
92 { if ( unify_ptrs(t, valTermRef(A4), ALLOW_GC|ALLOW_SHIFT PASS_LD) &&
106 if ( unify_ptrs(t, valTermRef(A4), ALLOW_GC|ALLOW_SHIFT PASS_LD) &&
H A Dpl-modul.c135 m = _lookupModule(name PASS_LD); in lookupModule__LD()
268 GD->modules.user = _lookupModule(ATOM_user PASS_LD); in initModules()
683 rc = set_module(m, prop PASS_LD);
738 if ( --depth == 0 && !is_acyclic(term PASS_LD) ) in stripModuleName()
764 if ( (rc=stripModuleName(term, &mname PASS_LD)) ) in stripModule()
1419 { return unify_export_list(a, m PASS_LD);
1488 if ( !export_pi(a1, module, depth PASS_LD) ) in export_pi()
1494 return export_pi1(pi, module PASS_LD); in export_pi()
1504 return export_pi(A1, module, 0 PASS_LD);
1733 return import(A1, 0 PASS_LD);
[all …]
H A Dpl-privitf.c151 if ( !unify_ptrs(a, ctx->lp, 0 PASS_LD) ) in unifyList()
169 if ( !unify_ptrs(a, ctx->lp, 0 PASS_LD) ) in unifyDiffList()
175 if ( !unify_ptrs(a, ctx->gstore, 0 PASS_LD) ) in unifyDiffList()
/dports/lang/yap/yap-6.2.2/packages/PLStream/
H A Dpl-privitf.c34 #define valHandle(r) valHandle__LD(r PASS_LD)
176 if ( !unify_ptrs(a, ctx->lp PASS_LD) ) in unifyList()
194 if ( !unify_ptrs(a, ctx->lp PASS_LD) ) in unifyDiffList()
200 if ( !unify_ptrs(a, ctx->gstore PASS_LD) ) in unifyDiffList()
/dports/lang/swi-pl/swipl-8.2.3/src/os/
H A Dpl-file.c3003 return put_byte(A1, A2 PASS_LD);
3011 return put_byte(0, A1 PASS_LD);
3035 return put_code(A1, A2 PASS_LD);
3043 return put_code(0, A1 PASS_LD);
3051 return put_code(A1, A2 PASS_LD);
3059 return put_code(0, A1 PASS_LD);
3127 return skip(0, A1 PASS_LD);
3135 return skip(A1, A2 PASS_LD);
3414 return tab(A1, A2 PASS_LD);
3421 return tab(0, A1 PASS_LD);
[all …]

123