if let Some(idx) = indices.get_code_index((name.clone(), arity), module) {
self.context_call(machine_st, name, arity, idx, indices)?;
} else {
- let h = machine_st.heap.h;
- let stub = MachineError::functor_stub(clause_name!("call"), arity + 1);
- let key = ExistenceError::Procedure(name, arity);
-
- return Err(
- machine_st.error_form(MachineError::existence_error(h, key), stub)
- );
+ try_in_situ(machine_st, name, arity, indices, machine_st.last_call)?;
}
}
ClauseType::Hook(_) | ClauseType::System(_) => {
&mut self.op_dir
}
- fn get_code_index(&self, key: PredicateKey, module: ClauseName) -> Option<CodeIndex> {
- match module.as_str() {
+ fn get_code_index(&self, key: PredicateKey, module_name: ClauseName) -> Option<CodeIndex> {
+ match module_name.as_str() {
"user" | "builtin" => self.code_dir.get(&key).cloned(),
_ => self
- .modules
- .get(&module)
- .and_then(|ref module| module.code_dir.get(&key).cloned().map(CodeIndex::from)),
+ .modules
+ .get(&module_name)
+ .and_then(|ref module| module.code_dir.get(&key).cloned().map(CodeIndex::from))
}
}
return;
}
- self.code_dir.insert((name, arity), idx);
+ self.code_dir.insert((name.clone(), arity), idx.clone());
}
fn use_qualified_module(
pub fn run_init_code(&mut self, code: Code) -> bool {
let old_machine_st = self.sink_to_snapshot();
- self.machine_st.reset();
+ self.machine_st.reset();
self.code_repo.cached_query = code;
self.run_query();
_ =>
unreachable!()
};
-
+
let arity = match &self.machine_st.heap[s+2] {
&HeapCellValue::Addr(Addr::Con(Constant::Integer(ref arity))) =>
arity.to_usize().unwrap(),
_ =>
unreachable!()
};
-
+
exports.push(ModuleExport::PredicateKey((name, arity)));
}
HeapCellValue::NamedStr(arity, ref name, _)
_ =>
unreachable!()
};
-
+
let prec = match &self.machine_st.heap[s+1] {
&HeapCellValue::Addr(Addr::Con(Constant::Integer(ref arity))) =>
arity.to_usize().unwrap(),
fn sink_to_snapshot(&mut self) -> MachineState {
let mut snapshot = MachineState::with_capacity(0);
-
+
snapshot.hb = self.machine_st.hb;
snapshot.e = self.machine_st.e;
snapshot.b = self.machine_st.b;
snapshot
}
- fn absorb_snapshot(&mut self, mut snapshot: MachineState) {
+ fn absorb_snapshot(&mut self, mut snapshot: MachineState) {
self.machine_st.hb = snapshot.hb;
self.machine_st.e = snapshot.e;
self.machine_st.b = snapshot.b;
// so hold onto it locally and restore it after the compiler has finished.
self.machine_st.fail = false;
let cached_query = mem::replace(&mut self.code_repo.cached_query, vec![]);
-
+
self.dynamic_transaction(trans_type, p);
self.code_repo.cached_query = cached_query;
pub fn col_num(&self) -> usize {
self.parser.col_num()
}
-
+
#[inline]
pub fn update_expansion_lens(&mut self) {
let te_key = (clause_name!("term_expansion"), 2);
let line_num = self.line_num();
let col_num = self.col_num();
-
+
let term = self.parser.read_term(composite_op!(
self.in_module,
&self.wam.indices.op_dir,
initial_term,
clause_name!(","),
)));
-
+
Ok(Term::Clause(cell, name, terms, arity))
}
_ => Ok(term),
) -> Result<Vec<Term>, ParserError> {
let mut results = vec![];
- while let Some(term) = terms.pop_front() {
+ while let Some(term) = terms.pop_front() {
match machine_st.try_expand_term(self.wam, &term, CompileTimeHook::GoalExpansion) {
Some(term_string) => {
let term = self.parse_expansion_output(term_string.as_str(), op_dir)?;
) -> Option<String> {
let term_write_result = write_term_to_heap(term, self);
let h = self.heap.h;
-
+
self[temp_v!(1)] = Addr::HeapCell(term_write_result.heap_loc);
self.heap.push(HeapCellValue::Addr(Addr::HeapCell(h)));
self[temp_v!(2)] = Addr::HeapCell(h);
let code = vec![call_clause!(ClauseType::Hook(hook), 2, 0, true)];
wam.code_repo.cached_query = code;
-
+
self.query_stepper(
&mut wam.indices,
&mut wam.policies,
IndexSource::TermStream => &mut self.term_stream.wam.indices.code_dir,
IndexSource::Local(ref mut indices) => &mut indices.code_dir,
}
- }
-
+ }
+
fn static_code_dir(&self) -> Option<&CodeDir> {
match self.static_code_dir {
Some(IndexSource::TermStream) => Some(&self.term_stream.wam.indices.code_dir),
};
if let Some(idx) = idx_opt {
- self.local_code_dir().insert((name, arity), idx.clone());
+ self.local_code_dir().insert((name.clone(), arity), idx.clone());
idx
} else {
- let idx = CodeIndex::default();
- self.local_code_dir().insert((name, arity), idx.clone());
+ let idx = CodeIndex::default();
+ self.local_code_dir().insert((name.clone(), arity), idx.clone());
idx
}
}
fn fabricate_disjunct(&self, body_term: Term) -> (JumpStub, VecDeque<Term>) {
let vars = self.compute_head(&body_term);
- let clauses: Vec<_> = unfold_by_str(body_term, ";")
+ let results = unfold_by_str(body_term, ";")
.into_iter()
.map(|term| {
let mut subterms = unfold_by_str(term, ",");
check_for_internal_if_then(&mut subterms);
let term = subterms.pop().unwrap();
- fold_by_str(subterms.into_iter(), term, clause_name!(","))
- })
- .collect();
+ let clause = fold_by_str(subterms.into_iter(), term, clause_name!(","));
- let results = clauses
- .into_iter()
- .map(|clause| self.fabricate_rule_body(&vars, clause))
+ self.fabricate_rule_body(&vars, clause)
+ })
.collect();
(vars, results)
if self.in_module { None } else { Some(IndexSource::TermStream) }
);
- let queue = self.rel_worker.parse_queue(&mut indices)?;
+ let queue = self.rel_worker.parse_queue(&mut indices)?;
let result = (append_preds(preds), queue);
let in_situ_code_dir = &mut indices.term_stream.wam.indices.in_situ_code_dir;