Displaying 12 results from an estimated 12 matches for "firsti".
Did you mean:
first
2016 Aug 25
2
InstList insert depreciated?
Jon,
> You want:
> TaintVar->insertAfter(FirstI);
This worked! Thank you.
On Thu, Aug 25, 2016 at 9:38 AM, Jonathan Roelofs
<jonathan at codesourcery.com> wrote:
>
>
> On 8/25/16 7:01 AM, Shehbaz Jaffer via llvm-dev wrote:
>>
>> I tried an alternative way of adding instruction by first getting the
>> first inst...
2013 Nov 01
6
[LLVMdev] Vectorization of loops with conditional dereferencing
...lock directly is not allowed.
One possibility, if we disallow for m[i] to have been munmaped or page protected in the middle, is to first collect the first and last index for which the condition is true, and then run the vector loop only on that portion. For the loop above, I mean something like:
FirstI = -1, LastI = -1, I = 0;
for (; I < N; ++I)
if (r[i] > 0) {
FirstI = I;
break;
}
for (; I < N; ++I) {
if (r[i] > 0)
LastI = I;
}
[In this case, since the guard dominates all side-effect, we don't need to do anything outside that range, otherwise, we'd need to...
2016 Aug 25
2
InstList insert depreciated?
...my basic block
in an instruction container list. Once that is done, I insert my new
instruction in the instruction container list using InstList.insert().
// code
void FSliceModulePass::allocaVSetArray(void) {
auto &B = F->getEntryBlock();
auto &IList = B.getInstList();
auto &FirstI = *IList.begin();
auto TaintVar = new AllocaInst(IntPtrTy, FirstI);
IList.insert(FirstI, TaintVar); // ERROR
After migrating to 3.8.1, It gives me the following error:
ERROR:
/home/shehbaz/project/plugin/FSlice.cpp: In member function ‘void
FSliceModulePass::allocaVSetArray()’:
/home/sheh...
2013 Nov 01
0
[LLVMdev] Vectorization of loops with conditional dereferencing
...allowed.
>
> One possibility, if we disallow for m[i] to have been munmaped or page protected in the middle, is to first collect the first and last index for which the condition is true, and then run the vector loop only on that portion. For the loop above, I mean something like:
>
> FirstI = -1, LastI = -1, I = 0;
> for (; I < N; ++I)
> if (r[i] > 0) {
> FirstI = I;
> break;
> }
>
> for (; I < N; ++I) {
> if (r[i] > 0)
> LastI = I;
> }
>
> [In this case, since the guard dominates all side-effect, we don't need to do an...
2013 Nov 14
0
[LLVMdev] Vectorization of loops with conditional dereferencing
On 1 November 2013 13:40, Hal Finkel <hfinkel at anl.gov> wrote:
> Done = false;
> FirstI = -1, LastI = -1;
> while (!Done) {
> for (I = FirstI+1; I < N; ++I)
> if (r[i] > 0) {
> FirstI = I;
> break;
> }
>
> for (; I < N && !page_bound(&m[i]) && ...; ++I) {
> if (r[i] > 0)
> LastI = I;
>...
2013 Nov 01
1
[LLVMdev] Vectorization of loops with conditional dereferencing
...ow for m[i] to have been munmaped or
> > page protected in the middle, is to first collect the first and
> > last index for which the condition is true, and then run the
> > vector loop only on that portion. For the loop above, I mean
> > something like:
> >
> > FirstI = -1, LastI = -1, I = 0;
> > for (; I < N; ++I)
> > if (r[i] > 0) {
> > FirstI = I;
> > break;
> > }
> >
> > for (; I < N; ++I) {
> > if (r[i] > 0)
> > LastI = I;
> > }
> >
> > [In this case, since the...
2013 Nov 14
3
[LLVMdev] Vectorization of loops with conditional dereferencing
...epared for handling pragmas and we just need to add the clang-side support. Is anyone planning to work on this ?
On Nov 14, 2013, at 2:18 AM, Renato Golin <renato.golin at linaro.org> wrote:
> On 1 November 2013 13:40, Hal Finkel <hfinkel at anl.gov> wrote:
> Done = false;
> FirstI = -1, LastI = -1;
> while (!Done) {
> for (I = FirstI+1; I < N; ++I)
> if (r[i] > 0) {
> FirstI = I;
> break;
> }
>
> for (; I < N && !page_bound(&m[i]) && ...; ++I) {
> if (r[i] > 0)
> LastI = I;
>...
2006 Jun 05
5
Controller-wide instance variable
Is it possible to declare an instance variable in a controller that is
available to every action without defining the variable in every action?
--
Posted via http://www.ruby-forum.com/.
2015 Feb 15
0
[PATCH V5] x86 spinlock: Fix memory corruption on completing completions
Well, I regret I mentioned the lack of barrier after enter_slowpath ;)
On 02/15, Raghavendra K T wrote:
>
> @@ -46,7 +46,8 @@ static __always_inline bool static_key_false(struct static_key *key);
>
> static inline void __ticket_enter_slowpath(arch_spinlock_t *lock)
> {
> - set_bit(0, (volatile unsigned long *)&lock->tickets.tail);
> + set_bit(0, (volatile unsigned
2015 Feb 15
0
[PATCH V5] x86 spinlock: Fix memory corruption on completing completions
Well, I regret I mentioned the lack of barrier after enter_slowpath ;)
On 02/15, Raghavendra K T wrote:
>
> @@ -46,7 +46,8 @@ static __always_inline bool static_key_false(struct static_key *key);
>
> static inline void __ticket_enter_slowpath(arch_spinlock_t *lock)
> {
> - set_bit(0, (volatile unsigned long *)&lock->tickets.tail);
> + set_bit(0, (volatile unsigned
2015 Feb 15
7
[PATCH V5] x86 spinlock: Fix memory corruption on completing completions
Paravirt spinlock clears slowpath flag after doing unlock.
As explained by Linus currently it does:
prev = *lock;
add_smp(&lock->tickets.head, TICKET_LOCK_INC);
/* add_smp() is a full mb() */
if (unlikely(lock->tickets.tail & TICKET_SLOWPATH_FLAG))
__ticket_unlock_slowpath(lock, prev);
which is
2015 Feb 15
7
[PATCH V5] x86 spinlock: Fix memory corruption on completing completions
Paravirt spinlock clears slowpath flag after doing unlock.
As explained by Linus currently it does:
prev = *lock;
add_smp(&lock->tickets.head, TICKET_LOCK_INC);
/* add_smp() is a full mb() */
if (unlikely(lock->tickets.tail & TICKET_SLOWPATH_FLAG))
__ticket_unlock_slowpath(lock, prev);
which is