Development discussion. Logged to https://ddnet.tw/irclogs/ Connected with DDNet's IRC channel, Matrix room and GitHub repositories — IRC: #ddnet on Quakenet | Matrix: #ddnet-developer:matrix.org GitHub: https://github.com/ddnet
Between 2020-04-20 00:00:00Z and 2020-04-21 00:00:00Z
Im trying to toggle super/unsuper on the key o with cfg files like i did with deepfly but it doesnt work because it instantly executes the cfg file which leads to the file that gives o the bind unsuper. Like my cfg file is bind o rcon super; exec 4.cfg. It doesnt give me super but executes the cfg file with bind o rcon unsuper; exec 3.cfg
15:09
and it keep staying at it, unsuper bind works, super bind doesnt
modifying an object is a side-effect and at sequence points all previous side effects should have taken place and no side effects from the subsequent evaluations shall take place.
The “modifying an object” clause is nonsensical because — in combination with sequence point semantics — it forbids the compiler from eliminating the redundant store when a program contains code like this:
thus the modifying an object clause wouldn't apply here, so it's allowed to optimize this unless x is volatile
15:22
This is just how I understand the standard, you can ask like 50 people and get 50 interpretations
15:22
You should try ##C, there are some standard nutjobs there
15:24
The function thing I'm not sure about, C99 5.1.2.3p2 defines what happens when we know the insides of the function, it doesn't seem to say anything about the default assumption though
15:24
(I think you are right about the miscompilation thing though, seeing how clang 3.3 is the last version that does that)
@heinrich5991 do you have a copy of the standard? C99 5.1.2.3p3 says that an actual implementation need not evaluate an expression if it can determine that it's value is not used and it produces no needed side effects
16:09
The second expressions value is not used, and the compiler determines that it produces no needed side effects
The reordering thing I am indeed wrong about though, the compiler can re-order as it pleases as long as it satisfies the things in 5.1.2.3p5, e.g. doesn't change "observable behaviour"
meh, very hard to think about this, it's not legal in the abstract machine to do the reordering, but the actual implementation is allowed to deviate from that if it can prove that the "observable behaviour" doesn't change, as it doesn't know what bar does, I think the optimization is illegal
Hey, just want to ask if anyone can help me out, I am out of ideas.
My problem:
I am about to create a 128 player server for 0.7, so far its working just fine. Now the problem are dummy clients like F-Client or ZillyWoods.
The current system functions just as the one from 0.6 for vanilla clients: The client gets the closest 64 tees to see. The first problem that occured was that the client info is wrong, because 0.7 doesnt handle the information in the snaps. So I solved that one by sending disconnect/connect packets with correct information but still faked IDs to the client when they come nearby some other tees.
The client of course only knows about 64 tees, and the server doesnt know if its a dummy or not. The solution would be that the client gets the information of the dummy's closest 64 tees when it switches between them, but that is unfortunately impossible to detect.
Any ideas?