int0x80

Do you have an example of a language that parses different because of dependencies?

Yes, a programming language being a user interface is a common analogy.

That would be a false positive, if I am understanding things correctly. The warning is about code that is correct, yet it warns, hence false positive. If the warning was missing for incorrect code that would be a false negative. At least that is the terminilogy used for static analysis.

How is this exposed to userspace? What interface?

One argument is that allowing non-root to mount(2) is already a big security problem.

I disagree. I found git checkout -b very convenient an intuitive way to say "create and checkout this branch".

For git branch -c one could say that the "branch" command should not do checkout-business.

Well, no. rm -rf / is a completely different beast. It is documented and expected for starters.

They may have valid reasons to do that, even if not common.

For example?

Do you know why is that?

I would hope it is not a new VM each time?

thanks for the answer.

thanks for the answer.

Can you expand on that, please?

That kind of rebase is just to refresh your work against updated masters etc. Of course you have to test against the refreshed (rebased) work again!! That doesn't mean you can't rebase. It means you can't randomly push untested work. If you know what rebase means you will understand that there are very likely new interactions with your code and you have to test your updated changeset. Exactly the same as if you merge. You have to retest the resulting tree.

I don't think it misses abstraction. It is covered under specialization costs.

There is also a channel search feature in telegram web something. IIRC.

E: like this https://tlgrm.eu/channels

Vodafone did also inject custom js/html in non HTTPS pages (obviously). This was 2 years ago.

I think this is a very very interesting idea. The only problem that makes me nervous is telecoms/ISPs capping the line or requiring some propietary interface to it (something done this days to an extent) and quirks. If they feel they are going to lose control or similar. Just a thought, I don't really know if it could be a real problem though.

Thanks for the interesting and detailed info.

I mean the cost of hitting the disk/socket. The actual IO. There is also the syscall overhead but that doesn't matter /that much/ with IO usually, in comparation with the actual IO (unless, again, you are doing something very wrong - very small buffers etc ...). This of course depends on the deatils. And yeah, if it uses mmap then that syscall problem is no more. Problem I was refering was actual IO cost per message (fsync/msync per message?) to mantain consistency instead of caching for example or batching and grouping IO at the expense of consistency guarantees (maybe) or coherent data re. messages in realtime.

I agree that the stack is usefull and I see your point. But I would almost never resort to alloca. That is not a solution IMO. If you have that kind of costs with the joining of keys there are other solutions, I think. What about a dynamic string library, that over allocates (maybe a big chung on the first time in the 'new message' path) and then just uses the extra memory until you run out. Classic (and silly) strategy of allocating like n << 4 bytes every time you run out of space. This way you really just have a few allocations instead of hundreds maybe making it a non-issue (at the cost of prob. unused extra memory). Not as efficent as alloca but very close.

I you want to get fancy you can have efficent malloc pools to. But I think a semi-clever dynamic string lib would be able to handle the problem best.

My point was that a malloc vs alloca in a full blown IO path, where you have sockets and posibly disk fsyncs is not all that significant, if at all. I understand that journald cares about performance. Micro-optimizations like malloc vs alloca are the least of your problems. Batching/buffering messages, an asyncronous model, plain O_APPEND, different files for logs/metadata etc like others and you have said ITT is what will matter. You can even use a sane dynamic string library with preallocation if you care that much. I haven't looked at the src, to be honest, but am I wrong?

My bluetooth mouse (logitec) works very well. Never disconnects. But it does fail to properly suspend. I need to switch the BT off to suspend, because it will automatically restart the system when it is connected. I haven't searched for a solution, I'm sure there is one involving /sys and a pre suspend hook etc.

Another big question is why does it use alloca at all. Considering that it is well known in the C world to be problematic and discouraged. For this very reason.

- Are you performance-constrained? NO.

- Is calling malloc/free such a big deal, instead of alloca? It is not.

Yes. That neat join funcion will need to get an extra parameter and free the returned pointer when it's done with it. This is C. If you want neat convenient string joining functions use a different language.

There is xfs.org and the XFS mailing list. You can just send an email there. Maybe you were sending HTML emails or something that made the message bounce?

Something you can try: exercise. Really. Get tired. It may work for you too.

This is hardware virtualization. Containers are OS "virtualization". They offer different levels of isolation and features.

Wow thats scary indeed... They where using x86 signed compare instead of unsigned (jg vs ja)... Thanks for the link btw!

Absolutely... adults don't/shouldn't play the blame game, just pointing out that in all fairness not everyone starts from the same point, but this is not really related to the main point beeing discussed anyway.

Big problem here is the preprocessor as mentioned in the article.

I agree with this thoughts very much. The attitude you mention is key, at least in my reduced and anecdotical experience. It is true, however, as others say, that you have to start from a reasonable and relative good baseline and that part is just pure luck.

For a subset of "ASCII art" diagrams, check http://asciiflow.com I find it handy sometimes :)