Ejemplo n.º 1
0
  /**
   * Authenticate the user (first phase).
   *
   * <p>The implementation of this method attempts to retrieve the user's Unix <code>Subject</code>
   * information by making a native Unix system call.
   *
   * <p>
   *
   * @exception FailedLoginException if attempts to retrieve the underlying system information fail.
   * @return true in all cases (this <code>LoginModule</code> should not be ignored).
   */
  public boolean login() throws LoginException {

    long[] unixGroups = null;

    ss = new UnixSystem();

    if (ss == null) {
      succeeded = false;
      throw new FailedLoginException(
          "Failed in attempt to import " + "the underlying system identity information");
    } else {
      userPrincipal = new UnixPrincipal(ss.getUsername());
      UIDPrincipal = new UnixNumericUserPrincipal(ss.getUid());
      GIDPrincipal = new UnixNumericGroupPrincipal(ss.getGid(), true);
      if (ss.getGroups() != null && ss.getGroups().length > 0) {
        unixGroups = ss.getGroups();
        for (int i = 0; i < unixGroups.length; i++) {
          UnixNumericGroupPrincipal ngp = new UnixNumericGroupPrincipal(unixGroups[i], false);
          if (!ngp.getName().equals(GIDPrincipal.getName())) supplementaryGroups.add(ngp);
        }
      }
      if (debug) {
        System.out.println("\t\t[UnixLoginModule]: " + "succeeded importing info: ");
        System.out.println("\t\t\tuid = " + ss.getUid());
        System.out.println("\t\t\tgid = " + ss.getGid());
        unixGroups = ss.getGroups();
        for (int i = 0; i < unixGroups.length; i++) {
          System.out.println("\t\t\tsupp gid = " + unixGroups[i]);
        }
      }
      succeeded = true;
      return true;
    }
  }
Ejemplo n.º 2
0
  public int compare(Component a, Component b) {
    if (a == b) {
      return 0;
    }

    // Row/Column algorithm only applies to siblings. If 'a' and 'b'
    // aren't siblings, then we need to find their most inferior
    // ancestors which share a parent. Compute the ancestory lists for
    // each Component and then search from the Window down until the
    // hierarchy branches.
    if (a.getParent() != b.getParent()) {
      LinkedList<Component> aAncestory = new LinkedList<Component>();

      for (; a != null; a = a.getParent()) {
        aAncestory.add(a);
        if (a instanceof Window) {
          break;
        }
      }
      if (a == null) {
        // 'a' is not part of a Window hierarchy. Can't cope.
        throw new ClassCastException();
      }

      LinkedList<Component> bAncestory = new LinkedList<Component>();

      for (; b != null; b = b.getParent()) {
        bAncestory.add(b);
        if (b instanceof Window) {
          break;
        }
      }
      if (b == null) {
        // 'b' is not part of a Window hierarchy. Can't cope.
        throw new ClassCastException();
      }

      for (ListIterator<Component> aIter = aAncestory.listIterator(aAncestory.size()),
              bIter = bAncestory.listIterator(bAncestory.size());
          ; ) {
        if (aIter.hasPrevious()) {
          a = aIter.previous();
        } else {
          // a is an ancestor of b
          return -1;
        }

        if (bIter.hasPrevious()) {
          b = bIter.previous();
        } else {
          // b is an ancestor of a
          return 1;
        }

        if (a != b) {
          break;
        }
      }
    }

    int ax = a.getX(), ay = a.getY(), bx = b.getX(), by = b.getY();

    int zOrder = a.getParent().getComponentZOrder(a) - b.getParent().getComponentZOrder(b);
    if (horizontal) {
      if (leftToRight) {

        // LT - Western Europe (optional for Japanese, Chinese, Korean)

        if (Math.abs(ay - by) < ROW_TOLERANCE) {
          return (ax < bx) ? -1 : ((ax > bx) ? 1 : zOrder);
        } else {
          return (ay < by) ? -1 : 1;
        }
      } else { // !leftToRight

        // RT - Middle East (Arabic, Hebrew)

        if (Math.abs(ay - by) < ROW_TOLERANCE) {
          return (ax > bx) ? -1 : ((ax < bx) ? 1 : zOrder);
        } else {
          return (ay < by) ? -1 : 1;
        }
      }
    } else { // !horizontal
      if (leftToRight) {

        // TL - Mongolian

        if (Math.abs(ax - bx) < ROW_TOLERANCE) {
          return (ay < by) ? -1 : ((ay > by) ? 1 : zOrder);
        } else {
          return (ax < bx) ? -1 : 1;
        }
      } else { // !leftToRight

        // TR - Japanese, Chinese, Korean

        if (Math.abs(ax - bx) < ROW_TOLERANCE) {
          return (ay < by) ? -1 : ((ay > by) ? 1 : zOrder);
        } else {
          return (ax > bx) ? -1 : 1;
        }
      }
    }
  }