 | | Re: Download problem
|
|
(...) you don't want to send source, you can always compile it and send the binary... nqc -Ofoo.rcx foo.nqc Another alternative would be to download it in verbose mode and send me the log... nqc -v -d foo.nqc >log My email is dbaum@enteract.com Dave (...) (25 years ago, 2-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
(...) I'm going from memory here, so I may miss a detail... int lock; #define TASK_BIT(task_num) (1 << task_num) void acquire_lock(int task_num) { while(1) { // wait for lock to be clear while(lock); // try to own it lock |= TASK_BIT(task_num); // (...) (25 years ago, 2-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: Download problem
|
|
Hi Mario, I've encountered some weird problems like this too. I think I was able to fix things up by erasing the memory. In RcxCC, use the Tools -> Clear Memory option. Please let us know if that works. Jonathan (...) (25 years ago, 1-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Download problem
|
|
Hi Dave and everybody, I have a strange problem with an NQC program. It's something Marco Beri and I are preparing for the Mindfest. The program is rather large if compared to the average NQC programs: about 240 lines of code with large inline (...) (25 years ago, 1-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
(...) There is a way to do it even if you have no test and set, though I can't remember it off the top of my head, and it is slow. Don't see how using bitflags helps? Cheers, Ben. -- (URL) grandfather once told me that there are two kinds of people: (...) (25 years ago, 1-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
On semaphores... There was a lot of discussion a long time ago on whether NQC should use semaphores to protect temp variables between tasks. There isn't an atomic test-and-set bytecode, so the only way I know of implementing sempaphore would be to (...) (25 years ago, 1-Oct-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
(...) I think that if you do something like this you should use a semaphore to secure no tasks access y and z simultanously. But that wastes another variable storing the sema. (25 years ago, 30-Sep-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
(...) That's exaclty what I was thinking of doing. Originally, the compiler had no way of allocating temp variables which is why code for % couldn't be emitted. The temp allocator is now pretty good, so I could emit the above sequence, but it just (...) (25 years ago, 30-Sep-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: NQC 2.0 and some math questions
|
|
(...) x = y % z is equivalent to (where w is an temporary integer): w = y / z; x = y - z * w; I can't think of a useful use of % just with constants. Ciao. Marco. (25 years ago, 29-Sep-99, to lugnet.robotics.rcx.nqc)
|
| |
| | Re: Listening to IR via NQC
|
|
(...) FWIW, I did something similar to this using NQC and the Datalog. It uses variable0 for polling and letting the PC know the Datalog has some "stuff" it wants to send. (URL) (25 years ago, 28-Sep-99, to lugnet.robotics.rcx, lugnet.robotics.rcx.nqc)
|
