Change Details

I was researching for quite some time how eo events could be made faster, while doing that i recognized that we are not utilizing the full size of Efl_Object_Data, so we can do a little bit more hinting for how our events are currently working. In this commit a flag called single priority is inserted. This flag ensures that the object only has one callback priority registered, which gives us the possibility of skipping the binary search, the search itself is not that bad, however, alone the loading of the instructions takes time, so this way we can skip the search, *and* the instructions for moving the array elements to later. This improves the startup time of terminology like that: OLD: ``` Performance counter stats for 'terminology': 178.85 msec task-clock:u # 0.945 CPUs utilized 0 context-switches:u # 0.000 K/sec 0 cpu-migrations:u # 0.000 K/sec 5,512 page-faults:u # 0.031 M/sec 381,399,765 cycles:u # 2.132 GHz 675,405,030 instructions:u # 1.77 insn per cycle 119,178,160 branches:u # 666.347 M/sec 1,649,097 branch-misses:u # 1.38% of all branches 0.189329001 seconds time elapsed 0.117272000 seconds user 0.030063000 seconds sys ``` NEW: ``` Performance counter stats for 'terminology': 164.23 msec task-clock:u # 1.132 CPUs utilized 0 context-switches:u # 0.000 K/sec 0 cpu-migrations:u # 0.000 K/sec 5,588 page-faults:u # 0.034 M/sec 412,778,300 cycles:u # 2.513 GHz 689,058,620 instructions:u # 1.67 insn per cycle 122,292,447 branches:u # 744.657 M/sec 1,690,443 branch-misses:u # 1.38% of all branches 0.145140221 seconds time elapsed 0.115062000 seconds user 0.016475000 seconds sys ```

I was researching for quite some time how eo events could be made faster, while doing that i recognized that we are not utilizing the full size of Efl_Object_Data, so we can do a little bit more hinting for how our events are currently working. In this commit a flag called single priority is inserted. This flag ensures that the object only has one callback priority registered, which gives us the possibility of skipping the binary search, the search itself is not that bad, however, alone the loading of the instructions takes time, so this way we can skip the search, *and* the instructions for moving the array elements to later.

I was researching for quite some time how eo events could be made faster, while doing that i recognized that we are not utilizing the full size of Efl_Object_Data, so we can do a little bit more hinting for how our events are currently working. In this commit a flag called single priority is inserted. This flag ensures that the object only has one callback priority registered, which gives us the possibility of skipping the binary search, the search itself is not that bad, however, alone the loading of the instructions takes time, so this way we can skip the search, *and* the instructions for moving the array elements to later. This improves the startup time of terminology like that: OLD: ``` Performance counter stats for 'terminology': 178.85 msec task-clock:u # 0.945 CPUs utilized 0 context-switches:u # 0.000 K/sec 0 cpu-migrations:u # 0.000 K/sec 5,512 page-faults:u # 0.031 M/sec 381,399,765 cycles:u # 2.132 GHz 675,405,030 instructions:u # 1.77 insn per cycle 119,178,160 branches:u # 666.347 M/sec 1,649,097 branch-misses:u # 1.38% of all branches 0.189329001 seconds time elapsed 0.117272000 seconds user 0.030063000 seconds sys ``` NEW: ``` Performance counter stats for 'terminology': 164.23 msec task-clock:u # 1.132 CPUs utilized 0 context-switches:u # 0.000 K/sec 0 cpu-migrations:u # 0.000 K/sec 5,588 page-faults:u # 0.034 M/sec 412,778,300 cycles:u # 2.513 GHz 689,058,620 instructions:u # 1.67 insn per cycle 122,292,447 branches:u # 744.657 M/sec 1,690,443 branch-misses:u # 1.38% of all branches 0.145140221 seconds time elapsed 0.115062000 seconds user 0.016475000 seconds sys ```