Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 21 for Xlogue (0.12 sec)

  1. src/cmd/internal/src/pos.go

    }
    
    // withXlogue attaches a prologue/epilogue attribute to a lico
    func (x lico) withXlogue(xlogue PosXlogue) lico {
    	if x == 0 {
    		if xlogue == 0 {
    			return x
    		}
    		// Normalize 0 to "not a statement"
    		x = lico(PosNotStmt << isStmtShift)
    	}
    	return lico(uint(x) & ^uint(xlogueMax<<xlogueShift) | (uint(xlogue) << xlogueShift))
    }
    
    // withStmt returns a lico for the same location with specified is_stmt attribute
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 01 15:52:41 UTC 2023
    - 15.5K bytes
    - Viewed (0)
  2. src/cmd/internal/obj/x86/seh.go

    	var pushbp *obj.Prog
    	for p := s.Func().Text; p != nil; p = p.Link {
    		if p.As == APUSHQ && p.From.Type == obj.TYPE_REG && p.From.Reg == REG_BP {
    			pushbp = p
    			break
    		}
    		if p.Pos.Xlogue() == src.PosPrologueEnd {
    			break
    		}
    	}
    	if pushbp == nil {
    		ctxt.Diag("missing frame pointer instruction: PUSHQ BP")
    		return
    	}
    
    	// It must be followed by a MOVQ SP, BP.
    	movbp := pushbp.Link
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 14:41:10 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  3. src/cmd/internal/src/pos_test.go

    		{makeLico(lineMax, 1).withXlogue(PosEpilogueBegin), fmt.Sprintf(":%d", lineMax) + defs + epi, lineMax, 1},
    	} {
    		x := test.x
    		if got := formatstr("", x.Line(), x.Col(), true) + fmt.Sprintf(":%d:%d", x.IsStmt(), x.Xlogue()); got != test.string {
    			t.Errorf("%d: %s: got %q", i, test.string, got)
    		}
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 14 23:50:26 UTC 2022
    - 8.4K bytes
    - Viewed (0)
  4. src/cmd/internal/obj/dwarf.go

    	fileIndex := 1
    	prologue, wrotePrologue := false, false
    	// Walk the progs, generating the DWARF table.
    	for p := s.Func().Text; p != nil; p = p.Link {
    		prologue = prologue || (p.Pos.Xlogue() == src.PosPrologueEnd)
    		// If we're not at a real instruction, keep looping!
    		if p.Pos.Line() == 0 || (p.Link != nil && p.Link.Pc == p.Pc) {
    			continue
    		}
    		newStmt := p.Pos.IsStmt() != src.PosNotStmt
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 01 20:40:28 UTC 2023
    - 22K bytes
    - Viewed (0)
  5. src/math/exp.go

    		return 0
    	case -NearZero < x && x < NearZero:
    		return 1 + x
    	}
    
    	// reduce; computed as r = hi - lo for extra precision.
    	var k int
    	switch {
    	case x < 0:
    		k = int(Log2e*x - 0.5)
    	case x > 0:
    		k = int(Log2e*x + 0.5)
    	}
    	hi := x - float64(k)*Ln2Hi
    	lo := float64(k) * Ln2Lo
    
    	// compute
    	return expmulti(hi, lo, k)
    }
    
    // Exp2 returns 2**x, the base-2 exponential of x.
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 11:59:09 UTC 2023
    - 5.4K bytes
    - Viewed (0)
  6. okhttp/src/test/java/okhttp3/internal/tls/CertificatePinnerChainValidationTest.kt

            .certificatePinner(certificatePinner)
            .build()
    
        // Add a bad intermediate CA and have that issue a rogue certificate for localhost. Prepare
        // an SSL context for an attacking webserver. It includes both these rogue certificates plus the
        // trusted good certificate above. The attack is that by including the good certificate in the
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 23.8K bytes
    - Viewed (0)
  7. src/math/const.go

    	SqrtPhi = 1.27201964951406896425242246173749149171560804184009624861664038 // https://oeis.org/A139339
    
    	Ln2    = 0.693147180559945309417232121458176568075500134360255254120680009 // https://oeis.org/A002162
    	Log2E  = 1 / Ln2
    	Ln10   = 2.30258509299404568401799145468436420760110148862877297603332790 // https://oeis.org/A002392
    	Log10E = 1 / Ln10
    )
    
    // Floating-point limit values.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Sep 21 14:07:39 UTC 2022
    - 2.8K bytes
    - Viewed (0)
  8. maven-core/src/site/apt/getting-to-container-configured-mojos.apt

    * Other
    
      We may need to define a new lifecycle/phase to contextualize a mojo right
      before it's used, and reset it's state afterward. Up to now, the approach
      of most plexus components has been to avoid instance state like the plague.
      With the current parameter passing model of mojos, this will not be possible,
      particularly when we move mojos to a singleton instantiation model, and then
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Mon Jan 30 15:20:35 UTC 2023
    - 4.1K bytes
    - Viewed (0)
  9. src/go/ast/issues_test.go

    // license that can be found in the LICENSE file.
    
    // Package p doc comment goes here.
    //
    // Code generated by gen. DO NOT EDIT. 
    package p
    
    ... `, false},
    		// Special comment has rogue interior space.
    		{`//     Code generated by gen. DO NOT EDIT.
    package p
    `, false},
    		// Special comment lacks the middle portion.
    		{`// Code generated DO NOT EDIT.
    package p
    `, false},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 25 13:57:33 UTC 2023
    - 3.5K bytes
    - Viewed (0)
  10. pkg/controller/disruption/disruption_test.go

    		if i < 2 {
    			ps.VerifyPdbStatus(t, pdbName, 0, i+1, 2, 3, map[string]metav1.Time{})
    		} else {
    			ps.VerifyPdbStatus(t, pdbName, 1, 3, 2, 3, map[string]metav1.Time{})
    		}
    	}
    
    	rogue, _ := newPod(t, "rogue")
    	add(t, dc.podStore, rogue)
    	dc.sync(ctx, pdbName)
    	ps.VerifyDisruptionAllowed(t, pdbName, 2)
    }
    
    func TestStatefulSetController(t *testing.T) {
    	labels := map[string]string{
    		"foo": "bar",
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 50K bytes
    - Viewed (0)
Back to top