Hmmm, the absence of any particular evidences does not mean that the assuption MUST be right, it could....
Yes, I know. But that is the best assumption I could come up with. How would one be sure? > So, the general fixup to avoid deadlocks is > > for each process > 1. Get the required resources one after the other in a well defined > order (that can be alfabetically!) > 2. If you cannot get one, release them all and re-try after a short time > > Do not wait in one thread for the competion of another one, instead > use a controlling mechanism which is signalled each completion. > > But as far as I understand you, you already tried that. Right you are. I've done that already > > It sounds a bit as if all the treads share the same piece of code, you > could build a controlling program, which can query the threads > for a status-var indicating how far each of them has come. Yeah, it looks like I'm going to have to go in that general direction > > Happy de-bugging! Thanks. Cheers Louis ----------------------------------------------------- Home page: http://groups.yahoo.com/group/delphi-en/ To unsubscribe: [EMAIL PROTECTED] Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/delphi-en/ <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
