similar to: Musings about Rails and Logging and philosophy

[OK, since I stupidly posted this over the July 4th week[end] and got no responses, let''s try it again...] As a perpetual Rails dabbler, I make an awful lot of typical beginner mistakes. And the logs are always either too verbose or too sparse to help me. And it started me thinking. I came from one of the largest production OLTP systems in the world, and the one thing that helped

On 13.11.20 13:22, Paul C. Anagnostopoulos via llvm-dev wrote: > Your suggestion for two passes is indeed my plan if simply using 3-byte sizes is not acceptable. I don't want to duplicate all the logic in a second length-calculating function, so I would just have special logic for the three matching operators with children and use the existing function for the rest, passing a null output

Would it make sense for TableGen to generate the outer OPC_SwitchOpcode offset table? At 11/13/2020 07:53 AM, Nicolai Hähnle wrote: >That said, if we are seriously thinking about the performance of the byte code, perhaps some of these opcodes should be reconsidered at a higher level anyway. > >For example: The overall bytecode always begins with an OPC_SwitchOpcode implemented as a

I took a look at all the OPC_SwitchOpcode operators in the matching tables. Almost every target starts with a large one, which is now cached by the interpreter. Instead, TableGen could build the opcode -> offset table. But there are also many other opcode switches with between 10 and 70 cases. To speed these up, we could embed a sorted opcode -> offset table right in the matcher code. Or,

Yes, we can. But I think either solution is going eliminate the relaxation step completely, Either we will always use 3-byte sizes or we will make a first pass to size everything and then a second pass to emit the code. Either way, no relaxation is necessary. >Can we skip the relaxation step if comments aren't being emitted? >Comment emission is off by default in CMake configuration.

I'm toying with the idea of writing a Samba-oriented Win95/98/NT logon window. I know it's possible to replace Windows' logon mechanism with another. Novell's Client32 does this. I know there's also standards to make a network service available to Windows' change-password mechanism (so I can fire smbpasswd on the other side). That could be an alternative to establishing

Your suggestion for two passes is indeed my plan if simply using 3-byte sizes is not acceptable. I don't want to duplicate all the logic in a second length-calculating function, so I would just have special logic for the three matching operators with children and use the existing function for the rest, passing a null output stream. Or I could conditionalize all the output on another function

IMHO, our big picture challenge is that multiple explanations for several topics are spread out over several different docs and pages One parameter is frequently discussed in four or more places (QSG, files reference pages, file comments, main documentation, etc.) That gives multiple perspectives, which can be good, but can also lead to at least the appearance, especially to a beginner, of

This is great! Thanks Paul! I think that the 9x reduction in compile-time is well worth the 4% size increase. TableGen's run-time has been a sore point and a source of complaints for quite some time. -- Krzysztof Parzyszek kparzysz at quicinc.com AI tools development -----Original Message----- From: llvm-dev <llvm-dev-bounces at lists.llvm.org> On Behalf Of Paul C.

This is the size of the table, not the size of the overall binary, right? I would imagine that a 4% growth in the size of the table is a substantially smaller growth in the total executable size of, say, clang. If the overall growth is minuscule (say, under 1%), then this seems like the clear path forward. I’m also optimistic that we might be able to find other ways to shrink the tables to make

I feel the need to protest about a disturbing trend in the vibrant RoR community - name dilution. ActiveRecord is called that precisely because it is that. The name come from Martin Fowler, and it expresses a class which is a database record, only _active_ - that is with methods & behaviors (unlike a classical database record, which is completely passive.) If you look in the

On Mon, May 28, 2018 at 02:05:05PM +0200, Kashyap Chamarthy wrote: > Cc the QEMU Block Layer mailing list (qemu-block@nongnu.org), [Sigh; now add the QEMU BLock Layer e-mail list to Cc, without typos.] > who might > have more insights here; and wrap long lines. > > On Mon, May 28, 2018 at 06:07:51PM +0800, Chunguang Li wrote: > > Hi, everyone. > > > > Recently

Cc the QEMU Block Layer mailing list (qemu-block@nongnu.org), who might have more insights here; and wrap long lines. On Mon, May 28, 2018 at 06:07:51PM +0800, Chunguang Li wrote: > Hi, everyone. > > Recently I am doing some tests on the VM storage+memory migration with > KVM/QEMU/libvirt. I use the following migrate command through virsh: > "virsh migrate --live

Hello all. In the shower the other day (where most of this sort of musing gets done, eh?) I was thinking about graceful degradation of audio signals. Let me apologise in advance if these are elementary concepts or if I demonstrate a complete lack of insight -- I don't rate even a dabbler status in the area of audio codecs. Anyway: If we have a 128kbs signal coming down a *udp* channel with

A rather notorious aspect of TableGen is the time required to run the -emit-dag-isel backend on some targets, including AMDGPU and X86. I added a timing feature to TableGen and timed the AMDGPU run. ===-------------------------------------------------------------------------=== TableGen Phase Timing

Hello, Anyone using or tested Oracle (OLTP load) on NetApp? Connected via Fibre Channel not NFS. Performance is good or should we better stay with "classic" SAN storage like HP EVA or similar boxes from EMC or Hitachi? In EMC test papers NetApp does not look good. In NetApp papers - vice versa. :) So I'm somewhat confused. I remember someone in this list saying that

Hi all, I would first like to introduce myself to the Ruby on Rails (RoR) community and to say that I hope to begin to build some relationships with other RoR developers. I''m a long time Java programmer (5+ years). Java was my first experience with Object Oriented Programming (OOP). Before Java I developed using many other languages including C, Pascal, Fortran, BASIC, Visual Basic,

Hey guys, I think it''s time for me to plug my company again :) Integralnet Marketing, a leader in web design, is looking for Ruby/Rails developers. Work in a fun, relaxed environment, surrounded by bright developers. We are strong believers in the principles of agile development, and follow practices such as: * Pair programming * Test driven development * User stories * YAGNI

Hi all. I am currently thinking about how to do the following: I have the following models. Team Person Team has various positions (manager, programmer etc.) I would like each one of those positions to reference one or more Person records. A single Person record could be on 6 different teams at the same time in different roles. the same person could even be on the same team multiple times

I wouldn't want to be too hasty about simply removing the relaxation algorithm. The size and speed of the compiler affects all users, but the time to compile the compiler "only" affects us compiler developers. And I speak as a developer who is heavily affected by the time to compile the AMDGPU backend. One off-the-cuff idea (I haven't even looked at the code yet): could we pass